-- c99f979ad34f155fbeeea69b88bdc7458d89a21c by Derek Mauro <dmauro@google.com>: Remove a floating point division by zero test. This isn't testing behavior related to the library, and MSVC warns about it in opt mode. PiperOrigin-RevId: 285220804 -- 68b015491f0dbf1ab547994673281abd1f34cd4b by Gennadiy Rozental <rogeeff@google.com>: This CL introduces following changes to the class FlagImpl: * We eliminate the CommandLineFlagLocks struct. Instead callback guard and callback function are combined into a single CallbackData struct, while primary data lock is stored separately. * CallbackData member of class FlagImpl is initially set to be nullptr and is only allocated and initialized when a flag's callback is being set. For most flags we do not pay for the extra space and extra absl::Mutex now. * Primary data guard is stored in data_guard_ data member. This is a properly aligned character buffer of necessary size. During initialization of the flag we construct absl::Mutex in this space using placement new call. * We now avoid extra value copy after successful attempt to parse value out of string. Instead we swap flag's current value with tentative value we just produced. PiperOrigin-RevId: 285132636 -- ed45d118fb818969eb13094cf7827c885dfc562c by Tom Manshreck <shreck@google.com>: Change null-term* (and nul-term*) to NUL-term* in comments PiperOrigin-RevId: 285036610 -- 729619017944db895ce8d6d29c1995aa2e5628a5 by Derek Mauro <dmauro@google.com>: Use the Posix implementation of thread identity on MinGW. Some versions of MinGW suffer from thread_local bugs. PiperOrigin-RevId: 285022920 -- 39a25493503c76885bc3254c28f66a251c5b5bb0 by Greg Falcon <gfalcon@google.com>: Implementation detail change. Add further ABSL_NAMESPACE_BEGIN and _END annotation macros to files in Abseil. PiperOrigin-RevId: 285012012 GitOrigin-RevId: c99f979ad34f155fbeeea69b88bdc7458d89a21c Change-Id: I4c85d3704e45d11a9ac50d562f39640a6adbedc1
		
			
				
	
	
		
			316 lines
		
	
	
	
		
			11 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
			
		
		
	
	
			316 lines
		
	
	
	
		
			11 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
| // Copyright 2018 The Abseil Authors.
 | |
| //
 | |
| // Licensed under the Apache License, Version 2.0 (the "License");
 | |
| // you may not use this file except in compliance with the License.
 | |
| // You may obtain a copy of the License at
 | |
| //
 | |
| //      https://www.apache.org/licenses/LICENSE-2.0
 | |
| //
 | |
| // Unless required by applicable law or agreed to in writing, software
 | |
| // distributed under the License is distributed on an "AS IS" BASIS,
 | |
| // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 | |
| // See the License for the specific language governing permissions and
 | |
| // limitations under the License.
 | |
| 
 | |
| #ifndef ABSL_CONTAINER_INTERNAL_UNORDERED_MAP_MODIFIERS_TEST_H_
 | |
| #define ABSL_CONTAINER_INTERNAL_UNORDERED_MAP_MODIFIERS_TEST_H_
 | |
| 
 | |
| #include <memory>
 | |
| 
 | |
| #include "gmock/gmock.h"
 | |
| #include "gtest/gtest.h"
 | |
| #include "absl/container/internal/hash_generator_testing.h"
 | |
| #include "absl/container/internal/hash_policy_testing.h"
 | |
| 
 | |
