The end_ set is the first set with cardinality card, that does not fit
in max_card bits. Thus, its bit at position max_card is set, and the
rightmost (card - 1) bits are set.
[[["Easy to understand","easyToUnderstand","thumb-up"],["Solved my problem","solvedMyProblem","thumb-up"],["Other","otherUp","thumb-up"]],[["Missing the information I need","missingTheInformationINeed","thumb-down"],["Too complicated / too many steps","tooComplicatedTooManySteps","thumb-down"],["Out of date","outOfDate","thumb-down"],["Samples / code issue","samplesCodeIssue","thumb-down"],["Other","otherDown","thumb-down"]],["Last updated 2024-08-06 UTC."],[[["`SetRangeWithCardinality` defines a range of sets based on their cardinality, using bit manipulation for efficient representation."],["The range starts with sets of a specified cardinality (`card`) and extends up to, but excludes, sets that require more than `max_card` bits to represent."],["The class provides `begin` and `end` iterators for traversing the sets within the defined range."]]],["The `SetRangeWithCardinality` class in C++ has methods `begin` and `end`, which return a `SetRangeIterator`. The `SetRangeWithCardinality` constructor takes `card` and `max_card` as arguments. The end set is the first set with cardinality `card` that exceeds `max_card` bits. The bit at position `max_card` in this end set is set, along with the (card - 1) rightmost bits.\n"]]
