thinking about getting mad and writing a messed up hashmap
November 13, 2025 at 7:58 PM
thinking about getting mad and writing a messed up hashmap
LazyLock<Mutex<HashMap<String, Weak<Mutex<Workspace>>>>>
rust is my passion
rust is my passion
February 27, 2025 at 6:46 PM
LazyLock<Mutex<HashMap<String, Weak<Mutex<Workspace>>>>>
rust is my passion
rust is my passion
why don’t we just put a HashMap there. now it’s 50 times faster
November 21, 2024 at 12:44 AM
why don’t we just put a HashMap there. now it’s 50 times faster
everything about the computer would suck so much more without the humble hashmap
April 28, 2024 at 12:35 AM
everything about the computer would suck so much more without the humble hashmap
Biscuits: A very fast concurrent hashmap with transactions for Go.
It's like sync.Map but can work on multiple keys atomically.
🚀
github.com/tidwall/bisc...
It's like sync.Map but can work on multiple keys atomically.
🚀
github.com/tidwall/bisc...
GitHub - tidwall/biscuits: Fast concurrent hashmap for rapidly changing keys
Fast concurrent hashmap for rapidly changing keys. Contribute to tidwall/biscuits development by creating an account on GitHub.
github.com
May 28, 2026 at 1:38 AM
Biscuits: A very fast concurrent hashmap with transactions for Go.
It's like sync.Map but can work on multiple keys atomically.
🚀
github.com/tidwall/bisc...
It's like sync.Map but can work on multiple keys atomically.
🚀
github.com/tidwall/bisc...
you know what, I take it back. in every memory-unsafe language, a hashmap is probabilistic.
and the house always wins.
and the house always wins.
well no. a hash map is not a probabilistic structure
(...in most languages)
(...in most languages)
September 2, 2026 at 2:36 PM
you know what, I take it back. in every memory-unsafe language, a hashmap is probabilistic.
and the house always wins.
and the house always wins.
There are like only three design patterns you need to use 80% to make stuff good and fast and elegant
Make it a lookup (hashmap)
Split it up into smaller pieces (sharding)
Combine it into one large piece (map reduce)
Make it a lookup (hashmap)
Split it up into smaller pieces (sharding)
Combine it into one large piece (map reduce)
July 16, 2026 at 12:49 PM
There are like only three design patterns you need to use 80% to make stuff good and fast and elegant
Make it a lookup (hashmap)
Split it up into smaller pieces (sharding)
Combine it into one large piece (map reduce)
Make it a lookup (hashmap)
Split it up into smaller pieces (sharding)
Combine it into one large piece (map reduce)
For maximum confusion I’m updating the HashMap iterator to gain DoubleEndedIterator but `next_back` just calls `next`. Iteration order is supposed to be unpredictable anyway riiight
July 8, 2026 at 1:04 AM
For maximum confusion I’m updating the HashMap iterator to gain DoubleEndedIterator but `next_back` just calls `next`. Iteration order is supposed to be unpredictable anyway riiight
Have you tried HashMap though?
I'm only half joking, all you need to get a DI container going is a HashMap, that's gotta be the most pragmatic
blog.p-y.wtf/diy-your-own...
#AndroidDev
I'm only half joking, all you need to get a DI container going is a HashMap, that's gotta be the most pragmatic
blog.p-y.wtf/diy-your-own...
#AndroidDev
DIY: your own Dependency Injection library!
Demystifying the internals of DI libraries
blog.p-y.wtf
October 18, 2025 at 11:56 AM
Have you tried HashMap though?
I'm only half joking, all you need to get a DI container going is a HashMap, that's gotta be the most pragmatic
blog.p-y.wtf/diy-your-own...
#AndroidDev
I'm only half joking, all you need to get a DI container going is a HashMap, that's gotta be the most pragmatic
blog.p-y.wtf/diy-your-own...
#AndroidDev
I was curious about the performance of a hasmap vs linear vs binary search array for small collections with small keys. HashMap was hashbrown with ahash. Keys were u32s.
For missed lookups the hashmap begins outperforming the array at 2(!) keys.
For missed lookups the hashmap begins outperforming the array at 2(!) keys.
April 12, 2024 at 11:42 AM
I was curious about the performance of a hasmap vs linear vs binary search array for small collections with small keys. HashMap was hashbrown with ahash. Keys were u32s.
For missed lookups the hashmap begins outperforming the array at 2(!) keys.
For missed lookups the hashmap begins outperforming the array at 2(!) keys.
Yearly reminder to not use the default hashmap in rust unless you really do need the hashdos protections.
nnethercote.github.io/perf-book/ha...
nnethercote.github.io/perf-book/ha...
Hashing - The Rust Performance Book
nnethercote.github.io
July 2, 2026 at 10:04 AM
Yearly reminder to not use the default hashmap in rust unless you really do need the hashdos protections.
nnethercote.github.io/perf-book/ha...
nnethercote.github.io/perf-book/ha...
> writing javascript code
> ask Brendan Eich if the array is a vector or a hashmap
> he doesn't understand
> pull out diagram explaining O(1) vs O(n log n) access time
> he laughs and says "it's a good data structure sir"
> allocate an array
> arr[0] and arr["0"] both resolve to the same bucket
> ask Brendan Eich if the array is a vector or a hashmap
> he doesn't understand
> pull out diagram explaining O(1) vs O(n log n) access time
> he laughs and says "it's a good data structure sir"
> allocate an array
> arr[0] and arr["0"] both resolve to the same bucket
February 13, 2026 at 12:12 AM
> writing javascript code
> ask Brendan Eich if the array is a vector or a hashmap
> he doesn't understand
> pull out diagram explaining O(1) vs O(n log n) access time
> he laughs and says "it's a good data structure sir"
> allocate an array
> arr[0] and arr["0"] both resolve to the same bucket
> ask Brendan Eich if the array is a vector or a hashmap
> he doesn't understand
> pull out diagram explaining O(1) vs O(n log n) access time
> he laughs and says "it's a good data structure sir"
> allocate an array
> arr[0] and arr["0"] both resolve to the same bucket
🧵 on using HashMaps in #rustlang👇
Imagine we are a university and we want to keep track of our professors and the courses they teach.
Let's implement a simple in-memory database using a HashMap and discuss various HashMap operations.
Imagine we are a university and we want to keep track of our professors and the courses they teach.
Let's implement a simple in-memory database using a HashMap and discuss various HashMap operations.
December 27, 2024 at 11:12 AM
🧵 on using HashMaps in #rustlang👇
Imagine we are a university and we want to keep track of our professors and the courses they teach.
Let's implement a simple in-memory database using a HashMap and discuss various HashMap operations.
Imagine we are a university and we want to keep track of our professors and the courses they teach.
Let's implement a simple in-memory database using a HashMap and discuss various HashMap operations.
god there really is a haskell package for all my worst ideas
dependent-hashmap
Dependent hash maps
hackage.haskell.org
October 4, 2025 at 1:18 PM
god there really is a haskell package for all my worst ideas
Yea just shouldn’t have used the same trait for Cow and HashMap::get
March 25, 2025 at 11:58 AM
Yea just shouldn’t have used the same trait for Cow and HashMap::get
chapter 3: for the love of god, use a HashMap instead of a Vec for your object soup
February 16, 2025 at 5:56 PM
chapter 3: for the love of god, use a HashMap instead of a Vec for your object soup
this is a sorta interesting difference between javascript and rust. something something values vs references
![use std::collections::HashMap;
fn main() {
let mut x: HashMap<Vec<i32>, i32> = HashMap::new();
x.insert(vec![1], 0);
x.insert(vec![1], 0);
x.insert(vec![1], 0);
assert_eq!(x.len(), 1);
}](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:v2qxemzaubz6mescdkvddqg3/bafkreigopfzokxh44oyyysz4juvrv3c4ut3gzwjidyerrt3737itd53auy)
![x = new Map();
x.set([1], 0);
x.set([1], 0);
x.set([1], 0);
x.size](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:v2qxemzaubz6mescdkvddqg3/bafkreidxyoc2fp3d355b7hdncnfrdbmh3cg2sysqma6g22jburzpb4yefy)
January 1, 2026 at 3:28 AM
this is a sorta interesting difference between javascript and rust. something something values vs references
E pra quem tá acompanhando nossa série aprendendo Rust, mais um episódio! www.youtube.com/watch?v=BdCP...
Aprendendo Rust [#11] - HashMap
YouTube video by TeclasDois
www.youtube.com
August 14, 2026 at 4:56 PM
E pra quem tá acompanhando nossa série aprendendo Rust, mais um episódio! www.youtube.com/watch?v=BdCP...
why does the console telling me it doesnt know what a hashmap is
May 14, 2024 at 11:59 PM
why does the console telling me it doesnt know what a hashmap is
i just used a hashmap serialized to disk every 20 seconds as a user login database so
March 23, 2024 at 11:19 PM
i just used a hashmap serialized to disk every 20 seconds as a user login database so
immanentizing. but who among us— @minormobius.bsky.social — could create the hashmap of all simcluster jokes...
July 23, 2026 at 10:16 PM
immanentizing. but who among us— @minormobius.bsky.social — could create the hashmap of all simcluster jokes...
the little side quest hobby project is nowhere near finished, or working
but after 1000 lines of code i have finally gotten though the boilerplate and made it do a thing
it's an mvcc hashmap with serializable transactions, and i got a read only snapshot running while i made changes, neat
but after 1000 lines of code i have finally gotten though the boilerplate and made it do a thing
it's an mvcc hashmap with serializable transactions, and i got a read only snapshot running while i made changes, neat
December 7, 2024 at 4:07 PM
the little side quest hobby project is nowhere near finished, or working
but after 1000 lines of code i have finally gotten though the boilerplate and made it do a thing
it's an mvcc hashmap with serializable transactions, and i got a read only snapshot running while i made changes, neat
but after 1000 lines of code i have finally gotten though the boilerplate and made it do a thing
it's an mvcc hashmap with serializable transactions, and i got a read only snapshot running while i made changes, neat