Searched refs:insert_result (Results 1 – 10 of 10) sorted by relevance
| /third_party/skia/third_party/externals/abseil-cpp/absl/container/ |
| D | node_hash_set_test.cc | 81 auto insert_result = set2.insert(std::move(node)); in TEST() local
83 EXPECT_FALSE(insert_result.inserted); in TEST()
84 EXPECT_TRUE(insert_result.node); in TEST()
85 EXPECT_THAT(insert_result.node.value(), Pointee(7)); in TEST()
86 EXPECT_EQ(**insert_result.position, 7); in TEST()
87 EXPECT_NE(insert_result.position->get(), insert_result.node.value().get()); in TEST()
97 insert_result = set2.insert(std::move(node)); in TEST()
99 EXPECT_TRUE(insert_result.inserted); in TEST()
100 EXPECT_FALSE(insert_result.node); in TEST()
101 EXPECT_EQ(**insert_result.position, 23); in TEST()
|
| D | flat_hash_set_test.cc | 116 auto insert_result = set2.insert(std::move(node)); in TEST() local
118 EXPECT_FALSE(insert_result.inserted); in TEST()
119 EXPECT_TRUE(insert_result.node); in TEST()
120 EXPECT_THAT(insert_result.node.value(), Pointee(7)); in TEST()
121 EXPECT_EQ(**insert_result.position, 7); in TEST()
122 EXPECT_NE(insert_result.position->get(), insert_result.node.value().get()); in TEST()
132 insert_result = set2.insert(std::move(node)); in TEST()
134 EXPECT_TRUE(insert_result.inserted); in TEST()
135 EXPECT_FALSE(insert_result.node); in TEST()
136 EXPECT_EQ(**insert_result.position, 23); in TEST()
|
| D | node_hash_map_test.cc | 195 auto insert_result = set2.insert(std::move(node)); in TEST() local
197 EXPECT_FALSE(insert_result.inserted); in TEST()
198 EXPECT_TRUE(insert_result.node); in TEST()
199 EXPECT_EQ(insert_result.node.key().i, 7); in TEST()
200 EXPECT_EQ(insert_result.node.mapped(), -7); in TEST()
201 EXPECT_THAT(*insert_result.position, Elem(7, -70)); in TEST()
212 insert_result = set2.insert(std::move(node)); in TEST()
214 EXPECT_TRUE(insert_result.inserted); in TEST()
215 EXPECT_FALSE(insert_result.node); in TEST()
216 EXPECT_THAT(*insert_result.position, Elem(17, 23)); in TEST()
|
| /third_party/node/deps/v8/src/torque/ |
| D | earley-parser.cc | 215 auto insert_result = processed->insert(worklist.back()); in RunEarleyAlgorithm() local
216 const Item& item = *insert_result.first; in RunEarleyAlgorithm()
220 bool is_new = insert_result.second; in RunEarleyAlgorithm()
|
| /third_party/node/deps/v8/src/ast/ |
| D | modules.cc | 310 auto insert_result = in BetterDuplicate() local
312 if (insert_result.second) return current_duplicate; in BetterDuplicate()
314 current_duplicate = insert_result.first->second; in BetterDuplicate()
|
| /third_party/node/deps/v8/src/heap/ |
| D | scavenger.cc | 762 auto insert_result = heap()->ephemeron_remembered_set_.insert( in Finalize() local
765 insert_result.first->second.insert(entry); in Finalize()
|
| D | mark-compact.cc | 1483 auto insert_result = in VisitEphemeron() local
1485 insert_result.first->second.insert(index); in VisitEphemeron()
3727 auto insert_result = in Finalize() local
3729 if (!insert_result.second) { in Finalize()
3731 auto set = insert_result.first->second; in Finalize()
|
| /third_party/node/deps/v8/src/objects/ |
| D | source-text-module.cc | 588 auto insert_result = more_exports.insert(std::make_pair(name, cell)); in FetchStarExports() local
589 if (!insert_result.second) { in FetchStarExports()
590 auto it = insert_result.first; in FetchStarExports()
|
| /third_party/mesa3d/src/amd/compiler/ |
| D | aco_spill.cpp | 232 auto insert_result = ctx.next_use_distances_end[pred_idx].insert( in next_uses_per_block() local
234 const bool inserted = insert_result.second; in next_uses_per_block()
235 std::pair<uint32_t, uint32_t>& entry_distance = insert_result.first->second; in next_uses_per_block()
256 auto insert_result = ctx.next_use_distances_end[pred_idx].insert( in next_uses_per_block() local
258 const bool inserted = insert_result.second; in next_uses_per_block()
259 std::pair<uint32_t, uint32_t>& entry_distance = insert_result.first->second; in next_uses_per_block()
|
| /third_party/protobuf/src/google/protobuf/ |
| D | descriptor.cc | 5160 insert_result = values.insert(std::make_pair(stripped, value)); in CheckEnumValueUniqueness() local
5161 bool inserted = insert_result.second; in CheckEnumValueUniqueness()
5169 if (!inserted && insert_result.first->second->name() != value->name() && in CheckEnumValueUniqueness()
5170 insert_result.first->second->number() != value->number()) { in CheckEnumValueUniqueness()
|