2 * Written by Josh Dybnis and released to the public domain, as explained at
3 * http://creativecommons.org/licenses/publicdomain
5 * generic interface for map-like data structures
13 const map_impl_t *impl;
18 const map_impl_t *impl;
22 map_t *map_alloc (const map_impl_t *map_impl, const datatype_t *key_type) {
23 map_t *map = nbd_malloc(sizeof(map_t));
25 map->data = map->impl->alloc(key_type);
29 void map_free (map_t *map) {
30 map->impl->free_(map->data);
33 void map_print (map_t *map) {
34 map->impl->print(map->data);
37 map_val_t map_count (map_t *map) {
38 return map->impl->count(map->data);
41 map_val_t map_get (map_t *map, map_key_t key) {
42 return map->impl->get(map->data, key);
45 map_val_t map_set (map_t *map, map_key_t key, map_val_t new_val) {
46 return map->impl->cas(map->data, key, CAS_EXPECT_WHATEVER, new_val);
49 map_val_t map_add (map_t *map, map_key_t key, map_val_t new_val) {
50 return map->impl->cas(map->data, key, CAS_EXPECT_DOES_NOT_EXIST, new_val);
53 map_val_t map_cas (map_t *map, map_key_t key, map_val_t expected_val, map_val_t new_val) {
54 return map->impl->cas(map->data, key, expected_val, new_val);
57 map_val_t map_replace(map_t *map, map_key_t key, map_val_t new_val) {
58 return map->impl->cas(map->data, key, CAS_EXPECT_EXISTS, new_val);
61 map_val_t map_remove (map_t *map, map_key_t key) {
62 return map->impl->remove(map->data, key);
65 map_iter_t * map_iter_begin (map_t *map, map_key_t key) {
66 map_iter_t *iter = nbd_malloc(sizeof(map_iter_t));
67 iter->impl = map->impl;
68 iter->state = map->impl->iter_begin(map->data, key);
72 map_val_t map_iter_next (map_iter_t *iter, map_key_t *key_ptr) {
73 return iter->impl->iter_next(iter->state, key_ptr);
76 void map_iter_free (map_iter_t *iter) {
77 iter->impl->iter_free(iter->state);