| // Protocol Buffers - Google's data interchange format |
| // Copyright 2008 Google Inc. All rights reserved. |
| // https://developers.google.com/protocol-buffers/ |
| // |
| // Redistribution and use in source and binary forms, with or without |
| // modification, are permitted provided that the following conditions are |
| // met: |
| // |
| // * Redistributions of source code must retain the above copyright |
| // notice, this list of conditions and the following disclaimer. |
| // * Redistributions in binary form must reproduce the above |
| // copyright notice, this list of conditions and the following disclaimer |
| // in the documentation and/or other materials provided with the |
| // distribution. |
| // * Neither the name of Google Inc. nor the names of its |
| // contributors may be used to endorse or promote products derived from |
| // this software without specific prior written permission. |
| // |
| // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| |
| // A hack to include windows.h first, which ensures the GetMessage macro can |
| // be undefined when we include <google/protobuf/stubs/common.h> |
| #if defined(_WIN32) |
| #define _WINSOCKAPI_ // to avoid re-definition in WinSock2.h |
| #define NOMINMAX // to avoid defining min/max macros |
| #include <windows.h> |
| #endif // _WIN32 |
| |
| #include <algorithm> |
| #include <map> |
| #include <memory> |
| #include <random> |
| #include <set> |
| #include <sstream> |
| #include <unordered_map> |
| #include <unordered_set> |
| #include <vector> |
| |
| #include <google/protobuf/stubs/logging.h> |
| #include <google/protobuf/stubs/common.h> |
| #include <google/protobuf/stubs/stringprintf.h> |
| #include <google/protobuf/testing/file.h> |
| #include <google/protobuf/arena_test_util.h> |
| #include <google/protobuf/map_proto2_unittest.pb.h> |
| #include <google/protobuf/map_test_util.h> |
| #include <google/protobuf/map_unittest.pb.h> |
| #include <google/protobuf/test_util.h> |
| #include <google/protobuf/test_util2.h> |
| #include <google/protobuf/unittest.pb.h> |
| #include <google/protobuf/io/coded_stream.h> |
| #include <google/protobuf/io/tokenizer.h> |
| #include <google/protobuf/io/zero_copy_stream_impl.h> |
| #include <google/protobuf/descriptor.pb.h> |
| #include <google/protobuf/descriptor.h> |
| #include <google/protobuf/descriptor_database.h> |
| #include <google/protobuf/dynamic_message.h> |
| #include <google/protobuf/map.h> |
| #include <google/protobuf/map_field_inl.h> |
| #include <google/protobuf/message.h> |
| #include <google/protobuf/reflection.h> |
| #include <google/protobuf/reflection_ops.h> |
| #include <google/protobuf/text_format.h> |
| #include <google/protobuf/wire_format.h> |
| #include <google/protobuf/util/message_differencer.h> |
| #include <google/protobuf/util/time_util.h> |
| #include <gmock/gmock.h> |
| #include <google/protobuf/testing/googletest.h> |
| #include <gtest/gtest.h> |
| #include <google/protobuf/stubs/casts.h> |
| #include <google/protobuf/stubs/substitute.h> |
| |
| |
| // Must be included last. |
| #include <google/protobuf/port_def.inc> |
| |
| namespace google { |
| namespace protobuf { |
| |
| using unittest::ForeignMessage; |
| using unittest::TestAllTypes; |
| using unittest::TestMap; |
| using unittest::TestRecursiveMapMessage; |
| |
| namespace internal { |
| |
| void MapTestForceDeterministic() { |
| io::CodedOutputStream::SetDefaultSerializationDeterministic(); |
| } |
| |
| namespace { |
| |
| // Map API Test ===================================================== |
| |
| class MapImplTest : public ::testing::Test { |
| protected: |
| MapImplTest() |
| : map_ptr_(new Map<int32, int32>()), |
| map_(*map_ptr_), |
| const_map_(*map_ptr_) { |
| EXPECT_TRUE(map_.empty()); |
| EXPECT_EQ(0, map_.size()); |
| } |
| |
| void ExpectSingleElement(int32 key, int32 value) { |
| EXPECT_FALSE(map_.empty()); |
| EXPECT_EQ(1, map_.size()); |
| ExpectElement(key, value); |
| } |
| |
| void ExpectElements(const std::map<int32, int32>& map) { |
| EXPECT_FALSE(map_.empty()); |
| EXPECT_EQ(map.size(), map_.size()); |
| for (std::map<int32, int32>::const_iterator it = map.begin(); |
| it != map.end(); ++it) { |
| ExpectElement(it->first, it->second); |
| } |
| } |
| |
| void ExpectElement(int32 key, int32 value) { |
| // Test map size is correct. |
| EXPECT_EQ(value, map_[key]); |
| EXPECT_EQ(1, map_.count(key)); |
| EXPECT_TRUE(map_.contains(key)); |
| |
| // Check mutable at and find work correctly. |
| EXPECT_EQ(value, map_.at(key)); |
| Map<int32, int32>::iterator it = map_.find(key); |
| |
| // iterator dereferenceable |
| EXPECT_EQ(key, (*it).first); |
| EXPECT_EQ(value, (*it).second); |
| EXPECT_EQ(key, it->first); |
| EXPECT_EQ(value, it->second); |
| |
| // iterator mutable |
| ((*it).second) = value + 1; |
| EXPECT_EQ(value + 1, map_[key]); |
| ((*it).second) = value; |
| EXPECT_EQ(value, map_[key]); |
| |
| it->second = value + 1; |
| EXPECT_EQ(value + 1, map_[key]); |
| it->second = value; |
| EXPECT_EQ(value, map_[key]); |
| |
| // copy constructor |
| Map<int32, int32>::iterator it_copy = it; |
| EXPECT_EQ(key, it_copy->first); |
| EXPECT_EQ(value, it_copy->second); |
| |
| // Immutable API ================================================ |
| |
| // Check immutable at and find work correctly. |
| EXPECT_EQ(value, const_map_.at(key)); |
| Map<int32, int32>::const_iterator const_it = const_map_.find(key); |
| |
| // iterator dereferenceable |
| EXPECT_EQ(key, (*const_it).first); |
| EXPECT_EQ(value, (*const_it).second); |
| EXPECT_EQ(key, const_it->first); |
| EXPECT_EQ(value, const_it->second); |
| |
| // copy constructor |
| Map<int32, int32>::const_iterator const_it_copy = const_it; |
| EXPECT_EQ(key, const_it_copy->first); |
| EXPECT_EQ(value, const_it_copy->second); |
| } |
| |
| std::unique_ptr<Map<int32, int32> > map_ptr_; |
| Map<int32, int32>& map_; |
| const Map<int32, int32>& const_map_; |
| }; |
| |
| TEST_F(MapImplTest, OperatorBracket) { |
| int32 key = 0; |
| int32 value1 = 100; |
| int32 value2 = 101; |
| |
| EXPECT_EQ(0, map_[key]); |
| |
| map_[key] = value1; |
| ExpectSingleElement(key, value1); |
| |
| map_[key] = value2; |
| ExpectSingleElement(key, value2); |
| } |
| |
| struct MoveTestKey { |
| MoveTestKey(int data, int* copies) : data(data), copies(copies) {} |
| |
| MoveTestKey(const MoveTestKey& other) |
| : data(other.data), copies(other.copies) { |
| ++*copies; |
| } |
| |
| MoveTestKey(MoveTestKey&& other) noexcept |
| : data(other.data), copies(other.copies) {} |
| |
| friend bool operator==(const MoveTestKey& lhs, const MoveTestKey& rhs) { |
| return lhs.data == rhs.data; |
| } |
| friend bool operator<(const MoveTestKey& lhs, const MoveTestKey& rhs) { |
| return lhs.data < rhs.data; |
| } |
| |
| int data; |
| int* copies; |
| }; |
| |
| } // namespace |
| } // namespace internal |
| } // namespace protobuf |
| } // namespace google |
| |
| namespace std { |
| |
| template <> // NOLINT |
| struct hash<google::protobuf::internal::MoveTestKey> { |
| size_t operator()(const google::protobuf::internal::MoveTestKey& key) const { |
| return hash<int>{}(key.data); |
| } |
| }; |
| } // namespace std |
| |
| namespace google { |
| namespace protobuf { |
| namespace internal { |
| namespace { |
| |
| TEST_F(MapImplTest, OperatorBracketRValue) { |
| Arena arena; |
| for (Arena* arena_to_use : {&arena, static_cast<Arena*>(nullptr)}) { |
| int copies = 0; |
| Map<MoveTestKey, int> map(arena_to_use); |
| MoveTestKey key1(1, &copies); |
| EXPECT_EQ(copies, 0); |
| map[key1] = 0; |
| EXPECT_EQ(copies, 1); |
| map[MoveTestKey(2, &copies)] = 2; |
| EXPECT_EQ(copies, 1); |
| } |
| } |
| |
| TEST_F(MapImplTest, OperatorBracketNonExist) { |
| int32 key = 0; |
| int32 default_value = 0; |
| |
| EXPECT_EQ(default_value, map_[key]); |
| ExpectSingleElement(key, default_value); |
| } |
| |
| TEST_F(MapImplTest, MutableAt) { |
| int32 key = 0; |
| int32 value1 = 100; |
| int32 value2 = 101; |
| |
| map_[key] = value1; |
| ExpectSingleElement(key, value1); |
| |
| map_.at(key) = value2; |
| ExpectSingleElement(key, value2); |
| } |
| |
| #ifdef PROTOBUF_HAS_DEATH_TEST |
| |
| TEST_F(MapImplTest, MutableAtNonExistDeathTest) { |
| EXPECT_DEATH(map_.at(0), ""); |
| } |
| |
| TEST_F(MapImplTest, ImmutableAtNonExistDeathTest) { |
| EXPECT_DEATH(const_map_.at(0), ""); |
| } |
| |
| TEST_F(MapImplTest, UsageErrors) { |
| MapKey key; |
| key.SetInt64Value(1); |
| EXPECT_DEATH(key.GetUInt64Value(), |
| "Protocol Buffer map usage error:\n" |
| "MapKey::GetUInt64Value type does not match\n" |
| " Expected : uint64\n" |
| " Actual : int64"); |
| |
| MapValueRef value; |
| EXPECT_DEATH( |
| value.SetFloatValue(0.1), |
| "Protocol Buffer map usage error:\n" |
| "MapValue[Const]*Ref::type MapValue[Const]*Ref is not initialized."); |
| } |
| |
| #endif // PROTOBUF_HAS_DEATH_TEST |
| |
| TEST_F(MapImplTest, MapKeyAssignment) { |
| MapKey from, to; |
| from.SetStringValue("abc"); |
| to = from; |
| EXPECT_EQ("abc", to.GetStringValue()); |
| } |
| |
| TEST_F(MapImplTest, CountNonExist) { EXPECT_EQ(0, map_.count(0)); } |
| |
| TEST_F(MapImplTest, ContainNotExist) { EXPECT_FALSE(map_.contains(0)); } |
| |
| TEST_F(MapImplTest, ImmutableContainNotExist) { |
| EXPECT_FALSE(const_map_.contains(0)); |
| } |
| |
| TEST_F(MapImplTest, MutableFindNonExist) { |
| EXPECT_TRUE(map_.end() == map_.find(0)); |
| } |
| |
| TEST_F(MapImplTest, ImmutableFindNonExist) { |
| EXPECT_TRUE(const_map_.end() == const_map_.find(0)); |
| } |
| |
| TEST_F(MapImplTest, ConstEnd) { |
| EXPECT_TRUE(const_map_.end() == const_map_.cend()); |
| } |
| |
| TEST_F(MapImplTest, GetReferenceFromIterator) { |
| for (int i = 0; i < 10; i++) { |
| map_[i] = i; |
| } |
| |
| for (Map<int32, int32>::const_iterator it = map_.cbegin(); |
| it != map_.cend();) { |
| Map<int32, int32>::const_reference entry = *it++; |
| EXPECT_EQ(entry.first, entry.second); |
| } |
| |
| for (Map<int32, int32>::const_iterator it = const_map_.begin(); |
| it != const_map_.end();) { |
| Map<int32, int32>::const_reference entry = *it++; |
| EXPECT_EQ(entry.first, entry.second); |
| } |
| |
| for (Map<int32, int32>::iterator it = map_.begin(); it != map_.end();) { |
| Map<int32, int32>::reference entry = *it++; |
| EXPECT_EQ(entry.first + 1, ++entry.second); |
| } |
| } |
| |
| TEST_F(MapImplTest, IteratorBasic) { |
| map_[0] = 0; |
| |
| // Default constructible (per forward iterator requirements). |
| Map<int, int>::const_iterator cit; |
| Map<int, int>::iterator it; |
| |
| it = map_.begin(); |
| cit = it; // Converts to const_iterator |
| |
| // Can compare between them. |
| EXPECT_TRUE(it == cit); |
| EXPECT_FALSE(cit != it); |
| |
| // Pre increment. |
| EXPECT_FALSE(it == ++cit); |
| |
| // Post increment. |
| EXPECT_FALSE(it++ == cit); |
| EXPECT_TRUE(it == cit); |
| } |
| |
| template <typename Iterator> |
| static int64 median(Iterator i0, Iterator i1) { |
| std::vector<int64> v(i0, i1); |
| std::nth_element(v.begin(), v.begin() + v.size() / 2, v.end()); |
| return v[v.size() / 2]; |
| } |
| |
| static int64 Now() { |
| return util::TimeUtil::TimestampToNanoseconds( |
| util::TimeUtil::GetCurrentTime()); |
| } |
| |
| // Arbitrary odd integers for creating test data. |
| static int k0 = 812398771; |
| static int k1 = 1312938717; |
| static int k2 = 1321555333; |
| |
| // A naive begin() implementation will cause begin() to get slower and slower |
| // if one erases elements at the "front" of the hash map, and we'd like to |
| // avoid that, as std::unordered_map does. |
| TEST_F(MapImplTest, BeginIsFast) { |
| if (true) return; // TODO(gpike): make this less flaky and re-enable it. |
| Map<int32, int32> map; |
| const int kTestSize = 250000; |
| // Create a random-looking map of size n. Use non-negative integer keys. |
| uint32 frog = 123983; |
| int last_key = 0; |
| int counter = 0; |
| while (map.size() < kTestSize) { |
| frog *= static_cast<uint32>(k0); |
| frog ^= frog >> 17; |
| frog += counter++; |
| last_key = |
| static_cast<int>(frog) >= 0 ? static_cast<int>(frog) : last_key ^ 1; |
| GOOGLE_DCHECK_GE(last_key, 0); |
| map[last_key] = last_key ^ 1; |
| } |
| std::vector<int64> times; |
| // We're going to do map.erase(map.begin()) over and over again. But, |
| // just in case one iteration is fast compared to the granularity of |
| // our time keeping, we measure kChunkSize iterations per outer-loop iter. |
| const int kChunkSize = 1000; |
| GOOGLE_CHECK_EQ(kTestSize % kChunkSize, 0); |
| do { |
| const int64 start = Now(); |
| for (int i = 0; i < kChunkSize; i++) { |
| map.erase(map.begin()); |
| } |
| const int64 end = Now(); |
| if (end > start) { |
| times.push_back(end - start); |
| } |
| } while (!map.empty()); |
| if (times.size() < .99 * kTestSize / kChunkSize) { |
| GOOGLE_LOG(WARNING) << "Now() isn't helping us measure time"; |
| return; |
| } |
| int64 x0 = median(times.begin(), times.begin() + 9); |
| int64 x1 = median(times.begin() + times.size() - 9, times.end()); |
| GOOGLE_LOG(INFO) << "x0=" << x0 << ", x1=" << x1; |
| // x1 will greatly exceed x0 if the code we just executed took O(n^2) time. |
| // And we'll probably time out and never get here. So, this test is |
| // intentionally loose: we check that x0 and x1 are within a factor of 8. |
| EXPECT_GE(x1, x0 / 8); |
| EXPECT_GE(x0, x1 / 8); |
| } |
| |
| // Try to create kTestSize keys that will land in just a few buckets, and |
| // time the insertions, to get a rough estimate of whether an O(n^2) worst case |
| // was triggered. This test is a hacky, but probably better than nothing. |
| TEST_F(MapImplTest, HashFlood) { |
| const int kTestSize = 1024; // must be a power of 2 |
| std::set<int> s; |
| for (int i = 0; s.size() < kTestSize; i++) { |
| if ((map_.hash_function()(i) & (kTestSize - 1)) < 3) { |
| s.insert(i); |
| } |
| } |
| // Create hash table with kTestSize entries that hash flood a table with |
| // 1024 (or 512 or 2048 or ...) entries. This assumes that map_ uses powers |
| // of 2 for table sizes, and that it's sufficient to "flood" with respect to |
| // the low bits of the output of map_.hash_function(). |
| std::vector<int64> times; |
| std::set<int>::iterator it = s.begin(); |
| int count = 0; |
| do { |
| const int64 start = Now(); |
| map_[*it] = 0; |
| const int64 end = Now(); |
| if (end > start) { |
| times.push_back(end - start); |
| } |
| ++count; |
| ++it; |
| } while (it != s.end()); |
| if (times.size() < .99 * count) return; |
| int64 x0 = median(times.begin(), times.begin() + 9); |
| int64 x1 = median(times.begin() + times.size() - 9, times.end()); |
| // x1 will greatly exceed x0 if the code we just executed took O(n^2) time. |
| // But we want to allow O(n log n). A factor of 20 should be generous enough. |
| EXPECT_LE(x1, x0 * 20); |
| } |
| |
| TEST_F(MapImplTest, CopyIteratorStressTest) { |
| std::vector<Map<int32, int32>::iterator> v; |
| const int kIters = 1e5; |
| for (uint32 i = 0; i < kIters; i++) { |
| int32 key = (3 + i * (5 + i * (-8 + i * (62 + i)))) & 0x77777777; |
| map_[key] = i; |
| v.push_back(map_.find(key)); |
| } |
| for (std::vector<Map<int32, int32>::iterator>::const_iterator it = v.begin(); |
| it != v.end(); it++) { |
| Map<int32, int32>::iterator i = *it; |
| ASSERT_EQ(i->first, (*it)->first); |
| ASSERT_EQ(i->second, (*it)->second); |
| } |
| } |
| |
| template <typename T, typename U> |
| static void TestValidityForAllKeysExcept(int key_to_avoid, const T& check_map, |
| const U& map) { |
| typedef typename U::value_type value_type; // a key-value pair |
| for (typename U::const_iterator it = map.begin(); it != map.end(); ++it) { |
| const int key = it->first; |
| if (key == key_to_avoid) continue; |
| // All iterators relevant to this key, whether old (from check_map) or new, |
| // must point to the same memory. So, test pointer equality here. |
| const value_type* check_val = &*check_map.find(key)->second; |
| EXPECT_EQ(check_val, &*it); |
| EXPECT_EQ(check_val, &*map.find(key)); |
| } |
| } |
| |
| // EXPECT i0 and i1 to be the same. Advancing them should have the same effect, |
| // too. |
| template <typename Iter> |
| static void TestEqualIterators(Iter i0, Iter i1, Iter end) { |
| const int kMaxAdvance = 10; |
| for (int i = 0; i < kMaxAdvance; i++) { |
| EXPECT_EQ(i0 == end, i1 == end); |
| if (i0 == end) return; |
| EXPECT_EQ(&*i0, &*i1) << "iter " << i; |
| ++i0; |
| ++i1; |
| } |
| } |
| |
| template <typename IteratorType> |
| static void TestOldVersusNewIterator(int skip, Map<int, int>* m) { |
| const int initial_size = m->size(); |
| IteratorType it = m->begin(); |
| for (int i = 0; i < skip && it != m->end(); it++, i++) { |
| } |
| if (it == m->end()) return; |
| const IteratorType old = it; |
| GOOGLE_LOG(INFO) << "skip=" << skip << ", old->first=" << old->first; |
| const int target_size = |
| initial_size < 100 ? initial_size * 5 : initial_size * 5 / 4; |
| for (int i = 0; m->size() <= target_size; i++) { |
| (*m)[i] = 0; |
| } |
| // Iterator 'old' should still work just fine despite the growth of *m. |
| const IteratorType after_growth = m->find(old->first); |
| TestEqualIterators<IteratorType>(old, after_growth, m->end()); |
| |
| // Now shrink the number of elements. Do this with a mix of erases and |
| // inserts to increase the chance that the hashtable will resize to a lower |
| // number of buckets. (But, in any case, the test is still useful.) |
| for (int i = 0; i < 2 * (target_size - initial_size); i++) { |
| if (i != old->first) { |
| m->erase(i); |
| } |
| if (((i ^ m->begin()->first) & 15) == 0) { |
| (*m)[i * 342] = i; |
| } |
| } |
| // Now, the table has grown and shrunk; test again. |
| TestEqualIterators<IteratorType>(old, m->find(old->first), m->end()); |
| TestEqualIterators<IteratorType>(old, after_growth, m->end()); |
| } |
| |
| // Create and test an n-element Map, with emphasis on iterator correctness. |
| static void StressTestIterators(int n) { |
| GOOGLE_LOG(INFO) << "StressTestIterators " << n; |
| GOOGLE_CHECK_GT(n, 0); |
| // Create a random-looking map of size n. Use non-negative integer keys. |
| Map<int, int> m; |
| uint32 frog = 123987 + n; |
| int last_key = 0; |
| int counter = 0; |
| while (m.size() < n) { |
| frog *= static_cast<uint32>(k0); |
| frog ^= frog >> 17; |
| frog += counter++; |
| last_key = |
| static_cast<int>(frog) >= 0 ? static_cast<int>(frog) : last_key ^ 1; |
| GOOGLE_DCHECK_GE(last_key, 0); |
| m[last_key] = last_key ^ 1; |
| } |
| // Test it. |
| ASSERT_EQ(n, m.size()); |
| // Create maps of pointers and iterators. |
| // These should remain valid even if we modify m. |
| std::unordered_map<int, Map<int, int>::value_type*> mp(n); |
| std::unordered_map<int, Map<int, int>::iterator> mi(n); |
| for (Map<int, int>::iterator it = m.begin(); it != m.end(); ++it) { |
| mp[it->first] = &*it; |
| mi[it->first] = it; |
| } |
| ASSERT_EQ(m.size(), mi.size()); |
| ASSERT_EQ(m.size(), mp.size()); |
| m.erase(last_key); |
| ASSERT_EQ(n - 1, m.size()); |
| TestValidityForAllKeysExcept(last_key, mp, m); |
| TestValidityForAllKeysExcept(last_key, mi, m); |
| |
| m[last_key] = 0; |
| ASSERT_EQ(n, m.size()); |
| // Test old iterator vs new iterator, with table modification in between. |
| TestOldVersusNewIterator<Map<int, int>::const_iterator>(n % 3, &m); |
| TestOldVersusNewIterator<Map<int, int>::iterator>(n % (1 + (n / 40)), &m); |
| // Finally, ensure erase(iterator) doesn't reorder anything, because that is |
| // what its documentation says. |
| m[last_key] = m[last_key ^ 999] = 0; |
| std::vector<Map<int, int>::iterator> v; |
| v.reserve(m.size()); |
| int position_of_last_key = 0; |
| for (Map<int, int>::iterator it = m.begin(); it != m.end(); ++it) { |
| if (it->first == last_key) { |
| position_of_last_key = v.size(); |
| } |
| v.push_back(it); |
| } |
| ASSERT_EQ(m.size(), v.size()); |
| const Map<int, int>::iterator erase_result = m.erase(m.find(last_key)); |
| int index = 0; |
| for (Map<int, int>::iterator it = m.begin(); it != m.end(); ++it, ++index) { |
| if (index == position_of_last_key) { |
| EXPECT_EQ(&*erase_result, &*v[++index]); |
| } |
| ASSERT_EQ(&*it, &*v[index]); |
| } |
| } |
| |
| TEST_F(MapImplTest, IteratorInvalidation) { |
| // Create a set of pseudo-random sizes to test. |
| #ifndef NDEBUG |
| const int kMaxSizeToTest = 100 * 1000; |
| #else |
| const int kMaxSizeToTest = 1000 * 1000; |
| #endif |
| std::set<int> s; |
| int n = kMaxSizeToTest; |
| unsigned int frog = k1 + n; |
| while (n > 1 && s.size() < 25) { |
| s.insert(n); |
| n = static_cast<int>(n * 100 / (101.0 + (frog & 63))); |
| frog *= k2; |
| frog ^= frog >> 17; |
| } |
| // Ensure we test a few small sizes. |
| s.insert(1); |
| s.insert(2); |
| s.insert(3); |
| // Now, the real work. |
| for (std::set<int>::iterator i = s.begin(); i != s.end(); ++i) { |
| StressTestIterators(*i); |
| } |
| } |
| |
| // Test that erase() revalidates iterators. |
| TEST_F(MapImplTest, EraseRevalidates) { |
| map_[3] = map_[13] = map_[20] = 0; |
| const int initial_size = map_.size(); |
| EXPECT_EQ(3, initial_size); |
| std::vector<Map<int, int>::iterator> v; |
| for (Map<int, int>::iterator it = map_.begin(); it != map_.end(); ++it) { |
| v.push_back(it); |
| } |
| EXPECT_EQ(initial_size, v.size()); |
| for (int i = 0; map_.size() <= initial_size * 20; i++) { |
| map_[i] = 0; |
| } |
| const int larger_size = map_.size(); |
| // We've greatly increased the size of the map, so it is highly likely that |
| // the following will corrupt m if erase() doesn't properly revalidate |
| // iterators passed to it. Finishing this routine without crashing indicates |
| // success. |
| for (int i = 0; i < v.size(); i++) { |
| map_.erase(v[i]); |
| } |
| EXPECT_EQ(larger_size - v.size(), map_.size()); |
| } |
| |
| template <typename T> |
| bool IsConstHelper(T& /*t*/) { // NOLINT. We want to catch non-const refs here. |
| return false; |
| } |
| template <typename T> |
| bool IsConstHelper(const T& /*t*/) { |
| return true; |
| } |
| |
| TEST_F(MapImplTest, IteratorConstness) { |
| map_[0] = 0; |
| EXPECT_TRUE(IsConstHelper(*map_.cbegin())); |
| EXPECT_TRUE(IsConstHelper(*const_map_.begin())); |
| EXPECT_FALSE(IsConstHelper(*map_.begin())); |
| } |
| |
| bool IsForwardIteratorHelper(std::forward_iterator_tag /*tag*/) { return true; } |
| |
| TEST_F(MapImplTest, IteratorCategory) { |
| EXPECT_TRUE(IsForwardIteratorHelper( |
| std::iterator_traits<Map<int, int>::iterator>::iterator_category())); |
| EXPECT_TRUE(IsForwardIteratorHelper( |
| std::iterator_traits< |
| Map<int, int>::const_iterator>::iterator_category())); |
| } |
| |
| TEST_F(MapImplTest, InsertSingle) { |
| int32 key = 0; |
| int32 value1 = 100; |
| int32 value2 = 101; |
| |
| // Insert a non-existed key. |
| std::pair<Map<int32, int32>::iterator, bool> result1 = |
| map_.insert(Map<int32, int32>::value_type(key, value1)); |
| ExpectSingleElement(key, value1); |
| |
| Map<int32, int32>::iterator it1 = result1.first; |
| EXPECT_EQ(key, it1->first); |
| EXPECT_EQ(value1, it1->second); |
| EXPECT_TRUE(result1.second); |
| |
| // Insert an existed key. |
| std::pair<Map<int32, int32>::iterator, bool> result2 = |
| map_.insert(Map<int32, int32>::value_type(key, value2)); |
| ExpectSingleElement(key, value1); |
| |
| Map<int32, int32>::iterator it2 = result2.first; |
| EXPECT_TRUE(it1 == it2); |
| EXPECT_FALSE(result2.second); |
| } |
| |
| TEST_F(MapImplTest, InsertByIterator) { |
| int32 key1 = 0; |
| int32 key2 = 1; |
| int32 value1a = 100; |
| int32 value1b = 101; |
| int32 value2a = 200; |
| int32 value2b = 201; |
| |
| std::map<int32, int32> map1; |
| map1[key1] = value1a; |
| map1[key2] = value2a; |
| |
| map_.insert(map1.begin(), map1.end()); |
| ExpectElements(map1); |
| |
| std::map<int32, int32> map2; |
| map2[key1] = value1b; |
| map2[key2] = value2b; |
| |
| map_.insert(map2.begin(), map2.end()); |
| ExpectElements(map1); |
| } |
| |
| TEST_F(MapImplTest, InsertByInitializerList) { |
| map_.insert({{1, 100}, {2, 200}}); |
| ExpectElements({{1, 100}, {2, 200}}); |
| |
| map_.insert({{2, 201}, {3, 301}}); |
| ExpectElements({{1, 100}, {2, 200}, {3, 301}}); |
| } |
| |
| TEST_F(MapImplTest, EraseSingleByKey) { |
| int32 key = 0; |
| int32 value = 100; |
| |
| map_[key] = value; |
| ExpectSingleElement(key, value); |
| |
| // Erase an existing key. |
| EXPECT_EQ(1, map_.erase(key)); |
| EXPECT_TRUE(map_.empty()); |
| EXPECT_EQ(0, map_.size()); |
| EXPECT_TRUE(map_.end() == map_.find(key)); |
| EXPECT_TRUE(map_.begin() == map_.end()); |
| |
| // Erase a non-existing key. |
| EXPECT_EQ(0, map_.erase(key)); |
| } |
| |
| TEST_F(MapImplTest, EraseMutipleByKey) { |
| // erase in one specific order to trigger corner cases |
| for (int i = 0; i < 5; i++) { |
| map_[i] = i; |
| } |
| |
| map_.erase(0); |
| EXPECT_EQ(4, map_.size()); |
| EXPECT_TRUE(map_.end() == map_.find(0)); |
| |
| map_.erase(1); |
| EXPECT_EQ(3, map_.size()); |
| EXPECT_TRUE(map_.end() == map_.find(1)); |
| |
| map_.erase(3); |
| EXPECT_EQ(2, map_.size()); |
| EXPECT_TRUE(map_.end() == map_.find(3)); |
| |
| map_.erase(4); |
| EXPECT_EQ(1, map_.size()); |
| EXPECT_TRUE(map_.end() == map_.find(4)); |
| |
| map_.erase(2); |
| EXPECT_EQ(0, map_.size()); |
| EXPECT_TRUE(map_.end() == map_.find(2)); |
| } |
| |
| TEST_F(MapImplTest, EraseSingleByIterator) { |
| int32 key = 0; |
| int32 value = 100; |
| |
| map_[key] = value; |
| ExpectSingleElement(key, value); |
| |
| Map<int32, int32>::iterator it = map_.find(key); |
| map_.erase(it); |
| EXPECT_TRUE(map_.empty()); |
| EXPECT_EQ(0, map_.size()); |
| EXPECT_TRUE(map_.end() == map_.find(key)); |
| EXPECT_TRUE(map_.begin() == map_.end()); |
| } |
| |
| TEST_F(MapImplTest, ValidIteratorAfterErase) { |
| for (int i = 0; i < 10; i++) { |
| map_[i] = i; |
| } |
| |
| int count = 0; |
| |
| for (Map<int32, int32>::iterator it = map_.begin(); it != map_.end();) { |
| count++; |
| if (it->first % 2 == 1) { |
| map_.erase(it++); |
| } else { |
| ++it; |
| } |
| } |
| |
| EXPECT_EQ(10, count); |
| EXPECT_EQ(5, map_.size()); |
| } |
| |
| TEST_F(MapImplTest, EraseByIterator) { |
| int32 key1 = 0; |
| int32 key2 = 1; |
| int32 value1 = 100; |
| int32 value2 = 101; |
| |
| std::map<int32, int32> map; |
| map[key1] = value1; |
| map[key2] = value2; |
| |
| map_.insert(map.begin(), map.end()); |
| ExpectElements(map); |
| |
| map_.erase(map_.begin(), map_.end()); |
| EXPECT_TRUE(map_.empty()); |
| EXPECT_EQ(0, map_.size()); |
| EXPECT_TRUE(map_.end() == map_.find(key1)); |
| EXPECT_TRUE(map_.end() == map_.find(key2)); |
| EXPECT_TRUE(map_.begin() == map_.end()); |
| } |
| |
| TEST_F(MapImplTest, Clear) { |
| int32 key = 0; |
| int32 value = 100; |
| |
| map_[key] = value; |
| ExpectSingleElement(key, value); |
| |
| map_.clear(); |
| |
| EXPECT_TRUE(map_.empty()); |
| EXPECT_EQ(0, map_.size()); |
| EXPECT_TRUE(map_.end() == map_.find(key)); |
| EXPECT_TRUE(map_.begin() == map_.end()); |
| } |
| |
| static void CopyConstructorHelper(Arena* arena, Map<int32, int32>* m) { |
| int32 key1 = 0; |
| int32 key2 = 1; |
| int32 value1 = 100; |
| int32 value2 = 101; |
| |
| std::map<int32, int32> map; |
| map[key1] = value1; |
| map[key2] = value2; |
| |
| m->insert(map.begin(), map.end()); |
| |
| Map<int32, int32> other(*m); |
| |
| EXPECT_EQ(2, other.size()); |
| EXPECT_EQ(value1, other.at(key1)); |
| EXPECT_EQ(value2, other.at(key2)); |
| } |
| |
| TEST_F(MapImplTest, CopyConstructorWithArena) { |
| Arena a; |
| CopyConstructorHelper(&a, &map_); |
| } |
| |
| TEST_F(MapImplTest, CopyConstructorWithoutArena) { |
| CopyConstructorHelper(NULL, &map_); |
| } |
| |
| TEST_F(MapImplTest, IterConstructor) { |
| int32 key1 = 0; |
| int32 key2 = 1; |
| int32 value1 = 100; |
| int32 value2 = 101; |
| |
| std::map<int32, int32> map; |
| map[key1] = value1; |
| map[key2] = value2; |
| |
| Map<int32, int32> new_map(map.begin(), map.end()); |
| |
| EXPECT_EQ(2, new_map.size()); |
| EXPECT_EQ(value1, new_map.at(key1)); |
| EXPECT_EQ(value2, new_map.at(key2)); |
| } |
| |
| TEST_F(MapImplTest, Assigner) { |
| int32 key1 = 0; |
| int32 key2 = 1; |
| int32 value1 = 100; |
| int32 value2 = 101; |
| |
| std::map<int32, int32> map; |
| map[key1] = value1; |
| map[key2] = value2; |
| |
| map_.insert(map.begin(), map.end()); |
| |
| Map<int32, int32> other; |
| int32 key_other = 123; |
| int32 value_other = 321; |
| other[key_other] = value_other; |
| EXPECT_EQ(1, other.size()); |
| |
| other = map_; |
| |
| EXPECT_EQ(2, other.size()); |
| EXPECT_EQ(value1, other.at(key1)); |
| EXPECT_EQ(value2, other.at(key2)); |
| EXPECT_TRUE(other.find(key_other) == other.end()); |
| |
| // Self assign |
| other = *&other; // Avoid -Wself-assign. |
| EXPECT_EQ(2, other.size()); |
| EXPECT_EQ(value1, other.at(key1)); |
| EXPECT_EQ(value2, other.at(key2)); |
| } |
| |
| TEST_F(MapImplTest, Rehash) { |
| const int test_size = 50; |
| std::map<int32, int32> reference_map; |
| for (int i = 0; i < test_size; i++) { |
| reference_map[i] = i; |
| } |
| for (int i = 0; i < test_size; i++) { |
| map_[i] = reference_map[i]; |
| EXPECT_EQ(reference_map[i], map_[i]); |
| } |
| for (int i = 0; i < test_size; i++) { |
| map_.erase(i); |
| EXPECT_TRUE(map_.end() == map_.find(i)); |
| } |
| EXPECT_TRUE(map_.empty()); |
| } |
| |
| TEST_F(MapImplTest, EqualRange) { |
| int key = 100, key_missing = 101; |
| map_[key] = 100; |
| |
| std::pair<Map<int32, int32>::iterator, Map<int32, int32>::iterator> range = |
| map_.equal_range(key); |
| EXPECT_TRUE(map_.find(key) == range.first); |
| EXPECT_TRUE(++map_.find(key) == range.second); |
| |
| range = map_.equal_range(key_missing); |
| EXPECT_TRUE(map_.end() == range.first); |
| EXPECT_TRUE(map_.end() == range.second); |
| |
| std::pair<Map<int32, int32>::const_iterator, |
| Map<int32, int32>::const_iterator> |
| const_range = const_map_.equal_range(key); |
| EXPECT_TRUE(const_map_.find(key) == const_range.first); |
| EXPECT_TRUE(++const_map_.find(key) == const_range.second); |
| |
| const_range = const_map_.equal_range(key_missing); |
| EXPECT_TRUE(const_map_.end() == const_range.first); |
| EXPECT_TRUE(const_map_.end() == const_range.second); |
| } |
| |
| TEST_F(MapImplTest, ConvertToStdMap) { |
| map_[100] = 101; |
| std::map<int32, int32> std_map(map_.begin(), map_.end()); |
| EXPECT_EQ(1, std_map.size()); |
| EXPECT_EQ(101, std_map[100]); |
| } |
| |
| TEST_F(MapImplTest, ConvertToStdVectorOfPairs) { |
| map_[100] = 101; |
| std::vector<std::pair<int32, int32> > std_vec(map_.begin(), map_.end()); |
| EXPECT_EQ(1, std_vec.size()); |
| EXPECT_EQ(100, std_vec[0].first); |
| EXPECT_EQ(101, std_vec[0].second); |
| } |
| |
| TEST_F(MapImplTest, SwapBasic) { |
| Map<int32, int32> another; |
| map_[9398] = 41999; |
| another[9398] = 41999; |
| another[8070] = 42056; |
| another.swap(map_); |
| EXPECT_THAT(another, |
| testing::UnorderedElementsAre(testing::Pair(9398, 41999))); |
| EXPECT_THAT(map_, testing::UnorderedElementsAre(testing::Pair(8070, 42056), |
| testing::Pair(9398, 41999))); |
| } |
| |
| TEST_F(MapImplTest, SwapArena) { |
| Arena arena1, arena2; |
| Map<int32, int32> m1(&arena1); |
| Map<int32, int32> m2(&arena2); |
| map_[9398] = 41999; |
| m1[9398] = 41999; |
| m1[8070] = 42056; |
| m2[10244] = 10247; |
| m2[8070] = 42056; |
| m1.swap(map_); |
| EXPECT_THAT(m1, testing::UnorderedElementsAre(testing::Pair(9398, 41999))); |
| EXPECT_THAT(map_, testing::UnorderedElementsAre(testing::Pair(8070, 42056), |
| testing::Pair(9398, 41999))); |
| m2.swap(m1); |
| EXPECT_THAT(m1, testing::UnorderedElementsAre(testing::Pair(8070, 42056), |
| testing::Pair(10244, 10247))); |
| EXPECT_THAT(m2, testing::UnorderedElementsAre(testing::Pair(9398, 41999))); |
| } |
| |
| TEST_F(MapImplTest, CopyAssignMapIterator) { |
| TestMap message; |
| MapReflectionTester reflection_tester(unittest::TestMap::descriptor()); |
| reflection_tester.SetMapFieldsViaMapReflection(&message); |
| MapIterator it1 = reflection_tester.MapBegin(&message, "map_int32_int32"); |
| MapIterator it2 = reflection_tester.MapEnd(&message, "map_int32_int32"); |
| it2 = it1; |
| EXPECT_EQ(it1.GetKey().GetInt32Value(), it2.GetKey().GetInt32Value()); |
| } |
| |
| TEST_F(MapImplTest, SpaceUsed) { |
| constexpr size_t kMinCap = 8; |
| |
| Map<int32, int32> m; |
| // An newly constructed map should have no space used. |
| EXPECT_EQ(m.SpaceUsedExcludingSelfLong(), 0); |
| |
| size_t capacity = kMinCap; |
| for (int i = 0; i < 100; ++i) { |
| m[i]; |
| static constexpr double kMaxLoadFactor = .75; |
| if (m.size() >= capacity * kMaxLoadFactor) { |
| capacity *= 2; |
| } |
| EXPECT_EQ(m.SpaceUsedExcludingSelfLong(), |
| sizeof(void*) * capacity + |
| m.size() * sizeof(std::pair<std::pair<int32, int32>, void*>)); |
| } |
| |
| // Test string, and non-scalar keys. |
| Map<std::string, int32> m2; |
| std::string str = "Some arbitrarily large string"; |
| m2[str] = 1; |
| EXPECT_EQ(m2.SpaceUsedExcludingSelfLong(), |
| sizeof(void*) * kMinCap + |
| sizeof(std::pair<std::pair<std::string, int32>, void*>) + |
| internal::StringSpaceUsedExcludingSelfLong(str)); |
| |
| // Test messages, and non-scalar values. |
| Map<int32, TestAllTypes> m3; |
| m3[0].set_optional_string(str); |
| EXPECT_EQ(m3.SpaceUsedExcludingSelfLong(), |
| sizeof(void*) * kMinCap + |
| sizeof(std::pair<std::pair<int32, TestAllTypes>, void*>) + |
| m3[0].SpaceUsedLong() - sizeof(m3[0])); |
| } |
| |
| // Attempts to verify that a map with keys a and b has a random ordering. This |
| // function returns true if it succeeds in observing both possible orderings. |
| bool MapOrderingIsRandom(int a, int b) { |
| bool saw_a_first = false; |
| bool saw_b_first = false; |
| |
| for (int i = 0; i < 50; ++i) { |
| Map<int32, int32> m; |
| m[a] = 0; |
| m[b] = 0; |
| int32 first_element = m.begin()->first; |
| if (first_element == a) saw_a_first = true; |
| if (first_element == b) saw_b_first = true; |
| if (saw_a_first && saw_b_first) { |
| return true; |
| } |
| } |
| |
| return false; |
| } |
| |
| // This test verifies that the iteration order is reasonably random even for |
| // small maps. Currently we only have sufficient randomness for debug builds and |
| // builds where we can use the RDTSC instruction, so we only test for those |
| // builds. |
| #if defined(__x86_64__) && defined(__GNUC__) && \ |
| !defined(GOOGLE_PROTOBUF_NO_RDTSC) |
| TEST_F(MapImplTest, RandomOrdering) { |
| for (int i = 0; i < 10; ++i) { |
| for (int j = i + 1; j < 10; ++j) { |
| EXPECT_TRUE(MapOrderingIsRandom(i, j)) |
| << "Map with keys " << i << " and " << j |
| << " has deterministic ordering"; |
| } |
| } |
| } |
| #endif |
| |
| template <typename Key> |
| void TestTransparent(const Key& key, const Key& miss_key) { |
| Map<std::string, int> m; |
| const auto& cm = m; |
| |
| m.insert({"ABC", 1}); |
| |
| const auto abc_it = m.begin(); |
| |
| m.insert({"DEF", 2}); |
| |
| using testing::Pair; |
| using testing::UnorderedElementsAre; |
| |
| EXPECT_EQ(m.at(key), 1); |
| EXPECT_EQ(cm.at(key), 1); |
| |
| #ifdef PROTOBUF_HAS_DEATH_TEST |
| EXPECT_DEATH(m.at(miss_key), ""); |
| EXPECT_DEATH(cm.at(miss_key), ""); |
| #endif // PROTOBUF_HAS_DEATH_TEST |
| |
| EXPECT_EQ(m.count(key), 1); |
| EXPECT_EQ(cm.count(key), 1); |
| EXPECT_EQ(m.count(miss_key), 0); |
| EXPECT_EQ(cm.count(miss_key), 0); |
| |
| EXPECT_EQ(m.find(key), abc_it); |
| EXPECT_EQ(cm.find(key), abc_it); |
| EXPECT_EQ(m.find(miss_key), m.end()); |
| EXPECT_EQ(cm.find(miss_key), cm.end()); |
| |
| EXPECT_TRUE(m.contains(key)); |
| EXPECT_TRUE(cm.contains(key)); |
| EXPECT_FALSE(m.contains(miss_key)); |
| EXPECT_FALSE(cm.contains(miss_key)); |
| |
| EXPECT_THAT(m.equal_range(key), Pair(abc_it, std::next(abc_it))); |
| EXPECT_THAT(cm.equal_range(key), Pair(abc_it, std::next(abc_it))); |
| EXPECT_THAT(m.equal_range(miss_key), Pair(m.end(), m.end())); |
| EXPECT_THAT(cm.equal_range(miss_key), Pair(m.end(), m.end())); |
| |
| EXPECT_THAT(m, UnorderedElementsAre(Pair("ABC", 1), Pair("DEF", 2))); |
| EXPECT_EQ(m.erase(key), 1); |
| EXPECT_THAT(m, UnorderedElementsAre(Pair("DEF", 2))); |
| EXPECT_EQ(m.erase(key), 0); |
| EXPECT_EQ(m.erase(miss_key), 0); |
| EXPECT_THAT(m, UnorderedElementsAre(Pair("DEF", 2))); |
| |
| m[key]; |
| EXPECT_THAT(m, UnorderedElementsAre(Pair("ABC", 0), Pair("DEF", 2))); |
| m[key] = 1; |
| EXPECT_THAT(m, UnorderedElementsAre(Pair("ABC", 1), Pair("DEF", 2))); |
| } |
| |
| TEST_F(MapImplTest, TransparentLookupForString) { |
| TestTransparent("ABC", "LKJ"); |
| TestTransparent(std::string("ABC"), std::string("LKJ")); |
| #if defined(__cpp_lib_string_view) |
| TestTransparent(std::string_view("ABC"), std::string_view("LKJ")); |
| #endif // defined(__cpp_lib_string_view) |
| |
| // std::reference_wrapper |
| std::string abc = "ABC", lkj = "LKJ"; |
| TestTransparent(std::ref(abc), std::ref(lkj)); |
| TestTransparent(std::cref(abc), std::cref(lkj)); |
| } |
| |
| TEST_F(MapImplTest, ConstInit) { |
| PROTOBUF_CONSTINIT static Map<int, int> map; // NOLINT |
| EXPECT_TRUE(map.empty()); |
| } |
| |
| // Map Field Reflection Test ======================================== |
| |
| static int Func(int i, int j) { return i * j; } |
| |
| static std::string StrFunc(int i, int j) { return StrCat(Func(i, j)); } |
| |
| static int Int(const std::string& value) { |
| int result = 0; |
| std::istringstream(value) >> result; |
| return result; |
| } |
| |
| } // namespace |
| |
| // This class is a friend, so no anonymous namespace. |
| class MapFieldReflectionTest : public testing::Test { |
| protected: |
| typedef FieldDescriptor FD; |
| |
| int MapSize(const Reflection* reflection, const FieldDescriptor* field, |
| const Message& message) { |
| return reflection->MapSize(message, field); |
| } |
| }; |
| |
| namespace { |
| |
| TEST_F(MapFieldReflectionTest, RegularFields) { |
| TestMap message; |
| const Reflection* refl = message.GetReflection(); |
| const Descriptor* desc = message.GetDescriptor(); |
| |
| Map<int32, int32>* map_int32_int32 = message.mutable_map_int32_int32(); |
| Map<int32, double>* map_int32_double = message.mutable_map_int32_double(); |
| Map<std::string, std::string>* map_string_string = |
| message.mutable_map_string_string(); |
| Map<int32, ForeignMessage>* map_int32_foreign_message = |
| message.mutable_map_int32_foreign_message(); |
| |
| for (int i = 0; i < 10; ++i) { |
| (*map_int32_int32)[i] = Func(i, 1); |
| (*map_int32_double)[i] = Func(i, 2); |
| (*map_string_string)[StrFunc(i, 1)] = StrFunc(i, 5); |
| (*map_int32_foreign_message)[i].set_c(Func(i, 6)); |
| } |
| |
| // Get FieldDescriptors for all the fields of interest. |
| const FieldDescriptor* fd_map_int32_int32 = |
| desc->FindFieldByName("map_int32_int32"); |
| const FieldDescriptor* fd_map_int32_double = |
| desc->FindFieldByName("map_int32_double"); |
| const FieldDescriptor* fd_map_string_string = |
| desc->FindFieldByName("map_string_string"); |
| const FieldDescriptor* fd_map_int32_foreign_message = |
| desc->FindFieldByName("map_int32_foreign_message"); |
| |
| const FieldDescriptor* fd_map_int32_in32_key = |
| fd_map_int32_int32->message_type()->FindFieldByName("key"); |
| const FieldDescriptor* fd_map_int32_in32_value = |
| fd_map_int32_int32->message_type()->FindFieldByName("value"); |
| const FieldDescriptor* fd_map_int32_double_key = |
| fd_map_int32_double->message_type()->FindFieldByName("key"); |
| const FieldDescriptor* fd_map_int32_double_value = |
| fd_map_int32_double->message_type()->FindFieldByName("value"); |
| const FieldDescriptor* fd_map_string_string_key = |
| fd_map_string_string->message_type()->FindFieldByName("key"); |
| const FieldDescriptor* fd_map_string_string_value = |
| fd_map_string_string->message_type()->FindFieldByName("value"); |
| const FieldDescriptor* fd_map_int32_foreign_message_key = |
| fd_map_int32_foreign_message->message_type()->FindFieldByName("key"); |
| const FieldDescriptor* fd_map_int32_foreign_message_value = |
| fd_map_int32_foreign_message->message_type()->FindFieldByName("value"); |
| |
| // Get RepeatedPtrField objects for all fields of interest. |
| const RepeatedPtrField<Message>& mf_int32_int32 = |
| refl->GetRepeatedPtrField<Message>(message, fd_map_int32_int32); |
| const RepeatedPtrField<Message>& mf_int32_double = |
| refl->GetRepeatedPtrField<Message>(message, fd_map_int32_double); |
| const RepeatedPtrField<Message>& mf_string_string = |
| refl->GetRepeatedPtrField<Message>(message, fd_map_string_string); |
| const RepeatedPtrField<Message>& mf_int32_foreign_message = |
| refl->GetRepeatedPtrField<Message>(message, fd_map_int32_foreign_message); |
| |
| // Get mutable RepeatedPtrField objects for all fields of interest. |
| RepeatedPtrField<Message>* mmf_int32_int32 = |
| refl->MutableRepeatedPtrField<Message>(&message, fd_map_int32_int32); |
| RepeatedPtrField<Message>* mmf_int32_double = |
| refl->MutableRepeatedPtrField<Message>(&message, fd_map_int32_double); |
| RepeatedPtrField<Message>* mmf_string_string = |
| refl->MutableRepeatedPtrField<Message>(&message, fd_map_string_string); |
| RepeatedPtrField<Message>* mmf_int32_foreign_message = |
| refl->MutableRepeatedPtrField<Message>(&message, |
| fd_map_int32_foreign_message); |
| |
| // Make sure we can do gets through the RepeatedPtrField objects. |
| for (int i = 0; i < 10; ++i) { |
| { |
| // Check gets through const objects. |
| const Message& message_int32_int32 = mf_int32_int32.Get(i); |
| int32 key_int32_int32 = message_int32_int32.GetReflection()->GetInt32( |
| message_int32_int32, fd_map_int32_in32_key); |
| int32 value_int32_int32 = message_int32_int32.GetReflection()->GetInt32( |
| message_int32_int32, fd_map_int32_in32_value); |
| EXPECT_EQ(value_int32_int32, Func(key_int32_int32, 1)); |
| |
| const Message& message_int32_double = mf_int32_double.Get(i); |
| int32 key_int32_double = message_int32_double.GetReflection()->GetInt32( |
| message_int32_double, fd_map_int32_double_key); |
| double value_int32_double = |
| message_int32_double.GetReflection()->GetDouble( |
| message_int32_double, fd_map_int32_double_value); |
| EXPECT_EQ(value_int32_double, Func(key_int32_double, 2)); |
| |
| const Message& message_string_string = mf_string_string.Get(i); |
| std::string key_string_string = |
| message_string_string.GetReflection()->GetString( |
| message_string_string, fd_map_string_string_key); |
| std::string value_string_string = |
| message_string_string.GetReflection()->GetString( |
| message_string_string, fd_map_string_string_value); |
| EXPECT_EQ(value_string_string, StrFunc(Int(key_string_string), 5)); |
| |
| const Message& message_int32_message = mf_int32_foreign_message.Get(i); |
| int32 key_int32_message = message_int32_message.GetReflection()->GetInt32( |
| message_int32_message, fd_map_int32_foreign_message_key); |
| const ForeignMessage& value_int32_message = |
| down_cast<const ForeignMessage&>( |
| message_int32_message.GetReflection()->GetMessage( |
| message_int32_message, fd_map_int32_foreign_message_value)); |
| EXPECT_EQ(value_int32_message.c(), Func(key_int32_message, 6)); |
| } |
| |
| { |
| // Check gets through mutable objects. |
| const Message& message_int32_int32 = mmf_int32_int32->Get(i); |
| int32 key_int32_int32 = message_int32_int32.GetReflection()->GetInt32( |
| message_int32_int32, fd_map_int32_in32_key); |
| int32 value_int32_int32 = message_int32_int32.GetReflection()->GetInt32( |
| message_int32_int32, fd_map_int32_in32_value); |
| EXPECT_EQ(value_int32_int32, Func(key_int32_int32, 1)); |
| |
| const Message& message_int32_double = mmf_int32_double->Get(i); |
| int32 key_int32_double = message_int32_double.GetReflection()->GetInt32( |
| message_int32_double, fd_map_int32_double_key); |
| double value_int32_double = |
| message_int32_double.GetReflection()->GetDouble( |
| message_int32_double, fd_map_int32_double_value); |
| EXPECT_EQ(value_int32_double, Func(key_int32_double, 2)); |
| |
| const Message& message_string_string = mmf_string_string->Get(i); |
| std::string key_string_string = |
| message_string_string.GetReflection()->GetString( |
| message_string_string, fd_map_string_string_key); |
| std::string value_string_string = |
| message_string_string.GetReflection()->GetString( |
| message_string_string, fd_map_string_string_value); |
| EXPECT_EQ(value_string_string, StrFunc(Int(key_string_string), 5)); |
| |
| const Message& message_int32_message = mmf_int32_foreign_message->Get(i); |
| int32 key_int32_message = message_int32_message.GetReflection()->GetInt32( |
| message_int32_message, fd_map_int32_foreign_message_key); |
| const ForeignMessage& value_int32_message = |
| down_cast<const ForeignMessage&>( |
| message_int32_message.GetReflection()->GetMessage( |
| message_int32_message, fd_map_int32_foreign_message_value)); |
| EXPECT_EQ(value_int32_message.c(), Func(key_int32_message, 6)); |
| } |
| } |
| |
| // Do sets through the RepeatedPtrField objects. |
| for (int i = 0; i < 10; i++) { |
| { |
| Message* message_int32_int32 = mmf_int32_int32->Mutable(i); |
| int32 key_int32_int32 = message_int32_int32->GetReflection()->GetInt32( |
| *message_int32_int32, fd_map_int32_in32_key); |
| message_int32_int32->GetReflection()->SetInt32(message_int32_int32, |
| fd_map_int32_in32_value, |
| Func(key_int32_int32, -1)); |
| |
| Message* message_int32_double = mmf_int32_double->Mutable(i); |
| int32 key_int32_double = message_int32_double->GetReflection()->GetInt32( |
| *message_int32_double, fd_map_int32_double_key); |
| message_int32_double->GetReflection()->SetDouble( |
| message_int32_double, fd_map_int32_double_value, |
| Func(key_int32_double, -2)); |
| |
| Message* message_string_string = mmf_string_string->Mutable(i); |
| std::string key_string_string = |
| message_string_string->GetReflection()->GetString( |
| *message_string_string, fd_map_string_string_key); |
| message_string_string->GetReflection()->SetString( |
| message_string_string, fd_map_string_string_value, |
| StrFunc(Int(key_string_string), -5)); |
| |
| Message* message_int32_message = mmf_int32_foreign_message->Mutable(i); |
| int32 key_int32_message = |
| message_int32_message->GetReflection()->GetInt32( |
| *message_int32_message, fd_map_int32_foreign_message_key); |
| ForeignMessage* value_int32_message = down_cast<ForeignMessage*>( |
| message_int32_message->GetReflection()->MutableMessage( |
| message_int32_message, fd_map_int32_foreign_message_value)); |
| value_int32_message->set_c(Func(key_int32_message, -6)); |
| } |
| } |
| |
| // Check gets through mutable objects. |
| for (int i = 0; i < 10; i++) { |
| EXPECT_EQ(Func(i, -1), message.map_int32_int32().at(i)); |
| EXPECT_EQ(Func(i, -2), message.map_int32_double().at(i)); |
| EXPECT_EQ(StrFunc(i, -5), message.map_string_string().at(StrFunc(i, 1))); |
| EXPECT_EQ(Func(i, -6), message.map_int32_foreign_message().at(i).c()); |
| } |
| } |
| |
| TEST_F(MapFieldReflectionTest, RepeatedFieldRefForRegularFields) { |
| TestMap message; |
| const Reflection* refl = message.GetReflection(); |
| const Descriptor* desc = message.GetDescriptor(); |
| |
| Map<int32, int32>* map_int32_int32 = message.mutable_map_int32_int32(); |
| Map<int32, double>* map_int32_double = message.mutable_map_int32_double(); |
| Map<std::string, std::string>* map_string_string = |
| message.mutable_map_string_string(); |
| Map<int32, ForeignMessage>* map_int32_foreign_message = |
| message.mutable_map_int32_foreign_message(); |
| |
| for (int i = 0; i < 10; ++i) { |
| (*map_int32_int32)[i] = Func(i, 1); |
| (*map_int32_double)[i] = Func(i, 2); |
| (*map_string_string)[StrFunc(i, 1)] = StrFunc(i, 5); |
| (*map_int32_foreign_message)[i].set_c(Func(i, 6)); |
| } |
| |
| // Get FieldDescriptors for all the fields of interest. |
| const FieldDescriptor* fd_map_int32_int32 = |
| desc->FindFieldByName("map_int32_int32"); |
| const FieldDescriptor* fd_map_int32_double = |
| desc->FindFieldByName("map_int32_double"); |
| const FieldDescriptor* fd_map_string_string = |
| desc->FindFieldByName("map_string_string"); |
| const FieldDescriptor* fd_map_int32_foreign_message = |
| desc->FindFieldByName("map_int32_foreign_message"); |
| |
| const FieldDescriptor* fd_map_int32_in32_key = |
| fd_map_int32_int32->message_type()->FindFieldByName("key"); |
| const FieldDescriptor* fd_map_int32_in32_value = |
| fd_map_int32_int32->message_type()->FindFieldByName("value"); |
| const FieldDescriptor* fd_map_int32_double_key = |
| fd_map_int32_double->message_type()->FindFieldByName("key"); |
| const FieldDescriptor* fd_map_int32_double_value = |
| fd_map_int32_double->message_type()->FindFieldByName("value"); |
| const FieldDescriptor* fd_map_string_string_key = |
| fd_map_string_string->message_type()->FindFieldByName("key"); |
| const FieldDescriptor* fd_map_string_string_value = |
| fd_map_string_string->message_type()->FindFieldByName("value"); |
| const FieldDescriptor* fd_map_int32_foreign_message_key = |
| fd_map_int32_foreign_message->message_type()->FindFieldByName("key"); |
| const FieldDescriptor* fd_map_int32_foreign_message_value = |
| fd_map_int32_foreign_message->message_type()->FindFieldByName("value"); |
| |
| // Get RepeatedFieldRef objects for all fields of interest. |
| const RepeatedFieldRef<Message> mf_int32_int32 = |
| refl->GetRepeatedFieldRef<Message>(message, fd_map_int32_int32); |
| const RepeatedFieldRef<Message> mf_int32_double = |
| refl->GetRepeatedFieldRef<Message>(message, fd_map_int32_double); |
| const RepeatedFieldRef<Message> mf_string_string = |
| refl->GetRepeatedFieldRef<Message>(message, fd_map_string_string); |
| const RepeatedFieldRef<Message> mf_int32_foreign_message = |
| refl->GetRepeatedFieldRef<Message>(message, fd_map_int32_foreign_message); |
| |
| // Get mutable RepeatedFieldRef objects for all fields of interest. |
| const MutableRepeatedFieldRef<Message> mmf_int32_int32 = |
| refl->GetMutableRepeatedFieldRef<Message>(&message, fd_map_int32_int32); |
| const MutableRepeatedFieldRef<Message> mmf_int32_double = |
| refl->GetMutableRepeatedFieldRef<Message>(&message, fd_map_int32_double); |
| const MutableRepeatedFieldRef<Message> mmf_string_string = |
| refl->GetMutableRepeatedFieldRef<Message>(&message, fd_map_string_string); |
| const MutableRepeatedFieldRef<Message> mmf_int32_foreign_message = |
| refl->GetMutableRepeatedFieldRef<Message>(&message, |
| fd_map_int32_foreign_message); |
| |
| // Get entry default instances |
| std::unique_ptr<Message> entry_int32_int32( |
| MessageFactory::generated_factory() |
| ->GetPrototype(fd_map_int32_int32->message_type()) |
| ->New()); |
| std::unique_ptr<Message> entry_int32_double( |
| MessageFactory::generated_factory() |
| ->GetPrototype(fd_map_int32_double->message_type()) |
| ->New()); |
| std::unique_ptr<Message> entry_string_string( |
| MessageFactory::generated_factory() |
| ->GetPrototype(fd_map_string_string->message_type()) |
| ->New()); |
| std::unique_ptr<Message> entry_int32_foreign_message( |
| MessageFactory::generated_factory() |
| ->GetPrototype(fd_map_int32_foreign_message->message_type()) |
| ->New()); |
| |
| EXPECT_EQ(10, mf_int32_int32.size()); |
| EXPECT_EQ(10, mmf_int32_int32.size()); |
| EXPECT_EQ(10, mf_int32_double.size()); |
| EXPECT_EQ(10, mmf_int32_double.size()); |
| EXPECT_EQ(10, mf_string_string.size()); |
| EXPECT_EQ(10, mmf_string_string.size()); |
| EXPECT_EQ(10, mf_int32_foreign_message.size()); |
| EXPECT_EQ(10, mmf_int32_foreign_message.size()); |
| |
| EXPECT_FALSE(mf_int32_int32.empty()); |
| EXPECT_FALSE(mmf_int32_int32.empty()); |
| EXPECT_FALSE(mf_int32_double.empty()); |
| EXPECT_FALSE(mmf_int32_double.empty()); |
| EXPECT_FALSE(mf_string_string.empty()); |
| EXPECT_FALSE(mmf_string_string.empty()); |
| EXPECT_FALSE(mf_int32_foreign_message.empty()); |
| EXPECT_FALSE(mmf_int32_foreign_message.empty()); |
| |
| // Make sure we can do gets through the RepeatedFieldRef objects. |
| for (int i = 0; i < 10; ++i) { |
| { |
| // Check gets through const objects. |
| const Message& message_int32_int32 = |
| mf_int32_int32.Get(i, entry_int32_int32.get()); |
| int32 key_int32_int32 = message_int32_int32.GetReflection()->GetInt32( |
| message_int32_int32, fd_map_int32_in32_key); |
| int32 value_int32_int32 = message_int32_int32.GetReflection()->GetInt32( |
| message_int32_int32, fd_map_int32_in32_value); |
| EXPECT_EQ(value_int32_int32, Func(key_int32_int32, 1)); |
| |
| const Message& message_int32_double = |
| mf_int32_double.Get(i, entry_int32_double.get()); |
| int32 key_int32_double = message_int32_double.GetReflection()->GetInt32( |
| message_int32_double, fd_map_int32_double_key); |
| double value_int32_double = |
| message_int32_double.GetReflection()->GetDouble( |
| message_int32_double, fd_map_int32_double_value); |
| EXPECT_EQ(value_int32_double, Func(key_int32_double, 2)); |
| |
| const Message& message_string_string = |
| mf_string_string.Get(i, entry_string_string.get()); |
| std::string key_string_string = |
| message_string_string.GetReflection()->GetString( |
| message_string_string, fd_map_string_string_key); |
| std::string value_string_string = |
| message_string_string.GetReflection()->GetString( |
| message_string_string, fd_map_string_string_value); |
| EXPECT_EQ(value_string_string, StrFunc(Int(key_string_string), 5)); |
| |
| const Message& message_int32_message = |
| mf_int32_foreign_message.Get(i, entry_int32_foreign_message.get()); |
| int32 key_int32_message = message_int32_message.GetReflection()->GetInt32( |
| message_int32_message, fd_map_int32_foreign_message_key); |
| const ForeignMessage& value_int32_message = |
| down_cast<const ForeignMessage&>( |
| message_int32_message.GetReflection()->GetMessage( |
| message_int32_message, fd_map_int32_foreign_message_value)); |
| EXPECT_EQ(value_int32_message.c(), Func(key_int32_message, 6)); |
| } |
| |
| { |
| // Check gets through mutable objects. |
| const Message& message_int32_int32 = |
| mmf_int32_int32.Get(i, entry_int32_int32.get()); |
| int32 key_int32_int32 = message_int32_int32.GetReflection()->GetInt32( |
| message_int32_int32, fd_map_int32_in32_key); |
| int32 value_int32_int32 = message_int32_int32.GetReflection()->GetInt32( |
| message_int32_int32, fd_map_int32_in32_value); |
| EXPECT_EQ(value_int32_int32, Func(key_int32_int32, 1)); |
| |
| const Message& message_int32_double = |
| mmf_int32_double.Get(i, entry_int32_double.get()); |
| int32 key_int32_double = message_int32_double.GetReflection()->GetInt32( |
| message_int32_double, fd_map_int32_double_key); |
| double value_int32_double = |
| message_int32_double.GetReflection()->GetDouble( |
| message_int32_double, fd_map_int32_double_value); |
| EXPECT_EQ(value_int32_double, Func(key_int32_double, 2)); |
| |
| const Message& message_string_string = |
| mmf_string_string.Get(i, entry_string_string.get()); |
| std::string key_string_string = |
| message_string_string.GetReflection()->GetString( |
| message_string_string, fd_map_string_string_key); |
| std::string value_string_string = |
| message_string_string.GetReflection()->GetString( |
| message_string_string, fd_map_string_string_value); |
| EXPECT_EQ(value_string_string, StrFunc(Int(key_string_string), 5)); |
| |
| const Message& message_int32_message = |
| mmf_int32_foreign_message.Get(i, entry_int32_foreign_message.get()); |
| int32 key_int32_message = message_int32_message.GetReflection()->GetInt32( |
| message_int32_message, fd_map_int32_foreign_message_key); |
| const ForeignMessage& value_int32_message = |
| down_cast<const ForeignMessage&>( |
| message_int32_message.GetReflection()->GetMessage( |
| message_int32_message, fd_map_int32_foreign_message_value)); |
| EXPECT_EQ(value_int32_message.c(), Func(key_int32_message, 6)); |
| } |
| } |
| |
| // Make sure we can do sets through the RepeatedFieldRef objects. |
| for (int i = 0; i < 10; i++) { |
| const Message& message_int32_int32 = |
| mmf_int32_int32.Get(i, entry_int32_int32.get()); |
| int key = message_int32_int32.GetReflection()->GetInt32( |
| message_int32_int32, fd_map_int32_in32_key); |
| |
| entry_int32_int32->GetReflection()->SetInt32( |
| entry_int32_int32.get(), fd_map_int32_int32->message_type()->field(0), |
| key); |
| entry_int32_int32->GetReflection()->SetInt32( |
| entry_int32_int32.get(), fd_map_int32_int32->message_type()->field(1), |
| Func(key, -1)); |
| entry_int32_double->GetReflection()->SetInt32( |
| entry_int32_double.get(), fd_map_int32_double->message_type()->field(0), |
| key); |
| entry_int32_double->GetReflection()->SetDouble( |
| entry_int32_double.get(), fd_map_int32_double->message_type()->field(1), |
| Func(key, -2)); |
| entry_string_string->GetReflection()->SetString( |
| entry_string_string.get(), |
| fd_map_string_string->message_type()->field(0), StrFunc(key, 1)); |
| entry_string_string->GetReflection()->SetString( |
| entry_string_string.get(), |
| fd_map_string_string->message_type()->field(1), StrFunc(key, -5)); |
| entry_int32_foreign_message->GetReflection()->SetInt32( |
| entry_int32_foreign_message.get(), |
| fd_map_int32_foreign_message->message_type()->field(0), key); |
| Message* value_message = |
| entry_int32_foreign_message->GetReflection()->MutableMessage( |
| entry_int32_foreign_message.get(), |
| fd_map_int32_foreign_message->message_type()->field(1)); |
| value_message->GetReflection()->SetInt32( |
| value_message, value_message->GetDescriptor()->FindFieldByName("c"), |
| Func(key, -6)); |
| |
| mmf_int32_int32.Set(i, *entry_int32_int32); |
| mmf_int32_double.Set(i, *entry_int32_double); |
| mmf_string_string.Set(i, *entry_string_string); |
| mmf_int32_foreign_message.Set(i, *entry_int32_foreign_message); |
| } |
| |
| for (int i = 0; i < 10; i++) { |
| EXPECT_EQ(Func(i, -1), message.map_int32_int32().at(i)); |
| EXPECT_EQ(Func(i, -2), message.map_int32_double().at(i)); |
| EXPECT_EQ(StrFunc(i, -5), message.map_string_string().at(StrFunc(i, 1))); |
| EXPECT_EQ(Func(i, -6), message.map_int32_foreign_message().at(i).c()); |
| } |
| |
| // Test iterators. |
| { |
| int index = 0; |
| std::unordered_map<int32, int32> result; |
| for (RepeatedFieldRef<Message>::iterator it = mf_int32_int32.begin(); |
| it != mf_int32_int32.end(); ++it) { |
| const Message& message = *it; |
| int32 key = |
| message.GetReflection()->GetInt32(message, fd_map_int32_in32_key); |
| int32 value = |
| message.GetReflection()->GetInt32(message, fd_map_int32_in32_value); |
| result[key] = value; |
| ++index; |
| } |
| EXPECT_EQ(10, index); |
| for (std::unordered_map<int32, int32>::const_iterator it = result.begin(); |
| it != result.end(); ++it) { |
| EXPECT_EQ(message.map_int32_int32().at(it->first), it->second); |
| } |
| } |
| |
| { |
| int index = 0; |
| std::unordered_map<int32, double> result; |
| for (RepeatedFieldRef<Message>::iterator it = mf_int32_double.begin(); |
| it != mf_int32_double.end(); ++it) { |
| const Message& message = *it; |
| int32 key = |
| message.GetReflection()->GetInt32(message, fd_map_int32_double_key); |
| double value = message.GetReflection()->GetDouble( |
| message, fd_map_int32_double_value); |
| result[key] = value; |
| ++index; |
| } |
| EXPECT_EQ(10, index); |
| for (std::unordered_map<int32, double>::const_iterator it = result.begin(); |
| it != result.end(); ++it) { |
| EXPECT_EQ(message.map_int32_double().at(it->first), it->second); |
| } |
| } |
| |
| { |
| int index = 0; |
| std::unordered_map<std::string, std::string> result; |
| for (RepeatedFieldRef<Message>::iterator it = mf_string_string.begin(); |
| it != mf_string_string.end(); ++it) { |
| const Message& message = *it; |
| std::string key = |
| message.GetReflection()->GetString(message, fd_map_string_string_key); |
| std::string value = message.GetReflection()->GetString( |
| message, fd_map_string_string_value); |
| result[key] = value; |
| ++index; |
| } |
| EXPECT_EQ(10, index); |
| for (std::unordered_map<std::string, std::string>::const_iterator it = |
| result.begin(); |
| it != result.end(); ++it) { |
| EXPECT_EQ(message.map_string_string().at(it->first), it->second); |
| } |
| } |
| |
| { |
| int index = 0; |
| std::map<int32, ForeignMessage> result; |
| for (RepeatedFieldRef<Message>::iterator it = |
| mf_int32_foreign_message.begin(); |
| it != mf_int32_foreign_message.end(); ++it) { |
| const Message& message = *it; |
| int32 key = message.GetReflection()->GetInt32( |
| message, fd_map_int32_foreign_message_key); |
| const ForeignMessage& sub_message = |
| down_cast<const ForeignMessage&>(message.GetReflection()->GetMessage( |
| message, fd_map_int32_foreign_message_value)); |
| result[key].MergeFrom(sub_message); |
| ++index; |
| } |
| EXPECT_EQ(10, index); |
| for (std::map<int32, ForeignMessage>::const_iterator it = result.begin(); |
| it != result.end(); ++it) { |
| EXPECT_EQ(message.map_int32_foreign_message().at(it->first).c(), |
| it->second.c()); |
| } |
| } |
| |
| // Test MutableRepeatedFieldRef::Add() |
| entry_int32_int32->GetReflection()->SetInt32( |
| entry_int32_int32.get(), fd_map_int32_int32->message_type()->field(0), |
| 4321); |
| entry_int32_int32->GetReflection()->SetInt32( |
| entry_int32_int32.get(), fd_map_int32_int32->message_type()->field(1), |
| 1234); |
| mmf_int32_int32.Add(*entry_int32_int32); |
| EXPECT_EQ(1234, message.map_int32_int32().at(4321)); |
| |
| entry_int32_double->GetReflection()->SetInt32( |
| entry_int32_double.get(), fd_map_int32_double->message_type()->field(0), |
| 4321); |
| entry_int32_double->GetReflection()->SetDouble( |
| entry_int32_double.get(), fd_map_int32_double->message_type()->field(1), |
| 1234.0); |
| mmf_int32_double.Add(*entry_int32_double); |
| EXPECT_EQ(1234.0, message.map_int32_double().at(4321)); |
| |
| entry_string_string->GetReflection()->SetString( |
| entry_string_string.get(), fd_map_string_string->message_type()->field(0), |
| "4321"); |
| entry_string_string->GetReflection()->SetString( |
| entry_string_string.get(), fd_map_string_string->message_type()->field(1), |
| "1234"); |
| mmf_string_string.Add(*entry_string_string); |
| EXPECT_EQ("1234", message.map_string_string().at("4321")); |
| |
| entry_int32_foreign_message->GetReflection()->SetInt32( |
| entry_int32_foreign_message.get(), |
| fd_map_int32_foreign_message->message_type()->field(0), 4321); |
| Message* value_message = |
| entry_int32_foreign_message->GetReflection()->MutableMessage( |
| entry_int32_foreign_message.get(), |
| fd_map_int32_foreign_message->message_type()->field(1)); |
| ForeignMessage foreign_message; |
| foreign_message.set_c(1234); |
| value_message->CopyFrom(foreign_message); |
| |
| mmf_int32_foreign_message.Add(*entry_int32_foreign_message); |
| EXPECT_EQ(1234, message.map_int32_foreign_message().at(4321).c()); |
| |
| // Test Reflection::AddAllocatedMessage |
| Message* free_entry_string_string = |
| MessageFactory::generated_factory() |
| ->GetPrototype(fd_map_string_string->message_type()) |
| ->New(); |
| entry_string_string->GetReflection()->SetString( |
| free_entry_string_string, fd_map_string_string->message_type()->field(0), |
| "4321"); |
| entry_string_string->GetReflection()->SetString( |
| free_entry_string_string, fd_map_string_string->message_type()->field(1), |
| "1234"); |
| refl->AddAllocatedMessage(&message, fd_map_string_string, |
| free_entry_string_string); |
| |
| // Test MutableRepeatedFieldRef::RemoveLast() |
| mmf_int32_int32.RemoveLast(); |
| mmf_int32_double.RemoveLast(); |
| mmf_string_string.RemoveLast(); |
| mmf_int32_foreign_message.RemoveLast(); |
| EXPECT_EQ(10, message.map_int32_int32().size()); |
| EXPECT_EQ(10, message.map_int32_double().size()); |
| EXPECT_EQ(11, message.map_string_string().size()); |
| EXPECT_EQ(10, message.map_int32_foreign_message().size()); |
| |
| // Test MutableRepeatedFieldRef::SwapElements() |
| { |
| const Message& message0a = mmf_int32_int32.Get(0, entry_int32_int32.get()); |
| int32 int32_value0a = |
| message0a.GetReflection()->GetInt32(message0a, fd_map_int32_in32_value); |
| const Message& message9a = mmf_int32_int32.Get(9, entry_int32_int32.get()); |
| int32 int32_value9a = |
| message9a.GetReflection()->GetInt32(message9a, fd_map_int32_in32_value); |
| |
| mmf_int32_int32.SwapElements(0, 9); |
| |
| const Message& message0b = mmf_int32_int32.Get(0, entry_int32_int32.get()); |
| int32 int32_value0b = |
| message0b.GetReflection()->GetInt32(message0b, fd_map_int32_in32_value); |
| const Message& message9b = mmf_int32_int32.Get(9, entry_int32_int32.get()); |
| int32 int32_value9b = |
| message9b.GetReflection()->GetInt32(message9b, fd_map_int32_in32_value); |
| |
| EXPECT_EQ(int32_value9a, int32_value0b); |
| EXPECT_EQ(int32_value0a, int32_value9b); |
| } |
| |
| { |
| const Message& message0a = |
| mmf_int32_double.Get(0, entry_int32_double.get()); |
| double double_value0a = message0a.GetReflection()->GetDouble( |
| message0a, fd_map_int32_double_value); |
| const Message& message9a = |
| mmf_int32_double.Get(9, entry_int32_double.get()); |
| double double_value9a = message9a.GetReflection()->GetDouble( |
| message9a, fd_map_int32_double_value); |
| |
| mmf_int32_double.SwapElements(0, 9); |
| |
| const Message& message0b = |
| mmf_int32_double.Get(0, entry_int32_double.get()); |
| double double_value0b = message0b.GetReflection()->GetDouble( |
| message0b, fd_map_int32_double_value); |
| const Message& message9b = |
| mmf_int32_double.Get(9, entry_int32_double.get()); |
| double double_value9b = message9b.GetReflection()->GetDouble( |
| message9b, fd_map_int32_double_value); |
| |
| EXPECT_EQ(double_value9a, double_value0b); |
| EXPECT_EQ(double_value0a, double_value9b); |
| } |
| |
| { |
| const Message& message0a = |
| mmf_string_string.Get(0, entry_string_string.get()); |
| std::string string_value0a = message0a.GetReflection()->GetString( |
| message0a, fd_map_string_string_value); |
| const Message& message9a = |
| mmf_string_string.Get(9, entry_string_string.get()); |
| std::string string_value9a = message9a.GetReflection()->GetString( |
| message9a, fd_map_string_string_value); |
| |
| mmf_string_string.SwapElements(0, 9); |
| |
| const Message& message0b = |
| mmf_string_string.Get(0, entry_string_string.get()); |
| std::string string_value0b = message0b.GetReflection()->GetString( |
| message0b, fd_map_string_string_value); |
| const Message& message9b = |
| mmf_string_string.Get(9, entry_string_string.get()); |
| std::string string_value9b = message9b.GetReflection()->GetString( |
| message9b, fd_map_string_string_value); |
| |
| EXPECT_EQ(string_value9a, string_value0b); |
| EXPECT_EQ(string_value0a, string_value9b); |
| } |
| |
| { |
| const Message& message0a = |
| mmf_int32_foreign_message.Get(0, entry_int32_foreign_message.get()); |
| const ForeignMessage& sub_message0a = |
| down_cast<const ForeignMessage&>(message0a.GetReflection()->GetMessage( |
| message0a, fd_map_int32_foreign_message_value)); |
| int32 int32_value0a = sub_message0a.c(); |
| const Message& message9a = |
| mmf_int32_foreign_message.Get(9, entry_int32_foreign_message.get()); |
| const ForeignMessage& sub_message9a = |
| down_cast<const ForeignMessage&>(message9a.GetReflection()->GetMessage( |
| message9a, fd_map_int32_foreign_message_value)); |
| int32 int32_value9a = sub_message9a.c(); |
| |
| mmf_int32_foreign_message.SwapElements(0, 9); |
| |
| const Message& message0b = |
| mmf_int32_foreign_message.Get(0, entry_int32_foreign_message.get()); |
| const ForeignMessage& sub_message0b = |
| down_cast<const ForeignMessage&>(message0b.GetReflection()->GetMessage( |
| message0b, fd_map_int32_foreign_message_value)); |
| int32 int32_value0b = sub_message0b.c(); |
| const Message& message9b = |
| mmf_int32_foreign_message.Get(9, entry_int32_foreign_message.get()); |
| const ForeignMessage& sub_message9b = |
| down_cast<const ForeignMessage&>(message9b.GetReflection()->GetMessage( |
| message9b, fd_map_int32_foreign_message_value)); |
| int32 int32_value9b = sub_message9b.c(); |
| |
| EXPECT_EQ(int32_value9a, int32_value0b); |
| EXPECT_EQ(int32_value0a, int32_value9b); |
| } |
| } |
| |
| TEST_F(MapFieldReflectionTest, RepeatedFieldRefMergeFromAndSwap) { |
| // Set-up message content. |
| TestMap m0, m1, m2; |
| for (int i = 0; i < 10; ++i) { |
| (*m0.mutable_map_int32_int32())[i] = Func(i, 1); |
| (*m0.mutable_map_int32_double())[i] = Func(i, 2); |
| (*m0.mutable_map_string_string())[StrFunc(i, 1)] = StrFunc(i, 5); |
| (*m0.mutable_map_int32_foreign_message())[i].set_c(Func(i, 6)); |
| (*m1.mutable_map_int32_int32())[i + 10] = Func(i, 11); |
| (*m1.mutable_map_int32_double())[i + 10] = Func(i, 12); |
| (*m1.mutable_map_string_string())[StrFunc(i + 10, 1)] = StrFunc(i, 15); |
| (*m1.mutable_map_int32_foreign_message())[i + 10].set_c(Func(i, 16)); |
| (*m2.mutable_map_int32_int32())[i + 20] = Func(i, 21); |
| (*m2.mutable_map_int32_double())[i + 20] = Func(i, 22); |
| (*m2.mutable_map_string_string())[StrFunc(i + 20, 1)] = StrFunc(i, 25); |
| (*m2.mutable_map_int32_foreign_message())[i + 20].set_c(Func(i, 26)); |
| } |
| |
| const Reflection* refl = m0.GetReflection(); |
| const Descriptor* desc = m0.GetDescriptor(); |
| |
| // Get FieldDescriptors for all the fields of interest. |
| const FieldDescriptor* fd_map_int32_int32 = |
| desc->FindFieldByName("map_int32_int32"); |
| const FieldDescriptor* fd_map_int32_double = |
| desc->FindFieldByName("map_int32_double"); |
| const FieldDescriptor* fd_map_string_string = |
| desc->FindFieldByName("map_string_string"); |
| const FieldDescriptor* fd_map_int32_foreign_message = |
| desc->FindFieldByName("map_int32_foreign_message"); |
| |
| // Get MutableRepeatedFieldRef objects for all fields of interest. |
| const MutableRepeatedFieldRef<Message> mmf_int32_int32 = |
| refl->GetMutableRepeatedFieldRef<Message>(&m0, fd_map_int32_int32); |
| const MutableRepeatedFieldRef<Message> mmf_int32_double = |
| refl->GetMutableRepeatedFieldRef<Message>(&m0, fd_map_int32_double); |
| const MutableRepeatedFieldRef<Message> mmf_string_string = |
| refl->GetMutableRepeatedFieldRef<Message>(&m0, fd_map_string_string); |
| const MutableRepeatedFieldRef<Message> mmf_int32_foreign_message = |
| refl->GetMutableRepeatedFieldRef<Message>(&m0, |
| fd_map_int32_foreign_message); |
| |
| // Test MutableRepeatedRef::CopyFrom |
| mmf_int32_int32.CopyFrom( |
| refl->GetRepeatedFieldRef<Message>(m1, fd_map_int32_int32)); |
| mmf_int32_double.CopyFrom( |
| refl->GetRepeatedFieldRef<Message>(m1, fd_map_int32_double)); |
| mmf_string_string.CopyFrom( |
| refl->GetRepeatedFieldRef<Message>(m1, fd_map_string_string)); |
| mmf_int32_foreign_message.CopyFrom( |
| refl->GetRepeatedFieldRef<Message>(m1, fd_map_int32_foreign_message)); |
| |
| for (int i = 0; i < 10; ++i) { |
| EXPECT_EQ(Func(i, 11), m0.map_int32_int32().at(i + 10)); |
| EXPECT_EQ(Func(i, 12), m0.map_int32_double().at(i + 10)); |
| EXPECT_EQ(StrFunc(i, 15), m0.map_string_string().at(StrFunc(i + 10, 1))); |
| EXPECT_EQ(Func(i, 16), m0.map_int32_foreign_message().at(i + 10).c()); |
| } |
| |
| // Test MutableRepeatedRef::MergeFrom |
| mmf_int32_int32.MergeFrom( |
| refl->GetRepeatedFieldRef<Message>(m2, fd_map_int32_int32)); |
| mmf_int32_double.MergeFrom( |
| refl->GetRepeatedFieldRef<Message>(m2, fd_map_int32_double)); |
| mmf_string_string.MergeFrom( |
| refl->GetRepeatedFieldRef<Message>(m2, fd_map_string_string)); |
| mmf_int32_foreign_message.MergeFrom( |
| refl->GetRepeatedFieldRef<Message>(m2, fd_map_int32_foreign_message)); |
| for (int i = 0; i < 10; ++i) { |
| EXPECT_EQ(Func(i, 21), m0.map_int32_int32().at(i + 20)); |
| EXPECT_EQ(Func(i, 22), m0.map_int32_double().at(i + 20)); |
| EXPECT_EQ(StrFunc(i, 25), m0.map_string_string().at(StrFunc(i + 20, 1))); |
| EXPECT_EQ(Func(i, 26), m0.map_int32_foreign_message().at(i + 20).c()); |
| } |
| |
| // Test MutableRepeatedRef::Swap |
| // Swap between m0 and m2. |
| mmf_int32_int32.Swap( |
| refl->GetMutableRepeatedFieldRef<Message>(&m2, fd_map_int32_int32)); |
| mmf_int32_double.Swap( |
| refl->GetMutableRepeatedFieldRef<Message>(&m2, fd_map_int32_double)); |
| mmf_string_string.Swap( |
| refl->GetMutableRepeatedFieldRef<Message>(&m2, fd_map_string_string)); |
| mmf_int32_foreign_message.Swap(refl->GetMutableRepeatedFieldRef<Message>( |
| &m2, fd_map_int32_foreign_message)); |
| for (int i = 0; i < 10; ++i) { |
| // Check the content of m0. |
| EXPECT_EQ(Func(i, 21), m0.map_int32_int32().at(i + 20)); |
| EXPECT_EQ(Func(i, 22), m0.map_int32_double().at(i + 20)); |
| EXPECT_EQ(StrFunc(i, 25), m0.map_string_string().at(StrFunc(i + 20, 1))); |
| EXPECT_EQ(Func(i, 26), m0.map_int32_foreign_message().at(i + 20).c()); |
| |
| // Check the content of m2. |
| EXPECT_EQ(Func(i, 11), m2.map_int32_int32().at(i + 10)); |
| EXPECT_EQ(Func(i, 12), m2.map_int32_double().at(i + 10)); |
| EXPECT_EQ(StrFunc(i, 15), m2.map_string_string().at(StrFunc(i + 10, 1))); |
| EXPECT_EQ(Func(i, 16), m2.map_int32_foreign_message().at(i + 10).c()); |
| EXPECT_EQ(Func(i, 21), m2.map_int32_int32().at(i + 20)); |
| EXPECT_EQ(Func(i, 22), m2.map_int32_double().at(i + 20)); |
| EXPECT_EQ(StrFunc(i, 25), m2.map_string_string().at(StrFunc(i + 20, 1))); |
| EXPECT_EQ(Func(i, 26), m2.map_int32_foreign_message().at(i + 20).c()); |
| } |
| |
| // TODO(teboring): add test for duplicated key |
| } |
| |
| TEST_F(MapFieldReflectionTest, MapSizeWithDuplicatedKey) { |
| // Dynamic Message |
| { |
| DynamicMessageFactory factory; |
| std::unique_ptr<Message> message( |
| factory.GetPrototype(unittest::TestMap::descriptor())->New()); |
| const Reflection* reflection = message->GetReflection(); |
| const FieldDescriptor* field = |
| unittest::TestMap::descriptor()->FindFieldByName("map_int32_int32"); |
| |
| Message* entry1 = reflection->AddMessage(message.get(), field); |
| Message* entry2 = reflection->AddMessage(message.get(), field); |
| |
| const Reflection* entry_reflection = entry1->GetReflection(); |
| const FieldDescriptor* key_field = |
| entry1->GetDescriptor()->FindFieldByName("key"); |
| entry_reflection->SetInt32(entry1, key_field, 1); |
| entry_reflection->SetInt32(entry2, key_field, 1); |
| |
| EXPECT_EQ(2, reflection->FieldSize(*message, field)); |
| EXPECT_EQ(1, MapSize(reflection, field, *message)); |
| EXPECT_EQ(2, reflection->FieldSize(*message, field)); |
| } |
| |
| // Generated Message |
| { |
| unittest::TestMap message; |
| const Reflection* reflection = message.GetReflection(); |
| const FieldDescriptor* field = |
| message.GetDescriptor()->FindFieldByName("map_int32_int32"); |
| |
| Message* entry1 = reflection->AddMessage(&message, field); |
| Message* entry2 = reflection->AddMessage(&message, field); |
| |
| const Reflection* entry_reflection = entry1->GetReflection(); |
| const FieldDescriptor* key_field = |
| entry1->GetDescriptor()->FindFieldByName("key"); |
| entry_reflection->SetInt32(entry1, key_field, 1); |
| entry_reflection->SetInt32(entry2, key_field, 1); |
| |
| EXPECT_EQ(2, reflection->FieldSize(message, field)); |
| EXPECT_EQ(1, MapSize(reflection, field, message)); |
| } |
| } |
| |
| TEST_F(MapFieldReflectionTest, UninitializedEntry) { |
| unittest::TestRequiredMessageMap message; |
| const Reflection* reflection = message.GetReflection(); |
| const FieldDescriptor* field = |
| message.GetDescriptor()->FindFieldByName("map_field"); |
| auto entry = reflection->AddMessage(&message, field); |
| EXPECT_FALSE(entry->IsInitialized()); |
| EXPECT_FALSE(message.IsInitialized()); |
| } |
| |
| class MyMapEntry |
| : public internal::MapEntry<MyMapEntry, ::google::protobuf::int32, ::google::protobuf::int32, |
| internal::WireFormatLite::TYPE_INT32, |
| internal::WireFormatLite::TYPE_INT32> { |
| public: |
| constexpr MyMapEntry() {} |
| MyMapEntry(Arena*) { std::abort(); } |
| Metadata GetMetadata() const override { std::abort(); } |
| static bool ValidateKey(void*) { return true; } |
| static bool ValidateValue(void*) { return true; } |
| }; |
| |
| class MyMapEntryLite |
| : public internal::MapEntryLite<MyMapEntryLite, ::google::protobuf::int32, ::google::protobuf::int32, |
| internal::WireFormatLite::TYPE_INT32, |
| internal::WireFormatLite::TYPE_INT32> { |
| public: |
| constexpr MyMapEntryLite() {} |
| explicit MyMapEntryLite(Arena*) { std::abort(); } |
| static bool ValidateKey(void*) { return true; } |
| static bool ValidateValue(void*) { return true; } |
| }; |
| |
| TEST(MapEntryTest, ConstInit) { |
| // This verifies that `MapEntry`, `MapEntryLite` and `MapEntryImpl` can be |
| // constant initialized. |
| PROTOBUF_CONSTINIT static MyMapEntry entry{}; |
| EXPECT_NE(entry.SpaceUsed(), 0); |
| |
| PROTOBUF_CONSTINIT static MyMapEntryLite entry_lite{}; // NOLINT |
| EXPECT_TRUE(entry_lite.IsInitialized()); |
| } |
| |
| // Generated Message Test =========================================== |
| |
| TEST(GeneratedMapFieldTest, Accessors) { |
| unittest::TestMap message; |
| |
| MapTestUtil::SetMapFields(&message); |
| MapTestUtil::ExpectMapFieldsSet(message); |
| |
| MapTestUtil::ModifyMapFields(&message); |
| MapTestUtil::ExpectMapFieldsModified(message); |
| } |
| |
| TEST(GeneratedMapFieldTest, SetMapFieldsInitialized) { |
| unittest::TestMap message; |
| |
| MapTestUtil::SetMapFieldsInitialized(&message); |
| MapTestUtil::ExpectMapFieldsSetInitialized(message); |
| } |
| |
| TEST(GeneratedMapFieldTest, Proto2SetMapFieldsInitialized) { |
| unittest::TestEnumMap message; |
| EXPECT_EQ(unittest::PROTO2_MAP_ENUM_FOO, |
| (*message.mutable_known_map_field())[0]); |
| } |
| |
| TEST(GeneratedMapFieldTest, Clear) { |
| unittest::TestMap message; |
| |
| MapTestUtil::SetMapFields(&message); |
| message.Clear(); |
| MapTestUtil::ExpectClear(message); |
| } |
| |
| TEST(GeneratedMapFieldTest, ClearMessageMap) { |
| unittest::TestMessageMap message; |
| |
| // Creates a TestAllTypes with default value |
| TestUtil::ExpectClear((*message.mutable_map_int32_message())[0]); |
| } |
| |
| TEST(GeneratedMapFieldTest, CopyFrom) { |
| unittest::TestMap message1, message2; |
| |
| MapTestUtil::SetMapFields(&message1); |
| message2.CopyFrom(message1); |
| MapTestUtil::ExpectMapFieldsSet(message2); |
| |
| // Copying from self should be a no-op. |
| message2.CopyFrom(message2); |
| MapTestUtil::ExpectMapFieldsSet(message2); |
| } |
| |
| TEST(GeneratedMapFieldTest, CopyFromMessageMap) { |
| unittest::TestMessageMap message1, message2; |
| |
| (*message1.mutable_map_int32_message())[0].add_repeated_int32(100); |
| (*message2.mutable_map_int32_message())[0].add_repeated_int32(101); |
| |
| message1.CopyFrom(message2); |
| |
| // Checks repeated field is overwritten. |
| EXPECT_EQ(1, message1.map_int32_message().at(0).repeated_int32_size()); |
| EXPECT_EQ(101, message1.map_int32_message().at(0).repeated_int32(0)); |
| } |
| |
| TEST(GeneratedMapFieldTest, SwapWithEmpty) { |
| unittest::TestMap message1, message2; |
| |
| MapTestUtil::SetMapFields(&message1); |
| MapTestUtil::ExpectMapFieldsSet(message1); |
| MapTestUtil::ExpectClear(message2); |
| |
| message1.Swap(&message2); |
| MapTestUtil::ExpectMapFieldsSet(message2); |
| MapTestUtil::ExpectClear(message1); |
| } |
| |
| TEST(GeneratedMapFieldTest, SwapWithSelf) { |
| unittest::TestMap message; |
| |
| MapTestUtil::SetMapFields(&message); |
| MapTestUtil::ExpectMapFieldsSet(message); |
| |
| message.Swap(&message); |
| MapTestUtil::ExpectMapFieldsSet(message); |
| } |
| |
| TEST(GeneratedMapFieldTest, SwapWithOther) { |
| unittest::TestMap message1, message2; |
| |
| MapTestUtil::SetMapFields(&message1); |
| MapTestUtil::SetMapFields(&message2); |
| MapTestUtil::ModifyMapFields(&message2); |
| |
| message1.Swap(&message2); |
| MapTestUtil::ExpectMapFieldsModified(message1); |
| MapTestUtil::ExpectMapFieldsSet(message2); |
| } |
| |
| TEST(GeneratedMapFieldTest, CopyConstructor) { |
| unittest::TestMap message1; |
| MapTestUtil::SetMapFields(&message1); |
| |
| unittest::TestMap message2(message1); |
| MapTestUtil::ExpectMapFieldsSet(message2); |
| } |
| |
| TEST(GeneratedMapFieldTest, CopyAssignmentOperator) { |
| unittest::TestMap message1; |
| MapTestUtil::SetMapFields(&message1); |
| |
| unittest::TestMap message2; |
| message2 = message1; |
| MapTestUtil::ExpectMapFieldsSet(message2); |
| |
| // Make sure that self-assignment does something sane. |
| message2.operator=(message2); |
| MapTestUtil::ExpectMapFieldsSet(message2); |
| } |
| |
| #if !defined(PROTOBUF_TEST_NO_DESCRIPTORS) || PROTOBUF_RTTI |
| TEST(GeneratedMapFieldTest, UpcastCopyFrom) { |
| // Test the CopyFrom method that takes in the generic const Message& |
| // parameter. |
| unittest::TestMap message1, message2; |
| |
| MapTestUtil::SetMapFields(&message1); |
| |
| const Message* source = implicit_cast<const Message*>(&message1); |
| message2.CopyFrom(*source); |
| |
| MapTestUtil::ExpectMapFieldsSet(message2); |
| } |
| #endif |
| |
| #ifndef PROTOBUF_TEST_NO_DESCRIPTORS |
| |
| TEST(GeneratedMapFieldTest, CopyFromDynamicMessage) { |
| // Test copying from a DynamicMessage, which must fall back to using |
| // reflection. |
| unittest::TestMap message2; |
| |
| // Construct a new version of the dynamic message via the factory. |
| DynamicMessageFactory factory; |
| std::unique_ptr<Message> message1; |
| message1.reset(factory.GetPrototype(unittest::TestMap::descriptor())->New()); |
| MapReflectionTester reflection_tester(unittest::TestMap::descriptor()); |
| reflection_tester.SetMapFieldsViaReflection(message1.get()); |
| reflection_tester.ExpectMapFieldsSetViaReflection(*message1); |
| reflection_tester.ExpectMapFieldsSetViaReflectionIterator(message1.get()); |
| message2.CopyFrom(*message1); |
| MapTestUtil::ExpectMapFieldsSet(message2); |
| } |
| |
| TEST(GeneratedMapFieldTest, CopyFromDynamicMessageMapReflection) { |
| unittest::TestMap message2; |
| |
| // Construct a new version of the dynamic message via the factory. |
| DynamicMessageFactory factory; |
| std::unique_ptr<Message> message1; |
| message1.reset(factory.GetPrototype(unittest::TestMap::descriptor())->New()); |
| MapReflectionTester reflection_tester(unittest::TestMap::descriptor()); |
| reflection_tester.SetMapFieldsViaMapReflection(message1.get()); |
| reflection_tester.ExpectMapFieldsSetViaReflection(*message1); |
| reflection_tester.ExpectMapFieldsSetViaReflectionIterator(message1.get()); |
| message2.CopyFrom(*message1); |
| MapTestUtil::ExpectMapFieldsSet(message2); |
| } |
| |
| TEST(GeneratedMapFieldTest, DynamicMessageMergeFromDynamicMessage) { |
| // Construct two dynamic message and sets via map reflection. |
| DynamicMessageFactory factory; |
| std::unique_ptr<Message> message1; |
| message1.reset(factory.GetPrototype(unittest::TestMap::descriptor())->New()); |
| MapReflectionTester reflection_tester(unittest::TestMap::descriptor()); |
| reflection_tester.SetMapFieldsViaMapReflection(message1.get()); |
| |
| // message2 is created by same factory. |
| std::unique_ptr<Message> message2; |
| message2.reset(factory.GetPrototype(unittest::TestMap::descriptor())->New()); |
| reflection_tester.SetMapFieldsViaMapReflection(message2.get()); |
| |
| // message3 is created by different factory. |
| DynamicMessageFactory factory3; |
| std::unique_ptr<Message> message3; |
| message3.reset(factory3.GetPrototype(unittest::TestMap::descriptor())->New()); |
| reflection_tester.SetMapFieldsViaMapReflection(message3.get()); |
| |
| message2->MergeFrom(*message1); |
| message3->MergeFrom(*message1); |
| |
| // Test MergeFrom does not sync to repeated fields and |
| // there is no duplicate keys in text format. |
| std::string output1, output2, output3; |
| TextFormat::PrintToString(*message1, &output1); |
| TextFormat::PrintToString(*message2, &output2); |
| TextFormat::PrintToString(*message3, &output3); |
| EXPECT_EQ(output1, output2); |
| EXPECT_EQ(output1, output3); |
| } |
| |
| TEST(GeneratedMapFieldTest, DynamicMessageCopyFrom) { |
| // Test copying to a DynamicMessage, which must fall back to using reflection. |
| unittest::TestMap message2; |
| MapTestUtil::SetMapFields(&message2); |
| |
| // Construct a new version of the dynamic message via the factory. |
| DynamicMessageFactory factory; |
| std::unique_ptr<Message> message1; |
| message1.reset(factory.GetPrototype(unittest::TestMap::descriptor())->New()); |
| |
| MapReflectionTester reflection_tester(unittest::TestMap::descriptor()); |
| message1->MergeFrom(message2); |
| reflection_tester.ExpectMapFieldsSetViaReflection(*message1); |
| reflection_tester.ExpectMapFieldsSetViaReflectionIterator(message1.get()); |
| } |
| |
| TEST(GeneratedMapFieldTest, DynamicMessageCopyFromMapReflection) { |
| MapReflectionTester reflection_tester(unittest::TestMap::descriptor()); |
| unittest::TestMap message2; |
| reflection_tester.SetMapFieldsViaMapReflection(&message2); |
| |
| // Construct a dynamic message via the factory. |
| DynamicMessageFactory factory; |
| std::unique_ptr<Message> message1; |
| message1.reset(factory.GetPrototype(unittest::TestMap::descriptor())->New()); |
| |
| message1->MergeFrom(message2); |
| reflection_tester.ExpectMapFieldsSetViaReflectionIterator(message1.get()); |
| reflection_tester.ExpectMapFieldsSetViaReflection(*message1); |
| } |
| |
| TEST(GeneratedMapFieldTest, SyncDynamicMapWithRepeatedField) { |
| // Construct a dynamic message via the factory. |
| MapReflectionTester reflection_tester(unittest::TestMap::descriptor()); |
| DynamicMessageFactory factory; |
| std::unique_ptr<Message> message; |
| message.reset(factory.GetPrototype(unittest::TestMap::descriptor())->New()); |
| reflection_tester.SetMapFieldsViaReflection(message.get()); |
| reflection_tester.ExpectMapFieldsSetViaReflectionIterator(message.get()); |
| reflection_tester.ExpectMapFieldsSetViaReflection(*message); |
| } |
| |
| #endif // !PROTOBUF_TEST_NO_DESCRIPTORS |
| |
| TEST(GeneratedMapFieldTest, NonEmptyMergeFrom) { |
| unittest::TestMap message1, message2; |
| |
| MapTestUtil::SetMapFields(&message1); |
| |
| // This field will test merging into an empty spot. |
| (*message2.mutable_map_int32_int32())[1] = 1; |
| message1.mutable_map_int32_int32()->erase(1); |
| |
| // This tests overwriting. |
| (*message2.mutable_map_int32_double())[1] = 1; |
| (*message1.mutable_map_int32_double())[1] = 2; |
| |
| message1.MergeFrom(message2); |
| MapTestUtil::ExpectMapFieldsSet(message1); |
| |
| // Test reflection MergeFrom does not sync to repeated field |
| // and there is no duplicated keys. |
| MapTestUtil::SetMapFields(&message1); |
| MapTestUtil::SetMapFields(&message2); |
| |
| message2.MergeFrom(message1); |
| |
| std::string output1, output2; |
| TextFormat::PrintToString(message1, &output1); |
| TextFormat::PrintToString(message2, &output2); |
| EXPECT_EQ(output1, output2); |
| } |
| |
| TEST(GeneratedMapFieldTest, MergeFromMessageMap) { |
| unittest::TestMessageMap message1, message2; |
| |
| (*message1.mutable_map_int32_message())[0].add_repeated_int32(100); |
| (*message2.mutable_map_int32_message())[0].add_repeated_int32(101); |
| |
| message1.MergeFrom(message2); |
| |
| // Checks repeated field is overwritten. |
| EXPECT_EQ(1, message1.map_int32_message().at(0).repeated_int32_size()); |
| EXPECT_EQ(101, message1.map_int32_message().at(0).repeated_int32(0)); |
| } |
| |
| // Test the generated SerializeWithCachedSizesToArray() |
| TEST(GeneratedMapFieldTest, SerializationToArray) { |
| unittest::TestMap message1, message2; |
| std::string data; |
| MapTestUtil::SetMapFields(&message1); |
| size_t size = message1.ByteSizeLong(); |
| data.resize(size); |
| uint8* start = reinterpret_cast<uint8*>(::google::protobuf::string_as_array(&data)); |
| uint8* end = message1.SerializeWithCachedSizesToArray(start); |
| EXPECT_EQ(size, end - start); |
| EXPECT_TRUE(message2.ParseFromString(data)); |
| MapTestUtil::ExpectMapFieldsSet(message2); |
| } |
| |
| // Test the generated SerializeWithCachedSizes() |
| TEST(GeneratedMapFieldTest, SerializationToStream) { |
| unittest::TestMap message1, message2; |
| MapTestUtil::SetMapFields(&message1); |
| size_t size = message1.ByteSizeLong(); |
| std::string data; |
| data.resize(size); |
| { |
| // Allow the output stream to buffer only one byte at a time. |
| io::ArrayOutputStream array_stream(::google::protobuf::string_as_array(&data), size, 1); |
| io::CodedOutputStream output_stream(&array_stream); |
| message1.SerializeWithCachedSizes(&output_stream); |
| EXPECT_FALSE(output_stream.HadError()); |
| EXPECT_EQ(size, output_stream.ByteCount()); |
| } |
| EXPECT_TRUE(message2.ParseFromString(data)); |
| MapTestUtil::ExpectMapFieldsSet(message2); |
| } |
| |
| |
| TEST(GeneratedMapFieldTest, SameTypeMaps) { |
| const Descriptor* map1 = unittest::TestSameTypeMap::descriptor() |
| ->FindFieldByName("map1") |
| ->message_type(); |
| const Descriptor* map2 = unittest::TestSameTypeMap::descriptor() |
| ->FindFieldByName("map2") |
| ->message_type(); |
| |
| const Message* map1_entry = |
| MessageFactory::generated_factory()->GetPrototype(map1); |
| const Message* map2_entry = |
| MessageFactory::generated_factory()->GetPrototype(map2); |
| |
| EXPECT_EQ(map1, map1_entry->GetDescriptor()); |
| EXPECT_EQ(map2, map2_entry->GetDescriptor()); |
| } |
| |
| TEST(GeneratedMapFieldTest, Proto2UnknownEnum) { |
| unittest::TestEnumMapPlusExtra from; |
| (*from.mutable_known_map_field())[0] = unittest::E_PROTO2_MAP_ENUM_FOO; |
| (*from.mutable_unknown_map_field())[0] = unittest::E_PROTO2_MAP_ENUM_EXTRA; |
| std::string data; |
| from.SerializeToString(&data); |
| |
| unittest::TestEnumMap to; |
| EXPECT_TRUE(to.ParseFromString(data)); |
| EXPECT_EQ(0, to.unknown_map_field().size()); |
| const UnknownFieldSet& unknown_field_set = |
| to.GetReflection()->GetUnknownFields(to); |
| EXPECT_EQ(1, unknown_field_set.field_count()); |
| EXPECT_EQ(1, to.known_map_field().size()); |
| EXPECT_EQ(unittest::PROTO2_MAP_ENUM_FOO, to.known_map_field().at(0)); |
| |
| data.clear(); |
| from.Clear(); |
| to.SerializeToString(&data); |
| EXPECT_TRUE(from.ParseFromString(data)); |
| EXPECT_EQ(0, from.GetReflection()->GetUnknownFields(from).field_count()); |
| EXPECT_EQ(1, from.known_map_field().size()); |
| EXPECT_EQ(unittest::E_PROTO2_MAP_ENUM_FOO, from.known_map_field().at(0)); |
| EXPECT_EQ(1, from.unknown_map_field().size()); |
| EXPECT_EQ(unittest::E_PROTO2_MAP_ENUM_EXTRA, from.unknown_map_field().at(0)); |
| } |
| |
| TEST(GeneratedMapFieldTest, StandardWireFormat) { |
| unittest::TestMap message; |
| std::string data = "\x0A\x04\x08\x01\x10\x01"; |
| |
| EXPECT_TRUE(message.ParseFromString(data)); |
| EXPECT_EQ(1, message.map_int32_int32().size()); |
| EXPECT_EQ(1, message.map_int32_int32().at(1)); |
| } |
| |
| TEST(GeneratedMapFieldTest, UnorderedWireFormat) { |
| unittest::TestMap message; |
| |
| // put value before key in wire format |
| std::string data = "\x0A\x04\x10\x01\x08\x02"; |
| |
| EXPECT_TRUE(message.ParseFromString(data)); |
| EXPECT_EQ(1, message.map_int32_int32().size()); |
| ASSERT_NE(message.map_int32_int32().find(2), message.map_int32_int32().end()); |
| EXPECT_EQ(1, message.map_int32_int32().at(2)); |
| } |
| |
| TEST(GeneratedMapFieldTest, DuplicatedKeyWireFormat) { |
| unittest::TestMap message; |
| |
| // Two key fields in wire format |
| std::string data = "\x0A\x06\x08\x01\x08\x02\x10\x01"; |
| |
| EXPECT_TRUE(message.ParseFromString(data)); |
| EXPECT_EQ(1, message.map_int32_int32().size()); |
| EXPECT_EQ(1, message.map_int32_int32().at(2)); |
| |
| // A similar test, but with a map from int to a message type. |
| // Again, we want to be sure that the "second one wins" when |
| // there are two separate entries with the same key. |
| const int key = 99; |
| unittest::TestRequiredMessageMap map_message; |
| unittest::TestRequired with_dummy4; |
| with_dummy4.set_a(0); |
| with_dummy4.set_b(0); |
| with_dummy4.set_c(0); |
| with_dummy4.set_dummy4(11); |
| (*map_message.mutable_map_field())[key] = with_dummy4; |
| std::string s = map_message.SerializeAsString(); |
| unittest::TestRequired with_dummy5; |
| with_dummy5.set_a(0); |
| with_dummy5.set_b(0); |
| with_dummy5.set_c(0); |
| with_dummy5.set_dummy5(12); |
| (*map_message.mutable_map_field())[key] = with_dummy5; |
| std::string both = s + map_message.SerializeAsString(); |
| // We don't expect a merge now. The "second one wins." |
| ASSERT_TRUE(map_message.ParseFromString(both)); |
| ASSERT_EQ(1, map_message.map_field().size()); |
| ASSERT_EQ(1, map_message.map_field().count(key)); |
| EXPECT_EQ(0, map_message.map_field().find(key)->second.a()); |
| EXPECT_EQ(0, map_message.map_field().find(key)->second.b()); |
| EXPECT_EQ(0, map_message.map_field().find(key)->second.c()); |
| EXPECT_FALSE(map_message.map_field().find(key)->second.has_dummy4()); |
| ASSERT_TRUE(map_message.map_field().find(key)->second.has_dummy5()); |
| EXPECT_EQ(12, map_message.map_field().find(key)->second.dummy5()); |
| } |
| |
| // Exhaustive combinations of keys, values, and junk in any order. |
| // This re-tests some of the things tested above, but if it fails |
| // it's more work to determine what went wrong, so it isn't necessarily |
| // bad that we have the simpler tests too. |
| TEST(GeneratedMapFieldTest, KeysValuesUnknownsWireFormat) { |
| unittest::TestMap message; |
| const int kMaxNumKeysAndValuesAndJunk = 4; |
| const char kKeyTag = 0x08; |
| const char kValueTag = 0x10; |
| const char kJunkTag = 0x20; |
| for (int items = 0; items <= kMaxNumKeysAndValuesAndJunk; items++) { |
| std::string data = "\x0A"; |
| // Encode length of what will follow. |
| data.push_back(items * 2); |
| static const int kBitsOfIPerItem = 4; |
| static const int mask = (1 << kBitsOfIPerItem) - 1; |
| // Each iteration of the following is a test. It uses i as bit vector |
| // encoding the keys and values to put in the wire format. |
| for (int i = 0; i < (1 << (items * kBitsOfIPerItem)); i++) { |
| std::string wire_format = data; |
| int expected_key = 0; |
| int expected_value = 0; |
| for (int k = i, j = 0; j < items; j++, k >>= kBitsOfIPerItem) { |
| bool is_key = k & 0x1; |
| bool is_value = !is_key && (k & 0x2); |
| wire_format.push_back(is_key ? kKeyTag |
| : is_value ? kValueTag : kJunkTag); |
| char c = static_cast<char>(k & mask) >> 2; // One char after the tag. |
| wire_format.push_back(c); |
| if (is_key) expected_key = static_cast<int>(c); |
| if (is_value) expected_value = static_cast<int>(c); |
| bool res = message.ParseFromString(wire_format); |
| bool expect_success = true; |
| // Unfortunately the old map parser accepts malformed input, the new |
| // parser accepts only correct input. |
| if (j != items - 1) expect_success = false; |
| if (expect_success) { |
| ASSERT_TRUE(res); |
| ASSERT_EQ(1, message.map_int32_int32().size()); |
| ASSERT_EQ(expected_key, message.map_int32_int32().begin()->first); |
| ASSERT_EQ(expected_value, message.map_int32_int32().begin()->second); |
| } else { |
| ASSERT_FALSE(res); |
| } |
| } |
| } |
| } |
| } |
| |
| TEST(GeneratedMapFieldTest, DuplicatedValueWireFormat) { |
| unittest::TestMap message; |
| |
| // Two value fields in wire format |
| std::string data = "\x0A\x06\x08\x01\x10\x01\x10\x02"; |
| |
| EXPECT_TRUE(message.ParseFromString(data)); |
| EXPECT_EQ(1, message.map_int32_int32().size()); |
| EXPECT_EQ(2, message.map_int32_int32().at(1)); |
| } |
| |
| TEST(GeneratedMapFieldTest, MissedKeyWireFormat) { |
| unittest::TestMap message; |
| |
| // No key field in wire format |
| std::string data = "\x0A\x02\x10\x01"; |
| |
| EXPECT_TRUE(message.ParseFromString(data)); |
| EXPECT_EQ(1, message.map_int32_int32().size()); |
| ASSERT_NE(message.map_int32_int32().find(0), message.map_int32_int32().end()); |
| EXPECT_EQ(1, message.map_int32_int32().at(0)); |
| } |
| |
| TEST(GeneratedMapFieldTest, MissedValueWireFormat) { |
| unittest::TestMap message; |
| |
| // No value field in wire format |
| std::string data = "\x0A\x02\x08\x01"; |
| |
| EXPECT_TRUE(message.ParseFromString(data)); |
| EXPECT_EQ(1, message.map_int32_int32().size()); |
| ASSERT_NE(message.map_int32_int32().find(1), message.map_int32_int32().end()); |
| EXPECT_EQ(0, message.map_int32_int32().at(1)); |
| } |
| |
| TEST(GeneratedMapFieldTest, MissedValueTextFormat) { |
| unittest::TestMap message; |
| |
| // No value field in text format |
| std::string text = |
| "map_int32_foreign_message {\n" |
| " key: 1234567890\n" |
| "}"; |
| |
| EXPECT_TRUE(TextFormat::ParseFromString(text, &message)); |
| EXPECT_EQ(1, message.map_int32_foreign_message().size()); |
| EXPECT_EQ(11, message.ByteSizeLong()); |
| } |
| |
| TEST(GeneratedMapFieldTest, UnknownFieldWireFormat) { |
| unittest::TestMap message; |
| |
| // Unknown field in wire format |
| std::string data = "\x0A\x06\x08\x02\x10\x03\x18\x01"; |
| |
| EXPECT_TRUE(message.ParseFromString(data)); |
| EXPECT_EQ(1, message.map_int32_int32().size()); |
| EXPECT_EQ(3, message.map_int32_int32().at(2)); |
| } |
| |
| TEST(GeneratedMapFieldTest, CorruptedWireFormat) { |
| unittest::TestMap message; |
| |
| // corrupted data in wire format |
| std::string data = "\x0A\x06\x08\x02\x11\x03"; |
| |
| EXPECT_FALSE(message.ParseFromString(data)); |
| } |
| |
| TEST(GeneratedMapFieldTest, IsInitialized) { |
| unittest::TestRequiredMessageMap map_message; |
| |
| // Add an uninitialized message. |
| (*map_message.mutable_map_field())[0]; |
| EXPECT_FALSE(map_message.IsInitialized()); |
| |
| // Initialize uninitialized message |
| (*map_message.mutable_map_field())[0].set_a(0); |
| (*map_message.mutable_map_field())[0].set_b(0); |
| (*map_message.mutable_map_field())[0].set_c(0); |
| EXPECT_TRUE(map_message.IsInitialized()); |
| } |
| |
| TEST(GeneratedMapFieldTest, SpaceUsed) { |
| unittest::TestRequiredMessageMap map_message; |
| const size_t initial = map_message.SpaceUsed(); |
| const size_t space_used_message = unittest::TestRequired().SpaceUsed(); |
| |
| auto& m = *map_message.mutable_map_field(); |
| constexpr int kNumValues = 100; |
| for (int i = 0; i < kNumValues; ++i) { |
| m[i]; |
| } |
| |
| // The exact value will depend on internal state, like collisions, |
| // so we can't predict it. But we can predict a lower bound. |
| size_t lower_bound = |
| initial + kNumValues * (space_used_message + sizeof(int32) + |
| /* Node::next */ sizeof(void*) + |
| /* table entry */ sizeof(void*)); |
| |
| EXPECT_LE(lower_bound, map_message.SpaceUsed()); |
| } |
| |
| TEST(GeneratedMapFieldTest, MessagesMustMerge) { |
| unittest::TestRequiredMessageMap map_message; |
| |
| unittest::TestRequired with_dummy4; |
| with_dummy4.set_a(97); |
| with_dummy4.set_b(91); |
| with_dummy4.set_dummy4(98); |
| EXPECT_FALSE(with_dummy4.IsInitialized()); |
| (*map_message.mutable_map_field())[0] = with_dummy4; |
| EXPECT_FALSE(map_message.IsInitialized()); |
| |
| unittest::TestRequired with_dummy5; |
| with_dummy5.set_b(0); |
| with_dummy5.set_c(33); |
| with_dummy5.set_dummy5(99); |
| EXPECT_FALSE(with_dummy5.IsInitialized()); |
| (*map_message.mutable_map_field())[0] = with_dummy5; |
| EXPECT_FALSE(map_message.IsInitialized()); |
| |
| // The wire format of MapEntry is straightforward (*) and can be manually |
| // constructed to force merging of two uninitialized messages that would |
| // result in an initialized message. |
| // |
| // (*) http://google3/net/proto2/internal/map_test.cc?l=2433&rcl=310012028 |
| std::string dummy4_s = with_dummy4.SerializePartialAsString(); |
| std::string dummy5_s = with_dummy5.SerializePartialAsString(); |
| int payload_size = dummy4_s.size() + dummy5_s.size(); |
| // Makes sure the payload size fits into one byte. |
| ASSERT_LT(payload_size, 128); |
| |
| std::string s(6, 0); |
| char* p = &s[0]; |
| *p++ = WireFormatLite::MakeTag(1, WireFormatLite::WIRETYPE_LENGTH_DELIMITED); |
| // Length: 2B for key tag & val and 2B for val tag and length of the following |
| // payload. |
| *p++ = 4 + payload_size; |
| *p++ = WireFormatLite::MakeTag(1, WireFormatLite::WIRETYPE_VARINT); |
| *p++ = 0; |
| *p++ = WireFormatLite::MakeTag(2, WireFormatLite::WIRETYPE_LENGTH_DELIMITED); |
| *p++ = payload_size; |
| StrAppend(&s, dummy4_s, dummy5_s); |
| |
| // Test key then value then value. |
| int key = 0; |
| ASSERT_TRUE(map_message.ParseFromString(s)); |
| ASSERT_EQ(1, map_message.map_field().size()); |
| ASSERT_EQ(1, map_message.map_field().count(key)); |
| EXPECT_EQ(97, map_message.map_field().find(key)->second.a()); |
| EXPECT_EQ(0, map_message.map_field().find(key)->second.b()); |
| EXPECT_EQ(33, map_message.map_field().find(key)->second.c()); |
| EXPECT_EQ(98, map_message.map_field().find(key)->second.dummy4()); |
| EXPECT_EQ(99, map_message.map_field().find(key)->second.dummy5()); |
| |
| // Test key then value then value then key. |
| s.push_back(s[2]); // Copy the key's tag. |
| key = 19; |
| s.push_back(key); // Second key is 19 instead of 0. |
| s[1] += 2; // Adjust encoded size. |
| ASSERT_TRUE(map_message.ParseFromString(s)); |
| ASSERT_EQ(1, map_message.map_field().size()); |
| ASSERT_EQ(1, map_message.map_field().count(key)); |
| EXPECT_EQ(97, map_message.map_field().find(key)->second.a()); |
| EXPECT_EQ(0, map_message.map_field().find(key)->second.b()); |
| EXPECT_EQ(33, map_message.map_field().find(key)->second.c()); |
| EXPECT_EQ(98, map_message.map_field().find(key)->second.dummy4()); |
| EXPECT_EQ(99, map_message.map_field().find(key)->second.dummy5()); |
| } |
| |
| // Generated Message Reflection Test ================================ |
| |
| TEST(GeneratedMapFieldReflectionTest, SpaceUsed) { |
| unittest::TestMap message; |
| MapReflectionTester reflection_tester(unittest::TestMap::descriptor()); |
| reflection_tester.SetMapFieldsViaReflection(&message); |
| |
| EXPECT_LT(0, message.GetReflection()->SpaceUsedLong(message)); |
| } |
| |
| TEST(GeneratedMapFieldReflectionTest, Accessors) { |
| // Set every field to a unique value then go back and check all those |
| // values. |
| unittest::TestMap message; |
| MapReflectionTester reflection_tester(unittest::TestMap::descriptor()); |
| reflection_tester.SetMapFieldsViaReflection(&message); |
| MapTestUtil::ExpectMapFieldsSet(message); |
| reflection_tester.ExpectMapFieldsSetViaReflection(message); |
| reflection_tester.ExpectMapFieldsSetViaReflectionIterator(&message); |
| |
| reflection_tester.ModifyMapFieldsViaReflection(&message); |
| MapTestUtil::ExpectMapFieldsModified(message); |
| } |
| |
| TEST(GeneratedMapFieldReflectionTest, Swap) { |
| unittest::TestMap message1; |
| unittest::TestMap message2; |
| |
| MapTestUtil::SetMapFields(&message1); |
| |
| const Reflection* reflection = message1.GetReflection(); |
| reflection->Swap(&message1, &message2); |
| |
| MapTestUtil::ExpectClear(message1); |
| MapTestUtil::ExpectMapFieldsSet(message2); |
| } |
| |
| TEST(GeneratedMapFieldReflectionTest, SwapWithBothSet) { |
| unittest::TestMap message1; |
| unittest::TestMap message2; |
| |
| MapTestUtil::SetMapFields(&message1); |
| MapTestUtil::SetMapFields(&message2); |
| MapTestUtil::ModifyMapFields(&message2); |
| |
| const Reflection* reflection = message1.GetReflection(); |
| reflection->Swap(&message1, &message2); |
| |
| MapTestUtil::ExpectMapFieldsModified(message1); |
| MapTestUtil::ExpectMapFieldsSet(message2); |
| } |
| |
| TEST(GeneratedMapFieldReflectionTest, SwapFields) { |
| unittest::TestMap message1; |
| unittest::TestMap message2; |
| |
| MapTestUtil::SetMapFields(&message2); |
| |
| std::vector<const FieldDescriptor*> fields; |
| const Reflection* reflection = message1.GetReflection(); |
| reflection->ListFields(message2, &fields); |
| reflection->SwapFields(&message1, &message2, fields); |
| |
| MapTestUtil::ExpectMapFieldsSet(message1); |
| MapTestUtil::ExpectClear(message2); |
| } |
| |
| TEST(GeneratedMapFieldReflectionTest, ClearField) { |
| unittest::TestMap message; |
| MapTestUtil::SetMapFields(&message); |
| MapTestUtil::ExpectMapFieldsSet(message); |
| |
| MapReflectionTester reflection_tester(unittest::TestMap::descriptor()); |
| reflection_tester.ClearMapFieldsViaReflection(&message); |
| reflection_tester.ExpectClearViaReflection(message); |
| reflection_tester.ExpectClearViaReflectionIterator(&message); |
| } |
| |
| TEST(GeneratedMapFieldReflectionTest, RemoveLast) { |
| unittest::TestMap message; |
| MapReflectionTester reflection_tester(unittest::TestMap::descriptor()); |
| |
| MapTestUtil::SetMapFields(&message); |
| MapTestUtil::ExpectMapsSize(message, 2); |
| std::vector<const Message*> expected_entries = |
| MapTestUtil::GetMapEntries(message, 0); |
| |
| reflection_tester.RemoveLastMapsViaReflection(&message); |
| |
| MapTestUtil::ExpectMapsSize(message, 1); |
| std::vector<const Message*> remained_entries = |
| MapTestUtil::GetMapEntries(message, 0); |
| EXPECT_TRUE(expected_entries == remained_entries); |
| } |
| |
| TEST(GeneratedMapFieldReflectionTest, ReleaseLast) { |
| unittest::TestMap message; |
| const Descriptor* descriptor = message.GetDescriptor(); |
| MapReflectionTester reflection_tester(descriptor); |
| |
| MapTestUtil::SetMapFields(&message); |
| |
| MapTestUtil::ExpectMapsSize(message, 2); |
| |
| reflection_tester.ReleaseLastMapsViaReflection(&message); |
| |
| MapTestUtil::ExpectMapsSize(message, 1); |
| |
| // Now test that we actually release the right message. |
| message.Clear(); |
| MapTestUtil::SetMapFields(&message); |
| |
| MapTestUtil::ExpectMapsSize(message, 2); |
| std::vector<const Message*> expect_last = |
| MapTestUtil::GetMapEntries(message, 1); |
| std::vector<const Message*> release_last = |
| MapTestUtil::GetMapEntriesFromRelease(&message); |
| MapTestUtil::ExpectMapsSize(message, 1); |
| EXPECT_TRUE(expect_last == release_last); |
| for (std::vector<const Message*>::iterator it = release_last.begin(); |
| it != release_last.end(); ++it) { |
| delete *it; |
| } |
| } |
| |
| TEST(GeneratedMapFieldReflectionTest, SwapElements) { |
| unittest::TestMap message; |
| MapReflectionTester reflection_tester(unittest::TestMap::descriptor()); |
| |
| MapTestUtil::SetMapFields(&message); |
| |
| // Get pointers of map entries at their original position |
| std::vector<const Message*> entries0 = MapTestUtil::GetMapEntries(message, 0); |
| std::vector<const Message*> entries1 = MapTestUtil::GetMapEntries(message, 1); |
| |
| // Swap the first time. |
| reflection_tester.SwapMapsViaReflection(&message); |
| |
| // Get pointer of map entry after swap once. |
| std::vector<const Message*> entries0_once = |
| MapTestUtil::GetMapEntries(message, 0); |
| std::vector<const Message*> entries1_once = |
| MapTestUtil::GetMapEntries(message, 1); |
| |
| // Test map entries are swapped. |
| MapTestUtil::ExpectMapsSize(message, 2); |
| EXPECT_TRUE(entries0 == entries1_once); |
| EXPECT_TRUE(entries1 == entries0_once); |
| |
| // Swap the second time. |
| reflection_tester.SwapMapsViaReflection(&message); |
| |
| // Get pointer of map entry after swap once. |
| std::vector<const Message*> entries0_twice = |
| MapTestUtil::GetMapEntries(message, 0); |
| std::vector<const Message*> entries1_twice = |
| MapTestUtil::GetMapEntries(message, 1); |
| |
| // Test map entries are swapped back. |
| MapTestUtil::ExpectMapsSize(message, 2); |
| EXPECT_TRUE(entries0 == entries0_twice); |
| EXPECT_TRUE(entries1 == entries1_twice); |
| } |
| |
| TEST(GeneratedMapFieldReflectionTest, MutableUnknownFields) { |
| unittest::TestMap message; |
| MapReflectionTester reflection_tester(unittest::TestMap::descriptor()); |
| reflection_tester.MutableUnknownFieldsOfMapFieldsViaReflection(&message); |
| } |
| |
| TEST(GeneratedMapFieldReflectionTest, EmbedProto2Message) { |
| unittest::TestMessageMap message; |
| |
| const FieldDescriptor* map_field = |
| unittest::TestMessageMap::descriptor()->FindFieldByName( |
| "map_int32_message"); |
| const FieldDescriptor* value = |
| map_field->message_type()->FindFieldByName("value"); |
| |
| Message* entry_message = |
| message.GetReflection()->AddMessage(&message, map_field); |
| EXPECT_EQ( |
| &entry_message->GetReflection()->GetMessage(*entry_message, value), |
| reinterpret_cast<const Message*>(&TestAllTypes::default_instance())); |
| |
| Message* proto2_message = |
| entry_message->GetReflection()->MutableMessage(entry_message, value); |
| EXPECT_EQ(unittest::TestAllTypes::descriptor(), |
| proto2_message->GetDescriptor()); |
| ASSERT_EQ(1, message.map_int32_message().size()); |
| } |
| |
| TEST(GeneratedMapFieldReflectionTest, MergeFromClearMapEntry) { |
| unittest::TestMap message; |
| const FieldDescriptor* map_field = |
| unittest::TestMap::descriptor()->FindFieldByName("map_int32_int32"); |
| const FieldDescriptor* key = |
| map_field->message_type()->FindFieldByName("key"); |
| const FieldDescriptor* value = |
| map_field->message_type()->FindFieldByName("value"); |
| |
| Message* entry_message1 = |
| message.GetReflection()->AddMessage(&message, map_field); |
| EXPECT_FALSE(entry_message1->GetReflection()->HasField(*entry_message1, key)); |
| EXPECT_FALSE( |
| entry_message1->GetReflection()->HasField(*entry_message1, value)); |
| |
| Message* entry_message2 = |
| message.GetReflection()->AddMessage(&message, map_field); |
| EXPECT_FALSE(entry_message2->GetReflection()->HasField(*entry_message2, key)); |
| EXPECT_FALSE( |
| entry_message2->GetReflection()->HasField(*entry_message2, value)); |
| |
| entry_message1->MergeFrom(*entry_message2); |
| EXPECT_FALSE(entry_message1->GetReflection()->HasField(*entry_message1, key)); |
| EXPECT_FALSE( |
| entry_message1->GetReflection()->HasField(*entry_message1, value)); |
| } |
| |
| TEST(GeneratedMapFieldReflectionTest, MapEntryClear) { |
| unittest::TestMap message; |
| MapReflectionTester reflection_tester(unittest::TestMap::descriptor()); |
| reflection_tester.MutableUnknownFieldsOfMapFieldsViaReflection(&message); |
| } |
| |
| TEST(GeneratedMapFieldReflectionTest, Proto2MapEntryClear) { |
| unittest::TestEnumMap message; |
| const Descriptor* descriptor = message.GetDescriptor(); |
| const FieldDescriptor* field_descriptor = |
| descriptor->FindFieldByName("known_map_field"); |
| const FieldDescriptor* value_descriptor = |
| field_descriptor->message_type()->FindFieldByName("value"); |
| Message* sub_message = |
| message.GetReflection()->AddMessage(&message, field_descriptor); |
| EXPECT_EQ(0, sub_message->GetReflection()->GetEnumValue(*sub_message, |
| value_descriptor)); |
| } |
| |
| // Map Reflection API Test ========================================= |
| |
| TEST(GeneratedMapFieldReflectionTest, SetViaMapReflection) { |
| unittest::TestMap message; |
| MapReflectionTester reflection_tester(unittest::TestMap::descriptor()); |
| reflection_tester.SetMapFieldsViaMapReflection(&message); |
| reflection_tester.ExpectMapFieldsSetViaReflection(message); |
| reflection_tester.ExpectMapFieldsSetViaReflectionIterator(&message); |
| } |
| |
| // Dynamic Message Test ============================================= |
| |
| class MapFieldInDynamicMessageTest : public testing::Test { |
| protected: |
| const DescriptorPool* pool_; |
| DynamicMessageFactory factory_; |
| const Descriptor* map_descriptor_; |
| const Descriptor* recursive_map_descriptor_; |
| const Message* map_prototype_; |
| |
| MapFieldInDynamicMessageTest() |
| : pool_(DescriptorPool::generated_pool()), factory_(pool_) {} |
| |
| virtual void SetUp() { |
| map_descriptor_ = pool_->FindMessageTypeByName("protobuf_unittest.TestMap"); |
| recursive_map_descriptor_ = |
| pool_->FindMessageTypeByName("protobuf_unittest.TestRecursiveMapMessage"); |
| ASSERT_TRUE(map_descriptor_ != NULL); |
| ASSERT_TRUE(recursive_map_descriptor_ != NULL); |
| map_prototype_ = factory_.GetPrototype(map_descriptor_); |
| } |
| }; |
| |
| TEST_F(MapFieldInDynamicMessageTest, MapIndependentOffsets) { |
| // Check that all fields have independent offsets by setting each |
| // one to a unique value then checking that they all still have those |
| // unique values (i.e. they don't stomp each other). |
| std::unique_ptr<Message> message(map_prototype_->New()); |
| MapReflectionTester reflection_tester(map_descriptor_); |
| |
| reflection_tester.SetMapFieldsViaReflection(message.get()); |
| reflection_tester.ExpectMapFieldsSetViaReflection(*message); |
| } |
| |
| TEST_F(MapFieldInDynamicMessageTest, DynamicMapReflection) { |
| // Check that map fields work properly. |
| std::unique_ptr<Message> message(map_prototype_->New()); |
| |
| // Check set functions. |
| MapReflectionTester reflection_tester(map_descriptor_); |
| reflection_tester.SetMapFieldsViaMapReflection(message.get()); |
| reflection_tester.ExpectMapFieldsSetViaReflection(*message); |
| } |
| |
| TEST_F(MapFieldInDynamicMessageTest, MapSpaceUsed) { |
| // Test that SpaceUsedLong() works properly |
| |
| // Since we share the implementation with generated messages, we don't need |
| // to test very much here. Just make sure it appears to be working. |
| |
| std::unique_ptr<Message> message(map_prototype_->New()); |
| MapReflectionTester reflection_tester(map_descriptor_); |
| |
| int initial_space_used = message->SpaceUsedLong(); |
| |
| reflection_tester.SetMapFieldsViaReflection(message.get()); |
| EXPECT_LT(initial_space_used, message->SpaceUsedLong()); |
| } |
| |
| TEST_F(MapFieldInDynamicMessageTest, RecursiveMap) { |
| TestRecursiveMapMessage from; |
| (*from.mutable_a())[""]; |
| std::string data = from.SerializeAsString(); |
| std::unique_ptr<Message> to( |
| factory_.GetPrototype(recursive_map_descriptor_)->New()); |
| ASSERT_TRUE(to->ParseFromString(data)); |
| } |
| |
| TEST_F(MapFieldInDynamicMessageTest, MapValueReferernceValidAfterSerialize) { |
| std::unique_ptr<Message> message(map_prototype_->New()); |
| MapReflectionTester reflection_tester(map_descriptor_); |
| reflection_tester.SetMapFieldsViaMapReflection(message.get()); |
| |
| // Get value reference before serialization, so that we know the value is from |
| // map. |
| MapKey map_key; |
| MapValueRef map_val; |
| map_key.SetInt32Value(0); |
| reflection_tester.GetMapValueViaMapReflection( |
| message.get(), "map_int32_foreign_message", map_key, &map_val); |
| Message* submsg = map_val.MutableMessageValue(); |
| |
| // In previous implementation, calling SerializeToString will cause syncing |
| // from map to repeated field, which will invalidate the submsg we previously |
| // got. |
| std::string data; |
| message->SerializeToString(&data); |
| |
| const Reflection* submsg_reflection = submsg->GetReflection(); |
| const Descriptor* submsg_desc = submsg->GetDescriptor(); |
| const FieldDescriptor* submsg_field = submsg_desc->FindFieldByName("c"); |
| submsg_reflection->SetInt32(submsg, submsg_field, 128); |
| |
| message->SerializeToString(&data); |
| TestMap to; |
| to.ParseFromString(data); |
| EXPECT_EQ(128, to.map_int32_foreign_message().at(0).c()); |
| } |
| |
| TEST_F(MapFieldInDynamicMessageTest, MapEntryReferernceValidAfterSerialize) { |
| std::unique_ptr<Message> message(map_prototype_->New()); |
| MapReflectionTester reflection_tester(map_descriptor_); |
| reflection_tester.SetMapFieldsViaReflection(message.get()); |
| |
| // Get map entry before serialization, so that we know the it is from |
| // repeated field. |
| Message* map_entry = reflection_tester.GetMapEntryViaReflection( |
| message.get(), "map_int32_foreign_message", 0); |
| const Reflection* map_entry_reflection = map_entry->GetReflection(); |
| const Descriptor* map_entry_desc = map_entry->GetDescriptor(); |
| const FieldDescriptor* value_field = map_entry_desc->FindFieldByName("value"); |
| Message* submsg = |
| map_entry_reflection->MutableMessage(map_entry, value_field); |
| |
| // In previous implementation, calling SerializeToString will cause syncing |
| // from repeated field to map, which will invalidate the map_entry we |
| // previously got. |
| std::string data; |
| message->SerializeToString(&data); |
| |
| const Reflection* submsg_reflection = submsg->GetReflection(); |
| const Descriptor* submsg_desc = submsg->GetDescriptor(); |
| const FieldDescriptor* submsg_field = submsg_desc->FindFieldByName("c"); |
| submsg_reflection->SetInt32(submsg, submsg_field, 128); |
| |
| message->SerializeToString(&data); |
| TestMap to; |
| to.ParseFromString(data); |
| EXPECT_EQ(128, to.map_int32_foreign_message().at(0).c()); |
| } |
| |
| // ReflectionOps Test =============================================== |
| |
| TEST(ReflectionOpsForMapFieldTest, MapSanityCheck) { |
| unittest::TestMap message; |
| |
| MapTestUtil::SetMapFields(&message); |
| MapTestUtil::ExpectMapFieldsSet(message); |
| } |
| |
| TEST(ReflectionOpsForMapFieldTest, MapCopy) { |
| unittest::TestMap message, message2; |
| |
| MapTestUtil::SetMapFields(&message); |
| |
| ReflectionOps::Copy(message, &message2); |
| |
| MapTestUtil::ExpectMapFieldsSet(message2); |
| |
| // Copying from self should be a no-op. |
| ReflectionOps::Copy(message2, &message2); |
| MapTestUtil::ExpectMapFieldsSet(message2); |
| } |
| |
| TEST(ReflectionOpsForMapFieldTest, MergeMap) { |
| // Note: Copy is implemented in terms of Merge() so technically the Copy |
| // test already tested most of this. |
| |
| unittest::TestMap message, message2; |
| |
| MapTestUtil::SetMapFields(&message); |
| |
| ReflectionOps::Merge(message2, &message); |
| |
| MapTestUtil::ExpectMapFieldsSet(message); |
| } |
| |
| TEST(ReflectionOpsForMapFieldTest, ClearMap) { |
| unittest::TestMap message; |
| |
| MapTestUtil::SetMapFields(&message); |
| |
| ReflectionOps::Clear(&message); |
| |
| MapTestUtil::ExpectClear(message); |
| } |
| |
| TEST(ReflectionOpsForMapFieldTest, MapDiscardUnknownFields) { |
| unittest::TestMap message; |
| MapTestUtil::SetMapFields(&message); |
| |
| // Set some unknown fields in message. |
| message.GetReflection()->MutableUnknownFields(&message)->AddVarint(123456, |
| 654321); |
| |
| // Discard them. |
| ReflectionOps::DiscardUnknownFields(&message); |
| MapTestUtil::ExpectMapFieldsSet(message); |
| |
| EXPECT_EQ(0, |
| message.GetReflection()->GetUnknownFields(message).field_count()); |
| } |
| |
| TEST(ReflectionOpsForMapFieldTest, IsInitialized) { |
| unittest::TestRequiredMessageMap map_message; |
| |
| // Add an uninitialized message. |
| (*map_message.mutable_map_field())[0]; |
| EXPECT_FALSE(ReflectionOps::IsInitialized(map_message)); |
| |
| // Initialize uninitialized message |
| (*map_message.mutable_map_field())[0].set_a(0); |
| (*map_message.mutable_map_field())[0].set_b(0); |
| (*map_message.mutable_map_field())[0].set_c(0); |
| EXPECT_TRUE(ReflectionOps::IsInitialized(map_message)); |
| } |
| |
| // Wire Format Test ================================================= |
| |
| TEST(WireFormatForMapFieldTest, ParseMap) { |
| unittest::TestMap source, dest; |
| std::string data; |
| |
| // Serialize using the generated code. |
| MapTestUtil::SetMapFields(&source); |
| source.SerializeToString(&data); |
| |
| // Parse using WireFormat. |
| io::ArrayInputStream raw_input(data.data(), data.size()); |
| io::CodedInputStream input(&raw_input); |
| WireFormat::ParseAndMergePartial(&input, &dest); |
| |
| // Check. |
| MapTestUtil::ExpectMapFieldsSet(dest); |
| } |
| |
| TEST(WireFormatForMapFieldTest, MapByteSize) { |
| unittest::TestMap message; |
| MapTestUtil::SetMapFields(&message); |
| |
| EXPECT_EQ(message.ByteSizeLong(), WireFormat::ByteSize(message)); |
| message.Clear(); |
| EXPECT_EQ(0, message.ByteSizeLong()); |
| EXPECT_EQ(0, WireFormat::ByteSize(message)); |
| } |
| |
| TEST(WireFormatForMapFieldTest, SerializeMap) { |
| unittest::TestMap message; |
| std::string generated_data; |
| std::string dynamic_data; |
| |
| MapTestUtil::SetMapFields(&message); |
| |
| // Serialize using the generated code. |
| { |
| message.ByteSizeLong(); |
| io::StringOutputStream raw_output(&generated_data); |
| io::CodedOutputStream output(&raw_output); |
| message.SerializeWithCachedSizes(&output); |
| ASSERT_FALSE(output.HadError()); |
| } |
| |
| // Serialize using WireFormat. |
| { |
| io::StringOutputStream raw_output(&dynamic_data); |
| io::CodedOutputStream output(&raw_output); |
| size_t size = WireFormat::ByteSize(message); |
| WireFormat::SerializeWithCachedSizes(message, size, &output); |
| ASSERT_FALSE(output.HadError()); |
| } |
| |
| // Should parse to the same message. |
| EXPECT_TRUE(TestUtil::EqualsToSerialized(message, generated_data)); |
| EXPECT_TRUE(TestUtil::EqualsToSerialized(message, dynamic_data)); |
| } |
| |
| TEST(WireFormatForMapFieldTest, SerializeMapDynamicMessage) { |
| DynamicMessageFactory factory; |
| std::unique_ptr<Message> dynamic_message; |
| dynamic_message.reset( |
| factory.GetPrototype(unittest::TestMap::descriptor())->New()); |
| MapReflectionTester reflection_tester(unittest::TestMap::descriptor()); |
| reflection_tester.SetMapFieldsViaReflection(dynamic_message.get()); |
| reflection_tester.ExpectMapFieldsSetViaReflection(*dynamic_message); |
| |
| unittest::TestMap generated_message; |
| MapTestUtil::SetMapFields(&generated_message); |
| MapTestUtil::ExpectMapFieldsSet(generated_message); |
| |
| std::string generated_data; |
| std::string dynamic_data; |
| |
| // Serialize. |
| generated_message.SerializeToString(&generated_data); |
| dynamic_message->SerializeToString(&dynamic_data); |
| |
| // Because map serialization doesn't guarantee order, we just compare |
| // serialized size here. This is enough to tell dynamic message doesn't miss |
| // anything in serialization. |
| EXPECT_TRUE(dynamic_data.size() == generated_data.size()); |
| } |
| |
| TEST(WireFormatForMapFieldTest, MapByteSizeDynamicMessage) { |
| DynamicMessageFactory factory; |
| std::unique_ptr<Message> dynamic_message; |
| dynamic_message.reset( |
| factory.GetPrototype(unittest::TestMap::descriptor())->New()); |
| MapReflectionTester reflection_tester(unittest::TestMap::descriptor()); |
| reflection_tester.SetMapFieldsViaReflection(dynamic_message.get()); |
| reflection_tester.ExpectMapFieldsSetViaReflection(*dynamic_message); |
| std::string expected_serialized_data; |
| dynamic_message->SerializeToString(&expected_serialized_data); |
| int expected_size = expected_serialized_data.size(); |
| EXPECT_EQ(dynamic_message->ByteSizeLong(), expected_size); |
| |
| std::unique_ptr<Message> message2; |
| message2.reset(factory.GetPrototype(unittest::TestMap::descriptor())->New()); |
| reflection_tester.SetMapFieldsViaMapReflection(message2.get()); |
| |
| const FieldDescriptor* field = |
| unittest::TestMap::descriptor()->FindFieldByName("map_int32_int32"); |
| const Reflection* reflection = dynamic_message->GetReflection(); |
| |
| // Force the map field to mark with STATE_MODIFIED_REPEATED |
| reflection->RemoveLast(dynamic_message.get(), field); |
| dynamic_message->MergeFrom(*message2); |
| dynamic_message->MergeFrom(*message2); |
| // The map field is marked as STATE_MODIFIED_REPEATED, ByteSizeLong() will use |
| // repeated field which have duplicate keys to calculate. |
| size_t duplicate_size = dynamic_message->ByteSizeLong(); |
| EXPECT_TRUE(duplicate_size > expected_size); |
| std::string duplicate_serialized_data; |
| dynamic_message->SerializeToString(&duplicate_serialized_data); |
| EXPECT_EQ(dynamic_message->ByteSizeLong(), duplicate_serialized_data.size()); |
| |
| // Force the map field to mark with map CLEAN |
| EXPECT_EQ(reflection_tester.MapSize(*dynamic_message, "map_int32_int32"), 2); |
| // The map field is marked as CLEAN, ByteSizeLong() will use map which do not |
| // have duplicate keys to calculate. |
| int size = dynamic_message->ByteSizeLong(); |
| EXPECT_EQ(expected_size, size); |
| |
| // Protobuf used to have a bug for serialize when map it marked CLEAN. It used |
| // repeated field to calculate ByteSizeLong but use map to serialize the real |
| // data, thus the ByteSizeLong may bigger than real serialized size. A crash |
| // might be happen at SerializeToString(). Or an "unexpected end group" |
| // warning was raised at parse back if user use SerializeWithCachedSizes() |
| // which avoids size check at serialize. |
| std::string serialized_data; |
| dynamic_message->SerializeToString(&serialized_data); |
| EXPECT_EQ(serialized_data, expected_serialized_data); |
| dynamic_message->ParseFromString(serialized_data); |
| } |
| |
| TEST(WireFormatForMapFieldTest, MapParseHelpers) { |
| std::string data; |
| |
| { |
| // Set up. |
| protobuf_unittest::TestMap message; |
| MapTestUtil::SetMapFields(&message); |
| message.SerializeToString(&data); |
| } |
| |
| { |
| // Test ParseFromString. |
| protobuf_unittest::TestMap message; |
| EXPECT_TRUE(message.ParseFromString(data)); |
| MapTestUtil::ExpectMapFieldsSet(message); |
| } |
| |
| { |
| // Test ParseFromIstream. |
| protobuf_unittest::TestMap message; |
| std::stringstream stream(data); |
| EXPECT_TRUE(message.ParseFromIstream(&stream)); |
| EXPECT_TRUE(stream.eof()); |
| MapTestUtil::ExpectMapFieldsSet(message); |
| } |
| |
| { |
| // Test ParseFromBoundedZeroCopyStream. |
| std::string data_with_junk(data); |
| data_with_junk.append("some junk on the end"); |
| io::ArrayInputStream stream(data_with_junk.data(), data_with_junk.size()); |
| protobuf_unittest::TestMap message; |
| EXPECT_TRUE(message.ParseFromBoundedZeroCopyStream(&stream, data.size())); |
| MapTestUtil::ExpectMapFieldsSet(message); |
| } |
| |
| { |
| // Test that ParseFromBoundedZeroCopyStream fails (but doesn't crash) if |
| // EOF is reached before the expected number of bytes. |
| io::ArrayInputStream stream(data.data(), data.size()); |
| protobuf_unittest::TestAllTypes message; |
| EXPECT_FALSE( |
| message.ParseFromBoundedZeroCopyStream(&stream, data.size() + 1)); |
| } |
| } |
| |
| // Deterministic Serialization Test ========================================== |
| |
| template <typename T> |
| static std::string DeterministicSerializationWithSerializePartialToCodedStream( |
| const T& t) { |
| const size_t size = t.ByteSizeLong(); |
| std::string result(size, '\0'); |
| io::ArrayOutputStream array_stream(::google::protobuf::string_as_array(&result), size); |
| io::CodedOutputStream output_stream(&array_stream); |
| output_stream.SetSerializationDeterministic(true); |
| t.SerializePartialToCodedStream(&output_stream); |
| EXPECT_FALSE(output_stream.HadError()); |
| EXPECT_EQ(size, output_stream.ByteCount()); |
| return result; |
| } |
| |
| template <typename T> |
| static std::string DeterministicSerializationWithSerializeToCodedStream( |
| const T& t) { |
| const size_t size = t.ByteSizeLong(); |
| std::string result(size, '\0'); |
| io::ArrayOutputStream array_stream(::google::protobuf::string_as_array(&result), size); |
| io::CodedOutputStream output_stream(&array_stream); |
| output_stream.SetSerializationDeterministic(true); |
| t.SerializeToCodedStream(&output_stream); |
| EXPECT_FALSE(output_stream.HadError()); |
| EXPECT_EQ(size, output_stream.ByteCount()); |
| return result; |
| } |
| |
| template <typename T> |
| static std::string DeterministicSerialization(const T& t) { |
| const size_t size = t.ByteSizeLong(); |
| std::string result(size, '\0'); |
| io::ArrayOutputStream array_stream(::google::protobuf::string_as_array(&result), size); |
| { |
| io::CodedOutputStream output_stream(&array_stream); |
| output_stream.SetSerializationDeterministic(true); |
| t.SerializeWithCachedSizes(&output_stream); |
| EXPECT_FALSE(output_stream.HadError()); |
| EXPECT_EQ(size, output_stream.ByteCount()); |
| } |
| EXPECT_EQ(result, DeterministicSerializationWithSerializeToCodedStream(t)); |
| EXPECT_EQ(result, |
| DeterministicSerializationWithSerializePartialToCodedStream(t)); |
| return result; |
| } |
| |
| // Helper for MapSerializationTest. Return a 7-bit ASCII string. |
| static std::string ConstructKey(uint64 n) { |
| std::string s(n % static_cast<uint64>(9), '\0'); |
| if (s.empty()) { |
| return StrCat(n); |
| } else { |
| while (n != 0) { |
| s[n % s.size()] = (n >> 10) & 0x7f; |
| n /= 888; |
| } |
| return s; |
| } |
| } |
| |
| TEST(MapSerializationTest, Deterministic) { |
| const int kIters = 25; |
| protobuf_unittest::TestMaps t; |
| protobuf_unittest::TestIntIntMap inner; |
| (*inner.mutable_m())[0] = (*inner.mutable_m())[10] = |
| (*inner.mutable_m())[-200] = 0; |
| uint64 frog = 9; |
| const uint64 multiplier = 0xa29cd16f; |
| for (int i = 0; i < kIters; i++) { |
| const int32 i32 = static_cast<int32>(frog & 0xffffffff); |
| const uint32 u32 = static_cast<uint32>(i32) * 91919; |
| const int64 i64 = static_cast<int64>(frog); |
| const uint64 u64 = frog * static_cast<uint64>(187321); |
| const bool b = i32 > 0; |
| const std::string s = ConstructKey(frog); |
| (*inner.mutable_m())[i] = i32; |
| (*t.mutable_m_int32())[i32] = (*t.mutable_m_sint32())[i32] = |
| (*t.mutable_m_sfixed32())[i32] = inner; |
| (*t.mutable_m_uint32())[u32] = (*t.mutable_m_fixed32())[u32] = inner; |
| (*t.mutable_m_int64())[i64] = (*t.mutable_m_sint64())[i64] = |
| (*t.mutable_m_sfixed64())[i64] = inner; |
| (*t.mutable_m_uint64())[u64] = (*t.mutable_m_fixed64())[u64] = inner; |
| (*t.mutable_m_bool())[b] = inner; |
| (*t.mutable_m_string())[s] = inner; |
| (*t.mutable_m_string())[s + std::string(1 << (u32 % static_cast<uint32>(9)), |
| b)] = inner; |
| inner.mutable_m()->erase(i); |
| frog = frog * multiplier + i; |
| frog ^= (frog >> 41); |
| } |
| |
| // Verifies if two consecutive calls to deterministic serialization produce |
| // the same bytes. Deterministic serialization means the same serialization |
| // bytes in the same binary. |
| const std::string s1 = DeterministicSerialization(t); |
| const std::string s2 = DeterministicSerialization(t); |
| EXPECT_EQ(s1, s2); |
| |
| protobuf_unittest::TestMaps u; |
| EXPECT_TRUE(u.ParseFromString(s1)); |
| EXPECT_TRUE(util::MessageDifferencer::Equals(u, t)); |
| } |
| |
| TEST(MapSerializationTest, DeterministicSubmessage) { |
| protobuf_unittest::TestSubmessageMaps p; |
| protobuf_unittest::TestMaps t; |
| const std::string filename = "golden_message_maps"; |
| std::string golden; |
| GOOGLE_CHECK_OK(File::GetContents( |
| TestUtil::GetTestDataPath("net/proto2/internal/testdata/" + filename), |
| &golden, true)); |
| t.ParseFromString(golden); |
| *(p.mutable_m()) = t; |
| std::vector<std::string> v; |
| // Use multiple attempts to increase the chance of a failure if something is |
| // buggy. For example, each separate copy of a map might use a different |
| // randomly-chosen hash function. |
| const int kAttempts = 10; |
| for (int i = 0; i < kAttempts; i++) { |
| protobuf_unittest::TestSubmessageMaps q(p); |
| ASSERT_EQ(DeterministicSerialization(q), DeterministicSerialization(p)); |
| } |
| } |
| |
| // Text Format Test ================================================= |
| |
| TEST(TextFormatMapTest, SerializeAndParse) { |
| unittest::TestMap source; |
| unittest::TestMap dest; |
| MapTestUtil::SetMapFields(&source); |
| std::string output; |
| |
| // Test compact ASCII |
| TextFormat::Printer printer; |
| printer.PrintToString(source, &output); |
| TextFormat::Parser parser; |
| EXPECT_TRUE(parser.ParseFromString(output, &dest)); |
| MapTestUtil::ExpectMapFieldsSet(dest); |
| } |
| |
| TEST(TextFormatMapTest, DynamicMessage) { |
| TestMap prototype; |
| DynamicMessageFactory factory; |
| std::unique_ptr<Message> message( |
| factory.GetPrototype(prototype.GetDescriptor())->New()); |
| MapReflectionTester tester(message->GetDescriptor()); |
| tester.SetMapFieldsViaReflection(message.get()); |
| |
| std::string expected_text; |
| GOOGLE_CHECK_OK( |
| File::GetContents(TestUtil::GetTestDataPath("net/proto2/internal/" |
| "testdata/map_test_data.txt"), |
| &expected_text, true)); |
| |
| CleanStringLineEndings(&expected_text, false); |
| EXPECT_EQ(message->DebugString(), expected_text); |
| } |
| |
| TEST(TextFormatMapTest, Sorted) { |
| unittest::TestMap message; |
| MapReflectionTester tester(message.GetDescriptor()); |
| tester.SetMapFieldsViaReflection(&message); |
| |
| std::string expected_text; |
| GOOGLE_CHECK_OK( |
| File::GetContents(TestUtil::GetTestDataPath("net/proto2/internal/" |
| "testdata/map_test_data.txt"), |
| &expected_text, true)); |
| |
| CleanStringLineEndings(&expected_text, false); |
| EXPECT_EQ(message.DebugString(), expected_text); |
| |
| // Test again on the reverse order. |
| unittest::TestMap message2; |
| tester.SetMapFieldsViaReflection(&message2); |
| tester.SwapMapsViaReflection(&message2); |
| EXPECT_EQ(message2.DebugString(), expected_text); |
| } |
| |
| TEST(TextFormatMapTest, ParseCorruptedString) { |
| std::string serialized_message; |
| GOOGLE_CHECK_OK( |
| File::GetContents(TestUtil::GetTestDataPath( |
| "net/proto2/internal/testdata/golden_message_maps"), |
| &serialized_message, true)); |
| protobuf_unittest::TestMaps message; |
| GOOGLE_CHECK(message.ParseFromString(serialized_message)); |
| TestParseCorruptedString<protobuf_unittest::TestMaps, true>(message); |
| TestParseCorruptedString<protobuf_unittest::TestMaps, false>(message); |
| } |
| |
| // Previously, serializing to text format will disable iterator from generated |
| // API. Now, the iterator can be still used even after serializing to text |
| // format. |
| TEST(TextFormatMapTest, NoDisableIterator) { |
| unittest::TestMap source; |
| (*source.mutable_map_int32_int32())[1] = 1; |
| |
| // Get iterator. |
| Map<int32, int32>::iterator iter = source.mutable_map_int32_int32()->find(1); |
| |
| // Serialize message to text format, which will invalidate the previous |
| // iterator previously. |
| std::string output; |
| TextFormat::Printer printer; |
| printer.PrintToString(source, &output); |
| |
| // Modify map via the iterator (invalidated in previous implementation.). |
| iter->second = 2; |
| |
| // In previous implementation, the new change won't be reflected in text |
| // format, because the previous iterator has been invalidated. |
| output.clear(); |
| printer.PrintToString(source, &output); |
| std::string expected = |
| "map_int32_int32 {\n" |
| " key: 1\n" |
| " value: 2\n" |
| "}\n"; |
| EXPECT_EQ(output, expected); |
| } |
| |
| // Previously, serializing to text format will disable iterator from reflection |
| // API. |
| TEST(TextFormatMapTest, NoDisableReflectionIterator) { |
| unittest::TestMap source; |
| (*source.mutable_map_int32_int32())[1] = 1; |
| |
| // Get iterator. This will also sync internal repeated field with map inside |
| // of MapField. |
| const Reflection* reflection = source.GetReflection(); |
| const FieldDescriptor* field_desc = |
| source.GetDescriptor()->FindFieldByName("map_int32_int32"); |
| RepeatedPtrField<Message>* map_field = |
| reflection->MutableRepeatedPtrField<Message>(&source, field_desc); |
| RepeatedPtrField<Message>::iterator iter = map_field->begin(); |
| |
| // Serialize message to text format, which will invalidate the previous |
| // iterator previously. |
| std::string output; |
| TextFormat::Printer printer; |
| printer.PrintToString(source, &output); |
| |
| // Modify map via the iterator (invalidated in previous implementation.). |
| const Reflection* map_entry_reflection = iter->GetReflection(); |
| const FieldDescriptor* value_field_desc = |
| iter->GetDescriptor()->FindFieldByName("value"); |
| map_entry_reflection->SetInt32(&(*iter), value_field_desc, 2); |
| GOOGLE_LOG(INFO) << iter->DebugString(); |
| |
| // In previous implementation, the new change won't be reflected in text |
| // format, because the previous iterator has been invalidated. |
| output.clear(); |
| printer.PrintToString(source, &output); |
| std::string expected = |
| "map_int32_int32 {\n" |
| " key: 1\n" |
| " value: 2\n" |
| "}\n"; |
| EXPECT_EQ(output, expected); |
| } |
| |
| |
| // arena support ================================================= |
| TEST(ArenaTest, ParsingAndSerializingNoHeapAllocation) { |
| // Allocate a large initial block to avoid mallocs during hooked test. |
| std::vector<char> arena_block(128 * 1024); |
| ArenaOptions options; |
| options.initial_block = &arena_block[0]; |
| options.initial_block_size = arena_block.size(); |
| Arena arena(options); |
| std::string data; |
| data.reserve(128 * 1024); |
| |
| { |
| // TODO(teboring): Enable no heap check when ArenaStringPtr is used in map. |
| // NoHeapChecker no_heap; |
| |
| unittest::TestArenaMap* from = |
| Arena::CreateMessage<unittest::TestArenaMap>(&arena); |
| MapTestUtil::SetArenaMapFields(from); |
| from->SerializeToString(&data); |
| |
| unittest::TestArenaMap* to = |
| Arena::CreateMessage<unittest::TestArenaMap>(&arena); |
| to->ParseFromString(data); |
| MapTestUtil::ExpectArenaMapFieldsSet(*to); |
| } |
| } |
| |
| // Use text format parsing and serializing to test reflection api. |
| TEST(ArenaTest, ReflectionInTextFormat) { |
| Arena arena; |
| std::string data; |
| |
| TextFormat::Printer printer; |
| TextFormat::Parser parser; |
| |
| unittest::TestArenaMap* from = |
| Arena::CreateMessage<unittest::TestArenaMap>(&arena); |
| unittest::TestArenaMap* to = |
| Arena::CreateMessage<unittest::TestArenaMap>(&arena); |
| |
| MapTestUtil::SetArenaMapFields(from); |
| printer.PrintToString(*from, &data); |
| |
| EXPECT_TRUE(parser.ParseFromString(data, to)); |
| MapTestUtil::ExpectArenaMapFieldsSet(*to); |
| } |
| |
| // Make sure the memory allocated for string in map is deallocated. |
| TEST(ArenaTest, StringMapNoLeak) { |
| Arena arena; |
| unittest::TestArenaMap* message = |
| Arena::CreateMessage<unittest::TestArenaMap>(&arena); |
| std::string data; |
| // String with length less than 16 will not be allocated from heap. |
| int original_capacity = data.capacity(); |
| while (data.capacity() <= original_capacity) { |
| data.append("a"); |
| } |
| (*message->mutable_map_string_string())[data] = data; |
| // We rely on heap checkers to detect memory leak for us. |
| ASSERT_FALSE(message == NULL); |
| } |
| |
| TEST(ArenaTest, IsInitialized) { |
| // Allocate a large initial polluted block. |
| std::vector<char> arena_block(128 * 1024); |
| std::fill(arena_block.begin(), arena_block.end(), '\xff'); |
| |
| ArenaOptions options; |
| options.initial_block = &arena_block[0]; |
| options.initial_block_size = arena_block.size(); |
| Arena arena(options); |
| |
| unittest::TestArenaMap* message = |
| Arena::CreateMessage<unittest::TestArenaMap>(&arena); |
| EXPECT_EQ(0, (*message->mutable_map_int32_int32())[0]); |
| } |
| |
| TEST(ArenaTest, DynamicMapFieldOnArena) { |
| Arena arena; |
| unittest::TestMap message2; |
| |
| DynamicMessageFactory factory; |
| Message* message1 = |
| factory.GetPrototype(unittest::TestMap::descriptor())->New(&arena); |
| MapReflectionTester reflection_tester(unittest::TestMap::descriptor()); |
| reflection_tester.SetMapFieldsViaReflection(message1); |
| reflection_tester.ExpectMapFieldsSetViaReflection(*message1); |
| reflection_tester.ExpectMapFieldsSetViaReflectionIterator(message1); |
| message2.CopyFrom(*message1); |
| MapTestUtil::ExpectMapFieldsSet(message2); |
| } |
| |
| TEST(MoveTest, MoveConstructorWorks) { |
| Map<int32, TestAllTypes> original_map; |
| original_map[42].mutable_optional_nested_message()->set_bb(42); |
| original_map[43].mutable_optional_nested_message()->set_bb(43); |
| const auto* nested_msg42_ptr = &original_map[42].optional_nested_message(); |
| const auto* nested_msg43_ptr = &original_map[43].optional_nested_message(); |
| |
| Map<int32, TestAllTypes> moved_to_map(std::move(original_map)); |
| EXPECT_TRUE(original_map.empty()); |
| EXPECT_EQ(2, moved_to_map.size()); |
| EXPECT_EQ(42, moved_to_map[42].optional_nested_message().bb()); |
| EXPECT_EQ(43, moved_to_map[43].optional_nested_message().bb()); |
| // This test takes advantage of the fact that pointers are swapped, so there |
| // should be pointer stability. |
| EXPECT_EQ(nested_msg42_ptr, &moved_to_map[42].optional_nested_message()); |
| EXPECT_EQ(nested_msg43_ptr, &moved_to_map[43].optional_nested_message()); |
| } |
| |
| TEST(MoveTest, MoveAssignmentWorks) { |
| Map<int32, TestAllTypes> original_map; |
| original_map[42].mutable_optional_nested_message()->set_bb(42); |
| original_map[43].mutable_optional_nested_message()->set_bb(43); |
| const auto* nested_msg42_ptr = &original_map[42].optional_nested_message(); |
| const auto* nested_msg43_ptr = &original_map[43].optional_nested_message(); |
| |
| Map<int32, TestAllTypes> moved_to_map = std::move(original_map); |
| EXPECT_TRUE(original_map.empty()); |
| EXPECT_EQ(2, moved_to_map.size()); |
| EXPECT_EQ(42, moved_to_map[42].optional_nested_message().bb()); |
| EXPECT_EQ(43, moved_to_map[43].optional_nested_message().bb()); |
| // This test takes advantage of the fact that pointers are swapped, so there |
| // should be pointer stability. |
| EXPECT_EQ(nested_msg42_ptr, &moved_to_map[42].optional_nested_message()); |
| EXPECT_EQ(nested_msg43_ptr, &moved_to_map[43].optional_nested_message()); |
| } |
| |
| |
| } // namespace |
| } // namespace internal |
| } // namespace protobuf |
| } // namespace google |
| |
| #include <google/protobuf/port_undef.inc> |