BiteSizedChunks.comLearn one small thing at a time.

Courses Suggested Paths Pricing

Course contentsShowHide

737std::vector internals
738vector capacity and reserve
739vector shrink_to_fit
740vector emplace_back
741vector insert and erase
742Erase-remove idiom
743std::erase and std::erase_if in C++20
744Iterator invalidation rules for vector
745vector<bool> pitfalls
746std::array internals
747std::array structured bindings
748std::to_array
749C arrays versus std::array
750std::deque internals
751deque iterator invalidation
752std::list internals
753list splice
754list sort and merge
755list remove
756std::forward_list
757forward_list insert_after
758std::inplace_vector in C++26
759std::hive in C++26
760std::string as a container
761std::basic_string and char traits
762Small string optimization
763std::string_view lifetime hazards
764std::span
765span dynamic and static extent
766std::mdspan in C++23
767mdspan layouts and accessors
768std::valarray
769std::bitset
770std::vector of vectors performance
771Flat matrix layout
772std::map internals
773map operator[] versus at
774map insert, emplace, try_emplace
775insert_or_assign
776map extract and node handles
777Merging maps
778map lower_bound and upper_bound
779map equal_range
780Heterogeneous lookup with transparent comparators
781std::multimap
782std::set operations
783std::multiset
784Custom comparators for ordered containers
785Strict weak ordering
786std::unordered_map internals
787Hash functions and std::hash
788Custom hash specialization
789Hash combine techniques
790Load factor and rehash
791Bucket interface
792Hash flooding and DoS
793std::unordered_set
794std::unordered_multimap
795Heterogeneous lookup for unordered containers in C++20
796std::flat_map in C++23
797std::flat_set in C++23
798std::flat_multimap
799Choosing between map and unordered_map
800Iterator invalidation in associative containers
801Node-based container memory overhead
802Absl flat_hash_map
803Boost.Container
804Boost.Unordered
805Robin Hood hashing
806Open-addressing hash tables
807std::stack
808std::queue
809std::priority_queue
810priority_queue with custom comparator
811Heap algorithms: make_heap and push_heap
812std::pair
813std::tuple
814std::tuple_cat and std::apply
815std::tie and std::ignore
816std::make_tuple and forward_as_tuple
817Tuple-like protocol for structured bindings
818std::optional deep dive
819optional monadic operations in C++23
820std::variant deep dive
821variant visitation patterns
822Overloaded lambda idiom
823valueless_by_exception
824std::any
825std::expected deep dive
826expected monadic operations
827std::bitset operations
828std::chrono::duration as a vocabulary type
829std::reference_wrapper in containers
830std::generator in C++23
831std::stacktrace in C++23
832std::print and std::println
833std::unreachable
834std::byteswap
835std::monostate
836std::in_place tags
837std::nullopt
838std::partial_ordering and friends
839std::type_identity
840std::ranges::to

737std::vector internals
738vector capacity and reserve
739vector shrink_to_fit
740vector emplace_back
741vector insert and erase
742Erase-remove idiom
743std::erase and std::erase_if in C++20
744Iterator invalidation rules for vector
745vector<bool> pitfalls
746std::array internals
747std::array structured bindings
748std::to_array
749C arrays versus std::array
750std::deque internals
751deque iterator invalidation
752std::list internals
753list splice
754list sort and merge
755list remove
756std::forward_list
757forward_list insert_after
758std::inplace_vector in C++26
759std::hive in C++26
760std::string as a container
761std::basic_string and char traits
762Small string optimization
763std::string_view lifetime hazards
764std::span
765span dynamic and static extent
766std::mdspan in C++23
767mdspan layouts and accessors
768std::valarray
769std::bitset
770std::vector of vectors performance
771Flat matrix layout
772std::map internals
773map operator[] versus at
774map insert, emplace, try_emplace
775insert_or_assign
776map extract and node handles
777Merging maps
778map lower_bound and upper_bound
779map equal_range
780Heterogeneous lookup with transparent comparators
781std::multimap
782std::set operations
783std::multiset
784Custom comparators for ordered containers
785Strict weak ordering
786std::unordered_map internals
787Hash functions and std::hash
788Custom hash specialization
789Hash combine techniques
790Load factor and rehash
791Bucket interface
792Hash flooding and DoS
793std::unordered_set
794std::unordered_multimap
795Heterogeneous lookup for unordered containers in C++20
796std::flat_map in C++23
797std::flat_set in C++23
798std::flat_multimap
799Choosing between map and unordered_map
800Iterator invalidation in associative containers
801Node-based container memory overhead
802Absl flat_hash_map
803Boost.Container
804Boost.Unordered
805Robin Hood hashing
806Open-addressing hash tables
807std::stack
808std::queue
809std::priority_queue
810priority_queue with custom comparator
811Heap algorithms: make_heap and push_heap
812std::pair
813std::tuple
814std::tuple_cat and std::apply
815std::tie and std::ignore
816std::make_tuple and forward_as_tuple
817Tuple-like protocol for structured bindings
818std::optional deep dive
819optional monadic operations in C++23
820std::variant deep dive
821variant visitation patterns
822Overloaded lambda idiom
823valueless_by_exception
824std::any
825std::expected deep dive
826expected monadic operations
827std::bitset operations
828std::chrono::duration as a vocabulary type
829std::reference_wrapper in containers
830std::generator in C++23
831std::stacktrace in C++23
832std::print and std::println
833std::unreachable
834std::byteswap
835std::monostate
836std::in_place tags
837std::nullopt
838std::partial_ordering and friends
839std::type_identity
840std::ranges::to

Search the C++ glossary

Lesson 738 of 2,476·11. The Standard Library: ContainersFree lesson

vector capacity and reserve

Writing your lesson…

← Previous Next lesson →

© 2026 BiteSizedChunks.com. Learn one small thing at a time.

Glossary Contact Terms of Service Privacy Policy