![]() |
Google OR-Tools v9.14
a fast and portable software suite for combinatorial optimization
|
#include <attr_storage.h>
Public Types | |
using | Key = AttrKey<n, NoSymmetry> |
Public Member Functions | |
SparseKeySet (const DenseKeySet< n > &dense_set) | |
size_t | size () const |
template<typename F> | |
void | ForEach (F f) const |
requires std::invocable<F, const Key&> | |
void | Erase (const Key &key) |
void | Insert (const Key &key) |
A non-default key set based on a hash set. Simple, but requires a hash lookup for each insertion and deletion.
Definition at line 71 of file attr_storage.h.
using operations_research::math_opt::detail::SparseKeySet< n >::Key = AttrKey<n, NoSymmetry> |
{Dense,Sparse}KeySet stores symmetric keys, symmetry is handled by SlicingStorage.
Definition at line 75 of file attr_storage.h.
|
inlineexplicit |
Definition at line 77 of file attr_storage.h.
|
inline |
Definition at line 90 of file attr_storage.h.
|
inline |
requires std::invocable<F, const Key&>
Definition at line 84 of file attr_storage.h.
|
inline |
Definition at line 91 of file attr_storage.h.
|
inline |
Definition at line 80 of file attr_storage.h.