Mercurial > hg > xemacs-beta
annotate lisp/hash-table.el @ 5015:d95c102a96d3
cleanups for specifier font stages, from ben-unicode-internal (preparation for eliminating shadowed warnings)
-------------------- ChangeLog entries follow: --------------------
src/ChangeLog addition:
2010-02-08 Ben Wing <ben@xemacs.org>
* faces.c:
* faces.c (face_property_matching_instance):
* faces.c (ensure_face_cachel_contains_charset):
* faces.h (FACE_FONT):
* lisp.h:
* lisp.h (enum font_specifier_matchspec_stages):
* objects-msw.c:
* objects-msw.c (mswindows_font_spec_matches_charset):
* objects-msw.c (mswindows_find_charset_font):
* objects-tty.c:
* objects-tty.c (tty_font_spec_matches_charset):
* objects-tty.c (tty_find_charset_font):
* objects-xlike-inc.c:
* objects-xlike-inc.c (XFUN):
* objects-xlike-inc.c (xft_find_charset_font):
* objects.c:
* objects.c (font_instantiate):
* objects.c (FROB):
* specifier.c:
* specifier.c (charset_matches_specifier_tag_set_p):
* specifier.c (call_charset_predicate):
* specifier.c (define_specifier_tag):
* specifier.c (Fdefine_specifier_tag):
* specifier.c (setup_charset_initial_specifier_tags):
* specifier.c (specifier_instance_from_inst_list):
* specifier.c (FROB):
* specifier.c (vars_of_specifier):
* specifier.h:
Rename the specifier-font-matching stages in preparation for
eliminating shadowed warnings, some other related fixes from
ben-unicode-internal.
1. Rename raw enums:
initial -> STAGE_INITIAL
final -> STAGE_FINAL
impossible -> NUM_MATCHSPEC_STAGES
2. Move `enum font_specifier_matchspec_stages' from
specifier.h to lisp.h.
3. Whitespace changes to match coding standards.
4. Eliminate unused second argument STAGE in charset predicates
that don't use it -- the code that calls the charset predicates
is now smart enough to supply the right number of arguments
automatically.
5. Add some long(ish) comments and authorial notices, esp. in
objects.c.
6. In specifier.c, change Vcharset_tag_lists from a vector over
leading bytes to a hash table over charsets. This change is
unnecessary currently but doesn't hurt and will be required
when we merge in Unicode-internal.
7. In specifier.c, extract out the code that calls charset predicates
into a function call_charset_predicate().
| author | Ben Wing <ben@xemacs.org> |
|---|---|
| date | Mon, 08 Feb 2010 16:51:25 -0600 |
| parents | 7039e6323819 |
| children | 2def0d83a5e3 |
| rev | line source |
|---|---|
| 502 | 1 ;;; hash-table.el --- hash-table utility functions |
| 2 | |
| 3 ;; Copyright (C) 2000 Ben Wing. | |
| 4 | |
| 5 ;; Author: Ben Wing | |
| 6 ;; Maintainer: XEmacs Development Team | |
| 7 ;; Keywords: internal, dumped | |
| 8 | |
| 9 ;; This file is part of XEmacs. | |
| 10 | |
| 11 ;; XEmacs is free software; you can redistribute it and/or modify it | |
| 12 ;; under the terms of the GNU General Public License as published by | |
| 13 ;; the Free Software Foundation; either version 2, or (at your option) | |
| 14 ;; any later version. | |
| 15 | |
| 16 ;; XEmacs is distributed in the hope that it will be useful, but | |
| 17 ;; WITHOUT ANY WARRANTY; without even the implied warranty of | |
| 18 ;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
| 19 ;; General Public License for more details. | |
| 20 | |
| 21 ;; You should have received a copy of the GNU General Public License | |
| 22 ;; along with XEmacs; see the file COPYING. If not, write to the | |
| 23 ;; Free Software Foundation, 59 Temple Place - Suite 330, | |
| 24 ;; Boston, MA 02111-1307, USA. | |
| 25 | |
| 26 ;;; Synched up with: Not in FSF. | |
| 27 | |
| 28 ;;; Authorship: | |
| 29 | |
| 30 ;; Created July 2000 by Ben Wing. | |
| 31 | |
| 32 ;;; Commentary: | |
| 33 | |
| 34 ;; This file is dumped with XEmacs. | |
| 35 | |
| 36 ;;; Code: | |
| 37 | |
| 38 (defun hash-table-key-list (hash-table) | |
| 39 "Return a list of all keys in HASH-TABLE." | |
| 40 (let (lis) | |
| 41 (maphash #'(lambda (key val) | |
| 42 (push key lis)) | |
| 43 hash-table) | |
| 44 (nreverse lis))) | |
| 45 | |
| 46 (defun hash-table-value-list (hash-table) | |
| 47 "Return a list of all values in HASH-TABLE." | |
| 48 (let (lis) | |
| 49 (maphash #'(lambda (key val) | |
| 50 (push val lis)) | |
| 51 hash-table) | |
| 52 (nreverse lis))) | |
| 53 | |
| 54 (defun hash-table-key-value-alist (hash-table) | |
| 55 "Return an alist of (KEY . VALUE) for all keys and values in HASH-TABLE." | |
| 56 (let (lis) | |
| 57 (maphash #'(lambda (key val) | |
| 58 (push (cons key val) lis)) | |
| 59 hash-table) | |
| 60 (nreverse lis))) | |
| 61 | |
| 62 (defun hash-table-key-value-plist (hash-table) | |
| 63 "Return a plist for all keys and values in HASH-TABLE. | |
| 64 A plist is a simple list containing alternating keys and values." | |
| 65 (let (lis) | |
| 66 (maphash #'(lambda (key val) | |
| 67 (push key lis) | |
| 68 (push val lis)) | |
| 69 hash-table) | |
| 70 (nreverse lis))) |