Commit | Line | Data |
---|---|---|
4ed46869 | 1 | /* GNU Emacs routines to deal with category tables. |
95df8112 | 2 | |
ab422c4d | 3 | Copyright (C) 1998, 2001-2013 Free Software Foundation, Inc. |
95df8112 GM |
4 | Copyright (C) 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, |
5 | 2005, 2006, 2007, 2008, 2009, 2010, 2011 | |
6 | National Institute of Advanced Industrial Science and Technology (AIST) | |
7 | Registration Number H14PRO021 | |
8 | Copyright (C) 2003 | |
9 | National Institute of Advanced Industrial Science and Technology (AIST) | |
10 | Registration Number H13PRO009 | |
4ed46869 KH |
11 | |
12 | This file is part of GNU Emacs. | |
13 | ||
9ec0b715 | 14 | GNU Emacs is free software: you can redistribute it and/or modify |
4ed46869 | 15 | it under the terms of the GNU General Public License as published by |
9ec0b715 GM |
16 | the Free Software Foundation, either version 3 of the License, or |
17 | (at your option) any later version. | |
4ed46869 KH |
18 | |
19 | GNU Emacs is distributed in the hope that it will be useful, | |
20 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
21 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
22 | GNU General Public License for more details. | |
23 | ||
24 | You should have received a copy of the GNU General Public License | |
9ec0b715 | 25 | along with GNU Emacs. If not, see <http://www.gnu.org/licenses/>. */ |
4ed46869 KH |
26 | |
27 | ||
28 | /* Here we handle three objects: category, category set, and category | |
29 | table. Read comments in the file category.h to understand them. */ | |
30 | ||
31 | #include <config.h> | |
f162bcc3 | 32 | |
4ed46869 | 33 | #include "lisp.h" |
ea012abd | 34 | #include "character.h" |
e5560ff7 | 35 | #include "buffer.h" |
4ed46869 KH |
36 | #include "charset.h" |
37 | #include "category.h" | |
e35f6ff7 | 38 | #include "keymap.h" |
4ed46869 | 39 | |
39eb03f1 | 40 | /* This setter is used only in this file, so it can be private. */ |
b0ab8123 | 41 | static void |
39eb03f1 PE |
42 | bset_category_table (struct buffer *b, Lisp_Object val) |
43 | { | |
44 | b->INTERNAL_FIELD (category_table) = val; | |
45 | } | |
46 | ||
4ed46869 KH |
47 | /* The version number of the latest category table. Each category |
48 | table has a unique version number. It is assigned a new number | |
49 | also when it is modified. When a regular expression is compiled | |
50 | into the struct re_pattern_buffer, the version number of the | |
51 | category table (of the current buffer) at that moment is also | |
52 | embedded in the structure. | |
53 | ||
54 | For the moment, we are not using this feature. */ | |
55 | static int category_table_version; | |
56 | ||
955cbe7b | 57 | static Lisp_Object Qcategory_table, Qcategoryp, Qcategorysetp, Qcategory_table_p; |
4ed46869 | 58 | |
d85b608f PE |
59 | /* Make CATEGORY_SET includes (if VAL is t) or excludes (if VAL is |
60 | nil) CATEGORY. */ | |
61 | #define SET_CATEGORY_SET(category_set, category, val) \ | |
62 | set_category_set (category_set, category, val) | |
63 | static void set_category_set (Lisp_Object, Lisp_Object, Lisp_Object); | |
4ed46869 KH |
64 | \f |
65 | /* Category set staff. */ | |
66 | ||
f57e2426 | 67 | static Lisp_Object hash_get_category_set (Lisp_Object, Lisp_Object); |
cd486875 KH |
68 | |
69 | static Lisp_Object | |
971de7fb | 70 | hash_get_category_set (Lisp_Object table, Lisp_Object category_set) |
cd486875 | 71 | { |
cd486875 | 72 | struct Lisp_Hash_Table *h; |
d3411f89 | 73 | ptrdiff_t i; |
0de4bb68 | 74 | EMACS_UINT hash; |
cd486875 KH |
75 | |
76 | if (NILP (XCHAR_TABLE (table)->extras[1])) | |
34dabdb7 | 77 | set_char_table_extras |
a098c930 | 78 | (table, 1, |
b7432bb2 | 79 | make_hash_table (hashtest_equal, make_number (DEFAULT_HASH_SIZE), |
a098c930 DA |
80 | make_float (DEFAULT_REHASH_SIZE), |
81 | make_float (DEFAULT_REHASH_THRESHOLD), | |
b7432bb2 | 82 | Qnil)); |
cd486875 KH |
83 | h = XHASH_TABLE (XCHAR_TABLE (table)->extras[1]); |
84 | i = hash_lookup (h, category_set, &hash); | |
85 | if (i >= 0) | |
86 | return HASH_KEY (h, i); | |
87 | hash_put (h, category_set, Qnil, hash); | |
88 | return category_set; | |
89 | } | |
90 | ||
91 | ||
4ed46869 | 92 | DEFUN ("make-category-set", Fmake_category_set, Smake_category_set, 1, 1, 0, |
fdb82f93 PJ |
93 | doc: /* Return a newly created category-set which contains CATEGORIES. |
94 | CATEGORIES is a string of category mnemonics. | |
95 | The value is a bool-vector which has t at the indices corresponding to | |
96 | those categories. */) | |
5842a27b | 97 | (Lisp_Object categories) |
4ed46869 KH |
98 | { |
99 | Lisp_Object val; | |
100 | int len; | |
101 | ||
b7826503 | 102 | CHECK_STRING (categories); |
4ed46869 KH |
103 | val = MAKE_CATEGORY_SET; |
104 | ||
115afec3 | 105 | if (STRING_MULTIBYTE (categories)) |
95030461 | 106 | error ("Multibyte string in `make-category-set'"); |
115afec3 | 107 | |
d5db4077 | 108 | len = SCHARS (categories); |
4ed46869 KH |
109 | while (--len >= 0) |
110 | { | |
15c60737 | 111 | Lisp_Object category; |
4ed46869 | 112 | |
d5db4077 | 113 | XSETFASTINT (category, SREF (categories, len)); |
b7826503 | 114 | CHECK_CATEGORY (category); |
4ed46869 KH |
115 | SET_CATEGORY_SET (val, category, Qt); |
116 | } | |
117 | return val; | |
118 | } | |
119 | ||
120 | \f | |
121 | /* Category staff. */ | |
122 | ||
d85b608f | 123 | static Lisp_Object check_category_table (Lisp_Object table); |
4ed46869 KH |
124 | |
125 | DEFUN ("define-category", Fdefine_category, Sdefine_category, 2, 3, 0, | |
839966f3 KH |
126 | doc: /* Define CATEGORY as a category which is described by DOCSTRING. |
127 | CATEGORY should be an ASCII printing character in the range ` ' to `~'. | |
f6d2f045 KH |
128 | DOCSTRING is the documentation string of the category. The first line |
129 | should be a terse text (preferably less than 16 characters), | |
130 | and the rest lines should be the full description. | |
fdb82f93 | 131 | The category is defined only in category table TABLE, which defaults to |
839966f3 | 132 | the current buffer's category table. */) |
5842a27b | 133 | (Lisp_Object category, Lisp_Object docstring, Lisp_Object table) |
4ed46869 | 134 | { |
b7826503 PJ |
135 | CHECK_CATEGORY (category); |
136 | CHECK_STRING (docstring); | |
4ed46869 KH |
137 | table = check_category_table (table); |
138 | ||
139 | if (!NILP (CATEGORY_DOCSTRING (table, XFASTINT (category)))) | |
5fdb398c | 140 | error ("Category `%c' is already defined", (int) XFASTINT (category)); |
905a9ed3 DN |
141 | if (!NILP (Vpurify_flag)) |
142 | docstring = Fpurecopy (docstring); | |
f1a95992 | 143 | SET_CATEGORY_DOCSTRING (table, XFASTINT (category), docstring); |
4ed46869 KH |
144 | |
145 | return Qnil; | |
146 | } | |
147 | ||
148 | DEFUN ("category-docstring", Fcategory_docstring, Scategory_docstring, 1, 2, 0, | |
839966f3 KH |
149 | doc: /* Return the documentation string of CATEGORY, as defined in TABLE. |
150 | TABLE should be a category table and defaults to the current buffer's | |
151 | category table. */) | |
5842a27b | 152 | (Lisp_Object category, Lisp_Object table) |
4ed46869 | 153 | { |
b7826503 | 154 | CHECK_CATEGORY (category); |
4ed46869 KH |
155 | table = check_category_table (table); |
156 | ||
157 | return CATEGORY_DOCSTRING (table, XFASTINT (category)); | |
158 | } | |
159 | ||
160 | DEFUN ("get-unused-category", Fget_unused_category, Sget_unused_category, | |
161 | 0, 1, 0, | |
839966f3 | 162 | doc: /* Return a category which is not yet defined in TABLE. |
0b6694a5 | 163 | If no category remains available, return nil. |
839966f3 | 164 | The optional argument TABLE specifies which category table to modify; |
0b6694a5 | 165 | it defaults to the current buffer's category table. */) |
5842a27b | 166 | (Lisp_Object table) |
4ed46869 KH |
167 | { |
168 | int i; | |
4ed46869 KH |
169 | |
170 | table = check_category_table (table); | |
171 | ||
172 | for (i = ' '; i <= '~'; i++) | |
173 | if (NILP (CATEGORY_DOCSTRING (table, i))) | |
174 | return make_number (i); | |
175 | ||
176 | return Qnil; | |
177 | } | |
178 | ||
179 | \f | |
180 | /* Category-table staff. */ | |
181 | ||
182 | DEFUN ("category-table-p", Fcategory_table_p, Scategory_table_p, 1, 1, 0, | |
fdb82f93 | 183 | doc: /* Return t if ARG is a category table. */) |
5842a27b | 184 | (Lisp_Object arg) |
4ed46869 KH |
185 | { |
186 | if (CHAR_TABLE_P (arg) | |
ed8ec86d | 187 | && EQ (XCHAR_TABLE (arg)->purpose, Qcategory_table)) |
4ed46869 KH |
188 | return Qt; |
189 | return Qnil; | |
190 | } | |
191 | ||
192 | /* If TABLE is nil, return the current category table. If TABLE is | |
193 | not nil, check the validity of TABLE as a category table. If | |
194 | valid, return TABLE itself, but if not valid, signal an error of | |
195 | wrong-type-argument. */ | |
196 | ||
d85b608f | 197 | static Lisp_Object |
971de7fb | 198 | check_category_table (Lisp_Object table) |
4ed46869 | 199 | { |
4ed46869 | 200 | if (NILP (table)) |
4b4deea2 | 201 | return BVAR (current_buffer, category_table); |
88674269 | 202 | CHECK_TYPE (!NILP (Fcategory_table_p (table)), Qcategory_table_p, table); |
4ed46869 | 203 | return table; |
177c0ea7 | 204 | } |
4ed46869 KH |
205 | |
206 | DEFUN ("category-table", Fcategory_table, Scategory_table, 0, 0, 0, | |
fdb82f93 PJ |
207 | doc: /* Return the current category table. |
208 | This is the one specified by the current buffer. */) | |
5842a27b | 209 | (void) |
4ed46869 | 210 | { |
4b4deea2 | 211 | return BVAR (current_buffer, category_table); |
4ed46869 KH |
212 | } |
213 | ||
214 | DEFUN ("standard-category-table", Fstandard_category_table, | |
215 | Sstandard_category_table, 0, 0, 0, | |
fdb82f93 PJ |
216 | doc: /* Return the standard category table. |
217 | This is the one used for new buffers. */) | |
5842a27b | 218 | (void) |
4ed46869 KH |
219 | { |
220 | return Vstandard_category_table; | |
221 | } | |
222 | ||
ea012abd KH |
223 | |
224 | static void | |
971de7fb | 225 | copy_category_entry (Lisp_Object table, Lisp_Object c, Lisp_Object val) |
ea012abd | 226 | { |
f4b670ef | 227 | val = Fcopy_sequence (val); |
8f924df7 KH |
228 | if (CONSP (c)) |
229 | char_table_set_range (table, XINT (XCAR (c)), XINT (XCDR (c)), val); | |
f4b670ef | 230 | else |
8f924df7 | 231 | char_table_set (table, XINT (c), val); |
ea012abd KH |
232 | } |
233 | ||
4ed46869 KH |
234 | /* Return a copy of category table TABLE. We can't simply use the |
235 | function copy-sequence because no contents should be shared between | |
ed8ec86d | 236 | the original and the copy. This function is called recursively by |
9da95d53 | 237 | binding TABLE to a sub char table. */ |
4ed46869 | 238 | |
9f3b5e69 | 239 | static Lisp_Object |
971de7fb | 240 | copy_category_table (Lisp_Object table) |
4ed46869 | 241 | { |
ea012abd | 242 | table = copy_char_table (table); |
4ed46869 | 243 | |
ea012abd | 244 | if (! NILP (XCHAR_TABLE (table)->defalt)) |
742af32f PE |
245 | set_char_table_defalt (table, |
246 | Fcopy_sequence (XCHAR_TABLE (table)->defalt)); | |
34dabdb7 | 247 | set_char_table_extras |
a098c930 | 248 | (table, 0, Fcopy_sequence (XCHAR_TABLE (table)->extras[0])); |
8f924df7 | 249 | map_char_table (copy_category_entry, Qnil, table, table); |
ed8ec86d | 250 | |
4ed46869 KH |
251 | return table; |
252 | } | |
253 | ||
254 | DEFUN ("copy-category-table", Fcopy_category_table, Scopy_category_table, | |
255 | 0, 1, 0, | |
fdb82f93 PJ |
256 | doc: /* Construct a new category table and return it. |
257 | It is a copy of the TABLE, which defaults to the standard category table. */) | |
5842a27b | 258 | (Lisp_Object table) |
4ed46869 KH |
259 | { |
260 | if (!NILP (table)) | |
261 | check_category_table (table); | |
262 | else | |
263 | table = Vstandard_category_table; | |
264 | ||
9da95d53 | 265 | return copy_category_table (table); |
4ed46869 KH |
266 | } |
267 | ||
70414a3d KH |
268 | DEFUN ("make-category-table", Fmake_category_table, Smake_category_table, |
269 | 0, 0, 0, | |
fdb82f93 | 270 | doc: /* Construct a new and empty category table and return it. */) |
5842a27b | 271 | (void) |
70414a3d KH |
272 | { |
273 | Lisp_Object val; | |
ea012abd | 274 | int i; |
70414a3d KH |
275 | |
276 | val = Fmake_char_table (Qcategory_table, Qnil); | |
742af32f | 277 | set_char_table_defalt (val, MAKE_CATEGORY_SET); |
8f924df7 | 278 | for (i = 0; i < (1 << CHARTAB_SIZE_BITS_0); i++) |
34dabdb7 | 279 | set_char_table_contents (val, i, MAKE_CATEGORY_SET); |
70414a3d KH |
280 | Fset_char_table_extra_slot (val, make_number (0), |
281 | Fmake_vector (make_number (95), Qnil)); | |
282 | return val; | |
283 | } | |
284 | ||
4ed46869 | 285 | DEFUN ("set-category-table", Fset_category_table, Sset_category_table, 1, 1, 0, |
839966f3 KH |
286 | doc: /* Specify TABLE as the category table for the current buffer. |
287 | Return TABLE. */) | |
5842a27b | 288 | (Lisp_Object table) |
4ed46869 | 289 | { |
6f598a6d | 290 | int idx; |
4ed46869 | 291 | table = check_category_table (table); |
39eb03f1 | 292 | bset_category_table (current_buffer, table); |
4ed46869 | 293 | /* Indicate that this buffer now has a specified category table. */ |
f6cd0527 GM |
294 | idx = PER_BUFFER_VAR_IDX (category_table); |
295 | SET_PER_BUFFER_VALUE_P (current_buffer, idx, 1); | |
4ed46869 KH |
296 | return table; |
297 | } | |
298 | ||
299 | \f | |
ea012abd | 300 | Lisp_Object |
971de7fb | 301 | char_category_set (int c) |
ea012abd | 302 | { |
4b4deea2 | 303 | return CHAR_TABLE_REF (BVAR (current_buffer, category_table), c); |
ea012abd KH |
304 | } |
305 | ||
4ed46869 | 306 | DEFUN ("char-category-set", Fchar_category_set, Schar_category_set, 1, 1, 0, |
a2c2f196 JB |
307 | doc: /* Return the category set of CHAR. |
308 | usage: (char-category-set CHAR) */) | |
5842a27b | 309 | (Lisp_Object ch) |
4ed46869 | 310 | { |
d311d28c | 311 | CHECK_CHARACTER (ch); |
4ed46869 KH |
312 | return CATEGORY_SET (XFASTINT (ch)); |
313 | } | |
314 | ||
315 | DEFUN ("category-set-mnemonics", Fcategory_set_mnemonics, | |
316 | Scategory_set_mnemonics, 1, 1, 0, | |
fdb82f93 PJ |
317 | doc: /* Return a string containing mnemonics of the categories in CATEGORY-SET. |
318 | CATEGORY-SET is a bool-vector, and the categories \"in\" it are those | |
839966f3 | 319 | that are indexes where t occurs in the bool-vector. |
fdb82f93 | 320 | The return value is a string containing those same categories. */) |
5842a27b | 321 | (Lisp_Object category_set) |
4ed46869 KH |
322 | { |
323 | int i, j; | |
324 | char str[96]; | |
325 | ||
b7826503 | 326 | CHECK_CATEGORY_SET (category_set); |
4ed46869 KH |
327 | |
328 | j = 0; | |
329 | for (i = 32; i < 127; i++) | |
330 | if (CATEGORY_MEMBER (i, category_set)) | |
331 | str[j++] = i; | |
332 | str[j] = '\0'; | |
333 | ||
334 | return build_string (str); | |
335 | } | |
336 | ||
d85b608f | 337 | static void |
971de7fb | 338 | set_category_set (Lisp_Object category_set, Lisp_Object category, Lisp_Object val) |
4ed46869 KH |
339 | { |
340 | do { | |
341 | int idx = XINT (category) / 8; | |
342 | unsigned char bits = 1 << (XINT (category) % 8); | |
343 | ||
344 | if (NILP (val)) | |
345 | XCATEGORY_SET (category_set)->data[idx] &= ~bits; | |
346 | else | |
347 | XCATEGORY_SET (category_set)->data[idx] |= bits; | |
348 | } while (0); | |
349 | } | |
350 | ||
351 | DEFUN ("modify-category-entry", Fmodify_category_entry, | |
352 | Smodify_category_entry, 2, 4, 0, | |
fdb82f93 PJ |
353 | doc: /* Modify the category set of CHARACTER by adding CATEGORY to it. |
354 | The category is changed only for table TABLE, which defaults to | |
8f7e5042 DL |
355 | the current buffer's category table. |
356 | CHARACTER can be either a single character or a cons representing the | |
357 | lower and upper ends of an inclusive character range to modify. | |
fdb82f93 PJ |
358 | If optional fourth argument RESET is non-nil, |
359 | then delete CATEGORY from the category set instead of adding it. */) | |
5842a27b | 360 | (Lisp_Object character, Lisp_Object category, Lisp_Object table, Lisp_Object reset) |
4ed46869 | 361 | { |
4ed46869 | 362 | Lisp_Object set_value; /* Actual value to be set in category sets. */ |
8f7e5042 | 363 | Lisp_Object category_set; |
ea012abd KH |
364 | int start, end; |
365 | int from, to; | |
4ed46869 | 366 | |
ea012abd | 367 | if (INTEGERP (character)) |
4ed46869 | 368 | { |
ea012abd KH |
369 | CHECK_CHARACTER (character); |
370 | start = end = XFASTINT (character); | |
4ed46869 | 371 | } |
ea012abd | 372 | else |
4ed46869 | 373 | { |
ea012abd | 374 | CHECK_CONS (character); |
8f924df7 KH |
375 | CHECK_CHARACTER_CAR (character); |
376 | CHECK_CHARACTER_CDR (character); | |
ea012abd KH |
377 | start = XFASTINT (XCAR (character)); |
378 | end = XFASTINT (XCDR (character)); | |
4ed46869 | 379 | } |
4ed46869 | 380 | |
b7826503 | 381 | CHECK_CATEGORY (category); |
4ed46869 | 382 | table = check_category_table (table); |
4ed46869 | 383 | |
4ed46869 | 384 | if (NILP (CATEGORY_DOCSTRING (table, XFASTINT (category)))) |
5fdb398c | 385 | error ("Undefined category: %c", (int) XFASTINT (category)); |
4ed46869 | 386 | |
4ed46869 | 387 | set_value = NILP (reset) ? Qt : Qnil; |
4ed46869 | 388 | |
ea012abd | 389 | while (start <= end) |
4ed46869 | 390 | { |
cd486875 | 391 | from = start, to = end; |
ea012abd | 392 | category_set = char_table_ref_and_range (table, start, &from, &to); |
0b261f59 | 393 | if (CATEGORY_MEMBER (XFASTINT (category), category_set) != NILP (reset)) |
ea012abd | 394 | { |
d8887a31 KH |
395 | category_set = Fcopy_sequence (category_set); |
396 | SET_CATEGORY_SET (category_set, category, set_value); | |
cd486875 KH |
397 | category_set = hash_get_category_set (table, category_set); |
398 | char_table_set_range (table, start, to, category_set); | |
ea012abd | 399 | } |
ea012abd | 400 | start = to + 1; |
4ed46869 | 401 | } |
4ed46869 KH |
402 | |
403 | return Qnil; | |
404 | } | |
405 | \f | |
17c05d74 PE |
406 | /* Return true if there is a word boundary between two word-constituent |
407 | characters C1 and C2 if they appear in this order. | |
4ed46869 KH |
408 | Use the macro WORD_BOUNDARY_P instead of calling this function |
409 | directly. */ | |
410 | ||
17c05d74 | 411 | bool |
971de7fb | 412 | word_boundary_p (int c1, int c2) |
4ed46869 KH |
413 | { |
414 | Lisp_Object category_set1, category_set2; | |
415 | Lisp_Object tail; | |
17c05d74 | 416 | bool default_result; |
4ed46869 | 417 | |
714b2198 KH |
418 | if (EQ (CHAR_TABLE_REF (Vchar_script_table, c1), |
419 | CHAR_TABLE_REF (Vchar_script_table, c2))) | |
4ed46869 KH |
420 | { |
421 | tail = Vword_separating_categories; | |
422 | default_result = 0; | |
423 | } | |
424 | else | |
425 | { | |
426 | tail = Vword_combining_categories; | |
427 | default_result = 1; | |
428 | } | |
429 | ||
430 | category_set1 = CATEGORY_SET (c1); | |
431 | if (NILP (category_set1)) | |
432 | return default_result; | |
433 | category_set2 = CATEGORY_SET (c2); | |
434 | if (NILP (category_set2)) | |
435 | return default_result; | |
436 | ||
03699b14 | 437 | for (; CONSP (tail); tail = XCDR (tail)) |
4ed46869 | 438 | { |
03699b14 | 439 | Lisp_Object elt = XCAR (tail); |
4ed46869 KH |
440 | |
441 | if (CONSP (elt) | |
714b2198 KH |
442 | && (NILP (XCAR (elt)) |
443 | || (CATEGORYP (XCAR (elt)) | |
8a605fe8 KH |
444 | && CATEGORY_MEMBER (XFASTINT (XCAR (elt)), category_set1) |
445 | && ! CATEGORY_MEMBER (XFASTINT (XCAR (elt)), category_set2))) | |
714b2198 KH |
446 | && (NILP (XCDR (elt)) |
447 | || (CATEGORYP (XCDR (elt)) | |
8a605fe8 | 448 | && ! CATEGORY_MEMBER (XFASTINT (XCDR (elt)), category_set1) |
714b2198 | 449 | && CATEGORY_MEMBER (XFASTINT (XCDR (elt)), category_set2)))) |
4ed46869 KH |
450 | return !default_result; |
451 | } | |
452 | return default_result; | |
453 | } | |
454 | ||
455 | \f | |
dfcf069d | 456 | void |
971de7fb | 457 | init_category_once (void) |
4ed46869 KH |
458 | { |
459 | /* This has to be done here, before we call Fmake_char_table. */ | |
cd3520a4 | 460 | DEFSYM (Qcategory_table, "category-table"); |
4ed46869 KH |
461 | Fput (Qcategory_table, Qchar_table_extra_slots, make_number (2)); |
462 | ||
463 | Vstandard_category_table = Fmake_char_table (Qcategory_table, Qnil); | |
177c0ea7 | 464 | /* Set a category set which contains nothing to the default. */ |
742af32f | 465 | set_char_table_defalt (Vstandard_category_table, MAKE_CATEGORY_SET); |
9da95d53 | 466 | Fset_char_table_extra_slot (Vstandard_category_table, make_number (0), |
4ed46869 KH |
467 | Fmake_vector (make_number (95), Qnil)); |
468 | } | |
469 | ||
dfcf069d | 470 | void |
971de7fb | 471 | syms_of_category (void) |
4ed46869 | 472 | { |
cd3520a4 JB |
473 | DEFSYM (Qcategoryp, "categoryp"); |
474 | DEFSYM (Qcategorysetp, "categorysetp"); | |
475 | DEFSYM (Qcategory_table_p, "category-table-p"); | |
4ed46869 | 476 | |
29208e82 | 477 | DEFVAR_LISP ("word-combining-categories", Vword_combining_categories, |
fdb82f93 PJ |
478 | doc: /* List of pair (cons) of categories to determine word boundary. |
479 | ||
480 | Emacs treats a sequence of word constituent characters as a single | |
e0f24100 | 481 | word (i.e. finds no word boundary between them) only if they belong to |
714b2198 | 482 | the same script. But, exceptions are allowed in the following cases. |
fdb82f93 | 483 | |
714b2198 | 484 | \(1) The case that characters are in different scripts is controlled |
fdb82f93 PJ |
485 | by the variable `word-combining-categories'. |
486 | ||
714b2198 | 487 | Emacs finds no word boundary between characters of different scripts |
fdb82f93 PJ |
488 | if they have categories matching some element of this list. |
489 | ||
490 | More precisely, if an element of this list is a cons of category CAT1 | |
491 | and CAT2, and a multibyte character C1 which has CAT1 is followed by | |
492 | C2 which has CAT2, there's no word boundary between C1 and C2. | |
493 | ||
714b2198 KH |
494 | For instance, to tell that Han characters followed by Hiragana |
495 | characters can form a single word, the element `(?C . ?H)' should be | |
496 | in this list. | |
fdb82f93 | 497 | |
714b2198 | 498 | \(2) The case that character are in the same script is controlled by |
fdb82f93 PJ |
499 | the variable `word-separating-categories'. |
500 | ||
ecdcaa09 | 501 | Emacs finds a word boundary between characters of the same script |
fdb82f93 PJ |
502 | if they have categories matching some element of this list. |
503 | ||
504 | More precisely, if an element of this list is a cons of category CAT1 | |
8a605fe8 KH |
505 | and CAT2, and a multibyte character C1 which has CAT1 but not CAT2 is |
506 | followed by C2 which has CAT2 but not CAT1, there's a word boundary | |
507 | between C1 and C2. | |
fdb82f93 | 508 | |
714b2198 KH |
509 | For instance, to tell that there's a word boundary between Hiragana |
510 | and Katakana (both are in the same script `kana'), | |
511 | the element `(?H . ?K) should be in this list. */); | |
4ed46869 KH |
512 | |
513 | Vword_combining_categories = Qnil; | |
514 | ||
29208e82 | 515 | DEFVAR_LISP ("word-separating-categories", Vword_separating_categories, |
fdb82f93 PJ |
516 | doc: /* List of pair (cons) of categories to determine word boundary. |
517 | See the documentation of the variable `word-combining-categories'. */); | |
4ed46869 KH |
518 | |
519 | Vword_separating_categories = Qnil; | |
520 | ||
521 | defsubr (&Smake_category_set); | |
522 | defsubr (&Sdefine_category); | |
523 | defsubr (&Scategory_docstring); | |
524 | defsubr (&Sget_unused_category); | |
525 | defsubr (&Scategory_table_p); | |
526 | defsubr (&Scategory_table); | |
527 | defsubr (&Sstandard_category_table); | |
528 | defsubr (&Scopy_category_table); | |
70414a3d | 529 | defsubr (&Smake_category_table); |
4ed46869 KH |
530 | defsubr (&Sset_category_table); |
531 | defsubr (&Schar_category_set); | |
532 | defsubr (&Scategory_set_mnemonics); | |
533 | defsubr (&Smodify_category_entry); | |
4ed46869 KH |
534 | |
535 | category_table_version = 0; | |
536 | } |