Lines Matching defs:hash
53 struct data_node_hash hash;
66 return "hash";
115 node->hash.elems_len = MAX_ELEMS;
116 node->hash.elems_used = 0;
142 struct data_node_hash *hash = &self->hash;
144 if (hash->elems_used == hash->elems_len)
147 struct data_hash_elem *elem = &hash->elems[hash->elems_used++];
164 for (i = 0; i < self->hash.elems_used; i++) {
165 data_node_free(self->hash.elems[i].node);
166 free(self->hash.elems[i].id);
181 struct data_node_hash *hash = &self->hash;
183 for (i = 0; i < hash->elems_used; i++) {
184 if (!strcmp(hash->elems[i].id, id))
188 if (i >= hash->elems_used)
191 data_node_free(hash->elems[i].node);
192 free(hash->elems[i].id);
194 hash->elems[i] = hash->elems[--hash->elems_used];
202 struct data_node_hash *hash = &self->hash;
204 for (i = 0; i < hash->elems_used; i++) {
205 if (!strcmp(hash->elems[i].id, id))
209 if (i >= hash->elems_used)
212 return hash->elems[i].node;
258 for (i = 0; i < self->hash.elems_used; i++) {
260 printf("%s = {\n", self->hash.elems[i].id);
261 data_node_print_(self->hash.elems[i].node, padd+1);
348 for (i = 0; i < self->hash.elems_used; i++) {
349 data_fprintf(f, padd, "\"%s\": ", self->hash.elems[i].id);
350 data_to_json_(self->hash.elems[i].node, f, padd+1, 0);
351 if (i < self->hash.elems_used - 1)