Anonymous user
Talk:Queue/Definition: Difference between revisions
Remove requirement for linked list
(New section: Ada examples) |
(Remove requirement for linked list) |
||
Line 16:
: It would probably be more appropriate to re-word the description like "If no appropriate data structure exists within the language or common libraries, define an appropriate data structure supporting (...)." While FIFOs are common enough data structures that I would expect them to be possible in most languages, I would still ask '''Nirs''' if there was a reason he specified that the link be mutable. --[[User:Short Circuit|Short Circuit]] 19:13, 4 November 2007 (MST)
::I suggest to remove the requirement for fifo data structure. --[[User:Nirs|Nirs]] 07:04, 5 November 2007 (MST)
:::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)
=Illustration=
| |||