Function intmap_del_

ccan/ccan/intmap/intmap.c:116–157

}

void *intmap_del_(struct intmap *map, intmap_index_t index)
{
	struct intmap *parent = NULL, *n;
	u8 direction;
	void *value;

	/* Empty map? */
	if (intmap_empty_(map)) {
		errno = ENOENT;
		return NULL;
	}

	/* Find closest, but keep track of parent. */
	n = map;
	/* Anything with NULL value is a node. */
	while (!n->v) {
		/* FIXME: compare cmp prefix, if not equal, ENOENT */
		parent = n;
		direction = (index >> critbit(n)) & 1;
		n = &n->u.n->child[direction];
	}

	/* Did we find it? */
	if (index != n->u.i) {
		errno = ENOENT;
		return NULL;
	}

	value = n->v;

	if (!parent) {
		/* We deleted last node. */
		intmap_init_(map);
	} else {
		struct node *old = parent->u.n;
		/* Raise other node to parent. */
		*parent = old->child[!direction];
		free(old);
	}
	errno = 0;
	return value;
}

void *intmap_first_(const struct intmap *map, intmap_index_t *indexp)
{