Explore >> Select a destination
|
You are here 
|
pdimov.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. | |
| | | | |
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). | |
| | | | |
artificial-mind.net
|
|
| | | | | Articles about Graphics, C++, Optimization, Game Development, Programming Languages, and more. Personal blog of Philip Tretter writing under the alias of Artificial Mind. | |
| | | | |
www.nayuki.io
|
|
| | | [AI summary] The user has provided a comprehensive overview of the x86 architecture, covering topics such as basic arithmetic operations, control flow with jumps and conditionals, memory addressing modes, the stack and calling conventions, advanced instructions like SSE, virtual memory, and differences between x86-32 and x86-64. The user is likely looking for a summary or clarification of the x86 architecture, possibly for learning purposes or to reinforce their understanding. | ||
