From: Pascal Obry <p.obry@wanadoo.fr>
Subject: Re: Dynamic file (queue) concept and algo.
Date: 13 Oct 2002 21:01:09 +0200
Date: 2002-10-13T19:01:37+00:00 [thread overview]
Message-ID: <uwuom88p6.fsf@wanadoo.fr> (raw)
In-Reply-To: mailman.1034528282.14042.comp.lang.ada@ada.eu.org
"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
prev parent reply other threads:[~2002-10-13 19:01 UTC|newest]
Thread overview: 2+ messages / expand[flat|nested] mbox.gz Atom feed top
2002-10-13 16:57 Dynamic file (queue) concept and algo Dominic D'Apice
2002-10-13 19:01 ` Pascal Obry [this message]
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox