/explore
|
You are here 
|
nikita-volkov.github.io | ||
| | | | |
rcoh.me
Few data-structures are more ubiquitous in real-world development than the hash table. Nearly every major programming features an implementation in its standard library or built into the runtime. Yet, there is no conclusive best strategy to implement one and the major programming languages diverge widely in their implementations! I did a survey of the Hash map implementations in Go, Python, Ruby, Java, C#, C++, and Scala to compare and contrast how they were implemented. |
|
| | | | | ||
| | | | |
www.nayuki.io
[AI summary] This article discusses the implementation and optimization of the Whirlpool hash function in x86 assembly, comparing different programming approaches and benchmarking their performance. |
|
| | | | | ||
| | | | |
idea.popcount.org
[AI summary] The article is an introduction to the Hash Array Mapped Trie (HAMT) data structure, explaining its memory-efficient implementation as a compressed variant of a Trie and its applicability to hash tables and search engines. |
|
| | | | | ||
| | | | |
0x44.cc
[AI summary] The article provides an in-depth explanation of reverse engineering concepts, including CPU operations, memory representation, data structures, and disassembly techniques. It guides readers through understanding machine code, endianness, signed integers, and how to analyze C code using tools like Visual Studio and disassemblers. |
|
| | | |||
