✳flâneur — a map of the web's best reading

Queue - Esolang

esolangs.org · 365 words · saved by 1 readers

A queue works by the principle of First In, First Out (FIFO). What is enqueued onto the queue first, will be dequeued first. This leads to the operations ENQUEUE, which puts a value at the back of the queue, and DEQUEUE, which takes a value from the front, removes it, and returns it. In addition to ENQUEUE and DEQUEUE, there are a few other queue manipulation operations, many of which are the queue equivalent of stack operations, that queues can use that are generally accomplished through scalar variables. The following table lists them, including the operation, its name, its traditional (or completely made up) laconic representation, its meaning, and an example in "Generic Queue Language" (GQL), a language used solely for example purposes. Here are some examples of esoteric programming languages that use queues:

Queue - Esolang We are currently working on new rules for what content should and shouldn't be allowed on this website, and are looking for feedback! See Esolang:2026 topicality proposal to view and give feedback on the current draft. Queue From Esolang Jump to navigation Jump to search A queue is a data structure sometimes used in esoteric programming languages . Contents 1 Operations 1.1 Additional Operations 2 Use in esolangs 3 See Also Operations A queue works by the principle of First In, First Out (FIFO). What is enqueued onto the queue first, will be dequeued first. This leads to the op

Explore this link on the map →

related reading