CloudFlare - Trie Hard - Big Savings On Cloud
Related videos
Cloudflare’s Lavalamp Obsession
The PrimeTime
33.1k views
Cloudflare takes on Next.js
Theo - t3․gg
98.5k views
How React took down Cloudflare
ThePrimeTime
133.7k views
LLMs are in trouble
ThePrimeTime
611.4k views
Things are breaking down
ThePrimeTime
48.7k views
Software Horror Stories | The Standup
ThePrimeTime
119.4k views
HARD truths before switching to Go
ThePrimeTime
355.4k views
Coding Should Be A Vibe
ThePrimeTime
154.3k views
Cheat On Everything - The Standup Ep 5
ThePrimeTime
100.7k views
C Must Die
ThePrimeTime
222.3k views
Unlock all features
FREE: Get instant access to 10 AI summaries, chats, or transcripts per day.
Unlock all features
FREE: Get instant access to 10 AI summaries, chats, or transcripts per day.
Unlock all features
FREE: Get instant access to 10 AI summaries, chats, or transcripts per day.
Unlock all features
FREE: Get instant access to 10 AI summaries, chats, or transcripts per day.
Unlock all features
FREE: Get instant access to 10 AI summaries, chats, or transcripts per day.
Related videos
Cloudflare’s Lavalamp Obsession
The PrimeTime
33.1k views
Cloudflare takes on Next.js
Theo - t3․gg
98.5k views
How React took down Cloudflare
ThePrimeTime
133.7k views
LLMs are in trouble
ThePrimeTime
611.4k views
Things are breaking down
ThePrimeTime
48.7k views
Software Horror Stories | The Standup
ThePrimeTime
119.4k views
HARD truths before switching to Go
ThePrimeTime
355.4k views
Coding Should Be A Vibe
ThePrimeTime
154.3k views
Cheat On Everything - The Standup Ep 5
ThePrimeTime
100.7k views
C Must Die
ThePrimeTime
222.3k views
Top Comments (10)
I thought that at couldflare's scale stuff like this would run on FPGAs.
LOL remember the other day when Prime said there weren't any large scale Rust projects in production?
The big-o notation for map lookups is usually represented in terms of comparison function calls. Lookup in a hash map takes O(1) comparison calls, but the comparison function (or the hash function) can be much more expensive.
Diagramiclis: the Greek god of diagrams and nerd info.
pingora, pingora... pin gora... ping ora
You mentioned Beverly hills ninja in a previous video and I've now seen it. It was really bad and I love it! I laughed so much!
If you are smart, you build hash maps with power of two buckets, then you don't need to use modulo, you can just clear the leading bits to find the bucket number. That alone is a significant improvement vs the % operator.
I love pointer arithmetic.
I learned a lot here. I hope I do Trie Hard one day at work.
Pingooraa
Unlock the Data Inside
Turn Videos into Knowledge
- Get FREE 10/day: transcripts, summaries, chats
- Chat with videos, export text & PDF
- $1 free API credit for RAG, chatbots & research
Free forever plan • All features unlocked
Top Comments (10)
I thought that at couldflare's scale stuff like this would run on FPGAs.
LOL remember the other day when Prime said there weren't any large scale Rust projects in production?
The big-o notation for map lookups is usually represented in terms of comparison function calls. Lookup in a hash map takes O(1) comparison calls, but the comparison function (or the hash function) can be much more expensive.
Diagramiclis: the Greek god of diagrams and nerd info.
pingora, pingora... pin gora... ping ora
You mentioned Beverly hills ninja in a previous video and I've now seen it. It was really bad and I love it! I laughed so much!
If you are smart, you build hash maps with power of two buckets, then you don't need to use modulo, you can just clear the leading bits to find the bucket number. That alone is a significant improvement vs the % operator.
I love pointer arithmetic.
I learned a lot here. I hope I do Trie Hard one day at work.
Pingooraa