Talk:FIFO (computing and electronics)

This is an old revision of this page, as edited by Antaeus Feldspar (talk | contribs) at 18:20, 5 September 2005 (Proposed merge with [Queue]). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Latest comment: 19 years ago by Antaeus Feldspar in topic Proposed merge with [Queue]

Proposed merge with [Queue]

A merge was proposed by R.Koot - Shall we discuss it?

Add *Support or *Oppose and/or any comments you may have. Sign your comments with ~~~~
  • Support - Queue, FIFO and Circular Buffer all seem to be describing the same data structure - it seems reasonable to keep them in one article rather than three. But which of the three places should we move it to? And should we merge the 'accounting' and 'engineering' bits as well as the 'computer science' bits? Mike1024 16:41, 5 September 2005 (UTC)Reply
  • Oppose for now -- they are not synonyms. FIFO is the behavior; Queue is an abstract data structure which produces that behavior; Circular buffer is a particular implementation that can be used for queues. As FIFO shows, the behavior is not limited to computer science, let alone to queues; as Queue shows, circular buffers are not the only implementation. There may be merits to doing some merging, but they have to be carefully considered. -- Antaeus Feldspar 18:20, 5 September 2005 (UTC)Reply