1 /* dict - a generic dictionary, variation over hash table */
3 /* Copyright (c) 2004-2017. The SimGrid Team.
4 * All rights reserved. */
6 /* This program is free software; you can redistribute it and/or modify it
7 * under the terms of the license (GNU LGPL) which comes with this package. */
16 #include "xbt/mallocator.h"
17 #include "src/xbt_modinter.h"
19 #include "dict_private.h"
21 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(xbt_dict, xbt, "Dictionaries provide the same functionalities as hash tables");
25 * \return pointer to the destination
26 * \see xbt_dict_new_homogenous(), xbt_dict_free()
28 * Creates and initialize a new dictionary with a default hashtable size.
29 * The dictionary is heterogeneous: each element can have a different free function.
31 xbt_dict_t xbt_dict_new()
33 XBT_WARN("Function xbt_dict_new() will soon be dropped. Please switch to xbt_dict_new_homogeneous()");
34 xbt_dict_t dict = xbt_dict_new_homogeneous(nullptr);
35 dict->homogeneous = 0;
42 * \param free_ctn function to call with (\a data as argument) when \a data is removed from the dictionary
43 * \return pointer to the destination
44 * \see xbt_dict_new(), xbt_dict_free()
46 * Creates and initialize a new dictionary with a default hashtable size.
47 * The dictionary is homogeneous: each element share the same free function.
49 xbt_dict_t xbt_dict_new_homogeneous(void_f_pvoid_t free_ctn)
51 if (dict_elm_mallocator == nullptr)
56 dict = xbt_new(s_xbt_dict_t, 1);
57 dict->free_f = free_ctn;
58 dict->table_size = 127;
59 dict->table = xbt_new0(xbt_dictelm_t, dict->table_size + 1);
62 dict->homogeneous = 1;
69 * \param dict the dictionary to be freed
71 * Frees a dictionary with all the data
73 void xbt_dict_free(xbt_dict_t * dict)
75 if (dict != nullptr && *dict != nullptr) {
76 int table_size = (*dict)->table_size;
77 xbt_dictelm_t* table = (*dict)->table;
78 /* Warning: the size of the table is 'table_size+1'...
79 * This is because table_size is used as a binary mask in xbt_dict_rehash */
80 for (int i = 0; (*dict)->count && i <= table_size; i++) {
81 xbt_dictelm_t current = table[i];
82 xbt_dictelm_t previous;
84 while (current != nullptr) {
86 current = current->next;
87 xbt_dictelm_free(*dict, previous);
97 /** Returns the amount of elements in the dict */
98 unsigned int xbt_dict_size(xbt_dict_t dict)
100 return (dict != nullptr ? static_cast<unsigned int>(dict->count) : static_cast<unsigned int>(0));
103 /* Expend the size of the dict */
104 static void xbt_dict_rehash(xbt_dict_t dict)
106 const unsigned oldsize = dict->table_size + 1;
107 unsigned newsize = oldsize * 2;
109 xbt_dictelm_t *currcell = (xbt_dictelm_t *) xbt_realloc((char *) dict->table, newsize * sizeof(xbt_dictelm_t));
110 memset(&currcell[oldsize], 0, oldsize * sizeof(xbt_dictelm_t)); /* zero second half */
112 dict->table_size = newsize;
113 dict->table = currcell;
114 XBT_DEBUG("REHASH (%d->%d)", oldsize, newsize);
116 for (unsigned i = 0; i < oldsize; i++, currcell++) {
117 if (*currcell == nullptr) /* empty cell */
120 xbt_dictelm_t *twincell = currcell + oldsize;
121 xbt_dictelm_t *pprev = currcell;
122 xbt_dictelm_t bucklet = *currcell;
123 for (; bucklet != nullptr; bucklet = *pprev) {
124 /* Since we use "& size" instead of "%size" and since the size was doubled, each bucklet of this cell must either:
125 - stay in cell i (ie, currcell)
126 - go to the cell i+oldsize (ie, twincell) */
127 if ((bucklet->hash_code & newsize) != i) { /* Move to b */
128 *pprev = bucklet->next;
129 bucklet->next = *twincell;
130 if (*twincell == nullptr)
134 pprev = &bucklet->next;
138 if (*currcell == nullptr) /* everything moved */
144 * \brief Add data to the dict (arbitrary key)
145 * \param dict the container
146 * \param key the key to set the new data
147 * \param key_len the size of the \a key
148 * \param data the data to add in the dict
149 * \param free_ctn function to call with (\a data as argument) when \a data is removed from the dictionary. This param
150 * will only be considered when the dict was instantiated with xbt_dict_new() and not xbt_dict_new_homogeneous()
152 * Set the \a data in the structure under the \a key, which can be any kind of data, as long as its length is provided
155 void xbt_dict_set_ext(xbt_dict_t dict, const char *key, int key_len, void *data, void_f_pvoid_t free_ctn)
157 unsigned int hash_code = xbt_str_hash_ext(key, key_len);
159 xbt_dictelm_t current;
160 xbt_dictelm_t previous = nullptr;
162 xbt_assert(not free_ctn, "Cannot set an individual free function in homogeneous dicts.");
163 XBT_CDEBUG(xbt_dict, "ADD %.*s hash = %u, size = %d, & = %u", key_len, key, hash_code,
164 dict->table_size, hash_code & dict->table_size);
165 current = dict->table[hash_code & dict->table_size];
166 while (current != nullptr && (hash_code != current->hash_code || key_len != current->key_len
167 || memcmp(key, current->key, key_len))) {
169 current = current->next;
172 if (current == nullptr) {
173 /* this key doesn't exist yet */
174 current = xbt_dictelm_new(key, key_len, hash_code, data);
176 if (previous == nullptr) {
177 dict->table[hash_code & dict->table_size] = current;
179 if ((dict->fill * 100) / (dict->table_size + 1) > MAX_FILL_PERCENT)
180 xbt_dict_rehash(dict);
182 previous->next = current;
185 XBT_CDEBUG(xbt_dict, "Replace %.*s by %.*s under key %.*s",
186 key_len, (char *) current->content, key_len, (char *) data, key_len, (char *) key);
187 /* there is already an element with the same key: overwrite it */
188 xbt_dictelm_set_data(dict, current, data, free_ctn);
193 * \brief Add data to the dict (null-terminated key)
195 * \param dict the dict
196 * \param key the key to set the new data
197 * \param data the data to add in the dict
198 * \param free_ctn function to call with (\a data as argument) when \a data is removed from the dictionary. This param
199 * will only be considered when the dict was instantiated with xbt_dict_new() and not xbt_dict_new_homogeneous()
201 * set the \a data in the structure under the \a key, which is anull terminated string.
203 void xbt_dict_set(xbt_dict_t dict, const char *key, void *data, void_f_pvoid_t free_ctn)
205 xbt_dict_set_ext(dict, key, strlen(key), data, free_ctn);
209 * \brief Retrieve data from the dict (arbitrary key)
211 * \param dict the dealer of data
212 * \param key the key to find data
213 * \param key_len the size of the \a key
214 * \return the data that we are looking for
216 * Search the given \a key. Throws not_found_error when not found.
218 void *xbt_dict_get_ext(xbt_dict_t dict, const char *key, int key_len)
220 unsigned int hash_code = xbt_str_hash_ext(key, key_len);
221 xbt_dictelm_t current = dict->table[hash_code & dict->table_size];
223 while (current != nullptr && (hash_code != current->hash_code || key_len != current->key_len
224 || memcmp(key, current->key, key_len))) {
225 current = current->next;
228 if (current == nullptr)
229 THROWF(not_found_error, 0, "key %.*s not found", key_len, key);
231 return current->content;
234 /** @brief like xbt_dict_get_ext(), but returning nullptr when not found */
235 void *xbt_dict_get_or_null_ext(xbt_dict_t dict, const char *key, int key_len)
237 unsigned int hash_code = xbt_str_hash_ext(key, key_len);
238 xbt_dictelm_t current = dict->table[hash_code & dict->table_size];
240 while (current != nullptr && (hash_code != current->hash_code || key_len != current->key_len
241 || memcmp(key, current->key, key_len))) {
242 current = current->next;
245 if (current == nullptr)
248 return current->content;
252 * @brief retrieve the key associated to that object. Warning, that's a linear search
254 * Returns nullptr if the object cannot be found
256 char *xbt_dict_get_key(xbt_dict_t dict, const void *data)
258 for (int i = 0; i <= dict->table_size; i++) {
259 xbt_dictelm_t current = dict->table[i];
260 while (current != nullptr) {
261 if (current->content == data)
263 current = current->next;
269 /** @brief retrieve the key associated to that xbt_dictelm_t. */
270 char *xbt_dict_get_elm_key(xbt_dictelm_t elm)
276 * \brief Retrieve data from the dict (null-terminated key)
278 * \param dict the dealer of data
279 * \param key the key to find data
280 * \return the data that we are looking for
282 * Search the given \a key. Throws not_found_error when not found.
283 * Check xbt_dict_get_or_null() for a version returning nullptr without exception when not found.
285 void *xbt_dict_get(xbt_dict_t dict, const char *key)
287 return xbt_dict_get_elm(dict, key)->content;
291 * \brief Retrieve element from the dict (null-terminated key)
293 * \param dict the dealer of data
294 * \param key the key to find data
295 * \return the s_xbt_dictelm_t that we are looking for
297 * Search the given \a key. Throws not_found_error when not found.
298 * Check xbt_dict_get_or_null() for a version returning nullptr without exception when not found.
300 xbt_dictelm_t xbt_dict_get_elm(xbt_dict_t dict, const char *key)
302 xbt_dictelm_t current = xbt_dict_get_elm_or_null(dict, key);
304 if (current == nullptr)
305 THROWF(not_found_error, 0, "key %s not found", key);
311 * \brief like xbt_dict_get(), but returning nullptr when not found
313 void *xbt_dict_get_or_null(xbt_dict_t dict, const char *key)
315 xbt_dictelm_t current = xbt_dict_get_elm_or_null(dict, key);
317 if (current == nullptr)
320 return current->content;
324 * \brief like xbt_dict_get_elm(), but returning nullptr when not found
326 xbt_dictelm_t xbt_dict_get_elm_or_null(xbt_dict_t dict, const char *key)
328 unsigned int hash_code = xbt_str_hash(key);
329 xbt_dictelm_t current = dict->table[hash_code & dict->table_size];
331 while (current != nullptr && (hash_code != current->hash_code || strcmp(key, current->key)))
332 current = current->next;
337 * \brief Remove data from the dict (arbitrary key)
339 * \param dict the trash can
340 * \param key the key of the data to be removed
341 * \param key_len the size of the \a key
343 * Remove the entry associated with the given \a key (throws not_found)
345 void xbt_dict_remove_ext(xbt_dict_t dict, const char *key, int key_len)
347 unsigned int hash_code = xbt_str_hash_ext(key, key_len);
348 xbt_dictelm_t previous = nullptr;
349 xbt_dictelm_t current = dict->table[hash_code & dict->table_size];
351 while (current != nullptr && (hash_code != current->hash_code || key_len != current->key_len
352 || strncmp(key, current->key, key_len))) {
353 previous = current; /* save the previous node */
354 current = current->next;
357 if (current == nullptr)
358 THROWF(not_found_error, 0, "key %.*s not found", key_len, key);
360 if (previous != nullptr) {
361 previous->next = current->next;
363 dict->table[hash_code & dict->table_size] = current->next;
367 if (not dict->table[hash_code & dict->table_size])
370 xbt_dictelm_free(dict, current);
375 * \brief Remove data from the dict (null-terminated key)
377 * \param dict the dict
378 * \param key the key of the data to be removed
380 * Remove the entry associated with the given \a key
382 void xbt_dict_remove(xbt_dict_t dict, const char *key)
384 xbt_dict_remove_ext(dict, key, strlen(key));
387 /** @brief Remove all data from the dict */
388 void xbt_dict_reset(xbt_dict_t dict)
390 if (dict->count == 0)
393 for (int i = 0; i <= dict->table_size; i++) {
394 xbt_dictelm_t previous = nullptr;
395 xbt_dictelm_t current = dict->table[i];
396 while (current != nullptr) {
398 current = current->next;
399 xbt_dictelm_free(dict, previous);
401 dict->table[i] = nullptr;
409 * \brief Return the number of elements in the dict.
410 * \param dict a dictionary
412 int xbt_dict_length(xbt_dict_t dict)
417 /** @brief function to be used in xbt_dict_dump as long as the stored values are strings */
418 void xbt_dict_dump_output_string(void *s)
420 fputs((char*) s, stdout);
424 * \brief test if the dict is empty or not
426 int xbt_dict_is_empty(xbt_dict_t dict)
428 return not dict || (xbt_dict_length(dict) == 0);
432 * \brief Outputs the content of the structure (debugging purpose)
434 * \param dict the exibitionist
435 * \param output a function to dump each data in the tree (check @ref xbt_dict_dump_output_string)
437 * Outputs the content of the structure. (for debugging purpose). \a output is a function to output the data. If nullptr,
438 * data won't be displayed.
440 void xbt_dict_dump(xbt_dict_t dict, void_f_pvoid_t output)
442 xbt_dictelm_t element;
443 printf("Dict %p:\n", dict);
444 if (dict != nullptr) {
445 for (int i = 0; i < dict->table_size; i++) {
446 element = dict->table[i];
449 while (element != nullptr) {
450 printf(" %s -> '", element->key);
451 if (output != nullptr) {
452 output(element->content);
455 element = element->next;
465 xbt_dynar_t all_sizes = nullptr;
466 /** @brief shows some debugging info about the bucklet repartition */
467 void xbt_dict_dump_sizes(xbt_dict_t dict)
472 printf("Dict %p: %d bucklets, %d used cells (of %d) ", dict, dict->count, dict->fill, dict->table_size);
478 xbt_dynar_t sizes = xbt_dynar_new(sizeof(int), nullptr);
480 for (int i = 0; i < dict->table_size; i++) {
481 xbt_dictelm_t element = dict->table[i];
484 while (element != nullptr) {
486 element = element->next;
489 if (xbt_dynar_length(sizes) <= size) {
491 xbt_dynar_set(sizes, size, &prevsize);
494 xbt_dynar_get_cpy(sizes, size, &prevsize);
496 xbt_dynar_set(sizes, size, &prevsize);
500 all_sizes = xbt_dynar_new(sizeof(int), nullptr);
502 xbt_dynar_foreach(sizes, count, size) {
503 /* Copy values of this one into all_sizes */
505 if (xbt_dynar_length(all_sizes) <= count) {
507 xbt_dynar_set(all_sizes, count, &prevcount);
509 xbt_dynar_get_cpy(all_sizes, count, &prevcount);
511 xbt_dynar_set(all_sizes, count, &prevcount);
514 /* Report current sizes */
515 if (count != 0 && size != 0)
516 printf("%uelm x %u cells; ", count, size);
519 xbt_dynar_free(&sizes);
523 * Create the dict mallocators.
524 * This is an internal XBT function called during the lib initialization.
525 * It can be used several times to recreate the mallocator, for example when you switch to MC mode
527 void xbt_dict_preinit()
529 if (dict_elm_mallocator == nullptr)
530 dict_elm_mallocator = xbt_mallocator_new(256, dict_elm_mallocator_new_f, dict_elm_mallocator_free_f,
531 dict_elm_mallocator_reset_f);
535 * Destroy the dict mallocators.
536 * This is an internal XBT function during the lib initialization
538 void xbt_dict_postexit()
540 if (dict_elm_mallocator != nullptr) {
541 xbt_mallocator_free(dict_elm_mallocator);
542 dict_elm_mallocator = nullptr;
549 printf("Overall stats:");
550 xbt_dynar_foreach(all_sizes, count, size) {
551 if (count != 0 && size != 0) {
552 printf("%uelm x %d cells; ", count, size);
558 printf("; %f elm per cell\n", avg / (double)total_count);
560 printf("; 0 elm per cell\n");
568 #include <xbt/ex.hpp>
569 #include "src/internal_config.h"
571 XBT_LOG_EXTERNAL_DEFAULT_CATEGORY(xbt_dict);
573 XBT_TEST_SUITE("dict", "Dict data container");
575 static void debugged_add_ext(xbt_dict_t head, const char* key, const char* data_to_fill)
577 char *data = xbt_strdup(data_to_fill);
579 xbt_test_log("Add %s under %s", data_to_fill, key);
581 xbt_dict_set(head, key, data, nullptr);
582 if (XBT_LOG_ISENABLED(xbt_dict, xbt_log_priority_debug)) {
583 xbt_dict_dump(head, (void (*)(void *)) &printf);
588 static void debugged_add(xbt_dict_t head, const char* key)
590 debugged_add_ext(head, key, key);
593 static xbt_dict_t new_fixture()
595 xbt_test_add("Fill in the dictionnary");
597 xbt_dict_t head = xbt_dict_new_homogeneous(&free);
598 debugged_add(head, "12");
599 debugged_add(head, "12a");
600 debugged_add(head, "12b");
601 debugged_add(head, "123");
602 debugged_add(head, "123456");
603 debugged_add(head, "1234");
604 debugged_add(head, "123457");
609 static void search_ext(xbt_dict_t head, const char *key, const char *data)
611 xbt_test_add("Search %s", key);
612 char *found = (char*) xbt_dict_get(head, key);
613 xbt_test_log("Found %s", found);
615 xbt_test_assert(found, "data do not match expectations: found nullptr while searching for %s", data);
617 xbt_test_assert(not strcmp(data, found), "data do not match expectations: found %s while searching for %s", found,
620 xbt_test_assert(not found, "data do not match expectations: found %s while searching for nullptr", found);
624 static void search(xbt_dict_t head, const char *key)
626 search_ext(head, key, key);
629 static void debugged_remove(xbt_dict_t head, const char* key)
631 xbt_test_add("Remove '%s'", key);
632 xbt_dict_remove(head, key);
633 /* xbt_dict_dump(head,(void (*)(void*))&printf); */
636 static void traverse(xbt_dict_t head)
638 xbt_dict_cursor_t cursor = nullptr;
643 xbt_dict_foreach(head, cursor, key, data) {
644 if (not key || not data || strcmp(key, data)) {
645 xbt_test_log("Seen #%d: %s->%s", ++i, key, data);
647 xbt_test_log("Seen #%d: %s", ++i, key);
649 xbt_test_assert(not data || not strcmp(key, data), "Key(%s) != value(%s). Aborting", key, data);
653 static void search_not_found(xbt_dict_t head, const char *data)
656 xbt_test_add("Search %s (expected not to be found)", data);
659 data = (const char*) xbt_dict_get(head, data);
660 THROWF(unknown_error, 0, "Found something which shouldn't be there (%s)", data);
663 if (e.category != not_found_error)
664 xbt_test_exception(e);
667 xbt_test_assert(ok, "Exception not raised");
670 static void count(xbt_dict_t dict, int length)
672 xbt_test_add("Count elements (expecting %d)", length);
673 xbt_test_assert(xbt_dict_length(dict) == length, "Announced length(%d) != %d.", xbt_dict_length(dict), length);
675 xbt_dict_cursor_t cursor;
679 xbt_dict_foreach(dict, cursor, key, data)
682 xbt_test_assert(effective == length, "Effective length(%d) != %d.", effective, length);
685 static void count_check_get_key(xbt_dict_t dict, int length)
687 xbt_dict_cursor_t cursor;
692 xbt_test_add("Count elements (expecting %d), and test the getkey function", length);
693 xbt_test_assert(xbt_dict_length(dict) == length, "Announced length(%d) != %d.", xbt_dict_length(dict), length);
695 xbt_dict_foreach(dict, cursor, key, data) {
697 char* key2 = xbt_dict_get_key(dict, data);
698 xbt_assert(not strcmp(key, key2), "The data was registered under %s instead of %s as expected", key2, key);
701 xbt_test_assert(effective == length, "Effective length(%d) != %d.", effective, length);
704 XBT_TEST_UNIT("basic", test_dict_basic, "Basic usage: change, retrieve and traverse homogeneous dicts")
706 xbt_test_add("Traversal the null dictionary");
709 xbt_test_add("Traversal and search the empty dictionary");
710 xbt_dict_t head = xbt_dict_new_homogeneous(&free);
713 debugged_remove(head, "12346");
716 if (e.category != not_found_error)
717 xbt_test_exception(e);
719 xbt_dict_free(&head);
721 xbt_test_add("Traverse the full dictionary");
722 head = new_fixture();
723 count_check_get_key(head, 7);
725 debugged_add_ext(head, "toto", "tutu");
726 search_ext(head, "toto", "tutu");
727 debugged_remove(head, "toto");
732 xbt_test_add("Free the dictionary (twice)");
733 xbt_dict_free(&head);
734 xbt_dict_free(&head);
737 head = new_fixture();
738 count_check_get_key(head, 7);
739 xbt_test_add("Change 123 to 'Changed 123'");
740 xbt_dict_set(head, "123", xbt_strdup("Changed 123"), nullptr);
741 count_check_get_key(head, 7);
743 xbt_test_add("Change 123 back to '123'");
744 xbt_dict_set(head, "123", xbt_strdup("123"), nullptr);
745 count_check_get_key(head, 7);
747 xbt_test_add("Change 12a to 'Dummy 12a'");
748 xbt_dict_set(head, "12a", xbt_strdup("Dummy 12a"), nullptr);
749 count_check_get_key(head, 7);
751 xbt_test_add("Change 12a to '12a'");
752 xbt_dict_set(head, "12a", xbt_strdup("12a"), nullptr);
753 count_check_get_key(head, 7);
755 xbt_test_add("Traverse the resulting dictionary");
759 xbt_test_add("Search 123");
760 char* data = (char*)xbt_dict_get(head, "123");
761 xbt_test_assert(data);
762 xbt_test_assert(not strcmp("123", data));
764 search_not_found(head, "Can't be found");
765 search_not_found(head, "123 Can't be found");
766 search_not_found(head, "12345678 NOT");
771 search(head, "123456");
772 search(head, "1234");
773 search(head, "123457");
775 xbt_test_add("Traverse the resulting dictionary");
778 /* xbt_dict_dump(head,(void (*)(void*))&printf); */
780 xbt_test_add("Free the dictionary twice");
781 xbt_dict_free(&head);
782 xbt_dict_free(&head);
784 xbt_test_add("Traverse the resulting dictionary");
788 XBT_TEST_UNIT("remove_homogeneous", test_dict_remove, "Removing some values from homogeneous dicts")
790 xbt_dict_t head = new_fixture();
792 xbt_test_add("Remove non existing data");
794 debugged_remove(head, "Does not exist");
797 if (e.category != not_found_error)
798 xbt_test_exception(e);
802 xbt_dict_free(&head);
804 xbt_test_add("Remove each data manually (traversing the resulting dictionary each time)");
805 head = new_fixture();
806 debugged_remove(head, "12a");
809 debugged_remove(head, "12b");
812 debugged_remove(head, "12");
815 debugged_remove(head, "123456");
819 debugged_remove(head, "12346");
822 if (e.category != not_found_error)
823 xbt_test_exception(e);
826 debugged_remove(head, "1234");
828 debugged_remove(head, "123457");
830 debugged_remove(head, "123");
833 debugged_remove(head, "12346");
836 if (e.category != not_found_error)
837 xbt_test_exception(e);
841 xbt_test_add("Free dict, create new fresh one, and then reset the dict");
842 xbt_dict_free(&head);
843 head = new_fixture();
844 xbt_dict_reset(head);
848 xbt_test_add("Free the dictionary twice");
849 xbt_dict_free(&head);
850 xbt_dict_free(&head);
853 XBT_TEST_UNIT("nulldata", test_dict_nulldata, "nullptr data management")
855 xbt_dict_t head = new_fixture();
857 xbt_test_add("Store nullptr under 'null'");
858 xbt_dict_set(head, "null", nullptr, nullptr);
859 search_ext(head, "null", nullptr);
861 xbt_test_add("Check whether I see it while traversing...");
863 xbt_dict_cursor_t cursor = nullptr;
868 xbt_dict_foreach(head, cursor, key, data) {
869 if (not key || not data || strcmp(key, data)) {
870 xbt_test_log("Seen: %s->%s", key, data);
872 xbt_test_log("Seen: %s", key);
875 if (not strcmp(key, "null"))
878 xbt_test_assert(found, "the key 'null', associated to nullptr is not found");
880 xbt_dict_free(&head);
884 #define SIZEOFKEY 1024
885 static int countelems(xbt_dict_t head)
887 xbt_dict_cursor_t cursor;
892 xbt_dict_foreach(head, cursor, key, data) {
898 XBT_TEST_UNIT("crash", test_dict_crash, "Crash test")
900 srand((unsigned int) time(nullptr));
902 for (int i = 0; i < 10; i++) {
903 xbt_test_add("CRASH test number %d (%d to go)", i + 1, 10 - i - 1);
904 xbt_test_log("Fill the struct, count its elems and frees the structure");
905 xbt_test_log("using 1000 elements with %d chars long randomized keys.", SIZEOFKEY);
906 xbt_dict_t head = xbt_dict_new_homogeneous(free);
907 /* if (i%10) printf("."); else printf("%d",i/10); fflush(stdout); */
908 for (int j = 0; j < 1000; j++) {
909 char* data = nullptr;
910 char* key = (char*)xbt_malloc(SIZEOFKEY);
913 for (int k = 0; k < SIZEOFKEY - 1; k++)
914 key[k] = rand() % ('z' - 'a') + 'a';
915 key[SIZEOFKEY - 1] = '\0';
916 /* printf("[%d %s]\n",j,key); */
917 data = (char*) xbt_dict_get_or_null(head, key);
918 } while (data != nullptr);
920 xbt_dict_set(head, key, key, nullptr);
921 data = (char*) xbt_dict_get(head, key);
922 xbt_test_assert(not strcmp(key, data), "Retrieved value (%s) != Injected value (%s)", key, data);
926 /* xbt_dict_dump(head,(void (*)(void*))&printf); */
928 xbt_dict_free(&head);
929 xbt_dict_free(&head);
932 xbt_dict_t head = xbt_dict_new_homogeneous(&free);
933 xbt_test_add("Fill %d elements, with keys being the number of element", NB_ELM);
934 for (int j = 0; j < NB_ELM; j++) {
935 char* key = (char*)xbt_malloc(10);
937 snprintf(key,10, "%d", j);
938 xbt_dict_set(head, key, key, nullptr);
940 /*xbt_dict_dump(head,(void (*)(void*))&printf); */
942 xbt_test_add("Count the elements (retrieving the key and data for each)");
943 xbt_test_log("There is %d elements", countelems(head));
945 xbt_test_add("Search my %d elements 20 times", NB_ELM);
946 char* key = (char*)xbt_malloc(10);
947 for (int i = 0; i < 20; i++) {
948 /* if (i%10) printf("."); else printf("%d",i/10); fflush(stdout); */
949 for (int j = 0; j < NB_ELM; j++) {
950 snprintf(key,10, "%d", j);
951 void* data = xbt_dict_get(head, key);
952 xbt_test_assert(not strcmp(key, (char*)data), "with get, key=%s != data=%s", key, (char*)data);
953 data = xbt_dict_get_ext(head, key, strlen(key));
954 xbt_test_assert(not strcmp(key, (char*)data), "with get_ext, key=%s != data=%s", key, (char*)data);
959 xbt_test_add("Remove my %d elements", NB_ELM);
960 key = (char*) xbt_malloc(10);
961 for (int j = 0; j < NB_ELM; j++) {
962 snprintf(key,10, "%d", j);
963 xbt_dict_remove(head, key);
967 xbt_test_add("Free the object (twice)");
968 xbt_dict_free(&head);
969 xbt_dict_free(&head);
972 XBT_TEST_UNIT("ext", test_dict_int, "Test dictionnary with int keys")
974 xbt_dict_t dict = xbt_dict_new_homogeneous(nullptr);
977 xbt_test_add("Insert elements");
978 for (int i = 0; i < count; ++i)
979 xbt_dict_set_ext(dict, (char*) &i, sizeof(i), (void*) (intptr_t) i, nullptr);
980 xbt_test_assert(xbt_dict_size(dict) == (unsigned) count, "Bad number of elements in the dictionnary");
982 xbt_test_add("Check elements");
983 for (int i = 0; i < count; ++i) {
984 int res = (int) (intptr_t) xbt_dict_get_ext(dict, (char*) &i, sizeof(i));
985 xbt_test_assert(xbt_dict_size(dict) == (unsigned) count, "Unexpected value at index %i, expected %i but was %i", i, i, res);
988 xbt_test_add("Free the array");
989 xbt_dict_free(&dict);
991 #endif /* SIMGRID_TEST */