scratchings/hash-table
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Updated: references & documentation

Browse Source
This commit is contained in:
rhuibertsjr 2024-04-12 17:40:47 +02:00
parent 1991eeadc8
commit 948f4159b3
5 changed files with 20 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
docs/CHANGELOG
View File

@ -1,3 +1,7 @@
12-04-2024 René Huiberts <rhuibertsjr@gmail.com>
Updated: references & documentation
12-04-2024 René Huiberts <rhuibertsjr@gmail.com> 12-04-2024 René Huiberts <rhuibertsjr@gmail.com>
Added: project layout Added: project layout

9
docs/HASH_TABLE Normal file
View File

@ -0,0 +1,9 @@
=== HASH TABLE =================================================================
1. Calling the hash-function with the same input, should always return the
same output.
2. Hash output should be unique.
3. Computing a hash should be fast, the whole point of a hash table is fast
lookup time.
4. Hash output should be "random".

3
docs/REFERENCES
View File

@ -3,3 +3,6 @@
[1] Strager (2023) "Faster than Rust and C++: the PERFECT hash table" [1] Strager (2023) "Faster than Rust and C++: the PERFECT hash table"
https://www.youtube.com/watch?v=DMQ_HcNSOAI https://www.youtube.com/watch?v=DMQ_HcNSOAI
[2] J. Sorber (2020) " Understanding and implementing a Hash Table (in C)"
https://www.youtube.com/watch?v=2Ti5yvumFTU