Handling Data Structures in C++
summary
Covers handling data structures in C++ with attention to interoperability with Java and Boost libraries, comparing how different programming languages manage data models. Discusses software development practices and language features useful for designing and manipulating data structures in C++.
AI-written summary · about
chapters (13)
- 0:00Introduction
- 1:50Why C++
- 2:57Computational complexity
- 15:28C++ standard containers
- 22:21Vector: contiguous memory
- 34:05Deque: blocks and random access
- 40:00Stack and queue adapters
- 41:07Priority queue and trees
- 42:29List: fast insertion limits
- 44:19Map and set: balanced trees
- 46:29Hash tables: pros and cons
- 47:10Compiler comparison
- 49:19Multithreading and safety
related talks
01h 01mFunctional C++
40mImmutable Data Structures in C++
01h 04mBetter Code: Data Structures
01h 07mDesign Patterns in Modern C++
01h 00mOLD VERSION: The Fine Details Behind C++ Containers And Algorithms
53mMulti-Paradigm Programming and Beyond
05mMaximising Throughput & Minimising Latency in High-Performance C++ Code
01h 11mC++ in the World of Embedded Systems