Minor fixes to commentaries, package headers, and whitespace

* queue.el: fix description of data structure in Commentary; add Maintainer
  header.

* queue.el, heap.el, tNFA.el, trie.el, dict-tree.el: trivial whitespace fixes.

diff --git a/packages/dict-tree/dict-tree.el b/packages/dict-tree/dict-tree.el
index 436a75ff5a273587cff874a7835308574ab8e824..fe3fbe2fcbc7df33dc22333bb640c167aa0eeef6 100644 (file)
--- a/packages/dict-tree/dict-tree.el
+++ b/packages/dict-tree/dict-tree.el
@@ -1,5 +1,4 @@
-;;; dict-tree.el --- dictionary data structure package
-
+;;; dict-tree.el --- Dictionary data structure package
 
 ;; Copyright (C) 2004-2012  Free Software Foundation, Inc
 

diff --git a/packages/heap/heap.el b/packages/heap/heap.el
index a962a006746d251505595d3fa286514bfba54e3f..4904a2e7657533b42eb06f03ac80655a35522569 100644 (file)
--- a/packages/heap/heap.el
+++ b/packages/heap/heap.el
@@ -1,5 +1,4 @@
-;;; heap.el --- heap (a.k.a. priority queue) data structures
-
+;;; heap.el --- Heap (a.k.a. priority queue) data structure
 
 ;; Copyright (C) 2004-2006, 2008, 2012  Free Software Foundation, Inc
 

diff --git a/packages/queue/queue.el b/packages/queue/queue.el
index 56cb234e1cd95136807bdaede86e3b211b613c0f..f065089f7e2af7e68d4529bc2fb2d679cc6ff006 100644 (file)
--- a/packages/queue/queue.el
+++ b/packages/queue/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 <inge@lysator.liu.se>
 ;;         Toby Cubitt <toby-predictive@dr-qubit.org>
+;; Maintainer: Toby Cubitt <toby-predictive@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:
 

diff --git a/packages/tNFA/tNFA.el b/packages/tNFA/tNFA.el
index 307d668b7d974e5d95d90722ab4bdc4f19fd9131..7e8b1697f090ff19f39c8f6a1a9a5c79791d8ccc 100644 (file)
--- a/packages/tNFA/tNFA.el
+++ b/packages/tNFA/tNFA.el
@@ -1,5 +1,4 @@
-;;; tNFA.el --- tagged non-deterministic finite-state automata
-
+;;; tNFA.el --- Tagged non-deterministic finite-state automata
 
 ;; Copyright (C) 2008-2010, 2012   Free Software Foundation, Inc
 

diff --git a/packages/trie/trie.el b/packages/trie/trie.el
index 4e5c016da274cda99be00ca9093f780d15fe07b8..ff8907c82a1d841a21e54b09665c15fb329ccf05 100644 (file)
--- a/packages/trie/trie.el
+++ b/packages/trie/trie.el
@@ -1,5 +1,4 @@
-;;; trie.el --- trie package
-
+;;; trie.el --- Trie data structure
 
 ;; Copyright (C) 2008-2010, 2012  Free Software Foundation, Inc