- Introduction
- References
- 1. Algorithms
❱
- 1.1. Time complexity overview
- 1.2. std::find
- 1.3. std::find_if
- 1.4. std::count/std::count_if
- 1.5. std::all_of/std::any_of/std:none_of
- 1.6. std::for_each
- 1.7. std::equal
- 1.8. std::mismatch
- 1.9. std::search
- 1.10. std::adjacent_find
- 1.11. std::binary_search
- 1.12. std::sort
- 1.13. std::stable_sort
- 1.14. std::partial_sort
- 1.15. std::is_sorted
- 1.16. std::transform
- 1.17. std::copy/std::copy_if
- 1.18. std::fill/std::fill_n
- 1.19. std::replace/std::replace_if
- 1.20. std::remove_if
- 1.21. std::unique
- 1.22. std::reverse
- 1.23. std::accumulate
- 1.24. std::iota
- 1.25. std::reduce
- 1.26. std::min_element/std::max_element/std::minmax_element
- 1.27. std::clamp
- 1.28. std::partition
- 1.29. std::set_intersection/std::set_union/std::set_difference
- 1.30. std::merge
- 1.31. std::generate
- 1.32. std::rotate
- 1.33. std::shuffle
- 1.34. std::next_permutation
- 2. Data structures
❱
- 2.1. std::array
- 2.2. std::vector
- 2.3. std::deque
- 2.4. std::list
- 2.5. std::forward_list
- 2.6. std::map
- 2.7. std::unordered_map
- 2.8. std::flat_map
- 2.9. std::set/std::unordered_set
- 2.10. std::multimap/std::multiset
- 2.11. std::pair
- 2.12. std::tuple
- 2.13. std::string
- 2.14. std::span
- 2.15. std::string_view
- 2.16. std::stack
- 2.17. std::queue
- 2.18. std::priority_queue
- 3. Design patterns and idioms
❱
- 3.1. Visitor pattern
- 3.2. Factory pattern
- 3.3. CRTP (Curiously Recurring Template Pattern)
- 3.4. RAII (Resource Acquisition Is Initialization)
- 3.5. Singleton