Re: Tally

["Jeffrey R. Carter" <spam.jrcarter.not@spam.not.acm.org>]

On 1/14/20 4:27 PM, Gilbert Gosseyn wrote:
> Before I make long tests with access Types, declarations or  containers, I would like to get an advice on how to program in a simple and fast way the following, or get a hint to an existing program.
> 
> Example_Input: (2, 3, 8, 2, 2, 2, 7, 2, 3, 4, 8) ; -- variable Length
> 
> Output by function or procedure : ((2, 5), (3, 2), (8, 2), (7, 1), (4, 1));  -- unknown Length

A lot depends on what restraints the problem domain puts on the input values. If 
you can define something like

type Input_Number is range 1 .. 10;

then you can do something straightforward like

type Count_Map is array (Input_Number) of Natural;

Count  : Count_Map := (others => 0);
Number : Input_Number;
...
loop
    exit when No_More_Numbers;

    Number := Next_Number;
    Count (Number) := Count (Number) + 1;
end loop;

If you can't limit the input numbers to a sufficiently small range that an 
object like Count can be declared, then you'll need to use a map, as Holsti 
suggested, which is only a little more complicated.

-- 
Jeff Carter
Just as Khan was hindered by two-dimensional thinking in a
three-dimensional situation, so many developers are hindered
by sequential thinking in concurrent situations.
118