LAL: Linear Arrangement Library 23.01.00
A library focused on algorithms on linear arrangements of graphs.
|
From a list of Boolean values, find the first that is set to true. More...
#include <first_true.hpp>
Classes | |
struct | _ft_impl |
Implementation of first_true. More... | |
struct | _ft_impl< idx, v > |
Implementation of first_true. More... | |
Static Public Attributes | |
static constexpr std::size_t | value = _ft_impl<0, values...>::value |
The index of the value in values set to true. | |
From a list of Boolean values, find the first that is set to true.
If there is no value set to true, then the index will be equal to the amount of values in the list.
values | List of Boolean values known at compile time. |