Searched refs:IsLeaf (Results 1 – 9 of 9) sorted by relevance
79 bool IsLeaf; member in __anon6bfa93f00111::DeltaTreeNode86 : NumValuesUsed(0), IsLeaf(isLeaf), FullDelta(0) {} in DeltaTreeNode()88 bool isLeaf() const { return IsLeaf; } in isLeaf()
89 bool IsLeaf; member in __anon1ec3f34e0111::RopePieceBTreeNode91 RopePieceBTreeNode(bool isLeaf) : Size(0), IsLeaf(isLeaf) {} in RopePieceBTreeNode()95 bool isLeaf() const { return IsLeaf; } in isLeaf()
1191 bool IsLeaf = true; in removeInternalRefEdge() local1202 IsLeaf = false; in removeInternalRefEdge()1208 assert(!IsLeaf && "This SCC cannot be a leaf as we have split out new " in removeInternalRefEdge()1212 assert(!IsLeaf && "This SCC cannot be a leaf as it already had child " in removeInternalRefEdge()1401 bool IsLeaf = true; in connectRefSCC() local1411 IsLeaf = false; in connectRefSCC()1415 if (IsLeaf) in connectRefSCC()
352 if (elements.IsLeaf(index)) { in ExpandTreeOfTuples()410 if (!elements.IsLeaf(index)) { in MakeTuple()444 if (elements.IsLeaf(index)) { in MakeTuple()
213 if (rhs_tree.IsLeaf(rhs_it->first)) { in AssignTreeSharding()214 TF_RET_CHECK(lhs_tree->IsLeaf(lhs_it->first)); in AssignTreeSharding()
75 EXPECT_TRUE(shape_tree.IsLeaf({})); in TEST_F()
332 bool IsLeaf = CurrNode.Children.size() == 0 && !CurrNode.isRoot(); in setSuffixIndices() local351 if (IsLeaf) { in setSuffixIndices()
139 bool IsLeaf(ShapeIndexView index) const { return Lookup(index)->is_leaf; } in IsLeaf() function
140 if (tuple_shape_tree->IsLeaf(index)) { in ParseTupleTree()