🚀 go-pugleaf

In article <1gkia2INN31u@escargot.xx.rmit.OZ.AU> rcskb@minyos.xx.rmit.OZ.AU (Kendall Bennett) writes:
 > cclark@trentu.ca (J. Chris Clark) writes:
 > >In article <1992Dec11.080213.6552@ugle.unit.no>, mariusk@solan.unit.no (Marius Kjeldahl) writes...
 > >>You should look into the CLASSLIB objects. I think they've got the most
 > >>usual lists, stacks, heaps and more adt covered in CLASSLIB. OWL for instance
 > >>uses CLASSLIB.

 > >Specifically, it's called the "container class library".  I looked at it
 > >once, considered using it, then decided that the overhead (probable run-time
 > >and my learning/frustration time) wasn't worth it for a doublly-linked list
 > >and I wrote the procedures in about an hour.

 > Actually, a good implementation of linked lists as a C++ class (forget
 > the whole concept of a container class library and go back to the old
 > concept of an ADT), can be more efficient than a set of nice routines
 > in C. Of course programmer's in C tend to write linked list code
 > inline anyway, using pointer arithmetic, but a C++ class can really
 > help to take the load of using lists etc.

The implementation of lists in CLASSLIB is quite braindead. For
example, you cannot insert or delete items in the middle of the list.
I cannot imagine any use for such a list.
--
Pertti Suomela

Internet: ps@uta.fi
X.400:    G=Pertti S=Suomela O=uta ADMD=fumail C=fi