1ZHASH(3) CZMQ Manual ZHASH(3)
2
6 zhash - simple generic hash container
7
9 // This is a stable class, and may not change except for emergencies. It
10 // is provided in stable builds.
11 // Callback function for zhash_freefn method
12 typedef void (zhash_free_fn) (
13 void *data);
14 // Create a new, empty hash container
16 CZMQ_EXPORT zhash_t *
17 zhash_new (void);
18 // Unpack binary frame into a new hash table. Packed data must follow format
20 // defined by zhash_pack. Hash table is set to autofree. An empty frame
21 // unpacks to an empty hash table.
22 CZMQ_EXPORT zhash_t *
23 zhash_unpack (zframe_t *frame);
24 // Destroy a hash container and all items in it
26 CZMQ_EXPORT void
27 zhash_destroy (zhash_t **self_p);
28 // Insert item into hash table with specified key and item.
30 // If key is already present returns -1 and leaves existing item unchanged
31 // Returns 0 on success.
32 CZMQ_EXPORT int
33 zhash_insert (zhash_t *self, const char *key, void *item);
34 // Update item into hash table with specified key and item.
36 // If key is already present, destroys old item and inserts new one.
37 // Use free_fn method to ensure deallocator is properly called on item.
38 CZMQ_EXPORT void
39 zhash_update (zhash_t *self, const char *key, void *item);
40 // Remove an item specified by key from the hash table. If there was no such
42 // item, this function does nothing.
43 CZMQ_EXPORT void
44 zhash_delete (zhash_t *self, const char *key);
45 // Return the item at the specified key, or null
47 CZMQ_EXPORT void *
48 zhash_lookup (zhash_t *self, const char *key);
49 // Reindexes an item from an old key to a new key. If there was no such
51 // item, does nothing. Returns 0 if successful, else -1.
52 CZMQ_EXPORT int
53 zhash_rename (zhash_t *self, const char *old_key, const char *new_key);
54 // Set a free function for the specified hash table item. When the item is
56 // destroyed, the free function, if any, is called on that item.
57 // Use this when hash items are dynamically allocated, to ensure that
58 // you don't have memory leaks. You can pass 'free' or NULL as a free_fn.
59 // Returns the item, or NULL if there is no such item.
60 CZMQ_EXPORT void *
61 zhash_freefn (zhash_t *self, const char *key, zhash_free_fn free_fn);
62 // Return the number of keys/items in the hash table
64 CZMQ_EXPORT size_t
65 zhash_size (zhash_t *self);
66 // Make copy of hash table; if supplied table is null, returns null.
68 // Does not copy items themselves. Rebuilds new table so may be slow on
69 // very large tables. NOTE: only works with item values that are strings
70 // since there's no other way to know how to duplicate the item value.
71 // Caller owns return value and must destroy it when done.
72 CZMQ_EXPORT zhash_t *
73 zhash_dup (zhash_t *self);
74 // Return keys for items in table
76 // Caller owns return value and must destroy it when done.
77 CZMQ_EXPORT zlist_t *
78 zhash_keys (zhash_t *self);
79 // Simple iterator; returns first item in hash table, in no given order,
81 // or NULL if the table is empty. This method is simpler to use than the
82 // foreach() method, which is deprecated. To access the key for this item
83 // use zhash_cursor(). NOTE: do NOT modify the table while iterating.
84 CZMQ_EXPORT void *
85 zhash_first (zhash_t *self);
86 // Simple iterator; returns next item in hash table, in no given order,
88 // or NULL if the last item was already returned. Use this together with
89 // zhash_first() to process all items in a hash table. If you need the
90 // items in sorted order, use zhash_keys() and then zlist_sort(). To
91 // access the key for this item use zhash_cursor(). NOTE: do NOT modify
92 // the table while iterating.
93 CZMQ_EXPORT void *
94 zhash_next (zhash_t *self);
95 // After a successful first/next method, returns the key for the item that
97 // was returned. This is a constant string that you may not modify or
98 // deallocate, and which lasts as long as the item in the hash. After an
99 // unsuccessful first/next, returns NULL.
100 CZMQ_EXPORT const char *
101 zhash_cursor (zhash_t *self);
102 // Add a comment to hash table before saving to disk. You can add as many
104 // comment lines as you like. These comment lines are discarded when loading
105 // the file. If you use a null format, all comments are deleted.
106 CZMQ_EXPORT void
107 zhash_comment (zhash_t *self, const char *format, ...) CHECK_PRINTF (2);
108 // Serialize hash table to a binary frame that can be sent in a message.
110 // The packed format is compatible with the 'dictionary' type defined in
111 // http://rfc.zeromq.org/spec:35/FILEMQ, and implemented by zproto:
112 //
113 // ; A list of name/value pairs
114 // dictionary = dict-count *( dict-name dict-value )
115 // dict-count = number-4
116 // dict-value = longstr
117 // dict-name = string
118 //
119 // ; Strings are always length + text contents
120 // longstr = number-4 *VCHAR
121 // string = number-1 *VCHAR
122 //
123 // ; Numbers are unsigned integers in network byte order
124 // number-1 = 1OCTET
125 // number-4 = 4OCTET
126 //
127 // Comments are not included in the packed data. Item values MUST be
128 // strings.
129 // Caller owns return value and must destroy it when done.
130 CZMQ_EXPORT zframe_t *
131 zhash_pack (zhash_t *self);
132 // Save hash table to a text file in name=value format. Hash values must be
134 // printable strings; keys may not contain '=' character. Returns 0 if OK,
135 // else -1 if a file error occurred.
136 CZMQ_EXPORT int
137 zhash_save (zhash_t *self, const char *filename);
138 // Load hash table from a text file in name=value format; hash table must
140 // already exist. Hash values must printable strings; keys may not contain
141 // '=' character. Returns 0 if OK, else -1 if a file was not readable.
142 CZMQ_EXPORT int
143 zhash_load (zhash_t *self, const char *filename);
144 // When a hash table was loaded from a file by zhash_load, this method will
146 // reload the file if it has been modified since, and is "stable", i.e. not
147 // still changing. Returns 0 if OK, -1 if there was an error reloading the
148 // file.
149 CZMQ_EXPORT int
150 zhash_refresh (zhash_t *self);
151 // Set hash for automatic value destruction
153 CZMQ_EXPORT void
154 zhash_autofree (zhash_t *self);
155 // Self test of this class.
157 CZMQ_EXPORT void
158 zhash_test (bool verbose);
159 Please add '@interface' section in './../src/zhash.c'.
161
163 zhash is an expandable hash table container. This is a simple
164 container. For heavy-duty applications we recommend using zhashx.
165 Note that it’s relatively slow (50K insertions/deletes per second), so
167 don’t do inserts/updates on the critical path for message I/O. It can
168 do 2.5M lookups per second for 16-char keys. Timed on a 1.6GHz CPU.
169
171 From zhash_test method.
172 zhash_t *hash = zhash_new ();
174 assert (hash);
175 assert (zhash_size (hash) == 0);
176 assert (zhash_first (hash) == NULL);
177 assert (zhash_cursor (hash) == NULL);
178 // Insert some items
180 int rc;
181 rc = zhash_insert (hash, "DEADBEEF", "dead beef");
182 char *item = (char *) zhash_first (hash);
183 assert (streq (zhash_cursor (hash), "DEADBEEF"));
184 assert (streq (item, "dead beef"));
185 assert (rc == 0);
186 rc = zhash_insert (hash, "ABADCAFE", "a bad cafe");
187 assert (rc == 0);
188 rc = zhash_insert (hash, "C0DEDBAD", "coded bad");
189 assert (rc == 0);
190 rc = zhash_insert (hash, "DEADF00D", "dead food");
191 assert (rc == 0);
192 assert (zhash_size (hash) == 4);
193 // Look for existing items
195 item = (char *) zhash_lookup (hash, "DEADBEEF");
196 assert (streq (item, "dead beef"));
197 item = (char *) zhash_lookup (hash, "ABADCAFE");
198 assert (streq (item, "a bad cafe"));
199 item = (char *) zhash_lookup (hash, "C0DEDBAD");
200 assert (streq (item, "coded bad"));
201 item = (char *) zhash_lookup (hash, "DEADF00D");
202 assert (streq (item, "dead food"));
203 // Look for non-existent items
205 item = (char *) zhash_lookup (hash, "foo");
206 assert (item == NULL);
207 // Try to insert duplicate items
209 rc = zhash_insert (hash, "DEADBEEF", "foo");
210 assert (rc == -1);
211 item = (char *) zhash_lookup (hash, "DEADBEEF");
212 assert (streq (item, "dead beef"));
213 // Some rename tests
215 // Valid rename, key is now LIVEBEEF
217 rc = zhash_rename (hash, "DEADBEEF", "LIVEBEEF");
218 assert (rc == 0);
219 item = (char *) zhash_lookup (hash, "LIVEBEEF");
220 assert (streq (item, "dead beef"));
221 // Trying to rename an unknown item to a non-existent key
223 rc = zhash_rename (hash, "WHATBEEF", "NONESUCH");
224 assert (rc == -1);
225 // Trying to rename an unknown item to an existing key
227 rc = zhash_rename (hash, "WHATBEEF", "LIVEBEEF");
228 assert (rc == -1);
229 item = (char *) zhash_lookup (hash, "LIVEBEEF");
230 assert (streq (item, "dead beef"));
231 // Trying to rename an existing item to another existing item
233 rc = zhash_rename (hash, "LIVEBEEF", "ABADCAFE");
234 assert (rc == -1);
235 item = (char *) zhash_lookup (hash, "LIVEBEEF");
236 assert (streq (item, "dead beef"));
237 item = (char *) zhash_lookup (hash, "ABADCAFE");
238 assert (streq (item, "a bad cafe"));
239 // Test keys method
241 zlist_t *keys = zhash_keys (hash);
242 assert (zlist_size (keys) == 4);
243 zlist_destroy (&keys);
244 // Test dup method
246 zhash_t *copy = zhash_dup (hash);
247 assert (zhash_size (copy) == 4);
248 item = (char *) zhash_lookup (copy, "LIVEBEEF");
249 assert (item);
250 assert (streq (item, "dead beef"));
251 zhash_destroy (©);
252 // Test pack/unpack methods
254 zframe_t *frame = zhash_pack (hash);
255 copy = zhash_unpack (frame);
256 zframe_destroy (&frame);
257 assert (zhash_size (copy) == 4);
258 item = (char *) zhash_lookup (copy, "LIVEBEEF");
259 assert (item);
260 assert (streq (item, "dead beef"));
261 zhash_destroy (©);
262 // Test save and load
264 zhash_comment (hash, "This is a test file");
265 zhash_comment (hash, "Created by %s", "czmq_selftest");
266 zhash_save (hash, ".cache");
267 copy = zhash_new ();
268 assert (copy);
269 zhash_load (copy, ".cache");
270 item = (char *) zhash_lookup (copy, "LIVEBEEF");
271 assert (item);
272 assert (streq (item, "dead beef"));
273 zhash_destroy (©);
274 zsys_file_delete (".cache");
275 // Delete a item
277 zhash_delete (hash, "LIVEBEEF");
278 item = (char *) zhash_lookup (hash, "LIVEBEEF");
279 assert (item == NULL);
280 assert (zhash_size (hash) == 3);
281 // Check that the queue is robust against random usage
283 struct {
284 char name [100];
285 bool exists;
286 } testset [200];
287 memset (testset, 0, sizeof (testset));
288 int testmax = 200, testnbr, iteration;
289 srandom ((unsigned) time (NULL));
291 for (iteration = 0; iteration < 25000; iteration++) {
292 testnbr = randof (testmax);
293 assert (testnbr != testmax);
294 assert (testnbr < testmax);
295 if (testset [testnbr].exists) {
296 item = (char *) zhash_lookup (hash, testset [testnbr].name);
297 assert (item);
298 zhash_delete (hash, testset [testnbr].name);
299 testset [testnbr].exists = false;
300 }
301 else {
302 sprintf (testset [testnbr].name, "%x-%x", rand (), rand ());
303 if (zhash_insert (hash, testset [testnbr].name, "") == 0)
304 testset [testnbr].exists = true;
305 }
306 }
307 // Test 10K lookups
308 for (iteration = 0; iteration < 10000; iteration++)
309 item = (char *) zhash_lookup (hash, "DEADBEEFABADCAFE");
310 // Destructor should be safe to call twice
312 zhash_destroy (&hash);
313 zhash_destroy (&hash);
314 assert (hash == NULL);
315 // Test autofree; automatically copies and frees string values
317 hash = zhash_new ();
318 assert (hash);
319 zhash_autofree (hash);
320 char value [255];
321 strcpy (value, "This is a string");
322 rc = zhash_insert (hash, "key1", value);
323 assert (rc == 0);
324 strcpy (value, "Inserting with the same key will fail");
325 rc = zhash_insert (hash, "key1", value);
326 assert (rc == -1);
327 strcpy (value, "Ring a ding ding");
328 rc = zhash_insert (hash, "key2", value);
329 assert (rc == 0);
330 assert (streq ((char *) zhash_lookup (hash, "key1"), "This is a string"));
331 assert (streq ((char *) zhash_lookup (hash, "key2"), "Ring a ding ding"));
332 zhash_destroy (&hash);
333
336 The czmq manual was written by the authors in the AUTHORS file.
337
339 Main web site:
340 Report bugs to the email <zeromq-dev@lists.zeromq.org[1]>
342
344 Copyright (c) the Contributors as noted in the AUTHORS file. This file
345 is part of CZMQ, the high-level C binding for 0MQ:
346 http://czmq.zeromq.org. This Source Code Form is subject to the terms
347 of the Mozilla Public License, v. 2.0. If a copy of the MPL was not
348 distributed with this file, You can obtain one at
349 http://mozilla.org/MPL/2.0/. LICENSE included with the czmq
350 distribution.
351
353 1. zeromq-dev@lists.zeromq.org
354 mailto:zeromq-dev@lists.zeromq.org
355CZMQ 4.0.2 12/31/2016 ZHASH(3)