Mercurial > hg > xemacs-beta
comparison src/elhash.c @ 4906:6ef8256a020a
implement equalp in C, fix case-folding, add equal() method for keymaps
-------------------- ChangeLog entries follow: --------------------
lisp/ChangeLog addition:
2010-02-01 Ben Wing <ben@xemacs.org>
* cl-extra.el:
* cl-extra.el (cl-string-vector-equalp): Removed.
* cl-extra.el (cl-bit-vector-vector-equalp): Removed.
* cl-extra.el (cl-vector-array-equalp): Removed.
* cl-extra.el (cl-hash-table-contents-equalp): Removed.
* cl-extra.el (equalp): Removed.
* cl-extra.el (cl-mapcar-many):
Comment out the whole `equalp' implementation for the moment;
remove once we're sure the C implementation works.
* cl-macs.el:
* cl-macs.el (equalp):
Simplify the compiler-macro for `equalp' -- once it's in C,
we don't need to try so hard to expand it.
src/ChangeLog addition:
2010-02-01 Ben Wing <ben@xemacs.org>
* abbrev.c (abbrev_match_mapper):
* buffer.h (CANON_TABLE_OF):
* buffer.h:
* editfns.c (Fchar_equal):
* minibuf.c (scmp_1):
* text.c (qxestrcasecmp_i18n):
* text.c (qxestrncasecmp_i18n):
* text.c (qxetextcasecmp):
* text.c (qxetextcasecmp_matching):
Create new macro CANONCASE that converts to a canonical mapping
and use it to do caseless comparisons instead of DOWNCASE.
* alloc.c:
* alloc.c (cons_equal):
* alloc.c (vector_equal):
* alloc.c (string_equal):
* bytecode.c (compiled_function_equal):
* chartab.c (char_table_entry_equal):
* chartab.c (char_table_equal):
* data.c (weak_list_equal):
* data.c (weak_box_equal):
* data.c (ephemeron_equal):
* device-msw.c (equal_devmode):
* elhash.c (hash_table_equal):
* events.c (event_equal):
* extents.c (properties_equal):
* extents.c (extent_equal):
* faces.c:
* faces.c (face_equal):
* faces.c (face_hash):
* floatfns.c (float_equal):
* fns.c:
* fns.c (bit_vector_equal):
* fns.c (plists_differ):
* fns.c (Fplists_eq):
* fns.c (Fplists_equal):
* fns.c (Flax_plists_eq):
* fns.c (Flax_plists_equal):
* fns.c (internal_equal):
* fns.c (internal_equalp):
* fns.c (internal_equal_0):
* fns.c (syms_of_fns):
* glyphs.c (image_instance_equal):
* glyphs.c (glyph_equal):
* glyphs.c (glyph_hash):
* gui.c (gui_item_equal):
* lisp.h:
* lrecord.h (struct lrecord_implementation):
* marker.c (marker_equal):
* number.c (bignum_equal):
* number.c (ratio_equal):
* number.c (bigfloat_equal):
* objects.c (color_instance_equal):
* objects.c (font_instance_equal):
* opaque.c (equal_opaque):
* opaque.c (equal_opaque_ptr):
* rangetab.c (range_table_equal):
* specifier.c (specifier_equal):
Add a `foldcase' param to the equal() method and use it to implement
`equalp' comparisons. Also add to plists_differ(), although we
don't currently use it here.
Rewrite internal_equalp(). Implement cross-type vector comparisons.
Don't implement our own handling of numeric promotion -- just use
the `=' primitive.
Add internal_equal_0(), which takes a `foldcase' param and calls
either internal_equal() or internal_equalp().
* buffer.h:
When given a 0 for buffer (which is the norm when functions don't
have a specific buffer available), use the current buffer's table,
not `standard-case-table'; otherwise the current settings are
ignored.
* casetab.c:
* casetab.c (set_case_table):
When handling old-style vectors of 256 in `set-case-table' don't
overwrite the existing table! Instead create a new table and
populate.
* device-msw.c (sync_printer_with_devmode):
* lisp.h:
* text.c (lisp_strcasecmp_ascii):
Rename lisp_strcasecmp to lisp_strcasecmp_ascii and use
lisp_strcasecmp_i18n for caseless comparisons in some places.
* elhash.c:
Delete unused lisp_string_hash and lisp_string_equal().
* events.h:
* keymap-buttons.h:
* keymap.h:
* keymap.c (keymap_lookup_directly):
* keymap.c (keymap_store):
* keymap.c (FROB):
* keymap.c (key_desc_list_to_event):
* keymap.c (describe_map_mapper):
* keymap.c (INCLUDE_BUTTON_ZERO):
New file keymap-buttons.h; use to handle buttons 1-26 in place of
duplicating code 26 times.
* frame-gtk.c (allocate_gtk_frame_struct):
* frame-msw.c (mswindows_init_frame_1):
Fix some comments about internal_equal() in redisplay that don't
apply any more.
* keymap-slots.h:
* keymap.c:
New file keymap-slots.h. Use it to notate the slots in a keymap
structure, similar to frameslots.h or coding-system-slots.h.
* keymap.c (MARKED_SLOT):
* keymap.c (keymap_equal):
* keymap.c (keymap_hash):
Implement.
tests/ChangeLog addition:
2010-02-01 Ben Wing <ben@xemacs.org>
* automated/case-tests.el:
* automated/case-tests.el (uni-mappings):
* automated/search-tests.el:
Delete old pristine-case-table code. Rewrite the Unicode torture
test to take into account whether overlapping mappings exist for
more than one character, and not doing the upcase/downcase
comparisons in such cases.
* automated/lisp-tests.el (foo):
* automated/lisp-tests.el (string-variable):
* automated/lisp-tests.el (featurep):
Replace Assert (equal ... with Assert-equal; same for other types
of equality. Replace some awkward equivalents of Assert-equalp
with Assert-equalp. Add lots of equalp tests.
* automated/case-tests.el:
* automated/regexp-tests.el:
* automated/search-tests.el:
Fix up the comments at the top of the files. Move rules about where
to put tests into case-tests.el.
* automated/test-harness.el:
* automated/test-harness.el (test-harness-aborted-summary-template): New.
* automated/test-harness.el (test-harness-from-buffer):
* automated/test-harness.el (batch-test-emacs):
Fix Assert-test-not. Create Assert-not-equal and variants.
Delete the doc strings from all these convenience functions to avoid
excessive repetition; instead use one copy in a comment.
author | Ben Wing <ben@xemacs.org> |
---|---|
date | Mon, 01 Feb 2010 01:02:40 -0600 |
parents | 6772ce4d982b |
children | e813cf16c015 |
comparison
equal
deleted
inserted
replaced
4903:70089046adef | 4906:6ef8256a020a |
---|---|
182 } | 182 } |
183 return primes [high]; | 183 return primes [high]; |
184 } | 184 } |
185 | 185 |
186 | 186 |
187 #if 0 /* I don't think these are needed any more. | |
188 If using the general lisp_object_equal_*() functions | |
189 causes efficiency problems, these can be resurrected. --ben */ | |
190 /* equality and hash functions for Lisp strings */ | |
191 int | |
192 lisp_string_equal (Lisp_Object str1, Lisp_Object str2) | |
193 { | |
194 /* This is wrong anyway. You can't use strcmp() on Lisp strings, | |
195 because they can contain zero characters. */ | |
196 return !strcmp ((char *) XSTRING_DATA (str1), (char *) XSTRING_DATA (str2)); | |
197 } | |
198 | |
199 static Hashcode | |
200 lisp_string_hash (Lisp_Object obj) | |
201 { | |
202 return hash_string (XSTRING_DATA (str), XSTRING_LENGTH (str)); | |
203 } | |
204 | |
205 #endif /* 0 */ | |
206 | 187 |
207 static int | 188 static int |
208 lisp_object_eql_equal (Lisp_Object obj1, Lisp_Object obj2) | 189 lisp_object_eql_equal (Lisp_Object obj1, Lisp_Object obj2) |
209 { | 190 { |
210 return EQ (obj1, obj2) || | 191 return EQ (obj1, obj2) || |
261 function, which we don't do. Doing that would require consing, and | 242 function, which we don't do. Doing that would require consing, and |
262 consing is a bad idea in `equal'. Anyway, our method should provide | 243 consing is a bad idea in `equal'. Anyway, our method should provide |
263 the same result -- if the keys are not equal according to the test | 244 the same result -- if the keys are not equal according to the test |
264 function, then Fgethash() in hash_table_equal_mapper() will fail. */ | 245 function, then Fgethash() in hash_table_equal_mapper() will fail. */ |
265 static int | 246 static int |
266 hash_table_equal (Lisp_Object hash_table1, Lisp_Object hash_table2, int depth) | 247 hash_table_equal (Lisp_Object hash_table1, Lisp_Object hash_table2, int depth, |
248 int foldcase) | |
267 { | 249 { |
268 Lisp_Hash_Table *ht1 = XHASH_TABLE (hash_table1); | 250 Lisp_Hash_Table *ht1 = XHASH_TABLE (hash_table1); |
269 Lisp_Hash_Table *ht2 = XHASH_TABLE (hash_table2); | 251 Lisp_Hash_Table *ht2 = XHASH_TABLE (hash_table2); |
270 htentry *e, *sentinel; | 252 htentry *e, *sentinel; |
271 | 253 |
280 if (!HTENTRY_CLEAR_P (e)) | 262 if (!HTENTRY_CLEAR_P (e)) |
281 /* Look up the key in the other hash table, and compare the values. */ | 263 /* Look up the key in the other hash table, and compare the values. */ |
282 { | 264 { |
283 Lisp_Object value_in_other = Fgethash (e->key, hash_table2, Qunbound); | 265 Lisp_Object value_in_other = Fgethash (e->key, hash_table2, Qunbound); |
284 if (UNBOUNDP (value_in_other) || | 266 if (UNBOUNDP (value_in_other) || |
285 !internal_equal (e->value, value_in_other, depth)) | 267 !internal_equal_0 (e->value, value_in_other, depth, foldcase)) |
286 return 0; /* Give up */ | 268 return 0; /* Give up */ |
287 } | 269 } |
288 | 270 |
289 return 1; | 271 return 1; |
290 } | 272 } |