/explore
|
You are here 
|
attractivechaos.wordpress.com | ||
| | | | |
thepythoncorner.com
Hi guys, have you ever wondered how can Python dictionaries be so fast and reliable? The answer is that they are built on top of another technology: hash tables. Knowing how Python hash tables work will give you a deeper understanding of how dictionaries work and this could be a great advantage for your Python understanding because dictionaries are almost everywhere in Python. Hash Functions Before introducing hash tables and their Python implementation you have to know what is a hash function and how it works. A hash function is a function that can map a piece of data of... |
|
| | | | | ||
| | | | |
probablydance.com
Hi, I wrote my new favorite hash table. This came about because last year I wrote the fastest hash table (I still make that claim) and this year one of the organizers of the C++Now conference asked me to give a talk. My problem was that Google had also announced a new fast hash table... |
|
| | | | | ||
| | | | |
ceronman.com
Last year I finally decided to learn some Rust. The official book by Steve Klabnik and Carol Nichols is excellent, but even after reading it and working on some small code exercises, I felt that I needed more to really understand the language. I wanted to work on a small project to get some hands-on... |
|
| | | | | ||
| | | | |
blog.demofox.org
Hash tables are great in that you can hash a key and then use that hash as an index into an array to get the information associated with that key. That is very fast, so long as you use a fast hash function. The story doesn't end there though because hash functions can have collisions... |
|
| | | |||
