bool (*key_equals_function)(const void *a, const void *b);
uint32_t size;
uint32_t rehash;
+ uint64_t size_magic;
+ uint64_t rehash_magic;
uint32_t max_entries;
uint32_t size_index;
uint32_t entries;
struct set_entry *
_mesa_set_add_pre_hashed(struct set *set, uint32_t hash, const void *key);
+struct set_entry *
+_mesa_set_search_or_add(struct set *set, const void *key);
+struct set_entry *
+_mesa_set_search_or_add_pre_hashed(struct set *set, uint32_t hash,
+ const void *key);
+
struct set_entry *
_mesa_set_search(const struct set *set, const void *key);
struct set_entry *
struct set *
_mesa_pointer_set_create(void *mem_ctx);
+bool
+_mesa_set_intersects(struct set *a, struct set *b);
+
/**
* This foreach function is safe against deletion, but not against
* insertion (which may rehash the set, making entry a dangling