------------------------------------------------------------
revno: 208
committer: Toby S. Cubitt <ts...@cantab.net>
branch nick: elpa
timestamp: Mon 2012-04-30 20:41:06 +0200
message:
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.
modified:
packages/dict-tree/dict-tree.el
packages/heap/heap.el
packages/queue/queue.el
packages/tNFA/tNFA.el
packages/trie/trie.el
=== modified file 'packages/dict-tree/dict-tree.el'
--- a/packages/dict-tree/dict-tree.el 2012-04-29 11:45:44 +0000
+++ b/packages/dict-tree/dict-tree.el 2012-04-30 18:41:06 +0000
@@ -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
=== modified file 'packages/heap/heap.el'
--- a/packages/heap/heap.el 2012-04-29 11:44:35 +0000
+++ b/packages/heap/heap.el 2012-04-30 18:41:06 +0000
@@ -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
=== modified file 'packages/queue/queue.el'
--- a/packages/queue/queue.el 2012-04-29 11:43:42 +0000
+++ b/packages/queue/queue.el 2012-04-30 18:41:06 +0000
@@ -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:
=== modified file 'packages/tNFA/tNFA.el'
--- a/packages/tNFA/tNFA.el 2012-04-29 11:45:01 +0000
+++ b/packages/tNFA/tNFA.el 2012-04-30 18:41:06 +0000
@@ -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
=== modified file 'packages/trie/trie.el'
--- a/packages/trie/trie.el 2012-04-29 11:45:19 +0000
+++ b/packages/trie/trie.el 2012-04-30 18:41:06 +0000
@@ -1,5 +1,4 @@
-;;; trie.el --- trie package
-
+;;; trie.el --- Trie data structure
;; Copyright (C) 2008-2010, 2012 Free Software Foundation, Inc
