88 struct HashTable {  struct
101   // - HashTable  argument
105     size_t left_align = alignof(HashTable) > alignof(ENTRY) ? alignof(HashTable)  in table_alignment()  argument
119     size_t header_size = sizeof(HashTable);  in offset_to_groups()  argument
123   LIBC_INLINE ENTRY &entry(size_t i) {  in entry()
127   LIBC_INLINE const ENTRY &entry(size_t i) const {  in entry()
131   LIBC_INLINE uint8_t &control(size_t i) {  in control()
136   LIBC_INLINE const uint8_t &control(size_t i) const {  in control()
144   LIBC_INLINE void set_ctrl(size_t index, uint8_t value) {  in set_ctrl()
150   LIBC_INLINE size_t find(const char *key, uint64_t primary) {  in find()
176   LIBC_INLINE uint64_t oneshot_hash(const char *key) const {  in oneshot_hash()
206   LIBC_INLINE HashTable *grow() const {  in grow()  argument
221   LIBC_INLINE static ENTRY *insert(HashTable *&table, ENTRY item,  in insert()  argument
252   LIBC_INLINE static void deallocate(HashTable *table) {  in deallocate()  argument
260   LIBC_INLINE static HashTable *allocate(size_t capacity, uint64_t randomness) {  in allocate()  argument
294     const HashTable &table;  argument
346   LIBC_INLINE static ENTRY *insert(HashTable *&table, ENTRY item) {  in insert()  argument