Partition a product type over a predicate.
- Template Parameters
-
| Pred | Compile-time predicate |
- Parameters
-
- Returns
- A tuple containing the product type of all values which types satisfies
Pred and the product type of all values which types does not satisfy Pred.
Helper type
{
template<
template<
typename>
typename Pred, kumi::product_type T>
struct partition;
template<template<typename> typename Pred, kumi::product_type T>
using partition_t = typename partition<Pred, T>::type;
}
constexpr auto partition(T &&t) noexcept
Partition a product type over a predicate.
Definition partition.hpp:64
Main KUMI namespace.
Definition algorithm.hpp:11
Computes the type returned by a call to kumi::partition.
Examples:
#include <kumi/kumi.hpp>
#include <type_traits>
#include <iostream>
int main()
{
int a = 4;
double b = 3.1415;
float c = 0.01f;
auto original =
kumi::tuple{a,&a,b,&b,c,&c,
'z',
nullptr};
std::cout << original << "\n";
std::cout << "Pointers first: " << kumi::partition<std::is_pointer>(original) << "\n";
std::cout << "Real first: " << kumi::partition<std::is_floating_point>(original) << "\n";
std::cout << "nullptr first: " << kumi::partition<std::is_null_pointer>(original) << "\n";
}
Fixed-size collection of heterogeneous values.
Definition tuple.hpp:32
#include <kumi/kumi.hpp>
#include <type_traits>
#include <iostream>
int main()
{
int a = 4;
double b = 3.1415;
float c = 0.01f;
auto original =
kumi::tuple{a,&a,b,&b,c,&c,
'z',
nullptr};
std::cout << original << "\n";
std::cout << "Pointers first: " << kumi::partition<std::is_pointer>(original) << "\n";
std::cout << "Real first: " << kumi::partition<std::is_floating_point>(original) << "\n";
std::cout << "nullptr first: " << kumi::partition<std::is_null_pointer>(original) << "\n";
}