globus_hashtable.h(3)

✨ NAME ✨

globus_hashtable.h — Hash Table 💖

okay bestie so this is the manual for globus_hashtable.h, living in section 3 of the Library Functions Manual, and it is literally the hash table of the globus_common world. bucket era. slay. 🎀

---

🦋 SYNOPSIS 🦋

#include 'globus_types.h'
#include 'globus_list.h'

🌸 Typedefs 🌸

these are the function-pointer shapes you gotta match, no cap:

• typedef int(* globus_hashtable_hash_func_t) (void *key, int limit) — the hash function shape, takes a key and a limit and gives you back an int 💅
• typedef int(* globus_hashtable_keyeq_func_t) (void *key1, void *key2) — the key-equality predicate shape, takes two keys, hands you an int
• typedef void(* globus_hashtable_copy_func_t) (void **dest_key, void **dest_datum, void *src_key, void *src_datum) — the copy function shape: dest_key, dest_datum, src_key, src_datum, all the pointers, zero return 🫶
• typedef void(* globus_hashtable_destructor_func_t) (void *datum) — the destructor shape, takes one datum and returns nothing, it's giving cleanup energy 🧹

👑 Functions 👑

• int globus_hashtable_init (globus_hashtable_t *table, int size, globus_hashtable_hash_func_t hash_func, globus_hashtable_keyeq_func_t keyeq_func) — Initialize a hash table. ✨
• void * globus_hashtable_lookup (globus_hashtable_t *table, void *key) — Look up a datum in a hash table. 🔍
• int globus_hashtable_insert (globus_hashtable_t *table, void *key, void *datum) — Insert a datum into a hash table. 📥
• void * globus_hashtable_update (globus_hashtable_t *table, void *key, void *datum) — Update a hash table mapping. 🔄
• void * globus_hashtable_remove (globus_hashtable_t *table, void *key) — Remove a datum from a hash table. 🗑️
• int globus_hashtable_to_list (globus_hashtable_t *table, globus_list_t **list) — Create a list of all datums in a hash table. 📝
• globus_bool_t globus_hashtable_empty (globus_hashtable_t *table) — Test hash table emptiness. 🕳️
• int globus_hashtable_size (globus_hashtable_t *table) — Hash table size. 📏
• void * globus_hashtable_first (globus_hashtable_t *table) — Initialize iterator to first hash table entry. ⏮️
• void * globus_hashtable_next (globus_hashtable_t *table) — Increment hash table iterator. ⏭️
• void * globus_hashtable_last (globus_hashtable_t *table) — Initialize iterator to last hash table entry. ⏪
• void * globus_hashtable_prev (globus_hashtable_t *table) — Decrement hash table iterator. ◀️
• int globus_hashtable_destroy (globus_hashtable_t *table) — Destroy a hash table

Destroys a hashtable representation, releasing any resources used to represent the mappings (abandoning any data in the queue). After this call, a hashtable is no longer considered initialized. " 😭

bestie the quote mark at the end is not me being chaotic, it's literally in there. and yes, that whole destroy paragraph is what globus_hashtable_destroy does. once it's destroyed the hashtable is no longer considered initialized, so don't come for her afterwards. periodt. 💀

• int globus_hashtable_string_hash (void *string, int limit) — Null-terminated string hash function. 🧵
• int globus_hashtable_string_keyeq (void *string1, void *string2) — Null-terminated string equality predicate. 🟰
• int globus_hashtable_voidp_hash (void *voidp, int limit) — Void pointer hash function. 👻
• int globus_hashtable_voidp_keyeq (void *voidp1, void *voidp2) — Void pointer equality predicate. 🫧
• int globus_hashtable_int_hash (void *integer, int limit) — Integer hash function. 🔢
• int globus_hashtable_int_keyeq (void *integer1, void *integer2) — Integer equality predicate. ⚖️

---

💜 Detailed Description 💜

Hash Table.

---

🌈 Author 🌈

Generated automatically by Doxygen for globus_common from the source code. 🤖✨

---

and that's the whole thing, bestie — this page came from globus_common, Version 18.15, and it's globus_hashtable.h(3). go forth and hash responsibly, ily 🫶💖🎀