Standard library header <inplace_vector> (C++26)

 

C++

Compiler support

Freestanding and hosted

Language

Standard library

Standard library headers

Named requirements

Feature test macros(C++20)

Language support library

Concepts library(C++20)

Diagnostics library

Memory management library

Metaprogramming library(C++11)

General utilities library

Containers library

Iterators library

Ranges library(C++20)

Algorithms library

Strings library

Text processing library

Numerics library

Date and time library

Input/output library

Filesystem library(C++17)

Concurrency support library(C++11)

Execution control library(C++26)

Technical specifications

Symbols index

External libraries

 

Standard library headers

Language support <cfloat> <climits> <compare>(C++20) <contracts>(C++26) <coroutine>(C++20) <csetjmp> <csignal> <cstdarg> <cstddef> <cstdint>(C++11) <cstdlib> <exception> <initializer_list>(C++11)    <limits> <new> <source_location>(C++20) <stdfloat>(C++23) <typeinfo> <version>(C++20) Concepts <concepts>(C++20) Diagnostics <cassert> <cerrno> <debugging>(C++26) <stacktrace>(C++23) <stdexcept> <system_error>(C++11) Memory management <memory> <memory_resource>(C++17) <scoped_allocator>(C++11) Metaprogramming <type_traits>(C++11) <ratio>(C++11)

General utilities <any>(C++17) <bitset> <bit>(C++20) <charconv>(C++17) <expected>(C++23) <format>(C++20) <functional> <optional>(C++17) <stdbit.h>(C++26) <tuple>(C++11) <typeindex>(C++11) <utility> <variant>(C++17) Containers <array>(C++11) <deque> <flat_map>(C++23) <flat_set>(C++23) <forward_list>(C++11) <hive>(C++26) <inplace_vector>(C++26)    <list> <map> <mdspan>(C++23) <queue> <set> <span>(C++20) <stack> <unordered_map>(C++11) <unordered_set>(C++11) <vector> Iterators <iterator> Ranges <generator>(C++23) <ranges>(C++20)

Algorithms <algorithm> <numeric> Strings <cctype> <cstring> <cuchar>(C++11) <cwchar> <cwctype> <string_view>(C++17) <string> Text processing <clocale> <codecvt>(C++11/17/26*) <locale> <regex>(C++11) <text_encoding>(C++26)    Numerics <cfenv>(C++11) <cmath> <complex> <linalg>(C++26) <numbers>(C++20) <random>(C++11) <simd>(C++26) <stdckdint.h>(C++26) <valarray> Time <chrono>(C++11) <ctime> C compatibility <ccomplex>(C++11/17/20*) <ciso646>(until C++20) <cstdalign>(C++11/17/20*) <cstdbool>(C++11/17/20*) <ctgmath>(C++11/17/20*)

Input/output <cinttypes>(C++11) <cstdio> <filesystem>(C++17) <fstream> <iomanip> <iosfwd> <iostream> <ios> <istream> <ostream> <print>(C++23) <spanstream>(C++23) <sstream> <streambuf> <strstream>(C++98/26*) <syncstream>(C++20) Concurrency support <atomic>(C++11) <barrier>(C++20) <condition_variable>(C++11) <future>(C++11) <hazard_pointer>(C++26) <latch>(C++20) <mutex>(C++11) <rcu>(C++26) <semaphore>(C++20) <shared_mutex>(C++14) <stdatomic.h>(C++23) <stop_token>(C++20) <thread>(C++11) Execution support <execution>(C++17)

 

This header is part of the containers library.

Includes
<compare> (C++20)	Three-way comparison operator support
<initializer_list> (C++11)	std::initializer_list class template
Classes
inplace_vector (C++26)	resizable, fixed capacity, inplace contiguous array (class template)
Functions
erase(std::inplace_vector)erase_if(std::inplace_vector) (C++26)	erases all elements satisfying specific criteria (function template)

Synopsis

// mostly freestanding#include <compare>#include <initializer_list>   namespace std {// class template inplace_vectortemplate<class T, size_t N>class inplace_vector;// partially freestanding   // erasuretemplate<class T, size_t N, class U = T>constexprtypename inplace_vector<T, N>::size_type erase(inplace_vector<T, N>& c, const U& value);template<class T, size_t N, class Predicate>constexprtypename inplace_vector<T, N>::size_type erase_if(inplace_vector<T, N>& c, Predicate pred);}

Class template std::inplace_vector

