aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorGlenn Morris2007-04-19 06:31:04 +0000
committerGlenn Morris2007-04-19 06:31:04 +0000
commit745465ec5feb2d9be4cb0c70531ae557423a1647 (patch)
treec938c686471bbcc01ae440bfbaca5d801ceb29b7
parente159624dea3cf646a7f294eefd28e2842ccb22d4 (diff)
downloademacs-745465ec5feb2d9be4cb0c70531ae557423a1647.tar.gz
emacs-745465ec5feb2d9be4cb0c70531ae557423a1647.zip
Fix typo: "threshhold" -> "threshold".
-rw-r--r--lisp/ChangeLog4
-rw-r--r--lisp/calendar/todo-mode.el12
2 files changed, 10 insertions, 6 deletions
diff --git a/lisp/ChangeLog b/lisp/ChangeLog
index 9744808949f..496c8394baa 100644
--- a/lisp/ChangeLog
+++ b/lisp/ChangeLog
@@ -1,3 +1,7 @@
12007-04-19 Glenn Morris <rgm@gnu.org>
2
3 * calendar/todo-mode.el: Fix typo: "threshhold" -> "threshold".
4
12007-04-18 Glenn Morris <rgm@gnu.org> 52007-04-18 Glenn Morris <rgm@gnu.org>
2 6
3 * calendar/diary-lib.el (diary-header-line-format): Add a custom 7 * calendar/diary-lib.el (diary-header-line-format): Add a custom
diff --git a/lisp/calendar/todo-mode.el b/lisp/calendar/todo-mode.el
index 9449c84cb2a..f70400ed27d 100644
--- a/lisp/calendar/todo-mode.el
+++ b/lisp/calendar/todo-mode.el
@@ -205,11 +205,11 @@
205;; by the binary insertion algorithm. However, you may not 205;; by the binary insertion algorithm. However, you may not
206;; really have a need for such accurate priorities amongst your 206;; really have a need for such accurate priorities amongst your
207;; TODO items. If you now think about the binary insertion 207;; TODO items. If you now think about the binary insertion
208;; halfing the size of the window each time, then the threshhold 208;; halfing the size of the window each time, then the threshold
209;; is the window size at which it will stop. If you set the 209;; is the window size at which it will stop. If you set the
210;; threshhold to zero, the upper and lower bound will coincide at 210;; threshold to zero, the upper and lower bound will coincide at
211;; the end of the loop and you will insert your item just before 211;; the end of the loop and you will insert your item just before
212;; that point. If you set the threshhold to, e.g. 8, it will stop 212;; that point. If you set the threshold to, e.g. 8, it will stop
213;; as soon as the window size drops below that amount and will 213;; as soon as the window size drops below that amount and will
214;; insert the item in the approximate centre of that window. I 214;; insert the item in the approximate centre of that window. I
215;; got the idea for this feature after reading a very helpful 215;; got the idea for this feature after reading a very helpful
@@ -307,10 +307,10 @@ If you have 8 items in your TODO list, then you may get asked 4
307questions by the binary insertion algorithm. However, you may not 307questions by the binary insertion algorithm. However, you may not
308really have a need for such accurate priorities amongst your TODO 308really have a need for such accurate priorities amongst your TODO
309items. If you now think about the binary insertion halfing the size 309items. If you now think about the binary insertion halfing the size
310of the window each time, then the threshhold is the window size at 310of the window each time, then the threshold is the window size at
311which it will stop. If you set the threshhold to zero, the upper and 311which it will stop. If you set the threshold to zero, the upper and
312lower bound will coincide at the end of the loop and you will insert 312lower bound will coincide at the end of the loop and you will insert
313your item just before that point. If you set the threshhold to, 313your item just before that point. If you set the threshold to,
314e.g. 8, it will stop as soon as the window size drops below that 314e.g. 8, it will stop as soon as the window size drops below that
315amount and will insert the item in the approximate center of that 315amount and will insert the item in the approximate center of that
316window." 316window."