[Top][All Lists]
[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: |
Sun, 22 Apr 2007 01:26:46 +0000 |
CVSROOT: /sources/emacs
Module name: emacs
Changes by: Glenn Morris <gm> 07/04/22 01:26:45
Index: todo-mode.el
===================================================================
RCS file: /sources/emacs/emacs/lisp/calendar/todo-mode.el,v
retrieving revision 1.59
retrieving revision 1.60
diff -u -b -r1.59 -r1.60
--- todo-mode.el 19 Apr 2007 06:30:26 -0000 1.59
+++ todo-mode.el 22 Apr 2007 01:26:45 -0000 1.60
@@ -205,7 +205,7 @@
;; 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 threshold
+;; halving the size 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
@@ -231,7 +231,7 @@
;; an event (unless marked by &)
;; o The optional COUNT variable of todo-forward-item should be
;; applied to the other functions performing similar tasks
-;; o Modularization could be done for repeaded elements of
+;; o Modularization could be done for repeated elements of
;; the code, like the completing-read lines of code.
;; o license / version function
;; o export to diary file
@@ -280,7 +280,7 @@
diary. With the default value \"*/*\" the diary displays each entry
every day and it may also be marked on every day of the calendar.
Using \"&%%(equal (calendar-current-date) date)\" instead will only
-show and mark todo entreis for today, but may slow down processing of
+show and mark todo entries for today, but may slow down processing of
the diary file somewhat."
:type 'string
:group 'todo)
@@ -306,7 +306,7 @@
If you have 8 items in your TODO list, then you may get asked 4
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
+items. If you now think about the binary insertion halving the size
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