Home/ Questions/Q 227263
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-11T19:35:02+00:00

The queue, or FIFO, is one of the most common data structures, and have

  • 0

The “queue”, or FIFO, is one of the most common data structures, and have native implementations in many languages and frameworks. However, there seems to be little consensus as to how fundamental queue operations should be named. A survey of several popular languages show:

  • Python: put / get
  • C#, Qt : enqueue /dequeue
  • Ruby, C++ STD: push / pop
  • Java: add / remove

If one need to implement a queue (say, in some embedded platform that does not have a native queue implementation already), what naming convention would be best?
Enqueue/dequeue seem to be the most explicit, but is wordy; put/get is succinct but does not provide any hint as to the FIFO nature of the operations; push/pop seems to be suggest stack operations instead of queue operations.

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    I’m kind of a pedant, so I’d go with enqueue/dequeue.

    Though add/next has a certain appeal.

    Just to cloud the issue a little more, in Perl it’s push/shift. 🙂

    • 0