Mattias Gaertner wrote:
If the linked list item contains the whole data, then you are either not
talking of the generic list this thread is about, or you use templates. In
the later case a TList will also use templates and the 'payload' is the
same.
That's true of records, sure. Someone could also create a
TLinkedListItem base class from which to descend and store their data
there. The next & prev pointers can be stored in the base class.
Anyway, thanks for the discussion :)
_______________________________________________
fpc-devel maillist - fpc-devel@lists.freepascal.org
http://lists.freepascal.org/mailman/listinfo/fpc-devel