| namespace absl {
 | |
| ABSL_NAMESPACE_BEGIN
 | |
| namespace container_internal {
 | |
| 
 | |
| template <class UnordMap>
 | |
| class ModifiersTest : public ::testing::Test {};
 | |
| 
 | |
| TYPED_TEST_SUITE_P(ModifiersTest);
 | |
| 
 | |
| TYPED_TEST_P(ModifiersTest, Clear) {
 | |
|   using T = hash_internal::GeneratedType<TypeParam>;
 | |
|   std::vector<T> values;
 | |
|   std::generate_n(std::back_inserter(values), 10,
 | |
|                   hash_internal::Generator<T>());
 | |
|   TypeParam m(values.begin(), values.end());
 | |
|   ASSERT_THAT(items(m), ::testing::UnorderedElementsAreArray(values));
 | |
|   m.clear();
 | |
|   EXPECT_THAT(items(m), ::testing::UnorderedElementsAre());
 | |
|   EXPECT_TRUE(m.empty());
 | |
| }
 | |
| 
 | |
| TYPED_TEST_P(ModifiersTest, Insert) {
 | |
|   using T = hash_internal::GeneratedType<TypeParam>;
 | |
|   using V = typename TypeParam::mapped_type;
 | |
|   T val = hash_internal::Generator<T>()();
 | |
|   TypeParam m;
 | |
|   auto p = m.insert(val);
 | |
|   EXPECT_TRUE(p.second);
 | |
|   EXPECT_EQ(val, *p.first);
 | |
|   T val2 = {val.first, hash_internal::Generator<V>()()};
 | |
|   p = m.insert(val2);
 | |
|   EXPECT_FALSE(p.second);
 | |
|   EXPECT_EQ(val, *p.first);
 | |
| }
 | |
| 
 | |
| TYPED_TEST_P(ModifiersTest, InsertHint) {
 | |
|   using T = hash_internal::GeneratedType<TypeParam>;
 | |
|   using V = typename TypeParam::mapped_type;
 | |
|   T val = hash_internal::Generator<T>()();
 | |
|   TypeParam m;
 | |
|   auto it = m.insert(m.end(), val);
 | |
|   EXPECT_TRUE(it != m.end());
 | |
|   EXPECT_EQ(val, *it);
 | |
|   T val2 = {val.first, hash_internal::Generator<V>()()};
 | |
|   it = m.insert(it, val2);
 | |
|   EXPECT_TRUE(it != m.end());
 | |
|   EXPECT_EQ(val, *it);
 | |
| }
 | |
| 
 | |
| TYPED_TEST_P(ModifiersTest, InsertRange) {
 | |
|   using T = hash_internal::GeneratedType<TypeParam>;
 | |
|   std::vector<T> values;
 | |
|   std::generate_n(std::back_inserter(values), 10,
 | |
|                   hash_internal::Generator<T>());
 | |
|   TypeParam m;
 | |
|   m.insert(values.begin(), values.end());
 | |
|   ASSERT_THAT(items(m), ::testing::UnorderedElementsAreArray(values));
 | |
| }
 | |
| 
 | |
| TYPED_TEST_P(ModifiersTest, InsertOrAssign) {
 | |
| #ifdef UNORDERED_MAP_CXX17
 | |
|   using std::get;
 | |
|   using K = typename TypeParam::key_type;
 | |
|   using V = typename TypeParam::mapped_type;
 | |
|   K k = hash_internal::Generator<K>()();
 | |
|   V val = hash_internal::Generator<V>()();
 | |
|   TypeParam m;
 | |
|   auto p = m.insert_or_assign(k, val);
 | |
|   EXPECT_TRUE(p.second);
 | |
|   EXPECT_EQ(k, get<0>(*p.first));
 | |
|   EXPECT_EQ(val, get<1>(*p.first));
 | |
|   V val2 = hash_internal::Generator<V>()();
 | |
|   p = m.insert_or_assign(k, val2);
 | |
|   EXPECT_FALSE(p.second);
 | |
|   EXPECT_EQ(k, get<0>(*p.first));
 | |
|   EXPECT_EQ(val2, get<1>(*p.first));
 | |
| #endif
 | |
| }
 | |
| 
 | |
| TYPED_TEST_P(ModifiersTest, InsertOrAssignHint) {
 | |
| #ifdef UNORDERED_MAP_CXX17
 | |
|   using std::get;
 | |
|   using K = typename TypeParam::key_type;
 | |
|   using V = typename TypeParam::mapped_type;
 | |
|   K k = hash_internal::Generator<K>()();
 | |
|   V val = hash_internal::Generator<V>()();
 | |
|   TypeParam m;
 | |
|   auto it = m.insert_or_assign(m.end(), k, val);
 | |
|   EXPECT_TRUE(it != m.end());
 | |
|   EXPECT_EQ(k, get<0>(*it));
 | |
|   EXPECT_EQ(val, get<1>(*it));
 | |
|   V val2 = hash_internal::Generator<V>()();
 | |
|   it = m.insert_or_assign(it, k, val2);
 | |
|   EXPECT_EQ(k, get<0>(*it));
 | |
|   EXPECT_EQ(val2, get<1>(*it));
 | |
| #endif
 | |
| }
 | |
| 
 | |
| TYPED_TEST_P(ModifiersTest, Emplace) {
 | |
|   using T = hash_internal::GeneratedType<TypeParam>;
 | |
|   using V = typename TypeParam::mapped_type;
 | |
|   T val = hash_internal::Generator<T>()();
 | |
|   TypeParam m;
 | |
|   // TODO(alkis): We need a way to run emplace in a more meaningful way. Perhaps
 | |
|   // with test traits/policy.
 | |
|   auto p = m.emplace(val);
 | |
|   EXPECT_TRUE(p.second);
 | |
|   EXPECT_EQ(val, *p.first);
 | |
|   T val2 = {val.first, hash_internal::Generator<V>()()};
 | |
|   p = m.emplace(val2);
 | |
|   EXPECT_FALSE(p.second);
 | |
|   EXPECT_EQ(val, *p.first);
 | |
| }
 | |
| 
 | |
| TYPED_TEST_P(ModifiersTest, EmplaceHint) {
 | |
|   using T = hash_internal::GeneratedType<TypeParam>;
 | |
|   using V = typename TypeParam::mapped_type;
 | |
|   T val = hash_internal::Generator<T>()();
 | |
|   TypeParam m;
 | |
|   // TODO(alkis): We need a way to run emplace in a more meaningful way. Perhaps
 | |
|   // with test traits/policy.
 | |
|   auto it = m.emplace_hint(m.end(), val);
 | |
|   EXPECT_EQ(val, *it);
 | |
|   T val2 = {val.first, hash_internal::Generator<V>()()};
 | |
|   it = m.emplace_hint(it, val2);
 | |
|   EXPECT_EQ(val, *it);
 | |
| }
 | |
| 
 | |
| TYPED_TEST_P(ModifiersTest, TryEmplace) {
 | |
| #ifdef UNORDERED_MAP_CXX17
 | |
|   using T = hash_internal::GeneratedType<TypeParam>;
 | |
|   using V = typename TypeParam::mapped_type;
 | |
|   T val = hash_internal::Generator<T>()();
 | |
|   TypeParam m;
 | |
|   // TODO(alkis): We need a way to run emplace in a more meaningful way. Perhaps
 | |
|   // with test traits/policy.
 | |
|   auto p = m.try_emplace(val.first, val.second);
 | |
|   EXPECT_TRUE(p.second);
 | |
|   EXPECT_EQ(val, *p.first);
 | |
|   T val2 = {val.first, hash_internal::Generator<V>()()};
 | |
|   p = m.try_emplace(val2.first, val2.second);
 | |
|   EXPECT_FALSE(p.second);
 | |
|   EXPECT_EQ(val, *p.first);
 | |
| #endif
 | |
| }
 | |
| 
 | |
| TYPED_TEST_P(ModifiersTest, TryEmplaceHint) {
 | |
| #ifdef UNORDERED_MAP_CXX17
 | |
|   using T = hash_internal::GeneratedType<TypeParam>;
 | |
|   using V = typename TypeParam::mapped_type;
 | |
|   T val = hash_internal::Generator<T>()();
 | |
|   TypeParam m;
 | |
|   // TODO(alkis): We need a way to run emplace in a more meaningful way. Perhaps
 | |
|   // with test traits/policy.
 | |
|   auto it = m.try_emplace(m.end(), val.first, val.second);
 | |
|   EXPECT_EQ(val, *it);
 | |
|   T val2 = {val.first, hash_internal::Generator<V>()()};
 | |
|   it = m.try_emplace(it, val2.first, val2.second);
 | |
|   EXPECT_EQ(val, *it);
 | |
| #endif
 | |
| }
 | |
| 
 | |
| template <class V>
 | |
| using IfNotVoid = typename std::enable_if<!std::is_void<V>::value, V>::type;
 | |
| 
 | |
| // In openmap we chose not to return the iterator from erase because that's
 | |
| // more expensive. As such we adapt erase to return an iterator here.
 | |
| struct EraseFirst {
 | |
|   template <class Map>
 | |
|   auto operator()(Map* m, int) const
 | |
|       -> IfNotVoid<decltype(m->erase(m->begin()))> {
 | |
|     return m->erase(m->begin());
 | |
|   }
 | |
|   template <class Map>
 | |
|   typename Map::iterator operator()(Map* m, ...) const {
 | |
|     auto it = m->begin();
 | |
|     m->erase(it++);
 | |
|     return it;
 | |
|   }
 | |
| };
 | |
| 
 | |
| TYPED_TEST_P(ModifiersTest, Erase) {
 | |
|   using T = hash_internal::GeneratedType<TypeParam>;
 | |
|   using std::get;
 | |
|   std::vector<T> values;
 | |
|   std::generate_n(std::back_inserter(values), 10,
 | |
|                   hash_internal::Generator<T>());
 | |
|   TypeParam m(values.begin(), values.end());
 | |
|   ASSERT_THAT(items(m), ::testing::UnorderedElementsAreArray(values));
 | |
|   auto& first = *m.begin();
 | |
|   std::vector<T> values2;
 | |
|   for (const auto& val : values)
 | |
|     if (get<0>(val) != get<0>(first)) values2.push_back(val);
 | |
|   auto it = EraseFirst()(&m, 0);
 | |
|   ASSERT_TRUE(it != m.end());
 | |
|   EXPECT_EQ(1, std::count(values2.begin(), values2.end(), *it));
 | |
|   EXPECT_THAT(items(m), ::testing::UnorderedElementsAreArray(values2.begin(),
 | |
|                                                              values2.end()));
 | |
| }
 | |
| 
 | |
| TYPED_TEST_P(ModifiersTest, EraseRange) {
 | |
|   using T = hash_internal::GeneratedType<TypeParam>;
 | |
|   std::vector<T> values;
 | |
|   std::generate_n(std::back_inserter(values), 10,
 | |
|                   hash_internal::Generator<T>());
 | |
|   TypeParam m(values.begin(), values.end());
 | |
|   ASSERT_THAT(items(m), ::testing::UnorderedElementsAreArray(values));
 | |
|   auto it = m.erase(m.begin(), m.end());
 | |
|   EXPECT_THAT(items(m), ::testing::UnorderedElementsAre());
 | |
|   EXPECT_TRUE(it == m.end());
 | |
| }
 | |
| 
 | |
| TYPED_TEST_P(ModifiersTest, EraseKey) {
 | |
|   using T = hash_internal::GeneratedType<TypeParam>;
 | |
|   std::vector<T> values;
 | |
|   std::generate_n(std::back_inserter(values), 10,
 | |
|                   hash_internal::Generator<T>());
 | |
|   TypeParam m(values.begin(), values.end());
 | |
|   ASSERT_THAT(items(m), ::testing::UnorderedElementsAreArray(values));
 | |
|   EXPECT_EQ(1, m.erase(values[0].first));
 | |
|   EXPECT_EQ(0, std::count(m.begin(), m.end(), values[0]));
 | |
|   EXPECT_THAT(items(m), ::testing::UnorderedElementsAreArray(values.begin() + 1,
 | |
|                                                              values.end()));
 | |
| }
 | |
| 
 | |
| TYPED_TEST_P(ModifiersTest, Swap) {
 | |
|   using T = hash_internal::GeneratedType<TypeParam>;
 | |
|   std::vector<T> v1;
 | |
|   std::vector<T> v2;
 | |
|   std::generate_n(std::back_inserter(v1), 5, hash_internal::Generator<T>());
 | |
|   std::generate_n(std::back_inserter(v2), 5, hash_internal::Generator<T>());
 | |
|   TypeParam m1(v1.begin(), v1.end());
 | |
|   TypeParam m2(v2.begin(), v2.end());
 | |
|   EXPECT_THAT(items(m1), ::testing::UnorderedElementsAreArray(v1));
 | |
|   EXPECT_THAT(items(m2), ::testing::UnorderedElementsAreArray(v2));
 | |
|   m1.swap(m2);
 | |
|   EXPECT_THAT(items(m1), ::testing::UnorderedElementsAreArray(v2));
 | |
|   EXPECT_THAT(items(m2), ::testing::UnorderedElementsAreArray(v1));
 | |
| }
 | |
| 
 | |
| // TODO(alkis): Write tests for extract.
 | |
| // TODO(alkis): Write tests for merge.
 | |
| 
 | |
| REGISTER_TYPED_TEST_CASE_P(ModifiersTest, Clear, Insert, InsertHint,
 | |
|                            InsertRange, InsertOrAssign, InsertOrAssignHint,
 | |
|                            Emplace, EmplaceHint, TryEmplace, TryEmplaceHint,
 | |
|                            Erase, EraseRange, EraseKey, Swap);
 | |
| 
 | |
| template <typename Type>
 | |
| struct is_unique_ptr : std::false_type {};
 | |
| 
 | |
| template <typename Type>
 | |
| struct is_unique_ptr<std::unique_ptr<Type>> : std::true_type {};
 | |
| 
 | |
| template <class UnordMap>
 | |
| class UniquePtrModifiersTest : public ::testing::Test {
 | |
|  protected:
 | |
|   UniquePtrModifiersTest() {
 | |
|     static_assert(is_unique_ptr<typename UnordMap::mapped_type>::value,
 | |
|                   "UniquePtrModifiersTyest may only be called with a "
 | |
|                   "std::unique_ptr value type.");
 | |
|   }
 | |
| };
 | |
| 
 | |
| TYPED_TEST_SUITE_P(UniquePtrModifiersTest);
 | |
| 
 | |
| // Test that we do not move from rvalue arguments if an insertion does not
 | |
| // happen.
 | |
| TYPED_TEST_P(UniquePtrModifiersTest, TryEmplace) {
 | |
| #ifdef UNORDERED_MAP_CXX17
 | |
|   using T = hash_internal::GeneratedType<TypeParam>;
 | |
|   using V = typename TypeParam::mapped_type;
 | |
|   T val = hash_internal::Generator<T>()();
 | |
|   TypeParam m;
 | |
|   auto p = m.try_emplace(val.first, std::move(val.second));
 | |
|   EXPECT_TRUE(p.second);
 | |
|   // A moved from std::unique_ptr is guaranteed to be nullptr.
 | |
|   EXPECT_EQ(val.second, nullptr);
 | |
|   T val2 = {val.first, hash_internal::Generator<V>()()};
 | |
|   p = m.try_emplace(val2.first, std::move(val2.second));
 | |
|   EXPECT_FALSE(p.second);
 | |
|   EXPECT_NE(val2.second, nullptr);
 | |
| #endif
 | |
| }
 | |
| 
 | |
| REGISTER_TYPED_TEST_SUITE_P(UniquePtrModifiersTest, TryEmplace);
 | |
| 
 | |
| }  // namespace container_internal
 | |
| ABSL_NAMESPACE_END
 | |
| }  // namespace absl
 | |
| 
 | |
| #endif  // ABSL_CONTAINER_INTERNAL_UNORDERED_MAP_MODIFIERS_TEST_H_
 |