[[["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\u003eSmallRevBitSet\u003c/code\u003e represents a small, reversible bitset with a maximum size of 64, making it suitable for managing supports.\u003c/p\u003e\n"],["\u003cp\u003eIt provides methods for setting and clearing bits (\u003ccode\u003eSetToOne\u003c/code\u003e, \u003ccode\u003eSetToZero\u003c/code\u003e), checking cardinality (\u003ccode\u003eCardinality\u003c/code\u003e, \u003ccode\u003eIsCardinalityOne\u003c/code\u003e, \u003ccode\u003eIsCardinalityZero\u003c/code\u003e), and identifying the first set bit (\u003ccode\u003eGetFirstOne\u003c/code\u003e).\u003c/p\u003e\n"],["\u003cp\u003eThis class is designed for efficiency and is automatically generated for integration within the OR-Tools constraint solver.\u003c/p\u003e\n"]]],["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"],null,["# SmallRevBitSet\n\nC++ Reference: class SmallRevBitSet\n===================================\n\n\nNote: This documentation is automatically generated.\nThis class represents a small reversible bitset (size \\\u003c= 64). This class is useful to maintain supports.\n\n| Method ||\n|-------------------------------------------------------------------------------------------------------------------------|--------------------------------------------------------------------------------------------------------------------|\n| [`Cardinality`](https://github.com/google/or-tools/blob/v9.4/ortools/constraint_solver/constraint_solveri.h#L405) | Return type: `int64_t ` Returns the number of bits set to one. |\n| [`GetFirstOne`](https://github.com/google/or-tools/blob/v9.4/ortools/constraint_solver/constraint_solveri.h#L414) | Return type: `int64_t ` Gets the index of the first bit set starting from 0. It returns -1 if the bitset is empty. |\n| [`IsCardinalityOne`](https://github.com/google/or-tools/blob/v9.4/ortools/constraint_solver/constraint_solveri.h#L409) | Return type: `bool ` Does it contains only one bit set? |\n| [`IsCardinalityZero`](https://github.com/google/or-tools/blob/v9.4/ortools/constraint_solver/constraint_solveri.h#L407) | Return type: `bool ` Is bitset null? |\n| [`SetToOne`](https://github.com/google/or-tools/blob/v9.4/ortools/constraint_solver/constraint_solveri.h#L401) | Return type: `void ` Arguments: `Solver* const solver, int64_t pos` Sets the 'pos' bit. |\n| [`SetToZero`](https://github.com/google/or-tools/blob/v9.4/ortools/constraint_solver/constraint_solveri.h#L403) | Return type: `void ` Arguments: `Solver* const solver, int64_t pos` Erases the 'pos' bit. |\n| [`SmallRevBitSet`](https://github.com/google/or-tools/blob/v9.4/ortools/constraint_solver/constraint_solveri.h#L399) | Return type: `explicit ` Arguments: `int64_t size` \u003cbr /\u003e |"]]
