message: Cleaning things up a bit, adding use of end(), testing insert return value in rehash
diff: @@ -29,13 +29,16 @@ void test_storage(experimental::Map<Key, T> &test)
  {
  for(int i = 0; i < test.max_size(); i++)
  {
  - auto ret_test = test.insert(i, i * 27);
  + Key key = i;
  + T value = key*27;
  + auto ret_test = test.insert(key, value);
  EXPECT_EQ(true, ret_test.second);
  }
  EXPECT_EQ(false, test.empty());
  for(int i = 0; i < test.max_size(); i++)
  {
  - EXPECT_EQ(i * 27, test.find(i).value);
  + Key key = i;
  + EXPECT_EQ(key * 27, test.find(key).value);
  }
  //This should fail, since we're at capacity.
  auto ret = test.insert(test.max_size(), 900);
  @@ -46,7 +49,8 @@ template <typename Key, typename T>
  void test_brackets(experimental::Map<Key, T> &test)
  {
  for(int i = 0; i < test.size(); i++){
  - EXPECT_EQ(i*27, test[i]);
  + Key key = i;
  + EXPECT_EQ(key*27, test[key]);
  }
  }
  @@ -90,10 +94,9 @@ void test_remove(experimental::Map<Key, T> &test)
  std::size_t to_erase = test.size();
  for(std::size_t i = 0; i < to_erase; i++){
  Key key = (Key) i;
  - bool erased = test.erase(i);
  + bool erased = test.erase(key);
  EXPECT_EQ(erased, true);
  - //Change to compare to some kind of end accessor.
  - EXPECT_EQ(test.find(key).next, -2);
  + EXPECT_EQ(test.find(key), test.end());
  }
  EXPECT_EQ(test.size(), 0);
  test.insert(0, 900);
  @@ -118,7 +121,8 @@ void test_rehash(experimental::Map<Key, T> &test, int num, int fact)
  {
  Key key = i;
  T value = key*27;
  - test.insert(key, value);
  + auto ret_test = test.insert(key, value);
  + EXPECT_EQ(true, ret_test.second);
  }
  for(int i = original_size; i < test.max_size(); i++)
  