Implement a map using an unsorted a sequence container such as std::vector or std::deque... Here is the structure!

// unsorted.cpp: Unsorted Map

#include "map.h"

// Methods --------------------------------------------------------------------

void UnsortedMap::insert(const std::string &key, const std::string &value) {

}

const Entry UnsortedMap::search(const std::string &key) {

return NONE;

}

void UnsortedMap::dump(std::ostream &os, DumpFlag flag) {

}

// vim: set sts=4 sw=4 ts=8 expandtab ft=cpp: