4 Click to return to the link:index.html[uthash home page].
6 NOTE: This ChangeLog may be incomplete and/or incorrect. See the git commit log.
8 Version 2.0.2 (2017-03-02)
9 --------------------------
10 * fix segfault in HASH_ADD_INORDER etc (thanks, Yana Kireyonok!)
11 * remove spurious cast to unsigned in utstring_len (thanks, Michal Sestrienka!)
12 * add uthash_memcmp and uthash_strlen for platforms without <stdlib.h> (thanks, Pawel Veselov!)
13 * fix a C++ incompatibility in utringbuffer
15 Version 2.0.1 (2016-07-05)
16 --------------------------
17 * in-order insertion macros HASH_ADD_INORDER etc (thanks, Thilo Schulz!)
18 * by-hashvalue insertion macros HASH_ADD_BYHASHVALUE etc
19 * during key comparison, check hashvalue before doing a full memcmp
21 Version 1.9.9.1 (2014-11-18)
22 ----------------------------
23 * inclusion of experimental libut bundle with utvector in opt/
24 * use shift in Bernstein hash instead of multiply (thanks, Jimmy Zhuo!)
25 * switch ssize_t types in utarray/utstring to size_t (thanks, Hong Xu!)
26 * fix utstring pointer math on >4GB strings (thanks, Thomas Bottesch!)
27 * change FNV hash to FNV-1a varation (thanks, dwest1975!)
28 * fix bug in HASH_REPLACE_STR (thanks, Ilya Kaliman!)
30 Version 1.9.9 (2014-02-25)
31 --------------------------
32 * made HASH_ADD_STR compatible with char* or char[] (thanks, Samuel Thibault!)
33 * fixed header inclusion of sys/types.h for ssize_t (thanks, Fernando Campos!)
34 * added LL_COUNT/DL_COUNT/CDL_COUNT (thansk, Paul Praet!)
35 * added LRU cache example in `tests/lru_cache` (thanks, Oliver Lorenz!)
36 * fix LL_DELETE2 for VS2008 (thanks, Greg Davydouski!)
37 * fix missing argument in `HASH_REPLACE_STR` (thanks, Alex!)
38 * bump version number in source files to match docs (thanks, John Crow!)
39 * add `HASH_OVERHEAD` macro to get overhead size for hash table
41 Version 1.9.8 (2013-03-10)
42 --------------------------
43 * `HASH_REPLACE` now in uthash (thanks, Nick Vatamaniuc!)
44 * fixed clang warnings (thanks wynnw!)
45 * fixed `utarray_insert` when inserting past array end (thanks Rob Willett!)
46 * you can now find http://troydhanson.github.com/uthash/[uthash on GitHub]
47 * there's a https://groups.google.com/d/forum/uthash[uthash Google Group]
48 * uthash has been downloaded 29,000+ times since 2006 on SourceForge
50 Version 1.9.7 (2012-10-09)
51 --------------------------
52 * utstring now supports substring search using `utstring_find` (thanks, Joe Wei!)
53 * utlist now supports element 'prepend' and 'replace' (thanks, Zoltán Lajos Kis!)
54 * utlist element prev/next fields can now have any names (thanks, Pawel S. Veselov!)
55 * uthash cast quiets a clang warning (thanks, Roman Divacky and Baptiste Daroussin!)
56 * uthash userguide example shows how to check key uniqueness (thanks, Richard Cook!)
57 * uthash HASH_MUR compiles under MSVC++ 10 in C mode (thanks, Arun Kirthi Cherian!)
58 * `utstring_printf` now supports format checking (thanks, Donald Carr!)
60 Version 1.9.6 (2012-04-28)
61 --------------------------
62 * add utarray_prev (thanks, Ben Hiett!)
63 * add parens/casts for greater compatibility (thanks, Atis, Debasis Ganguly, and Steve McClellan!)
64 * added ifndef to uthash_malloc and related hooks (thanks, Holger Machens!)
65 * edit examples so they do not leak memory (thanks, 任晶磊!)
67 Version 1.9.5 (2011-11-16)
68 --------------------------
69 * added `utarray_renew`
70 * fixed memory leak in `uthash_clear` when using Bloom filter (thanks, Jan Hättig!)
71 * utarray now copies the UT_icd on array creation rather than storing a pointer
72 * add parentheses to `HASH_ADD` to fix preprocessing of certain arguments (thanks, Aaron Rosen!)
73 * more parenthesizations for greater macro argument flexibility
75 Version 1.9.4 (2011-06-05)
76 --------------------------
77 * uthash now supports MurmurHash v3
78 * utlist now includes concatenation macros (`LL_CONCAT` and `DL_CONCAT`)
79 * utarray now supports binary search (`utarray_find`)
80 * utstring now supports a new-or-clear-existing macro (`utstring_renew`)
81 * documented technique for a multi-level hash table
82 * clarified scope requirements for `UT_icd` in the utarray documentation
83 * fixed termination when `utstring_clear` is followed by `utstring_body`
84 * fixed utarray_inserta macro when used with complex arguments
85 * on Visual Studio define missing type `uint8_t`
86 * Debian/Ubuntu include uthash in the package `uthash-dev`.
87 * uthash has been downloaded 16,211 times.
89 Thanks to Yu Feng, Richard Cook, Dino Ciuffetti, Chris Groer, and Arun Cherian
90 for feedback and fixes in this release!
92 Version 1.9.3 (2010-10-31)
93 --------------------------
94 * fix an `ifdef` for compatibility with Intel compiler (thanks, degski!)
95 * fix `HASH_ITER` macro to satisfy C++ casting rules (thanks, Erik Bai!)
97 Version 1.9.2 (2010-10-04)
98 --------------------------
99 * new `HASH_ITER` macro for more convenient deletion-safe iteration
100 * `hashscan` can now run on FreeBSD 8.1 and later (thanks, Markus Gebert!)
101 * More parens to evaluate complex macro arguments properly (thanks, ngg!)
102 * Add sz parameter to the `uthash_free` hook for platforms that do their own memory management. Hopefully this minor API change doesn't cause too much breakage for people. (thanks, Niall Douglas!)
103 * uthash has been downloaded 12,294 times
105 Version 1.9.1 (2010-05-15)
106 --------------------------
107 * Fix a redefinition warning when using `uthash.h` and `utstring.h` together
108 * Fix a bug in `utstring_init`
109 * Added `HASH_FIND_PTR` and `HASH_ADD_PTR` (thanks, Niall Douglas!)
111 Version 1.9 (2010-03-31)
112 --------------------------
113 * uthash now supports Visual Studio 2008 and 2010 in C or C++ code!
114 * new headers link:utarray.html[utarray.h] and link:utstring.html[utstring.h]
115 are now included. These implement dynamic arrays and strings using macros
116 * link:utlist.html[utlist.h] now has deletion-safe iterators and search macros
117 * the test suite now runs under Visual Studio (thanks again degski!)
118 * special thanks for suggesting utarray and utlist features to Charalampos P.!
119 * uthash has been downloaded 9,616 times
121 Version 1.8 (2009-09-08)
122 --------------------------
123 * Added the `hashscan` utility that can report on the size and quality of
124 hash tables in a running process (Linux-only)
125 * Added Bloom filter support. This has the potential to speed up certain
126 types of programs that look up non-existant keys in sufficient numbers.
127 * Restored the MurmurHash, which can once again be used, if an additional
128 symbol is defined. This is a "safety" by which the user declares they
129 understand that `-fno-strict-aliasing` flag must be used if they are
130 using MurmurHash under gcc with optimization.
131 * Unified the bucket/table malloc hooks; now there is only one malloc hook
132 * Re-organized the manual into a main section and advanced topics section
133 * Fixed a bug in `utlist.h` where sorting a singly-linked list threw a
135 * Fixed a bug in `utlist.h` where a doubly-linked list that is sorted
136 did not maintain the special `head->prev` pointer back to the list tail.
138 Version 1.7 (2009-06-11)
139 --------------------------
140 * The MurmurHash has been removed, and Jenkin's hash is once again the default.
141 While MurmurHash performed well, it's unsafe with regard to the strict
142 aliasing rule. This results in incorrect code when compiled with optimization.
143 It's not possible to enable `-fno-strict-aliasing` from within a header file.
144 * The linked list macros in `utlist.h` now comply with the strict-aliasing
145 rule so they generate correct code under high optimization levels (O2 or O3).
146 The use of the `__typeof__` extension, which was originally a GNU extension,
147 may reduce portability to other compilers that do not support this extension.
148 This extension is used in the singly-linked list macros and the sort macros.
150 Version 1.6 (2009-05-08)
151 --------------------------
152 Special thanks to Alfred Heisner for contributing several enhancements:
154 * Support for two new hash functions:
155 - the Paul Hsieh hash function (`HASH_SFH`)
156 - Austin Appleby's MurmurHash function (`HASH_MUR`)
157 * Because of its excellent performance, MurmurHash is now the default hash function.
158 * `keystats` now has much better elapsed time accuracy under Cygwin and MinGW
159 * fixed casting in `HASH_FNV`, `HASH_SAX` and `HASH_OAT` for non-char keys
161 This release also includes:
163 * a new `HASH_CLEAR` operation clears a hash table in one step.
164 * a new `HASH_SELECT` operation inserts those elements from one hash that
165 satisfy a given condition into another hash. The selected items have
166 dual presence in both hash tables. For example a game could select the
167 visible polygons from a hash of all polygons.
168 * fixed a compile-time error which occurred if the final argument to
169 `HASH_ADD_KEYPTR` was a pointer to an array member like `&a[i]`
170 * added another test script `tests/all_funcs` which executes the test suite
171 using every supported hash function
175 * a new, separate header called link:utlist.html[utlist.h] is included which
176 provides 'linked list macros' for C structures, similar in style to the
179 Version 1.5 (2009-02-19)
180 --------------------------
181 * now thread-safe for concurrent readers
182 * use scratch variables on stack rather than in table (thanks, Petter Arvidsson!).
183 This change made HASH_FIND about 13% faster and enabled reader concurrency.
184 * made link:license.html[BSD license] terms even more permissive
185 * added link:userguide.pdf[PDF version] of User Guide
186 * added http://troydhanson.wordpress.com/feed/[update news] image:rss.png[(RSS)]
188 Version 1.4 (2008-09-23)
189 --------------------------
190 * Add `HASH_COUNT` for counting items in the hash
191 * Compatibility with C\+\+. Satisfy additional casting requirements.
192 Also in the `tests/` directory, running `make cplusplus` now compiles
193 all the test programs with the C++ compiler.
194 * Eliminate `elmt` pointer from the UT_hash_handle. Calculate elmt
195 from hash handle address by subtracting `hho` (hash handle offset).
196 * Contributed by L.S.Chin:
197 Cast `void*` to char* before pointer arithmetic to suppress compiler
198 warnings. We assume compilers abide to C standards which impose
199 requirement that `sizeof(void*) == sizeof(char*)`.
200 * Return meaningful exit status from do_tests per Tiago Cunha,
201 so that package manager-based install can verify tests are successful
204 Version 1.3 (2008-07-27)
205 ------------------------
206 * use integer-only math-- no floating point! Support FPU-less CPU's.
207 * eliminate `hash_q` metric, which measured the fraction of items with
208 non-ideal chain positions. We only need to know if this fraction
209 is below 0.5. This is now determined using fast bitwise tests.
210 * when an item is added to the hash, calculate the key's hash value
211 upfront and store it, instead of recomputing it as needed. This hashv
212 is stored in the hash handle. Potentially major speed benefit for
213 bucket expansion algorithm. Deleting is marginally improved too.
214 * fixed a minor bug in the calculation of the max ideal chain length;
215 line 446 in v1.2 erroneously calculated a/b*2 instead of a/(b*2).
216 The effect of this bug was that bucket expansion could occur more
217 readily because the per-bucket 'max chain length multiplier factor'
218 (which delays bucket expansion when certain buckets are overused)
219 was set to a lower, expansion-favoring value than intended.
220 * improved source commenting and improved variable names in structures
221 * remove `HASH_JSW`. Lengthy random number array made code less readable
222 * add `HASH_SRT(hh,hash,cmp)` as a generalized `HASH_SORT(hash,cmp)`.
223 It was an omission in uthash 1.2 that there was no sort macro for
224 hash handles with names other than hh.
225 * Corrected `HASH_FSCK` so it works with any name for the hash handle.
226 * behave properly in pathological `HASH_DEL(a,a)` case where the same
227 variable references the head and the deletee (advancing the head
228 then loses the correct reference to the deletee); fix by using
229 scratch area in the hash table to store deletee hash handle.
230 * made tests runnable on MinGW
231 * 3000+ downloads since uthash-1.0
234 Version 1.2 (2006-11-22)
235 ------------------------
236 * new `HASH_SORT` macro
238 * User Guide now features a clickable Table of Contents.
239 (The technique for generating the TOC on the browser was contributed
240 back to the AsciiDoc project and incorporated into AsciiDoc v8.1.0).
243 Version 1.1 (2006-06-28)
244 ------------------------
245 * uthash-1.1 released
246 * supports several built-in user-selectable hash functions
247 * new keystats utility quantifies performance of hash functions
250 Version 1.0 (2006-06-02)
251 ------------------------
254 // vim: set syntax=asciidoc: