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 xbt_dictelm_t current;
76 xbt_dictelm_t previous;
80 // if ( *dict ) xbt_dict_dump_sizes(*dict);
82 if (dict != nullptr && *dict != nullptr) {
83 table_size = (*dict)->table_size;
84 table = (*dict)->table;
85 /* Warning: the size of the table is 'table_size+1'...
86 * This is because table_size is used as a binary mask in xbt_dict_rehash */
87 for (int i = 0; (*dict)->count && i <= table_size; i++) {
89 while (current != nullptr) {
91 current = current->next;
92 xbt_dictelm_free(*dict, previous);
102 /** Returns the amount of elements in the dict */
103 unsigned int xbt_dict_size(xbt_dict_t dict)
105 return (dict != nullptr ? static_cast<unsigned int>(dict->count) : static_cast<unsigned int>(0));
108 /* Expend the size of the dict */
109 static void xbt_dict_rehash(xbt_dict_t dict)
111 const unsigned oldsize = dict->table_size + 1;
112 unsigned newsize = oldsize * 2;
114 xbt_dictelm_t *currcell = (xbt_dictelm_t *) xbt_realloc((char *) dict->table, newsize * sizeof(xbt_dictelm_t));
115 memset(&currcell[oldsize], 0, oldsize * sizeof(xbt_dictelm_t)); /* zero second half */
117 dict->table_size = newsize;
118 dict->table = currcell;
119 XBT_DEBUG("REHASH (%d->%d)", oldsize, newsize);
121 for (unsigned i = 0; i < oldsize; i++, currcell++) {
122 if (!*currcell) /* empty cell */
125 xbt_dictelm_t *twincell = currcell + oldsize;
126 xbt_dictelm_t *pprev = currcell;
127 xbt_dictelm_t bucklet = *currcell;
128 for (; bucklet != nullptr; bucklet = *pprev) {
129 /* Since we use "& size" instead of "%size" and since the size was doubled, each bucklet of this cell must either:
130 - stay in cell i (ie, currcell)
131 - go to the cell i+oldsize (ie, twincell) */
132 if ((bucklet->hash_code & newsize) != i) { /* Move to b */
133 *pprev = bucklet->next;
134 bucklet->next = *twincell;
139 pprev = &bucklet->next;
143 if (!*currcell) /* everything moved */
149 * \brief Add data to the dict (arbitrary key)
150 * \param dict the container
151 * \param key the key to set the new data
152 * \param key_len the size of the \a key
153 * \param data the data to add in the dict
154 * \param free_ctn function to call with (\a data as argument) when \a data is removed from the dictionary. This param
155 * will only be considered when the dict was instantiated with xbt_dict_new() and not xbt_dict_new_homogeneous()
157 * 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
160 void xbt_dict_set_ext(xbt_dict_t dict, const char *key, int key_len, void *data, void_f_pvoid_t free_ctn)
162 unsigned int hash_code = xbt_str_hash_ext(key, key_len);
164 xbt_dictelm_t current;
165 xbt_dictelm_t previous = nullptr;
167 xbt_assert(!free_ctn, "Cannot set an individual free function in homogeneous dicts.");
168 XBT_CDEBUG(xbt_dict, "ADD %.*s hash = %u, size = %d, & = %u", key_len, key, hash_code,
169 dict->table_size, hash_code & dict->table_size);
170 current = dict->table[hash_code & dict->table_size];
171 while (current != nullptr && (hash_code != current->hash_code || key_len != current->key_len
172 || memcmp(key, current->key, key_len))) {
174 current = current->next;
177 if (current == nullptr) {
178 /* this key doesn't exist yet */
179 current = xbt_dictelm_new(key, key_len, hash_code, data);
181 if (previous == nullptr) {
182 dict->table[hash_code & dict->table_size] = current;
184 if ((dict->fill * 100) / (dict->table_size + 1) > MAX_FILL_PERCENT)
185 xbt_dict_rehash(dict);
187 previous->next = current;
190 XBT_CDEBUG(xbt_dict, "Replace %.*s by %.*s under key %.*s",
191 key_len, (char *) current->content, key_len, (char *) data, key_len, (char *) key);
192 /* there is already an element with the same key: overwrite it */
193 xbt_dictelm_set_data(dict, current, data, free_ctn);
198 * \brief Add data to the dict (null-terminated key)
200 * \param dict the dict
201 * \param key the key to set the new data
202 * \param data the data to add in the dict
203 * \param free_ctn function to call with (\a data as argument) when \a data is removed from the dictionary. This param
204 * will only be considered when the dict was instantiated with xbt_dict_new() and not xbt_dict_new_homogeneous()
206 * set the \a data in the structure under the \a key, which is anull terminated string.
208 void xbt_dict_set(xbt_dict_t dict, const char *key, void *data, void_f_pvoid_t free_ctn)
210 xbt_dict_set_ext(dict, key, strlen(key), data, free_ctn);
214 * \brief Retrieve data from the dict (arbitrary key)
216 * \param dict the dealer of data
217 * \param key the key to find data
218 * \param key_len the size of the \a key
219 * \return the data that we are looking for
221 * Search the given \a key. Throws not_found_error when not found.
223 void *xbt_dict_get_ext(xbt_dict_t dict, const char *key, int key_len)
225 unsigned int hash_code = xbt_str_hash_ext(key, key_len);
226 xbt_dictelm_t current = dict->table[hash_code & dict->table_size];
228 while (current != nullptr && (hash_code != current->hash_code || key_len != current->key_len
229 || memcmp(key, current->key, key_len))) {
230 current = current->next;
233 if (current == nullptr)
234 THROWF(not_found_error, 0, "key %.*s not found", key_len, key);
236 return current->content;
239 /** @brief like xbt_dict_get_ext(), but returning nullptr when not found */
240 void *xbt_dict_get_or_null_ext(xbt_dict_t dict, const char *key, int key_len)
242 unsigned int hash_code = xbt_str_hash_ext(key, key_len);
243 xbt_dictelm_t current = dict->table[hash_code & dict->table_size];
245 while (current != nullptr && (hash_code != current->hash_code || key_len != current->key_len
246 || memcmp(key, current->key, key_len))) {
247 current = current->next;
250 if (current == nullptr)
253 return current->content;
257 * @brief retrieve the key associated to that object. Warning, that's a linear search
259 * Returns nullptr if the object cannot be found
261 char *xbt_dict_get_key(xbt_dict_t dict, const void *data)
263 for (int i = 0; i <= dict->table_size; i++) {
264 xbt_dictelm_t current = dict->table[i];
265 while (current != nullptr) {
266 if (current->content == data)
268 current = current->next;
274 /** @brief retrieve the key associated to that xbt_dictelm_t. */
275 char *xbt_dict_get_elm_key(xbt_dictelm_t elm)
281 * \brief Retrieve data from the dict (null-terminated key)
283 * \param dict the dealer of data
284 * \param key the key to find data
285 * \return the data that we are looking for
287 * Search the given \a key. Throws not_found_error when not found.
288 * Check xbt_dict_get_or_null() for a version returning nullptr without exception when not found.
290 void *xbt_dict_get(xbt_dict_t dict, const char *key)
292 return xbt_dict_get_elm(dict, key)->content;
296 * \brief Retrieve element from the dict (null-terminated key)
298 * \param dict the dealer of data
299 * \param key the key to find data
300 * \return the s_xbt_dictelm_t that we are looking for
302 * Search the given \a key. Throws not_found_error when not found.
303 * Check xbt_dict_get_or_null() for a version returning nullptr without exception when not found.
305 xbt_dictelm_t xbt_dict_get_elm(xbt_dict_t dict, const char *key)
307 xbt_dictelm_t current = xbt_dict_get_elm_or_null(dict, key);
309 if (current == nullptr)
310 THROWF(not_found_error, 0, "key %s not found", key);
316 * \brief like xbt_dict_get(), but returning nullptr when not found
318 void *xbt_dict_get_or_null(xbt_dict_t dict, const char *key)
320 xbt_dictelm_t current = xbt_dict_get_elm_or_null(dict, key);
322 if (current == nullptr)
325 return current->content;
329 * \brief like xbt_dict_get_elm(), but returning nullptr when not found
331 xbt_dictelm_t xbt_dict_get_elm_or_null(xbt_dict_t dict, const char *key)
333 unsigned int hash_code = xbt_str_hash(key);
334 xbt_dictelm_t current = dict->table[hash_code & dict->table_size];
336 while (current != nullptr && (hash_code != current->hash_code || strcmp(key, current->key)))
337 current = current->next;
342 * \brief Remove data from the dict (arbitrary key)
344 * \param dict the trash can
345 * \param key the key of the data to be removed
346 * \param key_len the size of the \a key
348 * Remove the entry associated with the given \a key (throws not_found)
350 void xbt_dict_remove_ext(xbt_dict_t dict, const char *key, int key_len)
352 unsigned int hash_code = xbt_str_hash_ext(key, key_len);
353 xbt_dictelm_t previous = nullptr;
354 xbt_dictelm_t current = dict->table[hash_code & dict->table_size];
356 while (current != nullptr && (hash_code != current->hash_code || key_len != current->key_len
357 || strncmp(key, current->key, key_len))) {
358 previous = current; /* save the previous node */
359 current = current->next;
362 if (current == nullptr)
363 THROWF(not_found_error, 0, "key %.*s not found", key_len, key);
365 if (previous != nullptr) {
366 previous->next = current->next;
368 dict->table[hash_code & dict->table_size] = current->next;
372 if (!dict->table[hash_code & dict->table_size])
375 xbt_dictelm_free(dict, current);
380 * \brief Remove data from the dict (null-terminated key)
382 * \param dict the dict
383 * \param key the key of the data to be removed
385 * Remove the entry associated with the given \a key
387 void xbt_dict_remove(xbt_dict_t dict, const char *key)
389 xbt_dict_remove_ext(dict, key, strlen(key));
392 /** @brief Remove all data from the dict */
393 void xbt_dict_reset(xbt_dict_t dict)
395 if (dict->count == 0)
398 for (int i = 0; i <= dict->table_size; i++) {
399 xbt_dictelm_t previous = nullptr;
400 xbt_dictelm_t current = dict->table[i];
401 while (current != nullptr) {
403 current = current->next;
404 xbt_dictelm_free(dict, previous);
406 dict->table[i] = nullptr;
414 * \brief Return the number of elements in the dict.
415 * \param dict a dictionary
417 int xbt_dict_length(xbt_dict_t dict)
422 /** @brief function to be used in xbt_dict_dump as long as the stored values are strings */
423 void xbt_dict_dump_output_string(void *s)
425 fputs((char*) s, stdout);
429 * \brief test if the dict is empty or not
431 int xbt_dict_is_empty(xbt_dict_t dict)
433 return !dict || (xbt_dict_length(dict) == 0);
437 * \brief Outputs the content of the structure (debugging purpose)
439 * \param dict the exibitionist
440 * \param output a function to dump each data in the tree (check @ref xbt_dict_dump_output_string)
442 * Outputs the content of the structure. (for debugging purpose). \a output is a function to output the data. If nullptr,
443 * data won't be displayed.
445 void xbt_dict_dump(xbt_dict_t dict, void_f_pvoid_t output)
448 xbt_dictelm_t element;
449 printf("Dict %p:\n", dict);
450 if (dict != nullptr) {
451 for (i = 0; i < dict->table_size; i++) {
452 element = dict->table[i];
455 while (element != nullptr) {
456 printf(" %s -> '", element->key);
457 if (output != nullptr) {
458 output(element->content);
461 element = element->next;
471 xbt_dynar_t all_sizes = nullptr;
472 /** @brief shows some debugging info about the bucklet repartition */
473 void xbt_dict_dump_sizes(xbt_dict_t dict)
478 printf("Dict %p: %d bucklets, %d used cells (of %d) ", dict, dict->count, dict->fill, dict->table_size);
484 xbt_dynar_t sizes = xbt_dynar_new(sizeof(int), nullptr);
486 for (int i = 0; i < dict->table_size; i++) {
487 xbt_dictelm_t element = dict->table[i];
490 while (element != nullptr) {
492 element = element->next;
495 if (xbt_dynar_length(sizes) <= size) {
497 xbt_dynar_set(sizes, size, &prevsize);
500 xbt_dynar_get_cpy(sizes, size, &prevsize);
502 xbt_dynar_set(sizes, size, &prevsize);
506 all_sizes = xbt_dynar_new(sizeof(int), nullptr);
508 xbt_dynar_foreach(sizes, count, size) {
509 /* Copy values of this one into all_sizes */
511 if (xbt_dynar_length(all_sizes) <= count) {
513 xbt_dynar_set(all_sizes, count, &prevcount);
515 xbt_dynar_get_cpy(all_sizes, count, &prevcount);
517 xbt_dynar_set(all_sizes, count, &prevcount);
520 /* Report current sizes */
521 if (count != 0 && size != 0)
522 printf("%uelm x %u cells; ", count, size);
525 xbt_dynar_free(&sizes);
529 * Create the dict mallocators.
530 * This is an internal XBT function called during the lib initialization.
531 * It can be used several times to recreate the mallocator, for example when you switch to MC mode
533 void xbt_dict_preinit()
535 if (dict_elm_mallocator == nullptr)
536 dict_elm_mallocator = xbt_mallocator_new(256, dict_elm_mallocator_new_f, dict_elm_mallocator_free_f,
537 dict_elm_mallocator_reset_f);
541 * Destroy the dict mallocators.
542 * This is an internal XBT function during the lib initialization
544 void xbt_dict_postexit()
546 if (dict_elm_mallocator != nullptr) {
547 xbt_mallocator_free(dict_elm_mallocator);
548 dict_elm_mallocator = nullptr;
555 printf("Overall stats:");
556 xbt_dynar_foreach(all_sizes, count, size) {
557 if (count != 0 && size != 0) {
558 printf("%uelm x %d cells; ", count, size);
564 printf("; %f elm per cell\n", avg / (double)total_count);
566 printf("; 0 elm per cell\n");
574 #include <xbt/ex.hpp>
575 #include "src/internal_config.h"
577 XBT_LOG_EXTERNAL_DEFAULT_CATEGORY(xbt_dict);
579 XBT_TEST_SUITE("dict", "Dict data container");
581 static void debugged_add_ext(xbt_dict_t head, const char* key, const char* data_to_fill)
583 char *data = xbt_strdup(data_to_fill);
585 xbt_test_log("Add %s under %s", data_to_fill, key);
587 xbt_dict_set(head, key, data, nullptr);
588 if (XBT_LOG_ISENABLED(xbt_dict, xbt_log_priority_debug)) {
589 xbt_dict_dump(head, (void (*)(void *)) &printf);
594 static void debugged_add(xbt_dict_t head, const char* key)
596 debugged_add_ext(head, key, key);
599 static xbt_dict_t new_fixture(void)
601 xbt_test_add("Fill in the dictionnary");
603 xbt_dict_t head = xbt_dict_new_homogeneous(&free);
604 debugged_add(head, "12");
605 debugged_add(head, "12a");
606 debugged_add(head, "12b");
607 debugged_add(head, "123");
608 debugged_add(head, "123456");
609 debugged_add(head, "1234");
610 debugged_add(head, "123457");
615 static void search_ext(xbt_dict_t head, const char *key, const char *data)
617 xbt_test_add("Search %s", key);
618 char *found = (char*) xbt_dict_get(head, key);
619 xbt_test_log("Found %s", found);
621 xbt_test_assert(found, "data do not match expectations: found nullptr while searching for %s", data);
623 xbt_test_assert(!strcmp(data, found), "data do not match expectations: found %s while searching for %s",
626 xbt_test_assert(!found, "data do not match expectations: found %s while searching for nullptr", found);
630 static void search(xbt_dict_t head, const char *key)
632 search_ext(head, key, key);
635 static void debugged_remove(xbt_dict_t head, const char* key)
637 xbt_test_add("Remove '%s'", key);
638 xbt_dict_remove(head, key);
639 /* xbt_dict_dump(head,(void (*)(void*))&printf); */
642 static void traverse(xbt_dict_t head)
644 xbt_dict_cursor_t cursor = nullptr;
649 xbt_dict_foreach(head, cursor, key, data) {
650 if (!key || !data || strcmp(key, data)) {
651 xbt_test_log("Seen #%d: %s->%s", ++i, key, data);
653 xbt_test_log("Seen #%d: %s", ++i, key);
655 xbt_test_assert(!data || !strcmp(key, data), "Key(%s) != value(%s). Aborting", key, data);
659 static void search_not_found(xbt_dict_t head, const char *data)
662 xbt_test_add("Search %s (expected not to be found)", data);
665 data = (const char*) xbt_dict_get(head, data);
666 THROWF(unknown_error, 0, "Found something which shouldn't be there (%s)", data);
669 if (e.category != not_found_error)
670 xbt_test_exception(e);
673 xbt_test_assert(ok, "Exception not raised");
676 static void count(xbt_dict_t dict, int length)
678 xbt_test_add("Count elements (expecting %d)", length);
679 xbt_test_assert(xbt_dict_length(dict) == length, "Announced length(%d) != %d.", xbt_dict_length(dict), length);
681 xbt_dict_cursor_t cursor;
685 xbt_dict_foreach(dict, cursor, key, data)
688 xbt_test_assert(effective == length, "Effective length(%d) != %d.", effective, length);
691 static void count_check_get_key(xbt_dict_t dict, int length)
693 xbt_dict_cursor_t cursor;
698 xbt_test_add("Count elements (expecting %d), and test the getkey function", length);
699 xbt_test_assert(xbt_dict_length(dict) == length, "Announced length(%d) != %d.", xbt_dict_length(dict), length);
701 xbt_dict_foreach(dict, cursor, key, data) {
703 char* key2 = xbt_dict_get_key(dict, data);
704 xbt_assert(!strcmp(key, key2), "The data was registered under %s instead of %s as expected", key2, key);
707 xbt_test_assert(effective == length, "Effective length(%d) != %d.", effective, length);
710 XBT_TEST_UNIT("basic", test_dict_basic, "Basic usage: change, retrieve and traverse homogeneous dicts")
712 xbt_test_add("Traversal the null dictionary");
715 xbt_test_add("Traversal and search the empty dictionary");
716 xbt_dict_t head = xbt_dict_new_homogeneous(&free);
719 debugged_remove(head, "12346");
722 if (e.category != not_found_error)
723 xbt_test_exception(e);
725 xbt_dict_free(&head);
727 xbt_test_add("Traverse the full dictionary");
728 head = new_fixture();
729 count_check_get_key(head, 7);
731 debugged_add_ext(head, "toto", "tutu");
732 search_ext(head, "toto", "tutu");
733 debugged_remove(head, "toto");
738 xbt_test_add("Free the dictionary (twice)");
739 xbt_dict_free(&head);
740 xbt_dict_free(&head);
743 head = new_fixture();
744 count_check_get_key(head, 7);
745 xbt_test_add("Change 123 to 'Changed 123'");
746 xbt_dict_set(head, "123", xbt_strdup("Changed 123"), nullptr);
747 count_check_get_key(head, 7);
749 xbt_test_add("Change 123 back to '123'");
750 xbt_dict_set(head, "123", xbt_strdup("123"), nullptr);
751 count_check_get_key(head, 7);
753 xbt_test_add("Change 12a to 'Dummy 12a'");
754 xbt_dict_set(head, "12a", xbt_strdup("Dummy 12a"), nullptr);
755 count_check_get_key(head, 7);
757 xbt_test_add("Change 12a to '12a'");
758 xbt_dict_set(head, "12a", xbt_strdup("12a"), nullptr);
759 count_check_get_key(head, 7);
761 xbt_test_add("Traverse the resulting dictionary");
765 xbt_test_add("Search 123");
766 char* data = (char*)xbt_dict_get(head, "123");
767 xbt_test_assert(data);
768 xbt_test_assert(!strcmp("123", data));
770 search_not_found(head, "Can't be found");
771 search_not_found(head, "123 Can't be found");
772 search_not_found(head, "12345678 NOT");
777 search(head, "123456");
778 search(head, "1234");
779 search(head, "123457");
781 xbt_test_add("Traverse the resulting dictionary");
784 /* xbt_dict_dump(head,(void (*)(void*))&printf); */
786 xbt_test_add("Free the dictionary twice");
787 xbt_dict_free(&head);
788 xbt_dict_free(&head);
790 xbt_test_add("Traverse the resulting dictionary");
794 XBT_TEST_UNIT("remove_homogeneous", test_dict_remove, "Removing some values from homogeneous dicts")
796 xbt_dict_t head = new_fixture();
798 xbt_test_add("Remove non existing data");
800 debugged_remove(head, "Does not exist");
803 if (e.category != not_found_error)
804 xbt_test_exception(e);
808 xbt_dict_free(&head);
810 xbt_test_add("Remove each data manually (traversing the resulting dictionary each time)");
811 head = new_fixture();
812 debugged_remove(head, "12a");
815 debugged_remove(head, "12b");
818 debugged_remove(head, "12");
821 debugged_remove(head, "123456");
825 debugged_remove(head, "12346");
828 if (e.category != not_found_error)
829 xbt_test_exception(e);
832 debugged_remove(head, "1234");
834 debugged_remove(head, "123457");
836 debugged_remove(head, "123");
839 debugged_remove(head, "12346");
842 if (e.category != not_found_error)
843 xbt_test_exception(e);
847 xbt_test_add("Free dict, create new fresh one, and then reset the dict");
848 xbt_dict_free(&head);
849 head = new_fixture();
850 xbt_dict_reset(head);
854 xbt_test_add("Free the dictionary twice");
855 xbt_dict_free(&head);
856 xbt_dict_free(&head);
859 XBT_TEST_UNIT("nulldata", test_dict_nulldata, "nullptr data management")
861 xbt_dict_t head = new_fixture();
863 xbt_test_add("Store nullptr under 'null'");
864 xbt_dict_set(head, "null", nullptr, nullptr);
865 search_ext(head, "null", nullptr);
867 xbt_test_add("Check whether I see it while traversing...");
869 xbt_dict_cursor_t cursor = nullptr;
874 xbt_dict_foreach(head, cursor, key, data) {
875 if (!key || !data || strcmp(key, data)) {
876 xbt_test_log("Seen: %s->%s", key, data);
878 xbt_test_log("Seen: %s", key);
881 if (!strcmp(key, "null"))
884 xbt_test_assert(found, "the key 'null', associated to nullptr is not found");
886 xbt_dict_free(&head);
890 #define SIZEOFKEY 1024
891 static int countelems(xbt_dict_t head)
893 xbt_dict_cursor_t cursor;
898 xbt_dict_foreach(head, cursor, key, data) {
904 XBT_TEST_UNIT("crash", test_dict_crash, "Crash test")
906 srand((unsigned int) time(nullptr));
908 for (int i = 0; i < 10; i++) {
909 xbt_test_add("CRASH test number %d (%d to go)", i + 1, 10 - i - 1);
910 xbt_test_log("Fill the struct, count its elems and frees the structure");
911 xbt_test_log("using 1000 elements with %d chars long randomized keys.", SIZEOFKEY);
912 xbt_dict_t head = xbt_dict_new_homogeneous(free);
913 /* if (i%10) printf("."); else printf("%d",i/10); fflush(stdout); */
914 for (int j = 0; j < 1000; j++) {
915 char* data = nullptr;
916 char* key = (char*)xbt_malloc(SIZEOFKEY);
919 for (int k = 0; k < SIZEOFKEY - 1; k++)
920 key[k] = rand() % ('z' - 'a') + 'a';
921 key[SIZEOFKEY - 1] = '\0';
922 /* printf("[%d %s]\n",j,key); */
923 data = (char*) xbt_dict_get_or_null(head, key);
924 } while (data != nullptr);
926 xbt_dict_set(head, key, key, nullptr);
927 data = (char*) xbt_dict_get(head, key);
928 xbt_test_assert(!strcmp(key, data), "Retrieved value (%s) != Injected value (%s)", key, data);
932 /* xbt_dict_dump(head,(void (*)(void*))&printf); */
934 xbt_dict_free(&head);
935 xbt_dict_free(&head);
938 xbt_dict_t head = xbt_dict_new_homogeneous(&free);
939 xbt_test_add("Fill %d elements, with keys being the number of element", NB_ELM);
940 for (int j = 0; j < NB_ELM; j++) {
941 /* if (!(j%1000)) { printf("."); fflush(stdout); } */
942 char* key = (char*)xbt_malloc(10);
944 snprintf(key,10, "%d", j);
945 xbt_dict_set(head, key, key, nullptr);
947 /*xbt_dict_dump(head,(void (*)(void*))&printf); */
949 xbt_test_add("Count the elements (retrieving the key and data for each)");
950 xbt_test_log("There is %d elements", countelems(head));
952 xbt_test_add("Search my %d elements 20 times", NB_ELM);
953 char* key = (char*)xbt_malloc(10);
954 for (int i = 0; i < 20; i++) {
955 /* if (i%10) printf("."); else printf("%d",i/10); fflush(stdout); */
956 for (int j = 0; j < NB_ELM; j++) {
957 snprintf(key,10, "%d", j);
958 void* data = xbt_dict_get(head, key);
959 xbt_test_assert(!strcmp(key, (char *) data), "with get, key=%s != data=%s", key, (char *) data);
960 data = xbt_dict_get_ext(head, key, strlen(key));
961 xbt_test_assert(!strcmp(key, (char *) data), "with get_ext, key=%s != data=%s", key, (char *) data);
966 xbt_test_add("Remove my %d elements", NB_ELM);
967 key = (char*) xbt_malloc(10);
968 for (int j = 0; j < NB_ELM; j++) {
969 /* if (!(j%10000)) printf("."); fflush(stdout); */
970 snprintf(key,10, "%d", j);
971 xbt_dict_remove(head, key);
975 xbt_test_add("Free the object (twice)");
976 xbt_dict_free(&head);
977 xbt_dict_free(&head);
980 XBT_TEST_UNIT("ext", test_dict_int, "Test dictionnary with int keys")
982 xbt_dict_t dict = xbt_dict_new_homogeneous(nullptr);
985 xbt_test_add("Insert elements");
986 for (int i = 0; i < count; ++i)
987 xbt_dict_set_ext(dict, (char*) &i, sizeof(i), (void*) (intptr_t) i, nullptr);
988 xbt_test_assert(xbt_dict_size(dict) == (unsigned) count, "Bad number of elements in the dictionnary");
990 xbt_test_add("Check elements");
991 for (int i = 0; i < count; ++i) {
992 int res = (int) (intptr_t) xbt_dict_get_ext(dict, (char*) &i, sizeof(i));
993 xbt_test_assert(xbt_dict_size(dict) == (unsigned) count, "Unexpected value at index %i, expected %i but was %i", i, i, res);
996 xbt_test_add("Free the array");
997 xbt_dict_free(&dict);
999 #endif /* SIMGRID_TEST */