| /third_party/mindspore/tests/ut/cpp/dataset/ |
| D | btree_test.cc | 46 BPlusTree<uint64_t, std::string, Allocator<std::string>, std::less<>, mytraits> btree(alloc); in TEST_F() local
52 rc = btree.DoInsert(key, oss.str()); in TEST_F()
59 rc = btree.DoInsert(key, oss.str()); in TEST_F()
62 EXPECT_EQ(btree.size(), 200); in TEST_F()
67 auto it = btree.begin(); in TEST_F()
71 while (it != btree.end()) { in TEST_F()
91 auto r = btree.Search(100); in TEST_F()
97 auto q = btree.Search(300); in TEST_F()
103 rc = btree.DoInsert(100, "Expect error"); in TEST_F()
111 BPlusTree<uint64_t, std::string, Allocator<std::string>, std::less<>, mytraits> btree(alloc); in TEST_F() local
[all …]
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/ |
| D | cord_rep_btree_reader.h | 88 explicit operator bool() const { return navigator_.btree() != nullptr; }
91 CordRepBtree* btree() const { return navigator_.btree(); } in btree() function
165 assert(btree() != nullptr); in length()
166 return btree()->length; in length()
170 assert(btree() != nullptr); in consumed()
|
| D | cord_rep_btree_navigator.h | 70 CordRepBtree* btree() const;
153 inline CordRepBtree* CordRepBtreeNavigator::btree() const { in btree() function
181 tree = tree->Edge(index)->btree(); in Init()
191 assert(btree() != nullptr); in Seek()
198 edge = edge->Edge(index.index)->btree(); in Seek()
237 node_[--height] = edge = edge->Edge(index)->btree(); in NextUp()
255 node_[--height] = edge = edge->Edge(index)->btree(); in PreviousUp()
|
| D | cord_rep_btree.cc | 83 const CordRepBtree* node = rep->btree(); in DumpAll()
212 tree = tree->Edge(edge_type)->btree(); in BuildStack()
217 tree = tree->Edge(edge_type)->btree(); in BuildStack()
231 tree = tree->Edge(edge_type)->btree(); in BuildOwnedStack()
361 FastUnref(edge->btree(), Destroy); in DestroyNonLeaf()
391 NODE_CHECK_VALID(edge->btree()->height() == tree->height() - 1); in IsValid()
400 if (!IsValid(edge->btree(), shallow)) return false; in IsValid()
652 node = back->btree(); in CopySuffix()
683 node = edge->btree(); in CopySuffix()
708 node = front->btree(); in CopyPrefix()
[all …]
|
| D | cord_rep_btree_navigator_test.cc | 103 EXPECT_THAT(nav.btree(), Eq(nullptr)); in TEST()
113 EXPECT_THAT(nav.btree(), Eq(tree())); in TEST_P()
122 EXPECT_THAT(nav.btree(), Eq(tree())); in TEST_P()
175 EXPECT_THAT(nav.btree(), Eq(nullptr)); in TEST()
249 EXPECT_THAT(nav.btree(), Eq(tree)); in TEST()
264 EXPECT_THAT(nav.btree(), Eq(tree1)); in TEST()
269 EXPECT_THAT(nav.btree(), Eq(tree1)); in TEST()
293 ASSERT_TRUE(CordRepBtree::IsValid(result.tree->btree())); in TEST_P()
|
| D | cord_rep_btree_test.cc | 93 if (!CordRepBtree::IsValid(arg->btree())) {
94 CordRepBtree::Dump(arg->btree(), "Expected valid NODE, got:", false,
98 if (arg->btree()->height() != height) {
100 << arg->btree()->height();
172 GetLeafEdges(edge->btree(), edges); in GetLeafEdges()
293 EXPECT_THAT(rep->btree(), Eq(rep)); in TEST()
294 EXPECT_THAT(static_cast<const CordRep*>(rep)->btree(), Eq(rep)); in TEST()
298 EXPECT_DEATH(rep->btree(), ".*"); in TEST()
299 EXPECT_DEATH(static_cast<const CordRep*>(rep)->btree(), ".*"); in TEST()
440 EXPECT_THAT(edges[1]->btree()->Edges(), ElementsAre(flat)); in TEST_P()
[all …]
|
| D | cord_rep_btree.h | 516 inline CordRepBtree* CordRep::btree() { in btree() function
521 inline const CordRepBtree* CordRep::btree() const { in btree() function
592 int height = rep->IsBtree() ? rep->btree()->height() + 1 : 0; in New()
792 tree = tree->Edge(kBack)->btree(); in GetAppendBuffer()
797 tree = tree->Edge(kBack)->btree(); in GetAppendBuffer()
802 tree = tree->Edge(kBack)->btree(); in GetAppendBuffer()
|
| D | cordz_info_statistics_test.cc | 151 self = SizeOf(rep->btree()); in FairShareImpl()
152 for (CordRep*edge : rep->btree()->Edges()) { in FairShareImpl()
207 STATS_MATCHER_EXPECT_EQ(node_counts.btree);
473 expected.node_counts.btree = 1; in TEST()
513 mem_size += SizeOf(tree->Edges().back()->btree()); in TEST()
533 expected.node_counts.btree = 1 + leaf_count; in TEST()
|
| D | cord_rep_btree_navigator.cc | 90 node = edge->btree(); in Skip()
154 node = edge->btree(); in Read()
|
| D | cordz_statistics.h | 43 size_t btree = 0; // #btree reps member
|
| D | cord_internal.cc | 56 CordRepBtree::Destroy(rep->btree()); in Destroy()
|
| D | cord_internal.h | 247 inline CordRepBtree* btree();
248 inline const CordRepBtree* btree() const;
|
| /third_party/abseil-cpp/absl/container/internal/ |
| D | btree.h | 864 friend class btree;
989 friend class btree;
1015 class btree {
1114 btree(const key_compare &comp, const allocator_type &alloc);
1116 btree(const btree &other);
1117 btree(btree &&other) noexcept
1124 ~btree() {
1132 btree &operator=(const btree &other);
1133 btree &operator=(btree &&other) noexcept;
1177 return const_cast<btree *>(this)->equal_range(key);
[all …]
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/container/internal/ |
| D | btree.h | 336 friend class btree;
934 friend class btree;
1061 friend class btree;
1085 class btree {
1188 btree(const key_compare &comp, const allocator_type &alloc)
1191 btree(const btree &other) : btree(other, other.allocator()) {}
1192 btree(const btree &other, const allocator_type &alloc)
1193 : btree(other.key_comp(), alloc) {
1196 btree(btree &&other) noexcept
1202 btree(btree &&other, const allocator_type &alloc)
[all …]
|
| /third_party/libphonenumber/tools/cpp/ |
| D | CMakeLists.txt | 67 target_link_libraries (generate_geocoding_data absl::strings absl::btree absl::node_hash_set)
84 target_link_libraries (generate_geocoding_data_test absl::btree ${TEST_LIBS} absl::node_hash_set)
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/container/ |
| D | btree_set.h | 75 container_internal::btree<container_internal::set_params<
397 container_internal::btree<container_internal::set_params<
|
| D | btree_map.h | 75 container_internal::btree<container_internal::map_params<
477 container_internal::btree<container_internal::map_params<
|
| D | CMakeLists.txt | 19 btree
23 "internal/btree.h"
54 absl::btree
72 absl::btree
|
| D | BUILD.bazel | 879 name = "btree",
881 "internal/btree.h",
915 ":btree",
934 ":btree",
961 ":btree",
|
| /third_party/abseil-cpp/absl/container/ |
| D | btree_set.h | 75 container_internal::btree<container_internal::set_params<
397 container_internal::btree<container_internal::set_params<
|
| D | btree_map.h | 75 container_internal::btree<container_internal::map_params<
478 container_internal::btree<container_internal::map_params<
|
| D | BUILD.bazel | 825 name = "btree",
827 "internal/btree.h",
861 ":btree",
880 ":btree",
907 ":btree",
|
| D | CMakeLists.txt | 28 btree
32 "internal/btree.h"
63 absl::btree
81 absl::btree
|
| /third_party/mindspore/mindspore/ccsrc/minddata/dataset/util/ |
| D | btree.h | 387 explicit Iterator(BPlusTree *btree) : cur_(btree->leaf_nodes_.head), slot_(0), locked_(false) {} in Iterator() argument
450 …explicit ConstIterator(const BPlusTree *btree) : cur_(btree->leaf_nodes_.head), slot_(0), locked_(… in ConstIterator() argument
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/strings/ |
| D | cord.cc | 344 return rep->IsBtree() ? rep->btree() : CordRepBtree::Create(rep); in ForceBtree()
423 Span<char> span = root->btree()->GetAppendBuffer(max_length); in PrepareAppendRegion()
715 rep = CordRepBtree::Append(rep->btree(), src, alloc_hint); in AppendArray()
952 tree = tree->btree()->SubTree(n, tree->length - n); in RemovePrefix()
975 tree = tree->btree()->SubTree(0, tree->length - n); in RemoveSuffix()
1069 tree = tree->btree()->SubTree(pos, new_size); in Subcord()
1274 CordRepBtree* tree = node->btree(); in FindFlatStartPiece()
1277 tree = tree->Edge(CordRepBtree::kFront)->btree(); in FindFlatStartPiece()
1733 return rep->btree()->GetCharacter(offset); in operator []()
1793 return rep->btree()->IsFlat(fragment); in GetFlatAux()
[all …]
|