![]() |
Google OR-Tools v9.14
a fast and portable software suite for combinatorial optimization
|
Reversible Immutable MultiMap class. Represents an immutable multi-map that backtracks with the solver.
Definition at line 291 of file constraint_solveri.h.
#include <constraint_solveri.h>
Public Member Functions | |
RevImmutableMultiMap (Solver *const solver, int initial_size) | |
~RevImmutableMultiMap () | |
int | num_items () const |
bool | ContainsKey (const K &key) const |
Returns true if the multi-map contains at least one instance of 'key'. | |
const V & | FindWithDefault (const K &key, const V &default_value) const |
void | Insert (const K &key, const V &value) |
Inserts (key, value) in the multi-map. |
|
inline |
Definition at line 293 of file constraint_solveri.h.
|
inline |
Definition at line 301 of file constraint_solveri.h.
|
inline |
Returns true if the multi-map contains at least one instance of 'key'.
Definition at line 306 of file constraint_solveri.h.
|
inline |
Returns one value attached to 'key', or 'default_value' if 'key' is not in the multi-map. The actual value returned if more than one values is attached to the same key is not specified.
Definition at line 321 of file constraint_solveri.h.
|
inline |
Inserts (key, value) in the multi-map.
Definition at line 334 of file constraint_solveri.h.
|
inline |
Definition at line 303 of file constraint_solveri.h.