namespace std {template<class T, size_t N>class inplace_vector {public:// types:using value_type = T;using pointer = T*;using const_pointer =const T*;using reference = value_type&;using const_reference =const value_type&;using size_type = size_t;using difference_type = ptrdiff_t;using iterator =/* implementation-defined */;using const_iterator =/* implementation-defined */;using reverse_iterator =std::reverse_iterator<iterator>;using const_reverse_iterator =std::reverse_iterator<const_iterator>;   // construct/copy/destroyconstexpr inplace_vector()noexcept;constexprexplicit inplace_vector(size_type n);// freestanding-deletedconstexpr inplace_vector(size_type n, const T& value);// freestanding-deletedtemplate<class InputIter>constexpr inplace_vector(InputIter first, InputIter last);// freestanding-deletedtemplate<container-compatible-range<T> R>constexpr inplace_vector(from_range_t, R&& rg);// freestanding-deletedconstexpr inplace_vector(const inplace_vector&);constexpr inplace_vector(inplace_vector&&)noexcept( N ==0|| is_nothrow_move_constructible_v<T>);constexpr inplace_vector(initializer_list<T> il);// freestanding-deletedconstexpr ~inplace_vector();constexpr inplace_vector& operator=(const inplace_vector& other);constexpr inplace_vector& operator=(inplace_vector&& other)noexcept( N ==0||(is_nothrow_move_assignable_v<T>&& is_nothrow_move_constructible_v<T>));constexpr inplace_vector& operator=(initializer_list<T>);// freestanding-deletedtemplate<class InputIter>constexprvoid assign(InputIter first, InputIter last);// freestanding-deletedtemplate<container-compatible-range<T> R>constexprvoid assign_range(R&& rg);// freestanding-deletedconstexprvoid assign(size_type n, const T& u);// freestanding-deletedconstexprvoid assign(initializer_list<T> il);// freestanding-deleted   // iteratorsconstexpr iterator begin()noexcept;constexpr const_iterator begin()constnoexcept;constexpr iterator end()noexcept;constexpr const_iterator end()constnoexcept;constexpr reverse_iterator rbegin()noexcept;constexpr const_reverse_iterator rbegin()constnoexcept;constexpr reverse_iterator rend()noexcept;constexpr const_reverse_iterator rend()constnoexcept;   constexpr const_iterator cbegin()constnoexcept;constexpr const_iterator cend()constnoexcept;constexpr const_reverse_iterator crbegin()constnoexcept;constexpr const_reverse_iterator crend()constnoexcept;   // size/capacityconstexprbool empty()constnoexcept;constexpr size_type size()constnoexcept;staticconstexpr size_type max_size()noexcept;staticconstexpr size_type capacity()noexcept;constexprvoid resize(size_type sz);// freestanding-deletedconstexprvoid resize(size_type sz, const T& c);// freestanding-deletedstaticconstexprvoid reserve(size_type n);// freestanding-deletedstaticconstexprvoid shrink_to_fit()noexcept;   // element accessconstexpr reference operator[](size_type n);constexpr const_reference operator[](size_type n)const;constexpr reference at(size_type n);// freestanding-deletedconstexpr const_reference at(size_type n)const;// freestanding-deletedconstexpr reference front();constexpr const_reference front()const;constexpr reference back();constexpr const_reference back()const;   // data accessconstexpr T* data()noexcept;constexprconst T* data()constnoexcept;   // modifierstemplate<class... Args>constexpr reference emplace_back(Args&&... args);// freestanding-deletedconstexpr reference push_back(const T& x);// freestanding-deletedconstexpr reference push_back(T&& x);// freestanding-deletedtemplate<container-compatible-range<T> R>constexprvoid append_range(R&& rg);// freestanding-deletedconstexprvoid pop_back();   template<class... Args>constexpr pointer try_emplace_back(Args&&... args);constexpr pointer try_push_back(const T& x);constexpr pointer try_push_back(T&& x);template<container-compatible-range<T> R>constexprranges::borrowed_iterator_t<R> try_append_range(R&& rg);   template<class... Args>constexpr reference unchecked_emplace_back(Args&&... args);constexpr reference unchecked_push_back(const T& x);constexpr reference unchecked_push_back(T&& x);   template<class... Args>constexpr iterator emplace(const_iterator position, Args&&... args);// freestanding-deletedconstexpr iterator insert(const_iterator position, const T& x);// freestanding-deletedconstexpr iterator insert(const_iterator position, T&& x);// freestanding-deletedconstexpr iterator insert(const_iterator position, size_type n, // freestanding-deletedconst T& x);template<class InputIter>constexpr iterator insert(const_iterator position, // freestanding-deleted InputIter first, InputIter last);template<container-compatible-range<T> R>constexpr iterator insert_range(const_iterator position, R&& rg);// freestanding-deletedconstexpr iterator insert(const_iterator position, // freestanding-deleted initializer_list<T> il);constexpr iterator erase(const_iterator position);constexpr iterator erase(const_iterator first, const_iterator last);constexprvoid swap(inplace_vector& x)noexcept(N ==0||(is_nothrow_swappable_v<T>&& is_nothrow_move_constructible_v<T>));constexprvoid clear()noexcept;   constexprfriendbool operator==(const inplace_vector& x, const inplace_vector& y);constexprfriend/*synth-three-way-result*/<T> operator<=>(const inplace_vector& x, const inplace_vector& y);constexprfriendvoid swap(inplace_vector& x, inplace_vector& y)noexcept( N ==0||(is_nothrow_swappable_v<T>&& is_nothrow_move_constructible_v<T>)){ x.swap(y);}};}