[[["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\u003eRevBitMatrix\u003c/code\u003e is a matrix representation of the \u003ccode\u003eRevBitSet\u003c/code\u003e class in C++, providing a way to store and manipulate bits in a two-dimensional structure.\u003c/p\u003e\n"],["\u003cp\u003eIt offers methods for setting, clearing, and checking the status of individual bits within the matrix using row and column indices.\u003c/p\u003e\n"],["\u003cp\u003eFunctionality includes determining the cardinality of rows, finding the first set bit in a row, and checking if a row contains only one or zero bits set.\u003c/p\u003e\n"],["\u003cp\u003eThe class provides constructors for initialization and a destructor for cleanup.\u003c/p\u003e\n"],["\u003cp\u003eMethods like \u003ccode\u003eSetToOne\u003c/code\u003e, \u003ccode\u003eSetToZero\u003c/code\u003e, \u003ccode\u003eClearAll\u003c/code\u003e allow for manipulation of the bit matrix within a solver context.\u003c/p\u003e\n"]]],["The `RevBitMatrix` class, a matrix version of `RevBitSet`, provides methods for bit manipulation. `Cardinality` counts set bits in a row, while `GetFirstBit` finds the first set bit from a start position. `IsCardinalityOne` and `IsCardinalityZero` check if a row has one or zero set bits respectively. `IsSet` checks a specific bit's status. `SetToOne` and `SetToZero` set and clear bits, respectively. `ClearAll` resets all bits. It also has a constructor and destructor.\n"],null,[]]
