template<typename K = int, typename V = int>
class operations_research::sat::CompactVectorVector< K, V >
Definition at line 77 of file util.h.
|
| size_t | size () const |
| bool | empty () const |
| size_t | num_entries () const |
| absl::Span< V > | operator[] (K key) |
| absl::Span< const V > | operator[] (K key) const |
| std::vector< absl::Span< const V > > | AsVectorOfSpan () const |
| void | clear () |
| void | reserve (int size) |
| void | reserve (int size, int num_entries) |
| template<typename Keys, typename Values> |
| void | ResetFromFlatMapping (Keys keys, Values values, int minimum_num_nodes=0) |
| template<typename Collection> |
| void | ResetFromPairs (const Collection &pairs, int minimum_num_nodes=0) |
| void | ResetFromTranspose (const CompactVectorVector< V, K > &other, int min_transpose_size=0) |
| template<typename ValueMapper, typename Container> |
| void | ResetFromTransposeMap (const Container &other, int min_transpose_size=0) |
| int | Add (absl::Span< const V > values) |
| void | AppendToLastVector (const V &value) |
| void | AppendToLastVector (absl::Span< const V > values) |
| template<typename L> |
| int | AddLiterals (const std::vector< L > &wrapped_values) |
| void | RemoveBySwap (K key, int index) |
| void | ReplaceValuesBySmallerSet (K key, absl::Span< const V > values) |
| void | Shrink (K key, int new_size) |
| void | emplace_back (V const *begin, V const *end) |