static int create_with_insert_unique(c_pmap thiz) { int i = 0; for(; i < sizeof(keys) / sizeof(int); ++ i) { c_map_insert(thiz, &pairs[i]); assert(__c_rb_tree_verify(thiz->_l)); } return 0; }
static int test_size_empty(c_pmap thiz) { int i = 0; printf("max size is %d\n", c_map_max_size(thiz)); printf("size is %d\n", c_map_size(thiz)); printf("is empty? %s\n", c_map_empty(thiz) ? "yes" : "no"); for(; i < sizeof(values) / sizeof(int); ++ i) { printf("now insert %d\n", i + 1); c_map_insert(thiz, &pairs[i]); printf("size is %d\n", c_map_size(thiz)); printf("is empty? %s\n", c_map_empty(thiz) ? "yes" : "no"); } printf("now clear\n"); c_map_clear(thiz); printf("size is %d\n", c_map_size(thiz)); printf("is empty? %s\n", c_map_empty(thiz) ? "yes" : "no"); return 0; }
static void __map_put(Map *map, void *key, void *value){ Entry *entry = map->entries->insert(map->entries, key, value); c_map_insert(&map->values, entry); }