![]() |
Google OR-Tools v9.15
a fast and portable software suite for combinatorial optimization
|
Definition at line 5381 of file constraint_solver.h.
#include <constraint_solver.h>
Public Member Functions | |
| AssignmentContainer () | |
| E * | Add (V *var) |
| E * | FastAdd (V *var) |
| Adds element without checking its presence in the container. | |
| E * | AddAtPosition (V *var, int position) |
| void | Clear () |
| void | Resize (size_t size) |
| bool | Empty () const |
| void | CopyIntersection (const AssignmentContainer< V, E > &container) |
| void | Copy (const AssignmentContainer< V, E > &container) |
| bool | Contains (const V *const var) const |
| E * | MutableElement (const V *const var) |
| E * | MutableElementOrNull (const V *const var) |
| const E & | Element (const V *const var) const |
| const E * | ElementPtrOrNull (const V *const var) const |
| const std::vector< E > & | elements () const |
| E * | MutableElement (int index) |
| const E & | Element (int index) const |
| int | Size () const |
| void | Store () |
| void | Restore () |
| bool | AreAllElementsBound () const |
| bool | operator== (const AssignmentContainer< V, E > &container) const |
| bool | operator!= (const AssignmentContainer< V, E > &container) const |
|
inline |
Definition at line 5383 of file constraint_solver.h.
|
inline |
Definition at line 5384 of file constraint_solver.h.
|
inline |
Advanced usage: Adds element at a given position; position has to have been allocated with AssignmentContainer::Resize() beforehand.
Definition at line 5401 of file constraint_solver.h.
|
inline |
Definition at line 5491 of file constraint_solver.h.
|
inline |
2x speedup on OR-Tools.
Definition at line 5405 of file constraint_solver.h.
|
inline |
Definition at line 5445 of file constraint_solver.h.
|
inline |
Copies all the elements of 'container' to this container, clearing its previous content.
Definition at line 5439 of file constraint_solver.h.
|
inline |
Copies the elements of 'container' which are already in the calling container.
Definition at line 5417 of file constraint_solver.h.
|
inline |
Definition at line 5462 of file constraint_solver.h.
|
inline |
Definition at line 5477 of file constraint_solver.h.
|
inline |
Definition at line 5468 of file constraint_solver.h.
|
inline |
Definition at line 5475 of file constraint_solver.h.
|
inline |
Definition at line 5414 of file constraint_solver.h.
|
inline |
Adds element without checking its presence in the container.
Definition at line 5394 of file constraint_solver.h.
|
inline |
Definition at line 5449 of file constraint_solver.h.
|
inline |
Definition at line 5476 of file constraint_solver.h.
|
inline |
Definition at line 5455 of file constraint_solver.h.
|
inline |
Definition at line 5520 of file constraint_solver.h.
|
inline |
Returns true if this and 'container' both represent the same V* -> E map. Runs in linear time; requires that the == operator on the type E is well defined.
We may not have any work to do
The == should be order-independent
Do not use the hash_map::== operator! It compares both content and how the map is hashed (e.g., number of buckets). This is not what we want.
Definition at line 5501 of file constraint_solver.h.
|
inline |
Advanced usage: Resizes the container, potentially adding elements with null variables.
Definition at line 5413 of file constraint_solver.h.
|
inline |
Definition at line 5484 of file constraint_solver.h.
|
inline |
Definition at line 5478 of file constraint_solver.h.
|
inline |
Definition at line 5479 of file constraint_solver.h.