hashmap(std::map<Key, Value>&& map)

  {

    // NOTE: We're using 'insert' here with a move iterator in order

    // to avoid copies because we know we have an r-value paramater.

    std::unordered_map<Key, Value, Hash, Equal>::insert(

        std::make_move_iterator(map.begin()),

        std::make_move_iterator(map.end()));

  }

hashmap(std::initializer_list<std::pair<Key, Value>> list)

  {

    std::unordered_map<Key, Value, Hash, Equal>::reserve(list.size());

    for (auto iterator = list.begin(); iterator != list.end(); ++iterator) {

      std::unordered_map<Key, Value, Hash, Equal>::emplace(

          iterator->first,

          iterator->second);

    }

  }

hashmap<int, std::string> a = {{, "one"}, {, "two"}, {, "three"}};

#include "stout/hashmap.hpp"

#include <string>

#include <iostream>

int main()

{

  hashmap<int, std::string> a = {{, "one"}, {, "two"}, {, "three"}};

  if (a.contains())

    std::cout << "a contains 1" << std::endl;

  if (a.containsValue("one"))

    std::cout << "a containsValue one" << std::endl;

  auto b =  a.get();

  if (b.isSome())

    std::cout << "from a get " << b.get() << std::endl;

  auto c = a.keys();

  for (const int& x : c)

    std::cout << x << std::endl;

  auto d = a.values();

  for (const std::string& x : d)

    std::cout << x << std::endl;

  return ;

}