[[["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\u003eRevBitSet\u003c/code\u003e represents a reversible bitset, primarily used for maintaining supports in constraint programming.\u003c/p\u003e\n"],["\u003cp\u003eIt provides methods for setting, clearing, and checking the status of individual bits within the bitset.\u003c/p\u003e\n"],["\u003cp\u003e\u003ccode\u003eRevBitSet\u003c/code\u003e allows efficient operations for determining cardinality, such as checking if the bitset is empty or contains only one bit.\u003c/p\u003e\n"],["\u003cp\u003eThe class supports reversibility, enabling backtracking and exploration of different solution states.\u003c/p\u003e\n"]]],["The `RevBitSet` class in C++ manages reversible bitsets for maintaining supports. Key actions include: setting a specific bit to one (`SetToOne`) or zero (`SetToZero`), and clearing all bits (`ClearAll`). The class can return the number of bits set (`Cardinality`), check if a specific bit is set (`IsSet`), and determine if only one or no bits are set (`IsCardinalityOne`, `IsCardinalityZero`). It can also return the first bit set starting from a specified index (`GetFirstBit`). The size of the bitset can be set in the constructor (`RevBitSet`).\n"],null,[]]
