Re: OO Style with Ada Containers

[Ludovic Brenta <ludovic@ludovic-brenta.org>]

braver writes:
> On Nov 15, 2:35 pm, Ludovic Brenta <ludo...@ludovic-brenta.org> wrote:
>> Position := Counters.Find (Current_Word);
>
> It turned out this should be
>
> 	-- Count can be anything below due to our definition of Equivalent:
> 	Position := Counters.Find ((Word => Current_Word, Count => 0));
>
> -- which adds to the cumbersomeness of Hashed_Sets vs. Ordered_Maps.
> So what are the advantages?

I think Find is much more efficient in a Hashed_Set than in an
Ordered_Map because comparing hash values is more efficient than
comparing Unbounded_Strings.  And in the algorithm, we call Find for
each word in the input.

This applies to Insert, too, and we call Insert for every new word in
the input.

How about trying both solutions and benchmarking them?

-- 
Ludovic Brenta.