[[["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\u003eRevIntSet\u003c/code\u003e is a C++ class in Google's OR-Tools that represents a reversible integer set with a fixed capacity.\u003c/p\u003e\n"],["\u003cp\u003eIt provides methods for inserting, removing, and restoring elements within the set, allowing for backtracking during constraint solving.\u003c/p\u003e\n"],["\u003cp\u003eThe set's capacity is determined upon creation and cannot be changed, ensuring efficient memory management.\u003c/p\u003e\n"],["\u003cp\u003e\u003ccode\u003eRevIntSet\u003c/code\u003e includes iterators (\u003ccode\u003ebegin\u003c/code\u003e, \u003ccode\u003eend\u003c/code\u003e) to traverse the elements currently present in the set.\u003c/p\u003e\n"],["\u003cp\u003eMethods like \u003ccode\u003eCapacity\u003c/code\u003e, \u003ccode\u003eSize\u003c/code\u003e, \u003ccode\u003eElement\u003c/code\u003e, and \u003ccode\u003eRemovedElement\u003c/code\u003e provide access to information about the set's structure and contents.\u003c/p\u003e\n"]]],["The `RevIntSet` class provides methods for managing a fixed-size set. Key actions include: obtaining `Capacity` and `Size`, accessing elements via `Element` and `RemovedElement`, and iterating with `begin` and `end`. The set can be modified using `Insert`, `Remove`, `Restore`, and `Clear` (requires a `Solver`). Constructors allow initialization with a specified capacity, and shared positions. It also includes a destructor `~RevIntSet`.\n"],null,["# RevIntSet\n\nC++ Reference: class RevIntSet\n==============================\n\n\nNote: This documentation is automatically generated.\n\n| Method ||\n|-----------------------------------------------------------------------------------------------------------------------|--------------------------------------------------------------------------------------------------------------------------------------------|\n| [`begin`](https://github.com/google/or-tools/blob/v9.4/ortools/constraint_solver/constraint_solveri.h#L2640) | Return type: `const_iterator ` \u003cbr /\u003e |\n| [`Capacity`](https://github.com/google/or-tools/blob/v9.4/ortools/constraint_solver/constraint_solveri.h#L2603) | Return type: `int ` \u003cbr /\u003e |\n| [`Clear`](https://github.com/google/or-tools/blob/v9.4/ortools/constraint_solver/constraint_solveri.h#L2636) | Return type: `void ` Arguments: `Solver* const solver` \u003cbr /\u003e |\n| [`Element`](https://github.com/google/or-tools/blob/v9.4/ortools/constraint_solver/constraint_solveri.h#L2605) | Return type: `T ` Arguments: `int i` \u003cbr /\u003e |\n| [`end`](https://github.com/google/or-tools/blob/v9.4/ortools/constraint_solver/constraint_solveri.h#L2641) | Return type: `const_iterator ` \u003cbr /\u003e |\n| [`Insert`](https://github.com/google/or-tools/blob/v9.4/ortools/constraint_solver/constraint_solveri.h#L2617) | Return type: `void ` Arguments: `Solver* const solver, const T& elt` \u003cbr /\u003e |\n| [`Remove`](https://github.com/google/or-tools/blob/v9.4/ortools/constraint_solver/constraint_solveri.h#L2626) | Return type: `void ` Arguments: `Solver* const solver, const T& value_index` \u003cbr /\u003e |\n| [`RemovedElement`](https://github.com/google/or-tools/blob/v9.4/ortools/constraint_solver/constraint_solveri.h#L2611) | Return type: `T ` Arguments: `int i` \u003cbr /\u003e |\n| [`Restore`](https://github.com/google/or-tools/blob/v9.4/ortools/constraint_solver/constraint_solveri.h#L2631) | Return type: `void ` Arguments: `Solver* const solver, const T& value_index` \u003cbr /\u003e |\n| [`RevIntSet`](https://github.com/google/or-tools/blob/v9.4/ortools/constraint_solver/constraint_solveri.h#L2572) | Return type: `explicit ` Arguments: `int capacity` Capacity is the fixed size of the set (it cannot grow). |\n| [`RevIntSet`](https://github.com/google/or-tools/blob/v9.4/ortools/constraint_solver/constraint_solveri.h#L2584) | \u003cbr /\u003e Arguments: `int capacity, int* shared_positions, int shared_positions_size` Capacity is the fixed size of the set (it cannot grow). |\n| [`~RevIntSet`](https://github.com/google/or-tools/blob/v9.4/ortools/constraint_solver/constraint_solveri.h#L2595) | \u003cbr /\u003e |\n| [`Size`](https://github.com/google/or-tools/blob/v9.4/ortools/constraint_solver/constraint_solveri.h#L2601) | Return type: `int ` \u003cbr /\u003e |"]]