/* GNU Emacs routines to deal with category tables.
- Ver.1.0
-
- Copyright (C) 1995 Free Software Foundation, Inc.
- Copyright (C) 1995 Electrotechnical Laboratory, JAPAN.
+ Copyright (C) 1995, 1997 Electrotechnical Laboratory, JAPAN.
+ Licensed to the Free Software Foundation.
This file is part of GNU Emacs.
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, 675 Mass Ave, Cambridge, MA 02139, USA. */
+the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
+Boston, MA 02111-1307, USA. */
/* Here we handle three objects: category, category set, and category
DEFUN ("make-category-set", Fmake_category_set, Smake_category_set, 1, 1, 0,
"Return a newly created category-set which contains CATEGORIES.\n\
-CATEGORIES is a string of category mnemonics.")
+CATEGORIES is a string of category mnemonics.\n\
+The value is a bool-vector which has t at the indices corresponding to\n\
+those categories.")
(categories)
Lisp_Object categories;
{
CHECK_STRING (categories, 0);
val = MAKE_CATEGORY_SET;
+ if (STRING_MULTIBYTE (categories))
+ error ("Multibyte string in make-category-set");
+
len = XSTRING (categories)->size;
while (--len >= 0)
{
- Lisp_Object category = make_number (XSTRING (categories)->data[len]);
+ Lisp_Object category;
+ XSETFASTINT (category, XSTRING (categories)->data[len]);
CHECK_CATEGORY (category, 0);
SET_CATEGORY_SET (val, category, Qt);
}
DEFUN ("define-category", Fdefine_category, Sdefine_category, 2, 3, 0,
"Define CHAR as a category which is described by DOCSTRING.\n\
-CHAR should be a visible letter of ` ' thru `~'.\n\
+CHAR should be an ASCII printing character in the range ` ' to `~'.\n\
DOCSTRING is a documentation string of the category.\n\
The category is defined only in category table TABLE, which defaults to\n\
the current buffer's category table.")
}
DEFUN ("category-docstring", Fcategory_docstring, Scategory_docstring, 1, 2, 0,
- "Return a documentation string of CATEGORY.\n\
-Optional second arg specifies CATEGORY-TABLE,\n\
- which defaults to the current buffer's category table.")
+ "Return the documentation string of CATEGORY, as defined in CATEGORY-TABLE.")
(category, table)
Lisp_Object category, table;
{
DEFUN ("get-unused-category", Fget_unused_category, Sget_unused_category,
0, 1, 0,
- "Return a category which is not yet defined.\n\
-If total number of categories has reached the limit (95), return nil.\n\
-Optional argument specifies CATEGORY-TABLE,\n\
- which defaults to the current buffer's category table.")
+ "Return a category which is not yet defined in CATEGORY-TABLE.\n\
+If no category remains available, return nil.\n\
+The optional argument CATEGORY-TABLE specifies which category table\n\
+to modify; it defaults to the current buffer's category table.")
(table)
Lisp_Object table;
{
Lisp_Object arg;
{
if (CHAR_TABLE_P (arg)
- && EQ (XCHAR_TABLE (arg)->purpose, Qcategory_table)
- && CHAR_TABLE_EXTRA_SLOTS (XCHAR_TABLE (arg)) == 2)
+ && EQ (XCHAR_TABLE (arg)->purpose, Qcategory_table))
return Qt;
return Qnil;
}
/* Return a copy of category table TABLE. We can't simply use the
function copy-sequence because no contents should be shared between
- the original and the copy.
-
- If TOP is 1, we at first copy the tree structure of the table. */
+ the original and the copy. This function is called recursively by
+ binding TABLE to a sub char table. */
Lisp_Object
-copy_category_table (table, top)
+copy_category_table (table)
Lisp_Object table;
{
- int i;
-
- if (top)
- table = Fcopy_sequence (table);
- else if (!NILP (XCHAR_TABLE (table)->defalt))
- XCHAR_TABLE (table)->defalt
- = Fcopy_sequence (XCHAR_TABLE (table)->defalt);
+ Lisp_Object tmp;
+ int i, to;
- for (i = 0; i < CHAR_TABLE_ORDINARY_SLOTS; i++)
+ if (!NILP (XCHAR_TABLE (table)->top))
{
- Lisp_Object idx = make_number (i);
- Lisp_Object val = Faref (table, idx);
-
- if (NILP (val)) /* Do nothing because we can share nil. */
- ;
- else if (CATEGORY_SET_P (val))
- Faset (table, idx, Fcopy_sequence (val));
- else if (CHAR_TABLE_P (val))
- Faset (table, idx, copy_category_table (val, 0));
- else /* Invalid contents. */
- Faset (table, idx, Qnil);
+ /* TABLE is a top level char table.
+ At first, make a copy of tree structure of the table. */
+ table = Fcopy_sequence (table);
+
+ /* Then, copy elements for single byte characters one by one. */
+ for (i = 0; i < CHAR_TABLE_SINGLE_BYTE_SLOTS; i++)
+ if (!NILP (tmp = XCHAR_TABLE (table)->contents[i]))
+ XCHAR_TABLE (table)->contents[i] = Fcopy_sequence (tmp);
+ to = CHAR_TABLE_ORDINARY_SLOTS;
+
+ /* Also copy the first (and sole) extra slot. It is a vector
+ containing docstring of each category. */
+ Fset_char_table_extra_slot
+ (table, make_number (0),
+ Fcopy_sequence (Fchar_table_extra_slot (table, make_number (0))));
}
+ else
+ {
+ i = 32;
+ to = SUB_CHAR_TABLE_ORDINARY_SLOTS;
+ }
+
+ /* If the table has non-nil default value, copy it. */
+ if (!NILP (tmp = XCHAR_TABLE (table)->defalt))
+ XCHAR_TABLE (table)->defalt = Fcopy_sequence (tmp);
+
+ /* At last, copy the remaining elements while paying attention to a
+ sub char table. */
+ for (; i < to; i++)
+ if (!NILP (tmp = XCHAR_TABLE (table)->contents[i]))
+ XCHAR_TABLE (table)->contents[i]
+ = (SUB_CHAR_TABLE_P (tmp)
+ ? copy_category_table (tmp) : Fcopy_sequence (tmp));
return table;
}
else
table = Vstandard_category_table;
- return copy_category_table (table, 1);
+ return copy_category_table (table);
+}
+
+DEFUN ("make-category-table", Fmake_category_table, Smake_category_table,
+ 0, 0, 0,
+ "Construct a new and empty category table and return it.")
+ ()
+{
+ Lisp_Object val;
+
+ val = Fmake_char_table (Qcategory_table, Qnil);
+ XCHAR_TABLE (val)->defalt = MAKE_CATEGORY_SET;
+ Fset_char_table_extra_slot (val, make_number (0),
+ Fmake_vector (make_number (95), Qnil));
+ return val;
}
DEFUN ("set-category-table", Fset_category_table, Sset_category_table, 1, 1, 0,
- "Select a new category table for the current buffer.\n\
-One argument, a category table.")
+ "Specify TABLE as the category table for the current buffer.")
(table)
Lisp_Object table;
{
+ int idx;
table = check_category_table (table);
current_buffer->category_table = table;
/* Indicate that this buffer now has a specified category table. */
- current_buffer->local_var_flags
- |= XFASTINT (buffer_local_flags.category_table);
+ idx = PER_BUFFER_VAR_IDX (category_table);
+ SET_PER_BUFFER_VALUE_P (current_buffer, idx, 1);
return table;
}
\f
DEFUN ("char-category-set", Fchar_category_set, Schar_category_set, 1, 1, 0,
- "Return a category set of CHAR.")
+ "Return the category set of CHAR.")
(ch)
Lisp_Object ch;
{
DEFUN ("category-set-mnemonics", Fcategory_set_mnemonics,
Scategory_set_mnemonics, 1, 1, 0,
- "Return a string of mnemonics of all categories in CATEGORY-SET.")
+ "Return a string containing mnemonics of the categories in CATEGORY-SET.\n\
+CATEGORY-SET is a bool-vector, and the categories \"in\" it are those\n\
+that are indexes where t occurs the bool-vector.\n\
+The return value is a string containing those same categories.")
(category_set)
Lisp_Object category_set;
{
return build_string (str);
}
-/* Modify all category sets stored under category table TABLE so that
+/* Modify all category sets stored under sub char-table TABLE so that
they contain (SET_VALUE is t) or don't contain (SET_VALUE is nil)
CATEGORY. */
Lisp_Object val;
int i;
- if (NILP (XCHAR_TABLE (table)->defalt))
- {
- val = MAKE_CATEGORY_SET;
- SET_CATEGORY_SET (val, category, set_value);
- XCHAR_TABLE (table)->defalt = val;
- }
+ val = XCHAR_TABLE (table)->defalt;
+ if (!CATEGORY_SET_P (val))
+ val = MAKE_CATEGORY_SET;
+ SET_CATEGORY_SET (val, category, set_value);
+ XCHAR_TABLE (table)->defalt = val;
- for (i = 32; i < CHAR_TABLE_ORDINARY_SLOTS; i++)
+ for (i = 32; i < SUB_CHAR_TABLE_ORDINARY_SLOTS; i++)
{
val = XCHAR_TABLE (table)->contents[i];
if (CATEGORY_SET_P (val))
SET_CATEGORY_SET (val, category, set_value);
- else if (CHAR_TABLE_P (val))
+ else if (SUB_CHAR_TABLE_P (val))
modify_lower_category_set (val, category, set_value);
}
}
DEFUN ("modify-category-entry", Fmodify_category_entry,
Smodify_category_entry, 2, 4, 0,
- "Modify the category set of CHAR by adding CATEGORY to it.\n\
+ "Modify the category set of CHARACTER by adding CATEGORY to it.\n\
The category is changed only for table TABLE, which defaults to\n\
the current buffer's category table.\n\
-If optional forth argument RESET is non NIL,\n\
- CATEGORY is deleted from the category set instead of being added.")
- (ch, category, table, reset)
- Lisp_Object ch, category, table, reset;
+If optional fourth argument RESET is non-nil,\n\
+ then delete CATEGORY from the category set instead of adding it.")
+ (character, category, table, reset)
+ Lisp_Object character, category, table, reset;
{
int c, charset, c1, c2;
Lisp_Object set_value; /* Actual value to be set in category sets. */
Lisp_Object val, category_set;
- CHECK_NUMBER (ch, 0);
- c = XINT (ch);
+ CHECK_NUMBER (character, 0);
+ c = XINT (character);
CHECK_CATEGORY (category, 1);
table = check_category_table (table);
set_value = NILP (reset) ? Qt : Qnil;
- if (SINGLE_BYTE_CHAR_P (c))
+ if (c < CHAR_TABLE_SINGLE_BYTE_SLOTS)
{
val = XCHAR_TABLE (table)->contents[c];
if (!CATEGORY_SET_P (val))
return Qnil;
}
- if (COMPOSITE_CHAR_P (c))
- c = cmpchar_component (c, 0);
- SPLIT_NON_ASCII_CHAR (c, charset, c1, c2);
+ SPLIT_CHAR (c, charset, c1, c2);
/* The top level table. */
- val = XCHAR_TABLE (table)->contents[charset];
- if (NILP (val))
+ val = XCHAR_TABLE (table)->contents[charset + 128];
+ if (CATEGORY_SET_P (val))
+ category_set = val;
+ else if (!SUB_CHAR_TABLE_P (val))
{
- category_set = MAKE_CATEGORY_SET;
- XCHAR_TABLE (table)->contents[charset] = category_set;
+ category_set = val = MAKE_CATEGORY_SET;
+ XCHAR_TABLE (table)->contents[charset + 128] = category_set;
}
- else if (CATEGORY_SET_P (val))
- category_set = val;
- if (!c1)
+ if (c1 <= 0)
{
/* Only a charset is specified. */
- if (CHAR_TABLE_P (val))
- /* All characters in CHARSET should be the same as for CATEGORY. */
+ if (SUB_CHAR_TABLE_P (val))
+ /* All characters in CHARSET should be the same as for having
+ CATEGORY or not. */
modify_lower_category_set (val, category, set_value);
else
SET_CATEGORY_SET (category_set, category, set_value);
}
/* The second level table. */
- if (!CHAR_TABLE_P (val))
+ if (!SUB_CHAR_TABLE_P (val))
{
- val = Fmake_char_table (Qnil, Qnil);
- XCHAR_TABLE (table)->contents[charset] = val;
+ val = make_sub_char_table (Qnil);
+ XCHAR_TABLE (table)->contents[charset + 128] = val;
/* We must set default category set of CHARSET in `defalt' slot. */
XCHAR_TABLE (val)->defalt = category_set;
}
table = val;
val = XCHAR_TABLE (table)->contents[c1];
- if (NILP (val))
+ if (CATEGORY_SET_P (val))
+ category_set = val;
+ else if (!SUB_CHAR_TABLE_P (val))
{
- category_set = Fcopy_sequence (XCHAR_TABLE (table)->defalt);
+ category_set = val = Fcopy_sequence (XCHAR_TABLE (table)->defalt);
XCHAR_TABLE (table)->contents[c1] = category_set;
}
- else if (CATEGORY_SET_P (val))
- category_set = val;
- if (!c2)
+ if (c2 <= 0)
{
- if (CHAR_TABLE_P (val))
+ if (SUB_CHAR_TABLE_P (val))
/* All characters in C1 group of CHARSET should be the same as
for CATEGORY. */
modify_lower_category_set (val, category, set_value);
}
/* The third (bottom) level table. */
- if (!CHAR_TABLE_P (val))
+ if (!SUB_CHAR_TABLE_P (val))
{
- val = Fmake_char_table (Qnil, Qnil);
+ val = make_sub_char_table (Qnil);
XCHAR_TABLE (table)->contents[c1] = val;
/* We must set default category set of CHARSET and C1 in
`defalt' slot. */
table = val;
val = XCHAR_TABLE (table)->contents[c2];
- if (NILP (val))
+ if (CATEGORY_SET_P (val))
+ category_set = val;
+ else if (!SUB_CHAR_TABLE_P (val))
{
category_set = Fcopy_sequence (XCHAR_TABLE (table)->defalt);
XCHAR_TABLE (table)->contents[c2] = category_set;
}
- else if (CATEGORY_SET_P (val))
- category_set = val;
else
/* This should never happen. */
error ("Invalid category table");
return;
}
+ if (CHAR_TABLE_P (value))
+ {
+ insert_string ("deeper char-table ...\n");
+ return;
+ }
+
if (!CATEGORY_SET_P (value))
{
insert_string ("invalid\n");
}
mnemonics = Fcategory_set_mnemonics (value);
- insert_from_string (mnemonics, 0, XSTRING (mnemonics)->size, 0);
+ insert_from_string (mnemonics, 0, 0, XSTRING (mnemonics)->size,
+ STRING_BYTES (XSTRING (mnemonics)), 0);
insert_string ("\n");
return;
}
{
struct buffer *old = current_buffer;
set_buffer_internal (XBUFFER (Vstandard_output));
- describe_vector (vector, Qnil, describe_category, 0, Qnil, Qnil);
+ describe_vector (vector, Qnil, describe_category, 0, Qnil, Qnil,
+ (int *)0, 0);
{
int i;
Lisp_Object docs = XCHAR_TABLE (vector)->extras[0];
insert_char (i + 32);
insert (": ", 2);
- insert_from_string (elt, 0, XSTRING (elt)->size, 0);
+ insert_from_string (elt, 0, 0, XSTRING (elt)->size,
+ STRING_BYTES (XSTRING (elt)), 0);
insert ("\n", 1);
}
}
{
vector = XCHAR_TABLE (vector)->parent;
insert_string ("\nThe parent category table is:");
- describe_vector (vector, Qnil, describe_category, 0, Qnil, Qnil);
+ describe_vector (vector, Qnil, describe_category, 0, Qnil, Qnil,
+ (int *) 0, 0);
}
call0 (intern ("help-mode"));
return Qnil;
}
-DEFUN ("describe-category", Fdescribe_category, Sdescribe_category, 0, 0, "",
- "Describe the category specifications in the category table.\n\
+DEFUN ("describe-categories", Fdescribe_categories, Sdescribe_categories, 0, 0, "",
+ "Describe the category specifications in the current category table.\n\
The descriptions are inserted in a buffer, which is then displayed.")
()
{
if (NILP (category_set2))
return default_result;
- for (; CONSP (tail); tail = XCONS (tail)->cdr)
+ for (; CONSP (tail); tail = XCDR (tail))
{
- Lisp_Object elt = XCONS(tail)->car;
+ Lisp_Object elt = XCAR (tail);
if (CONSP (elt)
- && CATEGORYP (XCONS (elt)->car)
- && CATEGORYP (XCONS (elt)->cdr)
- && CATEGORY_MEMBER (XCONS (elt)->car, category_set1)
- && CATEGORY_MEMBER (XCONS (elt)->cdr, category_set2))
+ && CATEGORYP (XCAR (elt))
+ && CATEGORYP (XCDR (elt))
+ && CATEGORY_MEMBER (XFASTINT (XCAR (elt)), category_set1)
+ && CATEGORY_MEMBER (XFASTINT (XCDR (elt)), category_set2))
return !default_result;
}
return default_result;
}
\f
+void
init_category_once ()
{
/* This has to be done here, before we call Fmake_char_table. */
Vstandard_category_table = Fmake_char_table (Qcategory_table, Qnil);
/* Set a category set which contains nothing to the default. */
XCHAR_TABLE (Vstandard_category_table)->defalt = MAKE_CATEGORY_SET;
- Fset_char_table_extra_slot (Vstandard_category_table, 0,
+ Fset_char_table_extra_slot (Vstandard_category_table, make_number (0),
Fmake_vector (make_number (95), Qnil));
}
+void
syms_of_category ()
{
Qcategoryp = intern ("categoryp");
word (i.e. finds no word boundary between them) iff they belongs to\n\
the same charset. But, exceptions are allowed in the following cases.\n\
\n\
-(1) The case that characters are in different charsets is controlled\n\
+\(1) The case that characters are in different charsets is controlled\n\
by the variable `word-combining-categories'.\n\
\n\
Emacs finds no word boundary between characters of different charsets\n\
form a single word, the element `(?l . ?l)' should be in this list\n\
because both characters have the category `l' (Latin characters).\n\
\n\
-(2) The case that character are in the same charset is controlled by\n\
+\(2) The case that character are in the same charset is controlled by\n\
the variable `word-separating-categories'.\n\
\n\
Emacs find a word boundary between characters of the same charset\n\
defsubr (&Scategory_table);
defsubr (&Sstandard_category_table);
defsubr (&Scopy_category_table);
+ defsubr (&Smake_category_table);
defsubr (&Sset_category_table);
defsubr (&Schar_category_set);
defsubr (&Scategory_set_mnemonics);
defsubr (&Smodify_category_entry);
- defsubr (&Sdescribe_category);
+ defsubr (&Sdescribe_categories);
category_table_version = 0;
}
HCoop / bpt / emacs.git / blobdiff