From mboxrd@z Thu Jan 1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level:
X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00 autolearn=ham
autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,d13473ebb8b82e59
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 2002-10-13 12:01:38 PST
Path:
archiver1.google.com!news1.google.com!newsfeed.stanford.edu!paloalto-snf1.gtei.net!news.gtei.net!enews.sgi.com!proxad.net!wanadoo.fr!not-for-mail
From: Pascal Obry
Newsgroups: comp.lang.ada
Subject: Re: Dynamic file (queue) concept and algo.
Date: 13 Oct 2002 21:01:09 +0200
Organization: Home - http://perso.wanadoo.fr/pascal.obry
Message-ID:
References:
NNTP-Posting-Host: avelizy-103-1-7-21.abo.wanadoo.fr
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
X-Trace: wanadoo.fr 1034535697 4987 81.48.101.21 (13 Oct 2002 19:01:37 GMT)
X-Complaints-To: abuse@wanadoo.fr
NNTP-Posting-Date: 13 Oct 2002 19:01:37 GMT
User-Agent: Gnus/5.09 (Gnus v5.9.0) Emacs/21.2.91
Xref: archiver1.google.com comp.lang.ada:29751
Date: 2002-10-13T19:01:37+00:00
List-Id:
"Dominic D'Apice" 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