Dynamic file (queue) concept and algo. 
Author Message
 Dynamic file (queue) concept and algo.

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

thanks



Fri, 01 Apr 2005 00:57:52 GMT  
 Dynamic file (queue) concept and algo.

Quote:

> 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



Fri, 01 Apr 2005 03:01:09 GMT  
 
 [ 2 post ] 

 Relevant Pages 

1. Algo chess, Algo damier .FR

2. Dynamic file and queue structures

3. CLASSes and QUEUEs (was: Re: QUEUE in QUEUE)

4. Physical concepts lead to Abstract concepts

5. Physical concepts lead to Abstract concepts

6. Concept Languages (was:Re: Paper Available: Theorem Proving, Concept Languages)

7. declare queue dynamic

8. Dynamic Queue at Runtime?

9. Dynamic Queue Field Creation

10. Dynamic Queues and/or Linked Lists

11. New file handling concepts in 4tH

12. How to make a queue of queue's

 

 
Powered by phpBB® Forum Software