Re: Dynamically tagged expression required

[Georg Bauhaus <bauhaus@futureapps.de>]

Martin Krischik wrote:

>>  map_t m;
>>  //...
>>  m[k] = e;
>>  m.erase(k);
>>
>>and in Ada you say:
>>
>>  M : Map;
>>begin
>>  --...
>>  M.Include (K, E);
>>  M.Exclude (K);
> 
> 
> It's the interface. i.E. The STL cursors tries to mimic the C pointer
> behavior. Pointer arithmetic is low-level in my eyes.

OTOH, Ada containers, too, have a number of high level operations,
for example Intersection of sets, Floor... No visible cursors involved.
I believe you don't have this in STL's set<>, instead there are
generic algorithms.

> The OCL rather tries to mimic a simple database. And databases are more high
> level then pointers in my eyes.

I think the plan for Ada.Containers is to go on working
on generic algorithms. If a container doesn't provide
a high level operation that is likely used frequently,
it can be provided either using a generic algorithm, or,
maybe, by extending the container type.