diff options
author | Kaz Kylheku <kaz@kylheku.com> | 2015-12-01 12:21:58 -0800 |
---|---|---|
committer | Kaz Kylheku <kaz@kylheku.com> | 2015-12-01 12:21:58 -0800 |
commit | ef2d5d7c9f1422eaa9cb3a2a291e19e7eff1f8df (patch) | |
tree | 723eaaba96e8f474afbc199b5ad7dc944940c3d3 /deque.lisp | |
parent | ae11e9116d420ef4cf0aa941a3275d677ff8e2b4 (diff) | |
download | lisp-snippets-ef2d5d7c9f1422eaa9cb3a2a291e19e7eff1f8df.tar.gz lisp-snippets-ef2d5d7c9f1422eaa9cb3a2a291e19e7eff1f8df.tar.bz2 lisp-snippets-ef2d5d7c9f1422eaa9cb3a2a291e19e7eff1f8df.zip |
Nuke trailing whitespace.
Diffstat (limited to 'deque.lisp')
-rw-r--r-- | deque.lisp | 4 |
1 files changed, 2 insertions, 2 deletions
@@ -2,7 +2,7 @@ ;;; deque data type for Lisp ;;; ;;; Copyright 2012 Kaz Kylheku <kaz@kylheku.com> -;;; +;;; ;;; With the help of the pop-deque macro below, you can represent ;;; a deque using two Lisp lists. Use one list for the ;;; front end of the deque and another list for the back. @@ -19,7 +19,7 @@ ;;; (or F B) gives us a test whether the dequeue is not empty. ;;; ;;; (+ (length F) (length B)) gives us the length. -;;; +;;; ;;; (eval-when (:compile-toplevel :load-toplevel :execute) |