Faster than Rust and C++: the PERFECT hash table
I had a week of fun designing and optimizing a perfect hash table. In this video, I take you through the journey of making a hash table 10 times faster and share performance tips along the way. 00:00 why are hash tables important? 00:31 how hash tables work 02:40 a naïve hash table 04:35 custom hash function 08:52 perfect hash tables 12:03 my perfect hash table 14:20 beating gperf 17:24 beating memcmp 21:46 beating SIMD 26:01 even faster? 30:06 pop quiz answers 31:45 beating cmov 33:09 closing thoughts Thanks: Dave Churchill: / davechurchill My Twitch chat: / strager Jennipuff: / jenipuff Attribution: Thumbnail artwork by Jennipuff JavaScript logo by Christopher Williams under MIT license PHP logo copyright Colin Viebrock, Creative Commons Attribution-Share Alike 4.0 International Ruby logo copyright © 2006, Yukihiro Matsumoto, Creative Commons Attribution-ShareAlike 2.5

The Dark Side of .reserve()

Big O myths busted! (Time complexity is complicated)

Prime Reacts: From C to C++ to Rust to Haskell

CppCon 2017: Matt Kulukundis “Designing a Fast, Efficient, Cache-friendly Hash Table, Step by Step”

AI Bubble vs Dot Com Crash. History is REPEATING

going fast is about doing less

500 million voxels/sec - Voxel engine optimizations

This Battery Lasts for 30 Years And China Just Put It on the Grid

Why Haven't We Had That Oil Crisis... Yet?

Why AI Suddenly Looks Extra Bubbly

HashMaps & Dictionaries, Explained Simply

A Simpler Way to See Results

Bun Moved To Rust... Zig's Creator Fired Back

Constructors Are Broken

But what is cross-entropy? | Compression is Intelligence Part 2

C++ vs Rust: which is faster?

Rust Functions Are Weird (But Be Glad)

The Riskiest Moment of the AI Bubble

Andrew Kelley: A Practical Guide to Applying Data Oriented Design (DoD)

