Lines Matching defs:map
21 #include <map>
31 // A variant map is a heterogenous, type safe key->value map. It allows
32 // for multiple different value types to be stored dynamically in the same map.
209 // A variant map allows type-safe heteregeneous key->value mappings.
219 // A null value is returned only when the key does not exist in this map.
226 // A null value is returned only when the key does not exist in this map.
232 // Lookup the value from the key. If it was not set in the map, return the default value.
252 ScopedRemove(VariantMap& map, const TKey<TValue>& key) : map_(map), key_(key) {}
262 // Release the value from the key. If it was not set in the map, returns the default value.
326 // How many key/value pairs are stored in this map.
331 // Construct an empty map.
340 // Create a new map from an existing map, copying all the key/value pairs.
345 // Copy the key/value pairs from the other map into this one. Existing key/values are cleared.
366 // Create a new map by moving an existing map into this one. The other map becomes empty.
371 // Move the existing map's key/value pairs into this one. The other map becomes empty.
399 // Custom key comparator for std::map, needed since we are storing raw pointers as the keys.
412 using StorageMap = std::map<const detail::VariantMapKeyRaw*, void*, KeyComparator>;