X-Git-Url: http://info.iut-bm.univ-fcomte.fr/pub/gitweb/simgrid.git/blobdiff_plain/a4a0b7a61683f71695edc5b66c554d209311699f..1873a02acdc52506c010f43b4c78a8b8400dc0de:/src/xbt/dict.cpp diff --git a/src/xbt/dict.cpp b/src/xbt/dict.cpp index f5759cf390..485641c1d9 100644 --- a/src/xbt/dict.cpp +++ b/src/xbt/dict.cpp @@ -6,8 +6,8 @@ /* This program is free software; you can redistribute it and/or modify it * under the terms of the license (GNU LGPL) which comes with this package. */ -#include -#include +#include +#include #include "xbt/dict.h" #include "xbt/ex.h" @@ -20,14 +20,6 @@ XBT_LOG_NEW_DEFAULT_SUBCATEGORY(xbt_dict, xbt, "Dictionaries provide the same functionalities as hash tables"); -/** - * \brief Constructor - * \return pointer to the destination - * \see xbt_dict_new_homogenous(), xbt_dict_free() - * - * Creates and initialize a new dictionary with a default hashtable size. - * The dictionary is heterogeneous: each element can have a different free function. - */ xbt_dict_t xbt_dict_new() { XBT_WARN("Function xbt_dict_new() will soon be dropped. Please switch to xbt_dict_new_homogeneous()"); @@ -72,20 +64,15 @@ xbt_dict_t xbt_dict_new_homogeneous(void_f_pvoid_t free_ctn) */ void xbt_dict_free(xbt_dict_t * dict) { - xbt_dictelm_t current; - xbt_dictelm_t previous; - int table_size; - xbt_dictelm_t *table; - - // if ( *dict ) xbt_dict_dump_sizes(*dict); - if (dict != nullptr && *dict != nullptr) { - table_size = (*dict)->table_size; - table = (*dict)->table; + int table_size = (*dict)->table_size; + xbt_dictelm_t* table = (*dict)->table; /* Warning: the size of the table is 'table_size+1'... * This is because table_size is used as a binary mask in xbt_dict_rehash */ for (int i = 0; (*dict)->count && i <= table_size; i++) { - current = table[i]; + xbt_dictelm_t current = table[i]; + xbt_dictelm_t previous; + while (current != nullptr) { previous = current; current = current->next; @@ -116,7 +103,7 @@ static void xbt_dict_rehash(xbt_dict_t dict) newsize--; dict->table_size = newsize; dict->table = currcell; - XBT_DEBUG("REHASH (%d->%d)", oldsize, newsize); + XBT_DEBUG("REHASH (%u->%u)", oldsize, newsize); for (unsigned i = 0; i < oldsize; i++, currcell++) { if (*currcell == nullptr) /* empty cell */ @@ -444,11 +431,10 @@ int xbt_dict_is_empty(xbt_dict_t dict) */ void xbt_dict_dump(xbt_dict_t dict, void_f_pvoid_t output) { - int i; xbt_dictelm_t element; printf("Dict %p:\n", dict); if (dict != nullptr) { - for (i = 0; i < dict->table_size; i++) { + for (int i = 0; i < dict->table_size; i++) { element = dict->table[i]; if (element) { printf("[\n"); @@ -568,11 +554,11 @@ void xbt_dict_postexit() } #ifdef SIMGRID_TEST -#include +#include "src/internal_config.h" #include "xbt.h" #include "xbt/ex.h" +#include #include -#include "src/internal_config.h" XBT_LOG_EXTERNAL_DEFAULT_CATEGORY(xbt_dict); @@ -652,7 +638,7 @@ static void traverse(xbt_dict_t head) } else { xbt_test_log("Seen #%d: %s", ++i, key); } - xbt_test_assert(not data || not strcmp(key, data), "Key(%s) != value(%s). Aborting", key, data); + xbt_test_assert(key && data && strcmp(key, data) == 0, "Key(%s) != value(%s). Aborting", key, data); } } @@ -764,8 +750,7 @@ XBT_TEST_UNIT("basic", test_dict_basic, "Basic usage: change, retrieve and trave /* RETRIEVE */ xbt_test_add("Search 123"); char* data = (char*)xbt_dict_get(head, "123"); - xbt_test_assert(data); - xbt_test_assert(not strcmp("123", data)); + xbt_test_assert(data && strcmp("123", data) == 0); search_not_found(head, "Can't be found"); search_not_found(head, "123 Can't be found"); @@ -878,7 +863,7 @@ XBT_TEST_UNIT("nulldata", test_dict_nulldata, "nullptr data management") xbt_test_log("Seen: %s", key); } - if (not strcmp(key, "null")) + if (key && strcmp(key, "null") == 0) found = 1; } xbt_test_assert(found, "the key 'null', associated to nullptr is not found");