diff lisp/prim/undo-stack.el @ 2:ac2d302a0011 r19-15b2

Import from CVS: tag r19-15b2
author cvs
date Mon, 13 Aug 2007 08:46:35 +0200
parents 376386a54a3c
children 0293115a14e9
line wrap: on
line diff
--- a/lisp/prim/undo-stack.el	Mon Aug 13 08:45:53 2007 +0200
+++ b/lisp/prim/undo-stack.el	Mon Aug 13 08:46:35 2007 +0200
@@ -104,7 +104,7 @@
 ;;; Conceptually, we can implement the "undoable stack" using
 ;;; two stacks of a sort called "truncatable stack", which are
 ;;; just simple stacks, but where you can truncate elements
-;;; of of the bottom of the stack.  Then, the undoable stack
+;;; off of the bottom of the stack.  Then, the undoable stack
 ;;;
 ;;;   1 -> 2 -> 3 -> 4 -> 5 -> 6
 ;;;                  ^^