queue
- Description
- Queue data structure
- Latest
- queue-0.2.tar (.sig), 2024-Mar-31, 10.0 KiB
- Maintainer
- Toby Cubitt <[email protected]>
- Atom feed
- queue.xml
- Website
- http://www.dr-qubit.org/emacs.php
- Browse ELPA's repository
- CGit or Gitweb
- Badge
To install this package from Emacs, use package-install
or list-packages
.
Full description
These queues can be used both as a first-in last-out (FILO) and as a first-in first-out (FIFO) stack, i.e. elements can be added to the front or back of the queue, and can be removed from the front. (This type of data structure is sometimes called an "output-restricted deque".) You create a queue using `make-queue', add an element to the end of the queue using `queue-enqueue', and push an element onto the front of the queue using `queue-prepend'. To remove the first element from a queue, use `queue-dequeue'. A number of other queue convenience functions are also provided, all starting with the prefix `queue-'. Functions with prefix `queue--' are for internal use only, and should never be used outside this package.
Old versions
queue-0.1.1.el.lz | 2014-May-15 | 1.89 KiB |
queue-0.1.el.lz | 2012-Nov-29 | 1.88 KiB |