Re: Container reqs

[Jean-Marc Bourguet <jbourguet@free.fr>]

Ehud Lamm wrote:
> 
> Let's try to make a list of req the Ada community in general can agree on,
> and than see which of the existing libraries is closest and concentrate on
> that.

* the library should have an organisation which make it extensible;

* for one ADT, it should be possible to choose between several
  implementations (say an hash table or a red black tree for the
  ADT dictionnary);

* if several ADT are using the same implementation (say a stack and a
  queue provided over singly linked lists), it should be possible to
  share the implementation package;

* I prefer the STL way over the Booch components one, ie all iterators
  provide the same interface but are not overwise related (the same
  would hold for the dictionnary packages). 

* the container types should be limited (one can always provides
  a clone function if needed).

* the contained types should not be limited (one can always provides
  a standard wrapper for limited types)

* the save iterators should be provided (that is iterator not silently
  invalidated like in the STL) and be the default if unsave iterators
  are also provided;

* I prefer using a single iterators instead of the double iterators
  of the STL;

A possible organisation which provides the first two points is to have
the packages providing abstract data type be childs of packages
providing
concrete data type. 

Yours,

-- Jean-Marc