Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
|
Recursion ending specialisation of the helper class to build the variant type. The last type T is added as last type to the variant parameters. More...
#include <variant.hpp>
Public Types | |
typedef std::variant< ResTs ... > | std_variant |
template<class T > | |
using | index_in = ext::index_in< T, ResTs ... > |
Recursion ending specialisation of the helper class to build the variant type. The last type T is added as last type to the variant parameters.
ResTs | ... pack of types already accepted as types of the variant |
T | last type to construct the variant from |
using ext::variant_builder_impl< std::variant< ResTs ... > >::index_in = ext::index_in < T, ResTs ... > |
typedef std::variant< ResTs ... > ext::variant_builder_impl< std::variant< ResTs ... > >::std_variant |