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."],[[["\u003cp\u003e\u003ccode\u003eSetRangeWithCardinality\u003c/code\u003e defines a range of sets based on their cardinality, using bit manipulation for efficient representation.\u003c/p\u003e\n"],["\u003cp\u003eThe range starts with sets of a specified cardinality (\u003ccode\u003ecard\u003c/code\u003e) and extends up to, but excludes, sets that require more than \u003ccode\u003emax_card\u003c/code\u003e bits to represent.\u003c/p\u003e\n"],["\u003cp\u003eThe class provides \u003ccode\u003ebegin\u003c/code\u003e and \u003ccode\u003eend\u003c/code\u003e iterators for traversing the sets within the defined range.\u003c/p\u003e\n"]]],["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"],null,["# SetRangeWithCardinality\n\nC++ Reference: class SetRangeWithCardinality\n============================================\n\n\nNote: This documentation is automatically generated.\n\n| Method ||\n|-----------------------------------------------------------------------------------------------------------------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| [`begin`](https://github.com/google/or-tools/blob/v9.4/ortools/graph/hamiltonian_path.h#L274) | Return type: `SetRangeIterator\u003cSetRangeWithCardinality\u003e ` STL iterator-related methods. |\n| [`end`](https://github.com/google/or-tools/blob/v9.4/ortools/graph/hamiltonian_path.h#L277) | Return type: `SetRangeIterator\u003cSetRangeWithCardinality\u003e ` \u003cbr /\u003e |\n| [`SetRangeWithCardinality`](https://github.com/google/or-tools/blob/v9.4/ortools/graph/hamiltonian_path.h#L264) | \u003cbr /\u003e Arguments: `int card, int max_card` 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. |"]]
