#include <algorithm>
#include <array>
#include <concepts>
#include <initializer_list>
#include <iterator>
#include <ranges>
#include <stdexcept>
|
template<class T , class... U>
requires (... && std::convertible_to<U, T>) |
| | CSet (T, U...) -> CSet< T, 1+sizeof...(U)> |
| |
| template<typename Key , std::size_t Size> |
| consteval auto | make_set (Key(&&k)[Size]) -> CSet< Key, Size > |
| | Helper if the Key type of the CSet should be different than the provided values.
|
| |
◆ CSet()
template<class T , class... U>
requires (... && std::convertible_to<U, T>)
| CSet |
( |
T | , |
|
|
U... | ) -> CSet< T, 1+sizeof...(U)> |
◆ make_set()
template<typename Key , std::size_t Size>
| auto make_set |
( |
Key(&&) | k[Size] | ) |
-> CSet<Key, Size>
|
|
consteval |
Helper if the Key type of the CSet should be different than the provided values.