[[["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."],[[["`SmallRevBitSet` represents a small, reversible bitset with a maximum size of 64, making it suitable for managing supports."],["It provides methods for setting and clearing bits (`SetToOne`, `SetToZero`), checking cardinality (`Cardinality`, `IsCardinalityOne`, `IsCardinalityZero`), and identifying the first set bit (`GetFirstOne`)."],["This class is designed for efficiency and is automatically generated for integration within the OR-Tools constraint solver."]]],["The `SmallRevBitSet` class manages a bitset with a maximum size of 64, used for maintaining supports. Key actions include setting a bit to one (`SetToOne`) or zero (`SetToZero`) at a given position. Information retrieval methods include getting the count of bits set to one (`Cardinality`), finding the first bit set to one (`GetFirstOne`), and checking if only one bit is set (`IsCardinalityOne`) or if all are zero (`IsCardinalityZero`). The constructor takes the bitset size as input.\n"]]
