Searched defs:right_child (Results 1 – 14 of 14) sorted by relevance
18 tensorflow.boosted_trees.trees.Leaf right_child = 3; field
124 int32 right_child = left_child + 1; in Compute() local
126 int32 right_child = left_child + 1; in Compute() local
144 int32 right_child = left_child + 1; in Compute() local
157 int32 right_child = left_child + 1; in Compute() local
150 int32 right_child = left_child + 1; in Compute() local
162 int32 right_child = left_child + 1; in Compute() local
59 PartitionTreeNode* right_child() const { return children_[kRightChild]; } in right_child() function
56 uint32_t right_child = left_child + 1; in adjust_downwards() local
292 auto* right_child = split_info.mutable_right_child(); in ComputeNormalDecisionTree() local405 auto* right_child = oblivious_split_info.add_children(); in ComputeObliviousDecisionTree() local674 auto* right_child = split_info.mutable_right_child(); in Compute() local873 auto* right_child = split_info.mutable_right_child(); in ComputeNormalDecisionTree() local986 auto* right_child = oblivious_split_info.add_children(); in ComputeObliviousDecisionTree() local
248 bool right_child = true; in InsertNode() local
56 size_t right_child = left_child + 1u; in check_valid() local
2832 NodeDef* right_child = node_map_->GetNode(node->input(1)); in ConstantPushDown() local