source: dict.c @ cef53f9

release-1.6release-1.7release-1.8release-1.9
Last change on this file since cef53f9 was d537350, checked in by Anders Kaseorg <andersk@mit.edu>, 12 years ago
Inline owl_dict_free_simple. Signed-off-by: Anders Kaseorg <andersk@mit.edu> Reviewed-by: Nelson Elhage <nelhage@mit.edu>
  • Property mode set to 100644
File size: 3.5 KB
Line 
1/* Dictionary data abstraction. 
2 * Maps from strings to pointers.
3 * Stores as a sorted list of key/value pairs.
4 * O(n) on inserts and deletes.
5 * O(log n) on searches
6 */
7
8#include <stdlib.h>
9#include <string.h>
10#include <unistd.h>
11#include "owl.h"
12
13
14#define INITSIZE 30
15#define GROWBY 3 / 2
16
17int owl_dict_create(owl_dict *d) {
18  d->size=0;
19  d->els=owl_malloc(INITSIZE*sizeof(owl_dict_el));
20  d->avail=INITSIZE;
21  if (d->els==NULL) return(-1);
22  return(0);
23}
24
25int owl_dict_get_size(const owl_dict *d) {
26  return(d->size);
27}
28
29/* Finds the position of an element with key k, or of the element where
30 * this element would logically go, and stores the index in pos.
31 * Returns 1 if found, else 0. */
32int _owl_dict_find_pos(const owl_dict *d, const char *k, int *pos) {
33  int lo = 0, hi = d->size;
34  while (lo < hi) {
35    int mid = (lo + hi)/2; /* lo goes up and we can't hit hi, so no +1 */
36    int cmp = strcmp(k, d->els[mid].k);
37    if (cmp < 0) {
38      hi = mid;
39    } else if (cmp > 0) {
40      lo = mid+1;
41    } else {
42      *pos = mid;
43      return 1;
44    }
45  }
46  *pos = lo;
47  return 0;
48}
49
50/* returns the value corresponding to key k */
51void *owl_dict_find_element(const owl_dict *d, const char *k) {
52  int found, pos;
53  found = _owl_dict_find_pos(d, k, &pos);
54  if (!found) {
55    return(NULL);
56  }
57  return(d->els[pos].v);
58}
59
60/* creates a list and fills it in with keys.  duplicates the keys,
61 * so they will need to be freed by the caller. */
62int owl_dict_get_keys(const owl_dict *d, owl_list *l) {
63  int i;
64  char *dupk;
65  if (owl_list_create(l)) return(-1);
66  for (i=0; i<d->size; i++) {
67    if ((dupk = owl_strdup(d->els[i].k)) == NULL) return(-1);
68    owl_list_append_element(l, dupk);
69  }
70  return(0);
71}
72
73void owl_dict_noop_delete(void *x)
74{
75  return;
76}
77
78/* Returns 0 on success.  Will copy the key but make
79   a reference to the value.  Will clobber an existing
80   entry with the same key iff delete_on_replace!=NULL,
81   and will run delete_on_replace on the old element.
82   Will return -2 if replace=NULL and match was found.
83*/
84int owl_dict_insert_element(owl_dict *d, const char *k, void *v, void (*delete_on_replace)(void *old))
85{
86  int pos, found;
87  char *dupk;
88  found = _owl_dict_find_pos(d, k, &pos);
89  if (found && delete_on_replace) {
90    delete_on_replace(d->els[pos].v);
91    d->els[pos].v = v;
92    return(0);
93  } else if (found && !delete_on_replace) {
94    return(-2);
95  } else {
96    if (d->size + 1 > d->avail) {
97      int avail = MAX(d->avail * GROWBY, d->size + 1);
98      d->els = owl_realloc(d->els, avail * sizeof(owl_dict_el));
99      d->avail = avail;
100      if (d->els==NULL) return(-1);
101    }
102    if ((dupk = owl_strdup(k)) == NULL) return(-1);
103    if (pos!=d->size) {
104      /* shift forward to leave us a slot */
105      memmove(d->els+pos+1, d->els+pos, 
106              sizeof(owl_dict_el)*(d->size-pos));
107    }
108    d->size++;
109    d->els[pos].k = dupk;
110    d->els[pos].v = v;   
111    return(0);
112  }
113}
114
115/* Doesn't free the value of the element, but does
116 * return it so the caller can free it. */
117void *owl_dict_remove_element(owl_dict *d, const char *k) {
118  int i;
119  int pos, found;
120  void *v;
121  found = _owl_dict_find_pos(d, k, &pos);
122  if (!found) return(NULL);
123  owl_free(d->els[pos].k);
124  v = d->els[pos].v;
125  for (i=pos; i<d->size-1; i++) {
126    d->els[i]=d->els[i+1];
127  }
128  d->size--;
129  return(v);
130}
131
132/* elefree should free the value as well */
133void owl_dict_cleanup(owl_dict *d, void (*elefree)(void *))
134{
135  int i;
136
137  for (i=0; i<d->size; i++) {
138    owl_free(d->els[i].k);
139    if (elefree) (elefree)(d->els[i].v);
140  }
141  if (d->els) owl_free(d->els);
142}
143
Note: See TracBrowser for help on using the repository browser.