Mercurial > hg > xemacs-beta
annotate src/hash.h @ 4857:34ff4dd7397d
Add ChangeLog entries for previous changes to tests dir
-------------------- ChangeLog entries follow: --------------------
tests/ChangeLog addition:
2010-01-14 Ben Wing <ben@xemacs.org>
* automated/base64-tests.el (bt-base64-encode-string):
* automated/base64-tests.el (bt-base64-decode-string):
* automated/base64-tests.el (for):
* automated/byte-compiler-tests.el:
* automated/byte-compiler-tests.el (before-and-after-compile-equal):
* automated/case-tests.el:
* automated/case-tests.el (downcase-string):
* automated/case-tests.el (insert):
* automated/case-tests.el (featurep):
* automated/case-tests.el (let):
* automated/case-tests.el (boundp):
* automated/ccl-tests.el (ccl-test-normal-expr):
* automated/ccl-tests.el (ccl-test-map-instructions):
* automated/ccl-tests.el (ccl-test-suites):
* automated/database-tests.el (delete-database-files):
* automated/extent-tests.el (let):
* automated/extent-tests.el (insert):
* automated/extent-tests.el (props):
* automated/hash-table-tests.el (test):
* automated/hash-table-tests.el (for):
* automated/hash-table-tests.el (ht):
* automated/hash-table-tests.el (iterations):
* automated/hash-table-tests.el (h1):
* automated/hash-table-tests.el (make-hash-table):
* automated/hash-table-tests.el (sxhash):
* automated/lisp-tests.el:
* automated/lisp-tests.el (setq):
* automated/lisp-tests.el (test-setq):
* automated/lisp-tests.el (my-vector):
* automated/lisp-tests.el (nconc):
* automated/lisp-tests.el (x):
* automated/lisp-tests.el (y):
* automated/lisp-tests.el (butlast):
* automated/lisp-tests.el (+):
* automated/lisp-tests.el (featurep):
* automated/lisp-tests.el (-):
* automated/lisp-tests.el (six):
* automated/lisp-tests.el (three):
* automated/lisp-tests.el (1):
* automated/lisp-tests.el (one):
* automated/lisp-tests.el (two):
* automated/lisp-tests.el (0):
* automated/lisp-tests.el (five):
* automated/lisp-tests.el (logxor):
* automated/lisp-tests.el (test1):
* automated/lisp-tests.el (division-test):
* automated/lisp-tests.el (for):
* automated/lisp-tests.el (check-function-argcounts):
* automated/lisp-tests.el (type-of):
* automated/lisp-tests.el (mapcar):
* automated/lisp-tests.el (z):
* automated/lisp-tests.el (mapvector):
* automated/lisp-tests.el (mapconcat):
* automated/lisp-tests.el ([1 2 3]):
* automated/lisp-tests.el (#*010):
* automated/lisp-tests.el (test-harness-risk-infloops):
* automated/lisp-tests.el (erase-buffer):
* automated/lisp-tests.el (sym):
* automated/lisp-tests.el (subseq):
* automated/lisp-tests.el (length):
* automated/lisp-tests.el (102):
* automated/lisp-tests.el (read):
* automated/lisp-tests.el (new-char):
* automated/lisp-tests.el (new-load-file-name):
* automated/lisp-tests.el (cl-floor):
* automated/lisp-tests.el (foo):
* automated/lisp-tests.el (string-variable):
* automated/md5-tests.el (lambda):
* automated/md5-tests.el (large-string):
* automated/md5-tests.el (mapcar):
* automated/md5-tests.el (insert):
* automated/mule-tests.el (test-chars):
* automated/mule-tests.el (existing-file-name):
* automated/mule-tests.el (featurep):
* automated/query-coding-tests.el (featurep):
* automated/regexp-tests.el:
* automated/regexp-tests.el (insert):
* automated/regexp-tests.el (Assert):
* automated/regexp-tests.el (string-match):
* automated/regexp-tests.el (featurep):
* automated/regexp-tests.el (text):
* automated/regexp-tests.el (text1):
* automated/regexp-tests.el ("aáa"):
* automated/symbol-tests.el:
* automated/symbol-tests.el (name):
* automated/symbol-tests.el (check-weak-list-unique):
* automated/symbol-tests.el (string):
* automated/symbol-tests.el (list):
* automated/symbol-tests.el (foo):
* automated/symbol-tests.el (read):
* automated/symbol-tests.el (eval):
* automated/symbol-tests.el (fresh-keyword-name):
* automated/symbol-tests.el (set):
* automated/symbol-tests.el (print-gensym):
* automated/symbol-tests.el (mysym):
* automated/syntax-tests.el (test-forward-word):
* automated/syntax-tests.el (test-backward-word):
* automated/syntax-tests.el (test-syntax-table):
* automated/syntax-tests.el (with-syntax-table):
* automated/syntax-tests.el (Skip-Test-Unless):
* automated/syntax-tests.el (with):
* automated/tag-tests.el (testfile):
* automated/test-harness.el:
* automated/test-harness.el (test-harness-from-buffer):
* automated/weak-tests.el (w):
* automated/weak-tests.el (p):
* automated/weak-tests.el (a):
Create Assert-eq, Assert-equal, etc. These are equivalent to
(Assert (eq ...)) etc. but display both the actual value and the
expected value of the comparison. Use them throughout the test
suite.
* automated/test-harness.el (Assert):
Clean up code and doc string of macro Assert.
| author | Ben Wing <ben@xemacs.org> |
|---|---|
| date | Thu, 14 Jan 2010 02:34:47 -0600 |
| parents | de9952d2ed18 |
| children | 308d34e9f07d |
| rev | line source |
|---|---|
| 1292 | 1 /* Copyright (C) 2003 Ben Wing. |
| 2 This file is part of XEmacs. | |
| 428 | 3 |
| 4 XEmacs is free software; you can redistribute it and/or modify it | |
| 5 under the terms of the GNU General Public License as published by the | |
| 6 Free Software Foundation; either version 2, or (at your option) any | |
| 7 later version. | |
| 8 | |
| 9 XEmacs is distributed in the hope that it will be useful, but WITHOUT | |
| 10 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
| 11 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
| 12 for more details. | |
| 13 | |
| 14 You should have received a copy of the GNU General Public License | |
| 15 along with XEmacs; see the file COPYING. If not, write to | |
| 16 the Free Software Foundation, Inc., 59 Temple Place - Suite 330, | |
| 17 Boston, MA 02111-1307, USA. */ | |
| 18 | |
| 19 /* Synched up with: Not in FSF. */ | |
| 20 | |
| 440 | 21 #ifndef INCLUDED_hash_h_ |
| 22 #define INCLUDED_hash_h_ | |
| 428 | 23 |
| 24 typedef struct | |
| 25 { | |
| 442 | 26 const void *key; |
| 428 | 27 void *contents; |
| 28 } hentry; | |
| 29 | |
| 442 | 30 typedef int (*hash_table_test_function) (const void *, const void *); |
| 665 | 31 typedef Hashcode (*hash_table_hash_function) (const void *); |
| 428 | 32 |
| 33 struct hash_table | |
| 34 { | |
| 35 hentry *harray; | |
| 36 long zero_set; | |
| 37 void *zero_entry; | |
| 665 | 38 Elemcount size; /* size of the hasharray */ |
| 39 Elemcount fullness; /* number of entries in the hash table */ | |
| 428 | 40 hash_table_hash_function hash_function; |
| 41 hash_table_test_function test_function; | |
| 42 }; | |
| 43 | |
| 44 /* SIZE is the number of initial entries. The hash table will be grown | |
| 45 automatically if the number of entries approaches the size */ | |
| 665 | 46 struct hash_table *make_hash_table (Elemcount size); |
| 428 | 47 |
| 2515 | 48 struct hash_table *make_string_hash_table (Elemcount size); |
| 49 | |
| 826 | 50 struct hash_table *make_general_hash_table (Elemcount size, |
| 51 hash_table_hash_function | |
| 52 hash_function, | |
| 53 hash_table_test_function | |
| 54 test_function); | |
| 428 | 55 |
| 56 /* Clear HASH-TABLE. A freshly created hash table is already cleared up. */ | |
| 57 void clrhash (struct hash_table *hash_table); | |
| 58 | |
| 59 /* Free HASH-TABLE and its substructures */ | |
| 60 void free_hash_table (struct hash_table *hash_table); | |
| 61 | |
| 62 /* Returns a hentry whose key is 0 if the entry does not exist in HASH-TABLE */ | |
| 442 | 63 const void *gethash (const void *key, struct hash_table *hash_table, |
| 64 const void **ret_value); | |
| 428 | 65 |
| 66 /* KEY should be different from 0 */ | |
| 442 | 67 void puthash (const void *key, void *contents, struct hash_table *hash_table); |
| 428 | 68 |
| 69 /* delete the entry with key KEY */ | |
| 442 | 70 void remhash (const void *key, struct hash_table *hash_table); |
| 428 | 71 |
| 442 | 72 typedef int (*maphash_function) (const void* key, void* contents, void* arg); |
| 428 | 73 |
| 442 | 74 typedef int (*remhash_predicate) (const void* key, const void* contents, |
| 428 | 75 void* arg); |
| 76 | |
| 77 /* Call MF (key, contents, arg) for every entry in HASH-TABLE */ | |
| 78 void maphash (maphash_function mf, struct hash_table *hash_table, void* arg); | |
| 79 | |
| 80 /* Delete all objects from HASH-TABLE satisfying PREDICATE */ | |
| 81 void map_remhash (remhash_predicate predicate, | |
| 82 struct hash_table *hash_table, void *arg); | |
| 83 | |
| 1292 | 84 /* Grow the table if it has less than BREATHING_ROOM elements that can be |
| 85 added before a resize will be triggered. After the grow, the table can | |
| 86 hold at least BREATHING_ROOM elements (and probably a lot more) before | |
| 87 needing resizing again. */ | |
| 88 void pregrow_hash_table_if_necessary (struct hash_table *hash_table, | |
| 89 Elemcount breathing_room); | |
| 440 | 90 #endif /* INCLUDED_hash_h_ */ |