branch: externals/queue
commit 82aa3ef62dc08e78e62e0821349bae367ae5b233
Author: Toby S. Cubitt <toby-predict...@dr-qubit.org>
Commit: Toby S. Cubitt <toby-predict...@dr-qubit.org>
More minor whitespace and commentary changes.
---
queue.el | 17 ++++++++++++-----
1 file changed, 12 insertions(+), 5 deletions(-)
diff --git a/queue.el b/queue.el
index 56cb234..f065089 100644
--- a/queue.el
+++ b/queue.el
@@ -1,10 +1,10 @@
-;;; queue.el --- queue data structures
-
+;;; queue.el --- Queue data structure
;; Copyright (C) 1991-1995, 2008-2009, 2012 Free Software Foundation, Inc
;; Author: Inge Wallin <i...@lysator.liu.se>
;; Toby Cubitt <toby-predict...@dr-qubit.org>
+;; Maintainer: Toby Cubitt <toby-predict...@dr-qubit.org>
;; Version: 0.1
;; Keywords: extensions, data structures, queue
;; URL: http://www.dr-qubit.org/emacs.php
@@ -28,9 +28,10 @@
;;; Commentary:
;;
-;; A queue 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 and removed from the
-;; front or back of the queue.
+;; 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
@@ -41,6 +42,12 @@
;; package.
+;;; Change Log:
+;;
+;; Version 0.1
+;; * the old Elib library of the same name, updated to use defstructs
+
+
;;; Code:
