Re: why not

["Marin David Condic" <dont.bother.mcondic.auntie.spam@[acm.org>]

I don't remember saying I was trying to duplicate STL. (I don't recall
claiming I knew anything at all about STL - other than being aware of its
existence. :-) I don't know that duplicating STL is anybody's goal with a
component library for Ada.

This started as a discussion of the notion of adopting the Booch Components
as a de facto "standard" component library. Objections have been voiced.
Other libraries have been suggested. The notion of developing one from
bottom-up has been suggested. Clarifying requirements seems to be a running
theme. How much of a "standard" it should be is part of the discussion. How
to get it adopted (grassroots? vendors? Ada0x committee?) is also a factor.
Mostly it seems to be about tossing out possible ideas for what would be a
good "standard" set of components.

Are you proposing that a component library for Ada should be modeled on the
STL?

BTW: I would think that having just one algorithm for sorting might impose a
lot of overhead on things that weren't well suited to the algorithm. I don't
see any problem with saying, for example, a Map is "sorted" by its very
nature as elements enter into it and how it accomplishes that is an
implementation detail for the Map package. Similarly, one can imagine some
flavor of a list as an inherently sorted entity and how it gets its elements
into order is best left to the particular implementation. (If its underlying
implementation is an array, you do one thing - if its a linked list, you do
another.)


MDC
--
Marin David Condic
Senior Software Engineer
Pace Micro Technology Americas    www.pacemicro.com
Enabling the digital revolution
e-Mail:    marin.condic@pacemicro.com
Web:      http://www.mcondic.com/


"Matthew Heaney" <mheaney@on2.com> wrote in message
news:tu374frvic9ebb@corp.supernews.com...
>
> Something tells me you don't really understand the STL.  There is *one*
> algorithm for sorting, and it works for any kind of container.
>