/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.
You are here

 dave.cheney.net
How the Go runtime implements maps efficiently (without generics) | Dave Cheney
| | rcoh.me
An Analysis of Hash Map Implementations in Popular Languages
2.9 parsecs away

Travel
| | 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.
| | aradaelli.com
Why I Like D - Andrea Radaelli
1.7 parsecs away

Travel
| | [AI summary] The author discusses their experience with the programming language D, highlighting its features, advantages over C/C++, and reasons for preferring it despite its niche status.
| | artificial-mind.net
Measuring std::unordered_map Badness
2.9 parsecs away

Travel
| | Articles about Graphics, C++, Optimization, Game Development, Programming Languages, and more. Personal blog of Philip Tretter writing under the alias of Artificial Mind.
| | blog.demofox.org
O(1) Data Lookups With Minimal Perfect Hashing « The blog at the bottom of the sea
13.0 parsecs away

Travel
| 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...