From ac5f5a33e94054396de66a37043e226349b6c91c Mon Sep 17 00:00:00 2001 From: gingerBill Date: Sun, 18 Dec 2022 21:17:07 +0000 Subject: `gb_internal` a lot --- src/ptr_set.cpp | 54 +++++++++++++++++++++++++++--------------------------- 1 file changed, 27 insertions(+), 27 deletions(-) (limited to 'src/ptr_set.cpp') diff --git a/src/ptr_set.cpp b/src/ptr_set.cpp index 04ce162e2..9ecf1043e 100644 --- a/src/ptr_set.cpp +++ b/src/ptr_set.cpp @@ -10,20 +10,20 @@ struct PtrSet { Array> entries; }; -template void ptr_set_init (PtrSet *s, gbAllocator a, isize capacity = 16); -template void ptr_set_destroy(PtrSet *s); -template T ptr_set_add (PtrSet *s, T ptr); -template bool ptr_set_update (PtrSet *s, T ptr); // returns true if it previously existed -template bool ptr_set_exists (PtrSet *s, T ptr); -template void ptr_set_remove (PtrSet *s, T ptr); -template void ptr_set_clear (PtrSet *s); -template void ptr_set_grow (PtrSet *s); -template void ptr_set_rehash (PtrSet *s, isize new_count); -template void ptr_set_reserve(PtrSet *h, isize cap); +template gb_internal void ptr_set_init (PtrSet *s, gbAllocator a, isize capacity = 16); +template gb_internal void ptr_set_destroy(PtrSet *s); +template gb_internal T ptr_set_add (PtrSet *s, T ptr); +template gb_internal bool ptr_set_update (PtrSet *s, T ptr); // returns true if it previously existed +template gb_internal bool ptr_set_exists (PtrSet *s, T ptr); +template gb_internal void ptr_set_remove (PtrSet *s, T ptr); +template gb_internal void ptr_set_clear (PtrSet *s); +template gb_internal void ptr_set_grow (PtrSet *s); +template gb_internal void ptr_set_rehash (PtrSet *s, isize new_count); +template gb_internal void ptr_set_reserve(PtrSet *h, isize cap); template -void ptr_set_init(PtrSet *s, gbAllocator a, isize capacity) { +gb_internal void ptr_set_init(PtrSet *s, gbAllocator a, isize capacity) { if (capacity != 0) { capacity = next_pow2_isize(gb_max(16, capacity)); } @@ -36,7 +36,7 @@ void ptr_set_init(PtrSet *s, gbAllocator a, isize capacity) { } template -void ptr_set_destroy(PtrSet *s) { +gb_internal void ptr_set_destroy(PtrSet *s) { slice_free(&s->hashes, s->entries.allocator); array_free(&s->entries); } @@ -93,13 +93,13 @@ gb_internal bool ptr_set__full(PtrSet *s) { } template -gb_inline void ptr_set_grow(PtrSet *s) { +gb_internal gb_inline void ptr_set_grow(PtrSet *s) { isize new_count = gb_max(s->hashes.count<<1, 16); ptr_set_rehash(s, new_count); } template -void ptr_set_reset_entries(PtrSet *s) { +gb_internal void ptr_set_reset_entries(PtrSet *s) { for (isize i = 0; i < s->hashes.count; i++) { s->hashes.data[i] = MAP_SENTINEL; } @@ -117,7 +117,7 @@ void ptr_set_reset_entries(PtrSet *s) { } template -void ptr_set_reserve(PtrSet *s, isize cap) { +gb_internal void ptr_set_reserve(PtrSet *s, isize cap) { array_reserve(&s->entries, cap); if (s->entries.count*2 < s->hashes.count) { return; @@ -128,18 +128,18 @@ void ptr_set_reserve(PtrSet *s, isize cap) { template -void ptr_set_rehash(PtrSet *s, isize new_count) { +gb_internal void ptr_set_rehash(PtrSet *s, isize new_count) { ptr_set_reserve(s, new_count); } template -gb_inline bool ptr_set_exists(PtrSet *s, T ptr) { +gb_internal gb_inline bool ptr_set_exists(PtrSet *s, T ptr) { isize index = ptr_set__find(s, ptr).entry_index; return index != MAP_SENTINEL; } template -gb_inline isize ptr_entry_index(PtrSet *s, T ptr) { +gb_internal gb_inline isize ptr_entry_index(PtrSet *s, T ptr) { isize index = ptr_set__find(s, ptr).entry_index; if (index != MAP_SENTINEL) { return index; @@ -149,7 +149,7 @@ gb_inline isize ptr_entry_index(PtrSet *s, T ptr) { // Returns true if it already exists template -T ptr_set_add(PtrSet *s, T ptr) { +gb_internal T ptr_set_add(PtrSet *s, T ptr) { MapIndex index; MapFindResult fr; if (s->hashes.count == 0) { @@ -171,7 +171,7 @@ T ptr_set_add(PtrSet *s, T ptr) { } template -bool ptr_set_update(PtrSet *s, T ptr) { // returns true if it previously existsed +gb_internal bool ptr_set_update(PtrSet *s, T ptr) { // returns true if it previously existsed bool exists = false; MapIndex index; MapFindResult fr; @@ -198,7 +198,7 @@ bool ptr_set_update(PtrSet *s, T ptr) { // returns true if it previously exis template -void ptr_set__erase(PtrSet *s, MapFindResult fr) { +gb_internal void ptr_set__erase(PtrSet *s, MapFindResult fr) { MapFindResult last; if (fr.entry_prev == MAP_SENTINEL) { s->hashes.data[fr.hash_index] = s->entries.data[fr.entry_index].next; @@ -219,7 +219,7 @@ void ptr_set__erase(PtrSet *s, MapFindResult fr) { } template -void ptr_set_remove(PtrSet *s, T ptr) { +gb_internal void ptr_set_remove(PtrSet *s, T ptr) { MapFindResult fr = ptr_set__find(s, ptr); if (fr.entry_index != MAP_SENTINEL) { ptr_set__erase(s, fr); @@ -227,7 +227,7 @@ void ptr_set_remove(PtrSet *s, T ptr) { } template -gb_inline void ptr_set_clear(PtrSet *s) { +gb_internal gb_inline void ptr_set_clear(PtrSet *s) { array_clear(&s->entries); for (isize i = 0; i < s->hashes.count; i++) { s->hashes.data[i] = MAP_SENTINEL; @@ -236,21 +236,21 @@ gb_inline void ptr_set_clear(PtrSet *s) { template -PtrSetEntry *begin(PtrSet &m) { +gb_internal PtrSetEntry *begin(PtrSet &m) { return m.entries.data; } template -PtrSetEntry const *begin(PtrSet const &m) { +gb_internal PtrSetEntry const *begin(PtrSet const &m) { return m.entries.data; } template -PtrSetEntry *end(PtrSet &m) { +gb_internal PtrSetEntry *end(PtrSet &m) { return m.entries.data + m.entries.count; } template -PtrSetEntry const *end(PtrSet const &m) { +gb_internal PtrSetEntry const *end(PtrSet const &m) { return m.entries.data + m.entries.count; } \ No newline at end of file -- cgit v1.2.3