Re: Equivalent keys/elements in Ada.Containers Maps and Sets

[Georg Bauhaus <bauhaus@futureapps.de>]

On Wed, 2007-01-24 at 18:22 -0800, Adam Beneschan wrote:
> 
> On Jan 24, 2:50 pm, "Matthew Heaney" <mhea...@on2.com> wrote:
> 
> > This is a silly argument.  The Ada container library is modeled on the
> > C++ STL, and in that library the requirement for "strict weak ordering"
> > for the binary predicate for ordered associative containers is clear.

Whew, this is _not_ an argument for being practical in my view.
Are you implying that a programmer who wants to use Ada.Containers,
whether he/she is familiar with the STL or not,
should see to it that both ISO/IEC 8652:2007(E) (Ada)
and ISO/IEC 14882:2003 (C++) and associated documents
are available for reference?

> No, of course not.  But I guess I am suggesting that the Ada
> programming community expects the RM to be correct.

Yes, and the RM should stay helpful, too. If I wanted to use shared
variables in a C++ program, and be asked to consult the Ada programming
language and protected types, will this suggestion be acceptable
to any practical C++ programmer? No.


 -- Georg