[[["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\u003eRevPartialSequence\u003c/code\u003e is a C++ class within the OR-Tools constraint solver that represents a partial sequence of items in reverse order.\u003c/p\u003e\n"],["\u003cp\u003eIt provides methods for ranking elements, querying the ranked status, and retrieving the number of elements ranked first or last.\u003c/p\u003e\n"],["\u003cp\u003eYou can initialize a \u003ccode\u003eRevPartialSequence\u003c/code\u003e with a vector of items or a specified size.\u003c/p\u003e\n"],["\u003cp\u003eThe class includes functionality for debugging with \u003ccode\u003eDebugString\u003c/code\u003e and interacting with the solver using methods like \u003ccode\u003eRankFirst\u003c/code\u003e and \u003ccode\u003eRankLast\u003c/code\u003e.\u003c/p\u003e\n"]]],["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"],null,["# RevPartialSequence\n\nC++ Reference: class RevPartialSequence\n=======================================\n\n\nNote: This documentation is automatically generated.\n\n| Method ||\n|----------------------------------------------------------------------------------------------------------------------------|----------------------------------------------------------------------------|\n| [`DebugString`](https://github.com/google/or-tools/blob/v9.4/ortools/constraint_solver/constraint_solveri.h#L2739) | Return type: `std::string ` \u003cbr /\u003e |\n| [`IsRanked`](https://github.com/google/or-tools/blob/v9.4/ortools/constraint_solver/constraint_solveri.h#L2733) | Return type: `bool ` Arguments: `int elt` \u003cbr /\u003e |\n| [`NumFirstRanked`](https://github.com/google/or-tools/blob/v9.4/ortools/constraint_solver/constraint_solveri.h#L2707) | Return type: `int ` \u003cbr /\u003e |\n| [`NumLastRanked`](https://github.com/google/or-tools/blob/v9.4/ortools/constraint_solver/constraint_solveri.h#L2709) | Return type: `int ` \u003cbr /\u003e |\n| [`RankFirst`](https://github.com/google/or-tools/blob/v9.4/ortools/constraint_solver/constraint_solveri.h#L2721) | Return type: `void ` Arguments: `Solver* const solver, int elt` \u003cbr /\u003e |\n| [`RankLast`](https://github.com/google/or-tools/blob/v9.4/ortools/constraint_solver/constraint_solveri.h#L2727) | Return type: `void ` Arguments: `Solver* const solver, int elt` \u003cbr /\u003e |\n| [`RevPartialSequence`](https://github.com/google/or-tools/blob/v9.4/ortools/constraint_solver/constraint_solveri.h#L2681) | Return type: `explicit ` Arguments: `const std::vector\u003cint\u003e& items` \u003cbr /\u003e |\n| [`RevPartialSequence`](https://github.com/google/or-tools/blob/v9.4/ortools/constraint_solver/constraint_solveri.h#L2693) | Return type: `explicit ` Arguments: `int size` \u003cbr /\u003e |\n| [`~RevPartialSequence`](https://github.com/google/or-tools/blob/v9.4/ortools/constraint_solver/constraint_solveri.h#L2705) | \u003cbr /\u003e |\n| [`Size`](https://github.com/google/or-tools/blob/v9.4/ortools/constraint_solver/constraint_solveri.h#L2711) | Return type: `int ` \u003cbr /\u003e |"]]
