Searched refs:subtree_end (Results 1 – 8 of 8) sorted by relevance
/external/cronet/third_party/abseil-cpp/absl/strings/internal/ |
D | cord_rep_btree_navigator.cc | 125 size_t subtree_end = 1; in Read() local 131 subtree->set_end(subtree_end); in Read() 137 subtree->set_end(subtree_end); in Read() 139 subtree_end = 1; in Read() 147 subtree->edges_[subtree_end++] = CordRep::Ref(edge); in Read() 165 subtree->edges_[subtree_end++] = right; in Read() 166 subtree->set_end(subtree_end); in Read() 168 subtree_end = 0; in Read() 170 subtree->edges_[subtree_end++] = CordRep::Ref(edge); in Read() 178 subtree->edges_[subtree_end++] = Substring(edge, 0, length); in Read() [all …]
|
/external/webrtc/third_party/abseil-cpp/absl/strings/internal/ |
D | cord_rep_btree_navigator.cc | 125 size_t subtree_end = 1; in Read() local 131 subtree->set_end(subtree_end); in Read() 137 subtree->set_end(subtree_end); in Read() 139 subtree_end = 1; in Read() 147 subtree->edges_[subtree_end++] = CordRep::Ref(edge); in Read() 165 subtree->edges_[subtree_end++] = right; in Read() 166 subtree->set_end(subtree_end); in Read() 168 subtree_end = 0; in Read() 170 subtree->edges_[subtree_end++] = CordRep::Ref(edge); in Read() 178 subtree->edges_[subtree_end++] = Substring(edge, 0, length); in Read() [all …]
|
/external/tensorflow/third_party/absl/abseil-cpp/absl/strings/internal/ |
D | cord_rep_btree_navigator.cc | 125 size_t subtree_end = 1; in Read() local 131 subtree->set_end(subtree_end); in Read() 137 subtree->set_end(subtree_end); in Read() 139 subtree_end = 1; in Read() 147 subtree->edges_[subtree_end++] = CordRep::Ref(edge); in Read() 165 subtree->edges_[subtree_end++] = right; in Read() 166 subtree->set_end(subtree_end); in Read() 168 subtree_end = 0; in Read() 170 subtree->edges_[subtree_end++] = CordRep::Ref(edge); in Read() 178 subtree->edges_[subtree_end++] = Substring(edge, 0, length); in Read() [all …]
|
/external/abseil-cpp/absl/strings/internal/ |
D | cord_rep_btree_navigator.cc | 125 size_t subtree_end = 1; in Read() local 131 subtree->set_end(subtree_end); in Read() 137 subtree->set_end(subtree_end); in Read() 139 subtree_end = 1; in Read() 147 subtree->edges_[subtree_end++] = CordRep::Ref(edge); in Read() 165 subtree->edges_[subtree_end++] = right; in Read() 166 subtree->set_end(subtree_end); in Read() 168 subtree_end = 0; in Read() 170 subtree->edges_[subtree_end++] = CordRep::Ref(edge); in Read() 178 subtree->edges_[subtree_end++] = Substring(edge, 0, length); in Read() [all …]
|
/external/angle/third_party/abseil-cpp/absl/strings/internal/ |
D | cord_rep_btree_navigator.cc | 125 size_t subtree_end = 1; in Read() local 131 subtree->set_end(subtree_end); in Read() 137 subtree->set_end(subtree_end); in Read() 139 subtree_end = 1; in Read() 147 subtree->edges_[subtree_end++] = CordRep::Ref(edge); in Read() 165 subtree->edges_[subtree_end++] = right; in Read() 166 subtree->set_end(subtree_end); in Read() 168 subtree_end = 0; in Read() 170 subtree->edges_[subtree_end++] = CordRep::Ref(edge); in Read() 178 subtree->edges_[subtree_end++] = Substring(edge, 0, length); in Read() [all …]
|
/external/tensorflow/tensorflow/compiler/xla/service/ |
D | heap_simulator.cc | 627 parent->subtree_end = std::max(parent->subtree_end, end); in Add() 674 node->subtree_end = node->end; in Remove() 676 node->subtree_end = in Remove() 677 std::max(node->subtree_end, node->left->subtree_end); in Remove() 680 node->subtree_end = in Remove() 681 std::max(node->subtree_end, node->right->subtree_end); in Remove() 736 to_delete->subtree_end = to_promote->subtree_end; in Remove() 785 if (start > top->subtree_end) { in ChunksOverlappingInTime()
|
D | heap_simulator_test.cc | 1543 EXPECT_EQ(tree.GetRoot()->subtree_end, 36); in TEST_F() 1557 EXPECT_EQ(tree.GetRoot()->subtree_end, 36); in TEST_F() 1571 EXPECT_EQ(tree.GetRoot()->subtree_end, 45); in TEST_F() 1589 EXPECT_EQ(tree.GetRoot()->subtree_end, 45); in TEST_F() 1610 EXPECT_EQ(tree.GetRoot()->subtree_end, 40); in TEST_F() 1612 EXPECT_EQ(tree.GetRoot()->subtree_end, 40); in TEST_F() 1628 EXPECT_EQ(tree.GetRoot()->subtree_end, 40); in TEST_F() 1630 EXPECT_EQ(tree.GetRoot()->subtree_end, 36); in TEST_F() 1647 EXPECT_EQ(tree.GetRoot()->subtree_end, 40); in TEST_F() 1649 EXPECT_EQ(tree.GetRoot()->subtree_end, 36); in TEST_F() [all …]
|
D | heap_simulator.h | 325 int64_t subtree_end; member
|