Mercurial > emacs
view src/casetab.c @ 1310:8db103d11270
* keyboard.c (echo_char, read_char): Apply EVENT_HEAD without first
testing for EVENT_HAS_PARAMETERS; EVENT_HEAD works properly on
all sorts of events now.
(read_key_sequence): Use the new accessors to decide in which window
an event occurred.
* keyboard.c (Qevent_unmodified): Replaced by...
(Qevent_symbol_elements): New property.
(syms_of_keyboard): initialize and staticpro the latter, not the
former.
* keyboard.c (readable_events): This doesn't need to scan and
discard mouse release events anymore; it just uses
EVENT_QUEUES_EMPTY.
(kbd_buffer_get_event): No need to skip past mouse release events.
* keyboard.c (button_down_location): New variable, which
stores the location at which each button was pressed, so we
can build a complete drag event when the button is released.
(make_lispy_event): When a button is pressed, record its
location in button_down_location, and turn it into a `down'
event. When a button is released, compare its release
location with its press location, and decide whether to call
it a `click' or `drag' event.
Change mouse movement events to be arranged like click events.
(format_modifiers): Note that the click modifier has no
written representation.
(modifier_names, modifer_symbols): New variables, used to
create the Qevent_symbol_elements property.
(modify_event_symbol): Change the format of the modified
symbol cache; there are too many modifier bits now to use a
vector indexed by a modifier mask. Use an assoc-list instead.
Document the format of the cache.
Put the Qevent_symbol_elements property on each new symbol,
instead of a Qevent_unmodified property.
(symbols_of_keyboard): Put Qevent_symbol_elements properties on
the symbols specified in head_table, not Qevent_unmodifed properties.
Initialize and staticpro modifier_symbols, and staticpro the
window elements of button_down_location.
author | Jim Blandy <jimb@redhat.com> |
---|---|
date | Fri, 02 Oct 1992 23:55:39 +0000 |
parents | 3165b2697c78 |
children | 5fe52748a72c |
line wrap: on
line source
/* GNU Emacs routines to deal with case tables. Copyright (C) 1987 Free Software Foundation, Inc. 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 1, 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, 675 Mass Ave, Cambridge, MA 02139, USA. */ /* Written by Howard Gayle. See chartab.c for details. */ #include "config.h" #include "lisp.h" #include "buffer.h" Lisp_Object Qcase_table_p; Lisp_Object Vascii_downcase_table, Vascii_upcase_table; Lisp_Object Vascii_canon_table, Vascii_eqv_table; void compute_trt_inverse (); DEFUN ("case-table-p", Fcase_table_p, Scase_table_p, 1, 1, 0, "Return t iff ARG is a case table.\n\ See `set-case-table' for more information on these data structures.") (table) Lisp_Object table; { Lisp_Object down, up, canon, eqv; down = Fcar_safe (table); up = Fcar_safe (Fcdr_safe (table)); canon = Fcar_safe (Fcdr_safe (Fcdr_safe (table))); eqv = Fcar_safe (Fcdr_safe (Fcdr_safe (Fcdr_safe (table)))); #define STRING256_P(obj) \ (XTYPE (obj) == Lisp_String && XSTRING (obj)->size == 256) return (STRING256_P (down) && (NILP (up) || STRING256_P (up)) && ((NILP (canon) && NILP (eqv)) || (STRING256_P (canon) && STRING256_P (eqv))) ? Qt : Qnil); } static Lisp_Object check_case_table (obj) Lisp_Object obj; { register Lisp_Object tem; while (tem = Fcase_table_p (obj), NILP (tem)) obj = wrong_type_argument (Qcase_table_p, obj, 0); return (obj); } DEFUN ("current-case-table", Fcurrent_case_table, Scurrent_case_table, 0, 0, 0, "Return the case table of the current buffer.") () { Lisp_Object down, up, canon, eqv; down = current_buffer->downcase_table; up = current_buffer->upcase_table; canon = current_buffer->case_canon_table; eqv = current_buffer->case_eqv_table; return Fcons (down, Fcons (up, Fcons (canon, Fcons (eqv, Qnil)))); } DEFUN ("standard-case-table", Fstandard_case_table, Sstandard_case_table, 0, 0, 0, "Return the standard case table.\n\ This is the one used for new buffers.") () { return Fcons (Vascii_downcase_table, Fcons (Vascii_upcase_table, Fcons (Vascii_canon_table, Fcons (Vascii_eqv_table, Qnil)))); } DEFUN ("set-case-table", Fset_case_table, Sset_case_table, 1, 1, 0, "Select a new case table for the current buffer.\n\ A case table is a list (DOWNCASE UPCASE CANONICALIZE EQUIVALENCES)\n\ where each element is either nil or a string of length 256.\n\ DOWNCASE maps each character to its lower-case equivalent.\n\ UPCASE maps each character to its upper-case equivalent;\n\ if lower and upper case characters are in 1-1 correspondence,\n\ you may use nil and the upcase table will be deduced from DOWNCASE.\n\ CANONICALIZE maps each character to a canonical equivalent;\n\ any two characters that are related by case-conversion have the same\n\ canonical equivalent character.\n\ EQUIVALENCES is a map that cyclicly permutes each equivalence class\n\ (of characters with the same canonical equivalent).\n\ Both CANONICALIZE and EQUIVALENCES may be nil, in which case\n\ both are deduced from DOWNCASE and UPCASE.") (table) Lisp_Object table; { set_case_table (table, 0); } DEFUN ("set-standard-case-table", Fset_standard_case_table, Sset_standard_case_table, 1, 1, 0, "Select a new standard case table for new buffers.\n\ See `set-case-table' for more info on case tables.") (table) Lisp_Object table; { set_case_table (table, 1); } set_case_table (table, standard) Lisp_Object table; int standard; { Lisp_Object down, up, canon, eqv; check_case_table (table); down = Fcar_safe (table); up = Fcar_safe (Fcdr_safe (table)); canon = Fcar_safe (Fcdr_safe (Fcdr_safe (table))); eqv = Fcar_safe (Fcdr_safe (Fcdr_safe (Fcdr_safe (table)))); if (NILP (up)) { up = Fmake_string (make_number (256), make_number (0)); compute_trt_inverse (XSTRING (down)->data, XSTRING (up)->data); } if (NILP (canon)) { register int i; unsigned char *upvec = XSTRING (up)->data; unsigned char *downvec = XSTRING (down)->data; canon = Fmake_string (make_number (256), make_number (0)); eqv = Fmake_string (make_number (256), make_number (0)); /* Set up the CANON vector; for each character, this sequence of upcasing and downcasing ought to get the "preferred" lowercase equivalent. */ for (i = 0; i < 256; i++) XSTRING (canon)->data[i] = downvec[upvec[downvec[i]]]; compute_trt_inverse (XSTRING (canon)->data, XSTRING (eqv)->data); } if (standard) { Vascii_downcase_table = down; Vascii_upcase_table = up; Vascii_canon_table = canon; Vascii_eqv_table = eqv; } else { current_buffer->downcase_table = down; current_buffer->upcase_table = up; current_buffer->case_canon_table = canon; current_buffer->case_eqv_table = eqv; } return table; } /* Given a translate table TRT, store the inverse mapping into INVERSE. Since TRT is not one-to-one, INVERSE is not a simple mapping. Instead, it divides the space of characters into equivalence classes. All characters in a given class form one circular list, chained through the elements of INVERSE. */ void compute_trt_inverse (trt, inverse) register unsigned char *trt; register unsigned char *inverse; { register int i = 0400; register unsigned char c, q; while (i--) inverse[i] = i; i = 0400; while (i--) { if ((q = trt[i]) != (unsigned char) i) { c = inverse[q]; inverse[q] = i; inverse[i] = c; } } } init_casetab_once () { register int i; Lisp_Object tem; tem = Fmake_string (make_number (256), make_number (0)); Vascii_downcase_table = tem; Vascii_canon_table = tem; for (i = 0; i < 256; i++) XSTRING (tem)->data[i] = (i >= 'A' && i <= 'Z') ? i + 040 : i; tem = Fmake_string (make_number (256), make_number (0)); Vascii_upcase_table = tem; Vascii_eqv_table = tem; for (i = 0; i < 256; i++) XSTRING (tem)->data[i] = ((i >= 'A' && i <= 'Z') ? i + ('a' - 'A') : ((i >= 'a' && i <= 'z') ? i + ('A' - 'a') : i)); } syms_of_casetab () { Qcase_table_p = intern ("case-table-p"); staticpro (&Qcase_table_p); staticpro (&Vascii_downcase_table); staticpro (&Vascii_upcase_table); staticpro (&Vascii_canon_table); staticpro (&Vascii_eqv_table); defsubr (&Scase_table_p); defsubr (&Scurrent_case_table); defsubr (&Sstandard_case_table); defsubr (&Sset_case_table); defsubr (&Sset_standard_case_table); #if 0 DEFVAR_LISP ("ascii-downcase-table", &Vascii_downcase_table, "String mapping ASCII characters to lowercase equivalents."); DEFVAR_LISP ("ascii-upcase-table", &Vascii_upcase_table, "String mapping ASCII characters to uppercase equivalents."); #endif }