Talk:Queue/Definition: Difference between revisions

The last line of the task description states ''Define the data structure for a FIFO element. Said element should contain a data member capable of holding a numeric value, and the link to the next element should be mutable.'' The Python example first provided does not satisfy this requirement. It seems that the Python example should be expanded to include a definition of the data structure for a FIFO element.

- [[Waldorf|Waldorf]] 4 November 2007

:::There is definitely no need to require some specific method to implement the FIFO. After all, in real world the implementation should be encapsulated anyway. And why does it require using linked list? That is ''not'' how FIFO is implemented in the real world. The most common implementation method is a circular buffer. --[[User:PauliKL|PauliKL]] 16:19, 19 November 2008 (UTC)

 

I created and added an illustration. Hope you like it. Gimp was ''not'' the right way to assemble an animated GIF. --[[User:Short Circuit|Short Circuit]] 23:32, 5 November 2007 (MST)

 

 

The Ada section has actually four implementations, where two of them have the additional condition of being usable from concurrent threads. Since this makes the Ada section quite large and isn't actually necessary for the task, I propose to create a new task "concurrency-safe FIFO" or similar, and move the last two Ada examples there. --[[User:Ce|Ce]] 09:43, 28 February 2008 (MST)