comparison lisp/language/thai-word.el @ 90718:f1d13e615070

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: [e-mail]/emacs--unicode--0--patch-150

90717:06937e972ad0

	(setq this (and (< pos limit) (cdr (assq char this)))))
      positions)))


;; 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
;; 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.

(defun thai-forward-word-update-info (vec limit)

	    (setq v0 (cdr v0)))
	  ;; No success.
	  nil)
	(progn
	  ;; We found four succeeding Thai words (or LIMIT has been
	  ;; 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
	  ;; element to nil.
	  (if (and (consp v1) (< (car v1) (car (aref vec 1))))

	    (if (and (consp v2) (< (car v2) (car (aref vec 2))))
		(aset vec 1 nil)
	      (aset vec 1 v2)
	      (aset vec 2 v3)))) ; exit function successfully

      ;; 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
      ;; heuristic tests.
      (if (and second-best

90718:f1d13e615070

	(setq this (and (< pos limit) (cdr (assq char this)))))
      positions)))


;; 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
;; 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.

(defun thai-forward-word-update-info (vec limit)

	    (setq v0 (cdr v0)))
	  ;; No success.
	  nil)
	(progn
	  ;; We found four succeeding Thai words (or LIMIT has been
	  ;; 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
	  ;; element to nil.
	  (if (and (consp v1) (< (car v1) (car (aref vec 1))))

	    (if (and (consp v2) (< (car v2) (car (aref vec 2))))
		(aset vec 1 nil)
	      (aset vec 1 v2)
	      (aset vec 2 v3)))) ; exit function successfully

      ;; 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
      ;; heuristic tests.
      (if (and second-best