kumi
v3.1.0
Exquisite Epidote
Loading...
Searching...
No Matches
◆
min()
[1/2]
template<concepts::product_type T>
auto kumi::min
(
T &&
t
)
inline
nodiscard
constexpr
noexcept
Computes the minimum value all elements of t.
Parameters
t
Tuple to inspect
Returns
The minimum value of all elements of t
Helper type
namespace
kumi
{
template
<
typename
T>
struct
min
;
template
<
typename
T>
using
min_t =
typename
min<T>::type
;
}
kumi::min
constexpr auto min(T &&t) noexcept
Computes the minimum value all elements of t.
Definition
minmax.hpp:156
kumi
Main KUMI namespace.
Definition
algorithm.hpp:11
Computes the type returned by a call to
kumi::min
.
Examples:
#include <kumi/kumi.hpp>
#include <iostream>
int
main()
{
auto
f0 =
kumi::tuple
{1,
'A'
, -9.77f, 3. };
auto
f1 =
kumi::tuple
{2., f0, 3.f };
std::cout <<
kumi::min
(f0, [](
auto
m) {
return
sizeof
(m); }) <<
"\n"
;
std::cout <<
kumi::min
(f1, [](
auto
m) {
return
sizeof
(m); }) <<
"\n"
;
}
kumi::tuple
Fixed-size collection of heterogeneous values.
Definition
tuple.hpp:29
#include <kumi/kumi.hpp>
#include <iostream>
int
main()
{
using namespace
kumi::literals;
auto
f0 =
kumi::record
{
"a"
_id = 1,
"b"
_id =
'A'
,
"c"
_id =-9.77f,
"d"
_id =3. };
auto
f1 =
kumi::record
{
"a"
_id =2.,
"b"
_id =f0,
"c"
_id =3.f };
std::cout <<
kumi::min
(f0, [](
auto
m) {
return
sizeof
(m); }) <<
"\n"
;
std::cout <<
kumi::min
(f1, [](
auto
m) {
return
sizeof
(m); }) <<
"\n"
;
}
kumi::record
Fixed-size collection of heterogeneous fields necessarily named, names are unique.
Definition
record.hpp:29
kumi