Stay organized with collections
Save and categorize content based on your preferences.
C++ Reference: class RevIntSet
Note: This documentation is automatically generated.
Method |
begin | Return type: const_iterator |
Capacity | Return type: int |
Clear | Return type: void Arguments: Solver* const solver |
Element | Return type: T Arguments: int i |
end | Return type: const_iterator |
Insert | Return type: void Arguments: Solver* const solver, const T& elt |
Remove | Return type: void Arguments: Solver* const solver, const T& value_index |
RemovedElement | Return type: T Arguments: int i |
Restore | Return type: void Arguments: Solver* const solver, const T& value_index |
RevIntSet | Return type: explicit Arguments: int capacity Capacity is the fixed size of the set (it cannot grow).
|
RevIntSet | Arguments: int capacity, int* shared_positions, int shared_positions_size Capacity is the fixed size of the set (it cannot grow).
|
~RevIntSet | |
Size | Return type: int |
Except as otherwise noted, the content of this page is licensed under the Creative Commons Attribution 4.0 License, and code samples are licensed under the Apache 2.0 License. For details, see the Google Developers Site Policies. Java is a registered trademark of Oracle and/or its affiliates.
Last updated 2024-08-06 UTC.
[null,null,["Last updated 2024-08-06 UTC."],[],["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,[]]