HackerTube 中文?

CppCon 2014: Chandler Carruth "Efficiency with Algorithms, Performance with Data Structures"

CppConYouTube ↗

Further reading 1

What does a module promise its callers? →Try replacing a module whose callers rely on its incidental return order. Start with what the interface says, then trace the decisions it hides and the behaviors people have learned to expect.This video helps answer · Where did the hidden cost go?

Caption notes

Carruth compares data structures by following collision probes through memory. Tables with similar lookup complexity can make different demands on caches and pointer chasing.

Video or transcript source ↗
Original passages · 2
maximize the cache locality of of handling a collision
CppCon 2014: Chandler Carruth "Efficiency with Algorithms, Performance with Data Structures" · ▶ 49:33–49:43
use contiguous dense data structures
CppCon 2014: Chandler Carruth "Efficiency with Algorithms, Performance with Data Structures" · ▶ 55:15–55:21

Hacker News comments

View original on HN ↗