comp.lang.ada
 help / color / mirror / Atom feed
* Dynamic file (queue) concept and algo.
@ 2002-10-13 16:57 Dominic D'Apice
  2002-10-13 19:01 ` Pascal Obry
  0 siblings, 1 reply; 2+ messages in thread
From: Dominic D'Apice @ 2002-10-13 16:57 UTC (permalink / raw)


Hi, someone has some documentation about dynamic queue concept (and
algo.) ?

thanks




^ permalink raw reply	[flat|nested] 2+ messages in thread

* Re: Dynamic file (queue) concept and algo.
  2002-10-13 16:57 Dynamic file (queue) concept and algo Dominic D'Apice
@ 2002-10-13 19:01 ` Pascal Obry
  0 siblings, 0 replies; 2+ messages in thread
From: Pascal Obry @ 2002-10-13 19:01 UTC (permalink / raw)



"Dominic D'Apice" <dapiced@sympatico.ca> writes:

> Hi, someone has some documentation about dynamic queue concept (and
> algo.) ?

Simple, it is a FIFO (First In First Out) structure. Its means that the first
element inserted into the structure will be the first element out (retreived
by the user). "dynamic" here means that there is no limit for the number of
elements the queue can handle, this implementation will certainly use pointers
to link each items...

Pascal.

-- 

--|------------------------------------------------------
--| Pascal Obry                           Team-Ada Member
--| 45, rue Gabriel Peri - 78114 Magny Les Hameaux FRANCE
--|------------------------------------------------------
--|         http://perso.wanadoo.fr/pascal.obry
--| "The best way to travel is by means of imagination"
--|
--| gpg --keyserver wwwkeys.pgp.net --recv-key C1082595



^ permalink raw reply	[flat|nested] 2+ messages in thread

end of thread, other threads:[~2002-10-13 19:01 UTC | newest]

Thread overview: 2+ messages (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2002-10-13 16:57 Dynamic file (queue) concept and algo Dominic D'Apice
2002-10-13 19:01 ` Pascal Obry

This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox