ed/Odin
1
0
Fork 0
mirror of https://github.com/Ed94/Odin.git synced 2026-08-05 15:18:49 +00:00
Code Issues Packages Projects Releases Wiki Activity

Remove unused procedures

Browse Source
This commit is contained in:
gingerBill
2023-01-03 18:42:13 +00:00
parent ec69101101
commit b3a55b8b6f
1 changed files with 3 additions and 11 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/ptr_set.cpp
+3 -11
View File
@@ -23,9 +23,6 @@ template <typename T> gb_internal bool ptr_set_update (PtrSet<T> *s, T ptr); //
template <typename T> gb_internal bool ptr_set_exists (PtrSet<T> *s, T ptr); template <typename T> gb_internal bool ptr_set_exists (PtrSet<T> *s, T ptr);
template <typename T> gb_internal void ptr_set_remove (PtrSet<T> *s, T ptr); template <typename T> gb_internal void ptr_set_remove (PtrSet<T> *s, T ptr);
template <typename T> gb_internal void ptr_set_clear (PtrSet<T> *s); template <typename T> gb_internal void ptr_set_clear (PtrSet<T> *s);
template <typename T> gb_internal void ptr_set_grow (PtrSet<T> *s);
template <typename T> gb_internal void ptr_set_rehash (PtrSet<T> *s, isize new_count);
template <typename T> gb_internal void ptr_set_reserve(PtrSet<T> *h, isize cap);
gb_internal gbAllocator ptr_set_allocator(void) { gb_internal gbAllocator ptr_set_allocator(void) {
return heap_allocator(); return heap_allocator();
@@ -104,12 +101,6 @@ gb_internal bool ptr_set__full(PtrSet<T> *s) {
return 0.75f * s->hashes.count <= s->entries.count; return 0.75f * s->hashes.count <= s->entries.count;
} }
template <typename T>
gb_internal gb_inline void ptr_set_grow(PtrSet<T> *s) {
isize new_count = gb_max(s->hashes.count<<1, 16);
ptr_set_rehash(s, new_count);
}
template <typename T> template <typename T>
gb_internal void ptr_set_reset_entries(PtrSet<T> *s) { gb_internal void ptr_set_reset_entries(PtrSet<T> *s) {
for (isize i = 0; i < s->hashes.count; i++) { for (isize i = 0; i < s->hashes.count; i++) {
@@ -141,12 +132,13 @@ gb_internal void ptr_set_reserve(PtrSet<T> *s, isize cap) {
ptr_set_reset_entries(s); ptr_set_reset_entries(s);
} }
template <typename T> template <typename T>
gb_internal void ptr_set_rehash(PtrSet<T> *s, isize new_count) { gb_internal gb_inline void ptr_set_grow(PtrSet<T> *s) {
isize new_count = gb_max(s->hashes.count<<1, 16);
ptr_set_reserve(s, new_count); ptr_set_reserve(s, new_count);
} }
template <typename T> template <typename T>
gb_internal gb_inline bool ptr_set_exists(PtrSet<T> *s, T ptr) { gb_internal gb_inline bool ptr_set_exists(PtrSet<T> *s, T ptr) {
isize index = ptr_set__find(s, ptr).entry_index; isize index = ptr_set__find(s, ptr).entry_index;