Talk:FIFO (computing and electronics): Difference between revisions

Revision as of 19:21, 17 February 2015

Revision as of 18:43, 11 May 2020

Line 39:

== The code fragment is buggy ==

Try a simple thought experiment: <sourcesyntaxhighlight lang=cpp>queue(1);

item = dequeue();</sourcesyntaxhighlight>

The front and back pointers are not connected by the queue and dequeue functions, so the sequence won't work as expected.

A possible fixed version of the functions:

<sourcesyntaxhighlight lang=cpp>

fifo_node *dequeue(void)

{

Line 66:

}

}

</syntaxhighlight>

</source>

Note that this code is twice as long! The whole class would cover a full screen. I'm not sure such a queue implementation would fit into the article...