summaryrefslogtreecommitdiff
path: root/lisp/language
diff options
context:
space:
mode:
authorMiles Bader <miles@gnu.org>2006-12-07 04:14:14 +0000
committerMiles Bader <miles@gnu.org>2006-12-07 04:14:14 +0000
commita0451a715e4ed018a02b825d0eb823424693d1de (patch)
treed2b10fcc69c333ccc438d7a9ad116fbc1495fc9e /lisp/language
parentd324f894beea8b485792c779659e8e20c1cb699d (diff)
parent12f7728e938fe5bb850ce2928637d1e349919142 (diff)
downloademacs-a0451a715e4ed018a02b825d0eb823424693d1de.tar.gz
emacs-a0451a715e4ed018a02b825d0eb823424693d1de.tar.bz2
emacs-a0451a715e4ed018a02b825d0eb823424693d1de.zip
Merge from emacs--devo--0
Patches applied: * emacs--devo--0 (patch 523-544) - Update from CVS - Merge from gnus--rel--5.10 * gnus--rel--5.10 (patch 168-171) - Update from CVS - Merge from emacs--devo--0 Revision: emacs@sv.gnu.org/emacs--unicode--0--patch-150
Diffstat (limited to 'lisp/language')
-rw-r--r--lisp/language/thai-word.el6
1 files changed, 3 insertions, 3 deletions
diff --git a/lisp/language/thai-word.el b/lisp/language/thai-word.el
index 5584461bf4f..ee8db1f2708 100644
--- a/lisp/language/thai-word.el
+++ b/lisp/language/thai-word.el
@@ -10805,7 +10805,7 @@ the current word list."
;; Move point forward to the end of Thai word which follows point and
-;; update VEC. VEC is a vector of three elements used to cache word
+;; update VEC. VEC is a vector of three elements used to cache word
;; end positions. The Nth element, if non-nil, is a list of end
;; points of the Nth word, or t indicating that there is no Thai
;; character. LIMIT limits the point movement.
@@ -10886,7 +10886,7 @@ the current word list."
nil)
(progn
;; We found four succeeding Thai words (or LIMIT has been
- ;; reached). Move to the end of the first word.
+ ;; reached). Move to the end of the first word.
(goto-char (car v0))
;; Update VEC for the next function call. If no larger word
;; positions have been found, set the corresponding vector
@@ -10899,7 +10899,7 @@ the current word list."
(aset vec 1 v2)
(aset vec 2 v3)))) ; exit function successfully
- ;; We didn't find four consecutive words. If we have found a
+ ;; We didn't find four consecutive words. If we have found a
;; `second best' solution and the length of those two words is
;; longer than the longest word we can see at the current point,
;; adopt the second best solution. This decision is based on