Archivo de encabezado de la biblioteca estándar <inplace_vector> (C++26)

// mayormente independiente
#include <compare>
#include <initializer_list>
 
namespace std {
  // Plantilla de clase inplace_vector
  template<class T, size_t N>
  class inplace_vector; // parcialmente independiente
 
  // borrado
  template<class T, size_t N, class U = T>
  constexpr typename inplace_vector<T, N>::size_type erase(inplace_vector<T, N>& c,
                                                           const U& value);
  template<class T, size_t N, class Predicate>
  constexpr typename inplace_vector<T, N>::size_type erase_if(inplace_vector<T, N>& c,
                                                              Predicate pred);
}

namespace std {
  template<class T, size_t N>
  class inplace_vector
  {
  public:
    // tipos:
    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               = /* definido por la implementación */;
    using const_iterator         = /* definido por la implementación */;
    using reverse_iterator       = std::reverse_iterator<iterator>;
    using const_reverse_iterator = std::reverse_iterator<const_iterator>;
 
    // construir/copiar/destruir
    constexpr inplace_vector() noexcept;
    constexpr explicit inplace_vector(size_type n);        // independiente-eliminada
    constexpr inplace_vector(size_type n, const T& value); // independiente-eliminada
    template<class InputIter>
    constexpr inplace_vector(InputIter first, InputIter last); // independiente-eliminada
    template<container-compatible-range<T> R>
    constexpr inplace_vector(from_range_t, R&& rg); // independiente-eliminada
    constexpr 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); // independiente-eliminada
    constexpr ~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>); // independiente-eliminada
    template<class InputIter>
    constexpr void assign(InputIter first, InputIter last); // independiente-eliminada
    template<container-compatible-range<T> R>
    constexpr void assign_range(R&& rg);            // independiente-eliminada
    constexpr void assign(size_type n, const T& u); // independiente-eliminada
    constexpr void assign(initializer_list<T> il);  // independiente-eliminada
 
    // iteradores
    constexpr iterator begin() noexcept;
    constexpr const_iterator begin() const noexcept;
    constexpr iterator end() noexcept;
    constexpr const_iterator end() const noexcept;
    constexpr reverse_iterator rbegin() noexcept;
    constexpr const_reverse_iterator rbegin() const noexcept;
    constexpr reverse_iterator rend() noexcept;
    constexpr const_reverse_iterator rend() const noexcept;
 
    constexpr const_iterator cbegin() const noexcept;
    constexpr const_iterator cend() const noexcept;
    constexpr const_reverse_iterator crbegin() const noexcept;
    constexpr const_reverse_iterator crend() const noexcept;
 
    // tamaño/capacidad
    constexpr bool empty() const noexcept;
    constexpr size_type size() const noexcept;
    static constexpr size_type max_size() noexcept;
    static constexpr size_type capacity() noexcept;
    constexpr void resize(size_type sz);             // independiente-eliminada
    constexpr void resize(size_type sz, const T& c); // independiente-eliminada
    static constexpr void reserve(size_type n);      // independiente-eliminada
    static constexpr void shrink_to_fit() noexcept;
 
    // acceso a elementos
    constexpr reference operator[](size_type n);
    constexpr const_reference operator[](size_type n) const;
    constexpr reference at(size_type n);             // independiente-eliminada
    constexpr const_reference at(size_type n) const; // independiente-eliminada
    constexpr reference front();
    constexpr const_reference front() const;
    constexpr reference back();
    constexpr const_reference back() const;
 
    // acceso a datos
    constexpr T* data() noexcept;
    constexpr const T* data() const noexcept;
 
    // modificadores
    template<class... Args>
    constexpr reference emplace_back(Args&&... args); // independiente-eliminada
    constexpr reference push_back(const T& x);        // independiente-eliminada
    constexpr reference push_back(T&& x);             // independiente-eliminada
    template<container-compatible-range<T> R>
    constexpr void append_range(R&& rg); // independiente-eliminada
    constexpr void 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>
    constexpr ranges::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); // independiente-eliminada
    constexpr iterator insert(const_iterator position,
                              const T& x);                     // independiente-eliminada
    constexpr iterator insert(const_iterator position, T&& x); // independiente-eliminada
    constexpr iterator insert(const_iterator position,
                              size_type n, // independiente-eliminada
                              const T& x);
    template<class InputIter>
    constexpr iterator insert(const_iterator position, // independiente-eliminada
                              InputIter first,
                              InputIter last);
    template<container-compatible-range<T> R>
    constexpr iterator insert_range(const_iterator position,
                                    R&& rg);           // independiente-eliminada
    constexpr iterator insert(const_iterator position, // independiente-eliminada
                              initializer_list<T> il);
    constexpr iterator erase(const_iterator position);
    constexpr iterator erase(const_iterator first, const_iterator last);
    constexpr void swap(inplace_vector& x) noexcept(N == 0 ||
                                                    (is_nothrow_swappable_v<T> &&
                                                     is_nothrow_move_constructible_v<T>));
    constexpr void clear() noexcept;
 
    constexpr friend bool operator==(const inplace_vector& x, const inplace_vector& y);
    constexpr friend /*resultado-de-tres-vías-sintetizado*/<T> operator<=>(const inplace_vector& x,
                                                                           const inplace_vector& y);
    constexpr friend void swap(inplace_vector& x, inplace_vector& y) noexcept(
      N == 0 || (is_nothrow_swappable_v<T> && is_nothrow_move_constructible_v<T>))
    {
      x.swap(y);
    }
  };
}