Stay organized with collections
Save and categorize content based on your preferences.
C++ Reference: class RevImmutableMultiMap
Note: This documentation is automatically generated.
| Method |
ContainsKey | Return type: bool Arguments: const K& key Returns true if the multi-map contains at least one instance of 'key'.
|
FindWithDefault | Return type: const V& Arguments: const K& key, const V& default_value 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.
|
Insert | Return type: void Arguments: const K& key, const V& value Inserts (key, value) in the multi-map.
|
num_items | Return type: int |
RevImmutableMultiMap | Arguments: Solver* const solver, int initial_size |
~RevImmutableMultiMap | |
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 `RevImmutableMultiMap` class in C++ provides methods for managing a multi-map. Key actions include checking for the existence of a key via `ContainsKey`, retrieving a value associated with a key using `FindWithDefault` (returning a default if the key is absent), and inserting key-value pairs with `Insert`. The number of items can be checked with `num_items`. It has also a constructor `RevImmutableMultiMap` and a destructor `~RevImmutableMultiMap`.\n"],null,[]]
