[[["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."],[[["`RevPartialSequence` is a C++ class within the OR-Tools constraint solver that represents a partial sequence of items in reverse order."],["It provides methods for ranking elements, querying the ranked status, and retrieving the number of elements ranked first or last."],["You can initialize a `RevPartialSequence` with a vector of items or a specified size."],["The class includes functionality for debugging with `DebugString` and interacting with the solver using methods like `RankFirst` and `RankLast`."]]],["The `RevPartialSequence` class in C++ offers methods for managing a sequence. Key actions include: determining if an element is ranked (`IsRanked`), retrieving the number of first and last ranked elements (`NumFirstRanked`, `NumLastRanked`), and ranking elements as first or last (`RankFirst`, `RankLast`). The class can be constructed with a vector of items or a specific size (`RevPartialSequence`). It also provides a method to get the total `Size` and debug string representation (`DebugString`). There is also a destructor `~RevPartialSequence`.\n"]]
