emacs-diffs
[Top][All Lists]
Advanced

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[Emacs-diffs] Changes to emacs/lisp/calendar/todo-mode.el,v


From: Glenn Morris
Subject: [Emacs-diffs] Changes to emacs/lisp/calendar/todo-mode.el,v
Date: Thu, 19 Apr 2007 06:30:27 +0000

CVSROOT:        /sources/emacs
Module name:    emacs
Changes by:     Glenn Morris <gm>       07/04/19 06:30:27

Index: todo-mode.el
===================================================================
RCS file: /sources/emacs/emacs/lisp/calendar/todo-mode.el,v
retrieving revision 1.58
retrieving revision 1.59
diff -u -b -r1.58 -r1.59
--- todo-mode.el        21 Jan 2007 02:38:24 -0000      1.58
+++ todo-mode.el        19 Apr 2007 06:30:26 -0000      1.59
@@ -205,11 +205,11 @@
 ;;             by the binary insertion algorithm.  However, you may not
 ;;             really have a need for such accurate priorities amongst your
 ;;             TODO items.  If you now think about the binary insertion
-;;             halfing the size of the window each time, then the threshhold
+;;             halfing the size of the window each time, then the threshold
 ;;             is the window size at which it will stop.  If you set the
-;;             threshhold to zero, the upper and lower bound will coincide at
+;;             threshold to zero, the upper and lower bound will coincide at
 ;;             the end of the loop and you will insert your item just before
-;;             that point.  If you set the threshhold to, e.g. 8, it will stop
+;;             that point.  If you set the threshold to, e.g. 8, it will stop
 ;;             as soon as the window size drops below that amount and will
 ;;             insert the item in the approximate centre of that window.  I
 ;;             got the idea for this feature after reading a very helpful
@@ -307,10 +307,10 @@
 questions by the binary insertion algorithm.  However, you may not
 really have a need for such accurate priorities amongst your TODO
 items.  If you now think about the binary insertion halfing the size
-of the window each time, then the threshhold is the window size at
-which it will stop.  If you set the threshhold to zero, the upper and
+of the window each time, then the threshold is the window size at
+which it will stop.  If you set the threshold to zero, the upper and
 lower bound will coincide at the end of the loop and you will insert
-your item just before that point.  If you set the threshhold to,
+your item just before that point.  If you set the threshold to,
 e.g. 8, it will stop as soon as the window size drops below that
 amount and will insert the item in the approximate center of that
 window."




reply via email to

[Prev in Thread] Current Thread [Next in Thread]