talk · HACKER NEWS RECOMMENDATION
CppCon 2015: Sean Parent "Better Code: Data Structures"
CppCon · 3 HN recommenders · 3 recommendation months
Recommended by 3 Hacker News commenters across 3 months (2016–2021).
SignalTube analysis
Among 132 other talk videos tagged C, C++, Rust, Go & systems languages, the mean is 3.1 distinct HN recommenders. This video has 3 distinct HN recommenders, close to that mean. Recommendations span 3 distinct months; the peer average is 3.2 months. This is a data-derived comparison, not a human review or quality rating.
75% of its 4 labeled comments are marked as recommendations or strong recommendations. HN mention years are 2016–2021; those years describe discussion history, not upload date. Its verified runtime is 64 minutes 0 seconds. YouTube lists its publication date as 2015-09-25.
- Channel / speaker
- CppCon
- Verified runtime
- 1h 4m 0s
- YouTube upload date
- 2015-09-25
- Hacker News mention years
- 2016–2021
SAME TOPIC AND FORMAT
Compare with related videos
The comparison cohort uses other talk videos in C, C++, Rust, Go & systems languages. “Shared recommenders” counts HN users who recommended both videos in the source graph.
| Video | HN recommenders | Recommendation months | Positive label share | Shared recommenders | Runtime | Upload date |
|---|---|---|---|---|---|---|
| CppCon 2015: Sean Parent "Better Code: Data Structures"Current video | 3 | 3 | 75% | — | 1h 4m 0s | 2015-09-25 |
| Lexical Scanning in Go - Rob Piketalk · GoogleFOSSSydney | 13 | 12 | 65% | No recorded overlap | 51m 18s | 2011-08-30 |
| CppCon 2016: Jason Turner “Rich Code for Tiny Computers: A Simple Commodore 64 Game in C++17”talk · CppCon | 13 | 10 | 65% | No recorded overlap | 79m 52s | 2016-09-24 |
| CppCon 2017: Matt Kulukundis “Designing a Fast, Efficient, Cache-friendly Hash Table, Step by Step”talk · CppCon | 9 | 10 | 53% | No recorded overlap | 59m 34s | 2017-10-26 |
THREE SOURCE-BASED CONTEXT POINTS
Why Hacker News recommends it
Each note combines the dataset’s stance label and short rationale; comment bodies are not reproduced. Open the HN source for the original discussion.
The archive classifies this as a strong recommendation in “Ask HN: Programming talks that made something click for you?”. Its short rationale: Changed how commenter thinks about the STL.
The archive classifies this as a strong recommendation in “Type Systems Explained with Examples”. Its short rationale: First 20 minutes change how you think about types.
The archive classifies this as a contextual reference in “Tree traversal without recursion: the tree as a state machine (2007)”. Its short rationale: Beads-and-string toy as a tree data structure.