Missing features in Ada.Containers

["Alex R. Mosteo" <devnull@mailinator.com>]

Hi,

another thread as reminded me of some things that I find strange in the 
new Ada.Containers. Maybe the implementation I'm using is still 
incomplete or I'm missing something in the new files (I used Charles 
extensively). Please post your comments.

Of the top of my head I find notable the absence of the "hashed strings" 
container. Now it seems you're alone with a "hashed map" whose keys are 
generic of constrained nature. Thus you must make some leaps to have the 
old (and in my case, most used) hashed string container. Indeed it 
requires ugly conversions between the key type, String, defining the 
hashing function simply to reuse the Ada.Hash_String, etc. It smells so 
wrong to me that I'm almost sure I'm missing something obvious here.

Another bizarre (I suppose it was discussed in the mettings) novelty 
(but really of minor relevance as I see it) is that the "sorted maps" 
functionality is now a child package of the "sorted sets". Not only this 
requires now two instantiations to get a "sorted map" but it imposes the 
use of a "sorted set" even if you don't want one?

I know these comments, accurate or not, come too late... but I've just 
started to use these new containers and even if I did read the past 
discussions about the AI.302, I didn't know the specifics.

Best regards,

A. Mosteo.