A subset of the counts held as its steps: the positions where membership flips, strictly increasing, from outside at 0. At most K steps, so at most K / 2 runs.
More...
|
| struct | Member |
| | The subobject surface: a member is a count the run list holds, and its inclusion into the counts is the count itself. More...
|
|
|
using | Domain = N |
|
using | Codomain = bool |
|
using | logic_species = Boole |
|
|
constexpr N | ι (const Member &m) const |
| constexpr bool | operator() (N x) const |
|
template<std::size_t J> |
| constexpr bool | operator== (const RunList< N, J > &o) const |
| | The sets' equality, whatever the two bounds: the same steps.
|
template<IsCountWord N, std::size_t K>
struct dedekind::category::RunList< N, K >
A subset of the counts held as its steps: the positions where membership flips, strictly increasing, from outside at 0. At most K steps, so at most K / 2 runs.
- Template Parameters
-
| N | the counts. |
| K | the bound on the steps. |
◆ operator()()
template<IsCountWord N, std::size_t K>
- Parameters
-
- Returns
- whether it lies in the set: an odd number of steps at or before it.
The documentation for this struct was generated from the following file: