Re: List container: Insert and Delete

[John English <je@brighton.ac.uk>]

Ted Dennison wrote:
> 
> In article <9sn4qm$13g29j$2@ID-25716.news.dfncis.de>, Nick Roberts says...
> >(b) For a list based on an array, the operation: "delete the third item" is
> >easy to implement, and fairly efficient for short lists; "insert before the
> 
> Right now we are working on a defintion for *unbounded* lists, on the theory
> that this is the most basic need. Bounded is for special cases. If you know a
> good way to make an unbounded list using an array, you are a better man than I,
> Gungha Din.

Sigh. Perhaps a "list" of shortcomings of existing list packages would
be better than yet another reinvention of this particular wheel. For
example, what's wrong with Booch lists, or for that matter the ones in
my book (http://www.it.bton.ac.uk/staff/je/adacraft/ch12.htm#12.1 and
http://www.it.bton.ac.uk/staff/je/adacraft/appd.htm#d.8), or any of
the many other implementations floating around already?

Otherwise, it seems to me we'll end up with "just another list package"
which will be supported by some and decried by others...

-----------------------------------------------------------------
 John English              | mailto:je@brighton.ac.uk
 Senior Lecturer           | http://www.comp.it.bton.ac.uk/je
 Dept. of Computing        | ** NON-PROFIT CD FOR CS STUDENTS **
 University of Brighton    |    -- see http://burks.bton.ac.uk
-----------------------------------------------------------------