Re: List container: Insert and Delete

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

If you had an abstract tagged list type that defined behavior common to
*all* lists (unbounded, bounded, unsorted, sorted, etc,) you could just add
the operations that make sense for the particular type of list. I don't know
that it has to be a tagged type - just create different packages that have
somewhat different features where it makes sense.

I'd take a cue from Ada.Strings.* since this is the "flavor" of things in
Ada. The packages are similar, but not identical. Operations exist only if
they make sense for the particular type of string and are not always
identical since different types of strings need different parameters to
operations. If you think about it, Strings are not all that different from
Lists, so to whatever extent we can get orthogonality between the two
package sets, the more familiar they will appear to be to your average Ada
programmer.

(You can change the names so you won't have
ASCL.Lists.Unbounded.Unbounded_List if you like :-)

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/


"Ted Dennison" <dennison@telepath.com> wrote in message
news:5DaI7.23016$xS6.35866@www.newsranger.com...
>
> I'd agree with this. The only compelling reason I could see for it would
be if
> we were using some kind of root tagged type to implement both (which we
aren't),
> and wanted to allow for dynamic dispatching on classwide list pointers.
>
> I'm curious what people think about the extent of the compatability they
should
> have though. Should the look mostly alike, except for routines that don't
make
> sense in that context? Should we remove all basic-looking routines from
either
> implementation with time behavior >=O(N). Should the interface for bounded
be
> completely redesigned around things that you can do with bounded
implementations
> that you can't easily do with unbounded ones?
>
> Personally, I think I'm leaning towards the middle-of-the road option, but
its
> not a strong leaning.
>