11 template <
class K,
class V>
14 template <
class KM,
class VM>
23 for (
auto it = data.begin(); it != data.end(); ++it){
34 this->empty_ptr = (V*) ∅
38 return find_entry(key);
41 void put(K key,V value){
42 V value_found = find_entry(key);
44 if (&value_found == empty_ptr ){
46 MapEntry<K,V> new_entry = {value, key};
47 data.push_back(new_entry);
A simple key value map collection.
Definition: Map.h:12
Vector implementation which provides the most important methods as defined by std::vector....
Definition: Vector.h:13