Micha Nelissen wrote:
> procedure TGenericLinkedList.Insert(const AItem: T); inline;
> begin
> Move(AItem, inherited Insert^, sizeof(T));
That's probabaly dangerous for ref. counted types :)
> end;
>
___
fpc-devel maillist - [email protected]
On Fri, 23 Dec 2005 22:30:05 +0100
Florian Klaempfl <[EMAIL PROTECTED]> wrote:
> Micha Nelissen wrote:
> >
> > Comments are welcome.
>
> Make it a generic for use in a fpcontnr unit in fpc 2.1.x :)
Voilà :-). Maybe not in the way you imagined, but a nice test for generics
anyway :-). Seems that
On Fri, 23 Dec 2005 21:23:45 +0100
Micha Nelissen <[EMAIL PROTECTED]> wrote:
> I've attached my promised linked list.
I've attached an updated version :-). It adds ReadData/AppendData to ease
integration with buffers and arrays, such as TList.
Micha
linkedlist.tar.gz
Description: Binary data
Micha Nelissen wrote:
> On Fri, 23 Dec 2005 22:30:05 +0100
> Florian Klaempfl <[EMAIL PROTECTED]> wrote:
>
>
>>Micha Nelissen wrote:
>>
>>>Comments are welcome.
>>
>>Make it a generic for use in a fpcontnr unit in fpc 2.1.x :)
>
>
> fpc 2.1.x is a bit *too* experimental for my taste :-P.
For
On Fri, 23 Dec 2005 22:30:05 +0100
Florian Klaempfl <[EMAIL PROTECTED]> wrote:
> Micha Nelissen wrote:
> >
> > Comments are welcome.
>
> Make it a generic for use in a fpcontnr unit in fpc 2.1.x :)
fpc 2.1.x is a bit *too* experimental for my taste :-P.
Micha
__
Micha Nelissen wrote:
>
> Comments are welcome.
Make it a generic for use in a fpcontnr unit in fpc 2.1.x :)
___
fpc-devel maillist - [email protected]
http://lists.freepascal.org/mailman/listinfo/fpc-devel
Hi,
I've attached my promised linked list. It's become a doubly-linked list,
so that Delete can be called multiple times in a row without problems.
OTOH, it would not be hard to make a singly-linked list variant (anyone
who uses only a single Delete after linear Find only?). I think the
interface
