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