Writing Standard Library Compliant Data Structures and Algorithms
summary
Starts by implementing a simple find_all iterator-based algorithm that moves from a vector-only API to one taking input and output iterators, returns the output iterator past the last written element, and runs unchanged on vector, list and multimap via back_inserters. Covers iterator_traits and then builds a templated directed_graph with iterator and allocator support: nodes in a std::vector, adjacency as sets of indices, a const bidirectional iterator, begin/end/rbegin/rend, assign/initializer_list insert/erase semantics, and an allocator-aware node-base trick for exception-safe allocation; iterator immutability prevents modifying algorithms.
AI-written summary · about
related talks
01h 00mSTL Algorithms - why you should use them, and how to write your own
01h 00mBuilding and Extending the Iterator Hierarchy in a Modern, Multicore World
01h 31mThe C++ Vector Challenge
57mWriting Great Libraries: 89 Easy Steps
32mC++ Standard Library "Little Things”
01h 02m“STL Algorithms in Action "
18mPersistent Iterators with Value Semantics
37mEnhancing STL containers