Abseil's Open Source Hashtables: 2 Years In - Matt Kulukundis - CppCon 2019
推荐理由
gets into more depth of why this is a good idea
说明
这是2019年由CppCon发布的一部演讲,主题归在Algorithms & data structures。它讲的是swiss table hash tables这一支里的具体问题,而不是把整个领域扫一遍。适合想看推导、证明或实现细节的人。内容上可以概括成:Matt Kulukundis reviews two years of Abseil's Swiss table hashtable, covering post-release optimizations, lessons from rolling it out across Google, design choices, and what global monitoring revealed.这些读者给出的理由,核心是:HN points to it as the authoritative talk on Swiss tables, their design rationale, and real-world effects like Hyrum's law.讲法不绑某一条新闻,过几年仍然可以当材料看。从2021年到2026年,有1位不同的读者在2个不同月份把它推荐出来,其中明确叫别人去看的有0次。适合一次性看完。讲者把一个判断讲透,演示是在给这个判断配例子。如果已经会了基本定义,就把注意力放在它怎么把swiss table hash tables变成能跟着复述的例子。
视频信息
- 频道
- CppCon
- 时长
- 54 分 1 秒
- 发布年份
- 2019
同主题更多
- CppCon 2017: Matt Kulukundis “Designing a Fast, Efficient, Cache-friendly Hash Table, Step by Step”
- The Fast Fourier Transform (FFT): Most Ingenious Algorithm Ever?
- Modern Dictionaries by Raymond Hettinger
- CppCon 2014: Chandler Carruth "Efficiency with Algorithms, Performance with Data Structures"
- CppCon 2017: Juan Pedro Bolivar Puente “Postmodern immutable data structures”
- Sorting Algorithms: Speed Is Found In The Minds of People - Andrei Alexandrescu - CppCon 2019