Re: Tally

["Randy Brukardt" <randy@rrsoftware.com>]

"Brad Moore" <bmoore.ada@gmail.com> wrote in message 
news:4967a95b-3d79-4a5b-a30d-0f04f00ebbc4@googlegroups.com...
...
> For that matter, you could do it all in one shot and even make the map a 
> constant.
>
>   Counts : constant Count_Maps.Map
>     := [for I in Input'Range
>           when (for all J in Input'First .. I - 1 => Input (I) /= Input 
> (J))
>              use I =>
>                 [for K in Input'Range when Input (K) = Input (I)) => 1]
>                   'Reduce("+", 0)];
>
> Using a reduction expression to count the values.
> But this is definitely quite a mouthful.

So Ada 202x will allow us to catch up to C++ and many other "expressive" 
languages by allowing us to have "guess what this code does" contests!! :-)

Compared to Jere's loop, the above is impentrable. And it's hard to guess 
the performance of that (I'd have to expand the aggregate into its 
underlying operations to figure out whether it is more or less expensive 
than the simple loop would be).

                            Randy.