#include <array>
#include <concepts>
#include <cstddef>
#include <tuple>
#include <utility>
Go to the source code of this file.
|
| namespace | wpi |
| | Foonathan namespace.
|
| |
| namespace | std |
| | Implement std::hash so that hash_code can be used in STL containers.
|
| |
|
| template<typename T , std::convertible_to< T >... Ts> |
| | wpi::array (T, Ts...) -> array< T, 1+sizeof...(Ts)> |
| |
template<size_t I, typename T , size_t N>
requires (I < N) |
| constexpr T & | get (wpi::array< T, N > &arr) noexcept |
| |
template<size_t I, typename T , size_t N>
requires (I < N) |
| constexpr T && | get (wpi::array< T, N > &&arr) noexcept |
| |
template<size_t I, typename T , size_t N>
requires (I < N) |
| constexpr const T & | get (const wpi::array< T, N > &arr) noexcept |
| |
template<size_t I, typename T , size_t N>
requires (I < N) |
| constexpr const T && | get (const wpi::array< T, N > &&arr) noexcept |
| |
◆ get() [1/4]
template<size_t I, typename T , size_t N>
requires (I < N)
◆ get() [2/4]
template<size_t I, typename T , size_t N>
requires (I < N)
◆ get() [3/4]
template<size_t I, typename T , size_t N>
requires (I < N)
◆ get() [4/4]
template<size_t I, typename T , size_t N>
requires (I < N)