Lines Matching refs:key
58 // Given an STL container consisting of (key, value) pairs, STLDeleteValues
71 // If the key is present a const pointer to the associated value is returned,
76 const typename Collection::value_type::first_type& key) {
77 typename Collection::const_iterator it = collection.find(key);
123 // If the key is present a const pointer to the associated value is returned,
125 // This function does not distinguish between a missing key and a key mapped
130 const typename Collection::value_type::first_type& key) {
131 typename Collection::const_iterator it = collection.find(key);
138 // Test to see if a set, map, hash_set or hash_map contains a particular key.
139 // Returns true if the key is in the collection.
141 bool ContainsKey(const Collection& collection, const Key& key) {
142 return collection.find(key) != collection.end();
145 // Insert a new key and value into a map or hash_map.
146 // If the key is not present in the map the key and value are
148 // took place, false indicates the key was already present.
151 const Key& key, const Value& value) {
153 collection->insert(typename Collection::value_type(key, value));