🚀 go-pugleaf

Remy Lebeau (TeamB) <gambit47.no.spam@no.spam.yahoo.com> schrieb in im
Newsbeitrag: 3f844de9@newsgroups.borland.com...
>
> "Matt Heling" <heli@_REMOVE_THIS_heling.de> wrote in message
> news:3f84329c@newsgroups.borland.com...
>
> > Is there any difference in "performance" (speed) of these
> > two components (TQueue & TStack).
>
> You said you wanted a FIFO list.  TQueue is FIFO, whereas TStack is LIFO
> instead.
Oooooops! You are right: I said that, I remember...didn't want to confuse
anybody....sorry 'bout that....That was really a good reason to suggest
TQueue! :-)
......but there was the thought of getting speed advance by maybe using
TStack (only if it was faster) (actually the List shall keep pointers to
prepared (empty) Datacontainers and threads should exchange a pointer to a
just filled Datacontainer (filled by thread2) with a pointer to an empty
one, so it didn't matter, whether it was FIFO (although preferred) or a
LIFO, supplied enough pointers to empty Datacontainers keep beeing available
(another task for thread1). Thatswhy I was asking for any difference...


>
> > I could imagine, that TQueue works with InnerList->Add()
>
> Actually, it uses Insert(0) instead.
>
> > and the Pop() method returns InnerList->Items[0]
>
> Actually, it pops Items[Count-1] instead.
>
Thank you for all the information!

Best regards,

HELI