1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300
|
;;; mule-util.el --- utility functions for mulitilingual environment (mule)
;; Copyright (C) 1995 Electrotechnical Laboratory, JAPAN.
;; Licensed to the Free Software Foundation.
;; Keywords: mule, multilingual
;; This file is part of GNU Emacs.
;; GNU Emacs is free software; you can redistribute it and/or modify
;; it under the terms of the GNU General Public License as published by
;; the Free Software Foundation; either version 2, or (at your option)
;; any later version.
;; GNU Emacs is distributed in the hope that it will be useful,
;; but WITHOUT ANY WARRANTY; without even the implied warranty of
;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
;; GNU General Public License for more details.
;; You should have received a copy of the GNU General Public License
;; along with GNU Emacs; see the file COPYING. If not, write to the
;; Free Software Foundation, Inc., 59 Temple Place - Suite 330,
;; Boston, MA 02111-1307, USA.
;;; Commentary:
;;; Code:
;;; String manipulations while paying attention to multibyte
;;; characters.
;;;###autoload
(defun string-to-sequence (string type)
"Convert STRING to a sequence of TYPE which contains characters in STRING.
TYPE should be `list' or `vector'."
;;; (let ((len (length string))
;;; (i 0)
;;; val)
(cond ((eq type 'list)
;; Applicable post-Emacs 20.2 and asymptotically ~10 times
;; faster than the code below:
(append string nil))
;;; (setq val (make-list len 0))
;;; (let ((l val))
;;; (while (< i len)
;;; (setcar l (aref string i))
;;; (setq l (cdr l) i (1+ i))))))
((eq type 'vector)
;; As above.
(vconcat string))
;;; (setq val (make-vector len 0))
;;; (while (< i len)
;;; (aset val i (aref string i))
;;; (setq i (1+ i))))
(t
(error "Invalid type: %s" type)))
;;; val)
)
;;;###autoload
(defsubst string-to-list (string)
"Return a list of characters in STRING."
(string-to-sequence string 'list))
;;;###autoload
(defsubst string-to-vector (string)
"Return a vector of characters in STRING."
(string-to-sequence string 'vector))
;;;###autoload
(defun store-substring (string idx obj)
"Embed OBJ (string or character) at index IDX of STRING."
(if (integerp obj)
(aset string idx obj)
(let ((len1 (length obj))
(len2 (length string))
(i 0))
(while (< i len1)
(aset string (+ idx i) (aref obj i))
(setq i (1+ i)))))
string)
;;;###autoload
(defun truncate-string-to-width (str end-column &optional start-column padding)
"Truncate string STR to end at column END-COLUMN.
The optional 3rd arg START-COLUMN, if non-nil, specifies
the starting column; that means to return the characters occupying
columns START-COLUMN ... END-COLUMN of STR.
The optional 4th arg PADDING, if non-nil, specifies a padding character
to add at the end of the result if STR doesn't reach column END-COLUMN,
or if END-COLUMN comes in the middle of a character in STR.
PADDING is also added at the beginning of the result
if column START-COLUMN appears in the middle of a character in STR.
If PADDING is nil, no padding is added in these cases, so
the resulting string may be narrower than END-COLUMN."
(or start-column
(setq start-column 0))
(let ((len (length str))
(idx 0)
(column 0)
(head-padding "") (tail-padding "")
ch last-column last-idx from-idx)
(condition-case nil
(while (< column start-column)
(setq ch (aref str idx)
column (+ column (char-width ch))
idx (1+ idx)))
(args-out-of-range (setq idx len)))
(if (< column start-column)
(if padding (make-string end-column padding) "")
(if (and padding (> column start-column))
(setq head-padding (make-string (- column start-column) padding)))
(setq from-idx idx)
(if (< end-column column)
(setq idx from-idx)
(condition-case nil
(while (< column end-column)
(setq last-column column
last-idx idx
ch (aref str idx)
column (+ column (char-width ch))
idx (1+ idx)))
(args-out-of-range (setq idx len)))
(if (> column end-column)
(setq column last-column idx last-idx))
(if (and padding (< column end-column))
(setq tail-padding (make-string (- end-column column) padding))))
(setq str (substring str from-idx idx))
(if padding
(concat head-padding str tail-padding)
str))))
;;; For backward compatibility ...
;;;###autoload
(defalias 'truncate-string 'truncate-string-to-width)
(make-obsolete 'truncate-string 'truncate-string-to-width "20.1")
;;; Nested alist handler. Nested alist is alist whose elements are
;;; also nested alist.
;;;###autoload
(defsubst nested-alist-p (obj)
"Return t if OBJ is a nested alist.
Nested alist is a list of the form (ENTRY . BRANCHES), where ENTRY is
any Lisp object, and BRANCHES is a list of cons cells of the form
(KEY-ELEMENT . NESTED-ALIST).
You can use a nested alist to store any Lisp object (ENTRY) for a key
sequence KEYSEQ, where KEYSEQ is a sequence of KEY-ELEMENT. KEYSEQ
can be a string, a vector, or a list."
(and obj (listp obj) (listp (cdr obj))))
;;;###autoload
(defun set-nested-alist (keyseq entry alist &optional len branches)
"Set ENTRY for KEYSEQ in a nested alist ALIST.
Optional 4th arg LEN non-nil means the first LEN elements in KEYSEQ
is considered.
Optional argument BRANCHES if non-nil is branches for a keyseq
longer than KEYSEQ.
See the documentation of `nested-alist-p' for more detail."
(or (nested-alist-p alist)
(error "Invalid argument %s" alist))
(let ((islist (listp keyseq))
(len (or len (length keyseq)))
(i 0)
key-elt slot)
(while (< i len)
(if (null (nested-alist-p alist))
(error "Keyseq %s is too long for this nested alist" keyseq))
(setq key-elt (if islist (nth i keyseq) (aref keyseq i)))
(setq slot (assoc key-elt (cdr alist)))
(if (null slot)
(progn
(setq slot (cons key-elt (list t)))
(setcdr alist (cons slot (cdr alist)))))
(setq alist (cdr slot))
(setq i (1+ i)))
(setcar alist entry)
(if branches
(setcdr (last alist) branches))))
;;;###autoload
(defun lookup-nested-alist (keyseq alist &optional len start nil-for-too-long)
"Look up key sequence KEYSEQ in nested alist ALIST. Return the definition.
Optional 1st argument LEN specifies the length of KEYSEQ.
Optional 2nd argument START specifies index of the starting key.
The returned value is normally a nested alist of which
car part is the entry for KEYSEQ.
If ALIST is not deep enough for KEYSEQ, return number which is
how many key elements at the front of KEYSEQ it takes
to reach a leaf in ALIST.
Optional 3rd argument NIL-FOR-TOO-LONG non-nil means return nil
even if ALIST is not deep enough."
(or (nested-alist-p alist)
(error "Invalid argument %s" alist))
(or len
(setq len (length keyseq)))
(let ((i (or start 0)))
(if (catch 'lookup-nested-alist-tag
(if (listp keyseq)
(while (< i len)
(if (setq alist (cdr (assoc (nth i keyseq) (cdr alist))))
(setq i (1+ i))
(throw 'lookup-nested-alist-tag t))))
(while (< i len)
(if (setq alist (cdr (assoc (aref keyseq i) (cdr alist))))
(setq i (1+ i))
(throw 'lookup-nested-alist-tag t))))
;; KEYSEQ is too long.
(if nil-for-too-long nil i)
alist)))
;; Coding system related functions.
;;;###autoload
(defun coding-system-eol-type-mnemonic (coding-system)
"Return the string indicating end-of-line format of CODING-SYSTEM."
(let* ((eol-type (coding-system-eol-type coding-system))
(val (cond ((vectorp eol-type) eol-mnemonic-undecided)
((eq eol-type 0) eol-mnemonic-unix)
((eq eol-type 1) eol-mnemonic-dos)
((eq eol-type 2) eol-mnemonic-mac)
(t "-"))))
(if (stringp val)
val
(char-to-string val))))
;;;###autoload
(defun coding-system-post-read-conversion (coding-system)
"Return the value of CODING-SYSTEM's post-read-conversion property."
(coding-system-get coding-system 'post-read-conversion))
;;;###autoload
(defun coding-system-pre-write-conversion (coding-system)
"Return the value of CODING-SYSTEM's pre-write-conversion property."
(coding-system-get coding-system 'pre-write-conversion))
;;;###autoload
(defun coding-system-translation-table-for-decode (coding-system)
"Return the value of CODING-SYSTEM's translation-table-for-decode property."
(coding-system-get coding-system 'translation-table-for-decode))
;;;###autoload
(defun coding-system-translation-table-for-encode (coding-system)
"Return the value of CODING-SYSTEM's translation-table-for-encode property."
(coding-system-get coding-system 'translation-table-for-encode))
;;;###autoload
(defun coding-system-equal (coding-system-1 coding-system-2)
"Return t if and only if CODING-SYSTEM-1 and CODING-SYSTEM-2 are identical.
Two coding systems are identical if two symbols are equal
or one is an alias of the other."
(or (eq coding-system-1 coding-system-2)
(and (equal (coding-system-spec coding-system-1)
(coding-system-spec coding-system-2))
(let ((eol-type-1 (coding-system-eol-type coding-system-1))
(eol-type-2 (coding-system-eol-type coding-system-2)))
(or (eq eol-type-1 eol-type-2)
(and (vectorp eol-type-1) (vectorp eol-type-2)))))))
;;;###autoload
(defmacro detect-coding-with-priority (from to priority-list)
"Detect a coding system of the text between FROM and TO with PRIORITY-LIST.
PRIORITY-LIST is an alist of coding categories vs the corresponding
coding systems ordered by priority."
`(unwind-protect
(let* ((prio-list ,priority-list)
(coding-category-list coding-category-list)
,@(mapcar (function (lambda (x) (list x x)))
coding-category-list))
(mapc (function (lambda (x) (set (car x) (cdr x))))
prio-list)
(set-coding-priority (mapcar #'car prio-list))
(detect-coding-region ,from ,to))
;; We must restore the internal database.
(set-coding-priority coding-category-list)
(update-coding-systems-internal)))
;;;###autoload
(defun detect-coding-with-language-environment (from to lang-env)
"Detect a coding system of the text between FROM and TO with LANG-ENV.
The detection takes into account the coding system priorities for the
language environment LANG-ENV."
(let ((coding-priority (get-language-info lang-env 'coding-priority)))
(if coding-priority
(detect-coding-with-priority
from to
(mapcar (function (lambda (x)
(cons (coding-system-get x 'coding-category) x)))
coding-priority))
(detect-coding-region from to))))
(provide 'mule-util)
;;; mule-util.el ends here
|