Explore >> Select a destination
|
You are here 
|
acorwin.com | ||
| | | | |
emre.me
|
|
| | | | | A hash table is an unordered collection of key-value pairs, where each key is unique. Also, they are the most commonly used data structure for implementing associative arrays1 (maps, dictionaries). | |
| | | | |
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... | |
| | | | |
www.laurentluce.com
|
|
| | | | | ||
| | | | |
coredumped.dev
|
|
| | | In this post, we are going to take a deep dive into pointer tagging, where metadata is encoded into a word-sized pointer. Doing so allows us to keep a compact representation that can be passed around in machine registers. This is very common in implementing dynamic programming languages, but can really be used anywhere that additional runtime information is needed about a pointer. We will look at a handful of different ways these pointers can be encoded and see how the compiler can optimize them for diff... | ||
