──────────────────────────────
🌸 many-shaped creature
✨ too many projects
🚀 cannot be stopped
🌙 stayed up too late
eggbug enjoyer
──────────────────────────────
header image: chapter 8 complete from celeste
avatar: made using this character builder
i'm not gonna post the tests or anything because they're very boring looking, but it's a data structure i've never implemented before and i'm very proud of it!
it definitely needs some work to be competitive with a production-quality hash map, but even just having a working implementation is really exciting 
i haven't encountered those terms in my research yet, but probably disjointed? what i implemented was a prime-number-sized dynamic array of buckets, each bucket storing another dynamic array consisting of all the pairs whose keys hash to the index of the bucket modulo the number of buckets
Yea I meant separate chaining. Slabs bc open addressing involves allocating a slab and probing it, and the third kind is just making a slab big enough so that you never have modulo collisions (and cry upon hash collisions).
Cuckoo's Hashing and its two slabs and two hash functions also is interesting with its O(1) lookup and Ω(1) O(∞) insertion.
oohh, interesting algorithm! thanks for sharing!
i've read some stuff suggesting linear probing (slab) might be fastest, but chained felt like the easiest version so i did that first c:
