C++
- Getting started with C++
- Awesome Book
- Awesome Community
- Awesome Course
- Awesome Tutorial
- Awesome YouTube
- Alignment
- Argument Dependent Name Lookup
- Arithmitic Metaprogramming
- Arrays
- Atomic Types
- Attributes
- auto
- Basic input/output in c++
- Basic Type Keywords
- Bit fields
- Bit Manipulation
- Bit Operators
- Build Systems
- C incompatibilities
- C++ Containers
- C++ Debugging and Debug-prevention Tools & Techniques
- C++ function "call by value" vs. "call by reference"
- C++ Streams
- C++11 Memory Model
- Callable Objects
- Classes/Structures
- Client server examples
- Common compile/linker errors (GCC)
- Compiling and Building
- Concurrency With OpenMP
- Const Correctness
- const keyword
- Constant class member functions
- constexpr
- Copy Elision
- Copying vs Assignment
- Curiously Recurring Template Pattern (CRTP)
- Data Structures in C++
-
Date and time using
header - decltype
- Design pattern implementation in C++
- Digit separators
- Enumeration
- Exceptions
- Explicit type conversions
- Expression templates
- File I/O
- Floating Point Arithmetic
- Flow Control
- Fold Expressions
- Friend keyword
- Function Overloading
- Function Template Overloading
- Futures and Promises
- Header Files
- Implementation-defined behavior
- Inline functions
- Inline variables
- Internationalization in C++
- Iteration
- Iterators
- Keywords
- Lambdas
- Layout of object types
- Linkage specifications
- Literals
- Loops
- Memory management
- Metaprogramming
- More undefined behaviors in C++
- Move Semantics
- mutable keyword
- Mutexes
- Namespaces
- Non-Static Member Functions
- One Definition Rule (ODR)
- Operator Overloading
- operator precedence
- Optimization
- Optimization in C++
- Overload resolution
- Parameter packs
- Perfect Forwarding
- Pimpl Idiom
- Pointers
- Pointers to members
- Polymorphism
- Preprocessor
- Profiling
- RAII: Resource Acquisition Is Initialization
- Random number generation
- Recursion in C++
- Recursive Mutex
- Refactoring Techniques
- References
- Regular expressions
- Resource Management
- Return Type Covariance
- Returning several values from a function
- RTTI: Run-Time Type Information
- Scopes
- Semaphore
- SFINAE (Substitution Failure Is Not An Error)
- Side by Side Comparisons of classic C++ examples solved via C++ vs C++11 vs C++14 vs C++17
- Singleton Design Pattern
- Smart Pointers
- Sorting
- Special Member Functions
- Standard Library Algorithms
- static_assert
- std::any
- std::array
- std::atomics
- std::forward_list
- std::function: To wrap any element that is callable
- std::integer_sequence
- std::iomanip
- std::map
- std::optional
- std::pair
- std::set and std::multiset
- std::string
- std::variant
- std::vector
- Accessing Elements
- Concatenating Vectors
- Converting an array to std::vector
- Deleting Elements
- Find max and min Element and Respective Index in a Vector
- Finding an Element in std::vector
- Functions Returning Large Vectors
- Initializing a std::vector
- Inserting Elements
- Iterating Over std::vector
- Iterator/Pointer Invalidation
- Matrices Using Vectors
- Reducing the Capacity of a Vector
- Using a Sorted Vector for Fast Element Lookup
- Using std::vector as a C array
- Vector size and capacity
-
vector
: The Exception To So Many, So Many Rules - Storage class specifiers
- Stream manipulators
- Templates
- The ISO C++ Standard
- The Rule of Three, Five, And Zero
- The This Pointer
- Thread synchronization structures
- Threading
- Trailing return type
- type deduction
- Type Erasure
- Type Inference
- Type Keywords
- Type Traits
- Typedef and type aliases
- Undefined Behavior
- Unions
- Unit Testing in C++
- Unnamed types
- Unspecified behavior
- User-Defined Literals
- Using declaration
- Using std::unordered_map
- Value and Reference Semantics
- Value Categories
- Variable Declaration Keywords
- Virtual Member Functions
C++ std::vector
Introduction
A vector is a dynamic array with automatically handled storage. The elements in a vector can be accessed just as efficiently as those in an array with the advantage being that vectors can dynamically change in size.
In terms of storage the vector data is (usually) placed in dynamically allocated memory thus requiring some minor overhead; conversely C-arrays and std::array use automatic storage relative to the declared location and thus do not have any overhead.
Remarks
Use of an std::vector requires the inclusion of the <vector> header using #include <vector>.
Elements in a std::vector are stored contiguously on the free store. It should be noted that when vectors are nested as in std::vector<std::vector<int> >, the elements of each vector are contiguous, but each vector allocates its own underlying buffer on the free store.
std::vector Related Examples
- Accessing Elements
- Concatenating Vectors
- Converting an array to std::vector
- Deleting Elements
- Find max and min Element and Respective Index in a Vector
- Finding an Element in std::vector
- Functions Returning Large Vectors
- Initializing a std::vector
- Inserting Elements
- Iterating Over std::vector
- Iterator/Pointer Invalidation
- Matrices Using Vectors
- Reducing the Capacity of a Vector
- Using a Sorted Vector for Fast Element Lookup
- Using std::vector as a C array
- Vector size and capacity
-
vector
: The Exception To So Many, So Many Rules
