Lines Matching defs:split
41 const auto& split = current_node.dense_float_binary_split();
42 node_id = example.dense_float_features[split.feature_column()] <=
43 split.threshold()
44 ? split.left_id()
45 : split.right_id();
49 const auto& split =
50 current_node.sparse_float_binary_split_default_left().split();
52 example.sparse_float_features[split.feature_column()];
53 // Feature id for the split when multivalent sparse float column, or 0
55 const int32 dimension_id = split.dimension_id();
59 split.threshold()
60 ? split.left_id()
61 : split.right_id();
65 const auto& split =
66 current_node.sparse_float_binary_split_default_right().split();
68 example.sparse_float_features[split.feature_column()];
69 // Feature id for the split when multivalent sparse float column, or 0
71 const int32 dimension_id = split.dimension_id();
74 split.threshold()
75 ? split.left_id()
76 : split.right_id();
80 const auto& split = current_node.categorical_id_binary_split();
82 example.sparse_int_features[split.feature_column()];
83 node_id = features.find(split.feature_id()) != features.end()
84 ? split.left_id()
85 : split.right_id();
89 const auto& split =
92 node_id = split.right_id();
94 example.sparse_int_features[split.feature_column()]) {
95 if (std::binary_search(split.feature_ids().begin(),
96 split.feature_ids().end(), feature_id)) {
97 node_id = split.left_id();
125 << "A binary split node must have exactly two children.";
126 auto* split = parent_node->mutable_dense_float_binary_split();
127 split->set_left_id(*children_it);
128 split->set_right_id(*++children_it);
133 << "A binary split node must have exactly two children.";
134 auto* split =
137 split->set_left_id(*children_it);
138 split->set_right_id(*++children_it);
143 << "A binary split node must have exactly two children.";
144 auto* split =
147 split->set_left_id(*children_it);
148 split->set_right_id(*++children_it);
153 << "A binary split node must have exactly two children.";
154 auto* split = parent_node->mutable_categorical_id_binary_split();
155 split->set_left_id(*children_it);
156 split->set_right_id(*++children_it);
161 << "A binary split node must have exactly two children.";
162 auto* split =
164 split->set_left_id(*children_it);
165 split->set_right_id(*++children_it);
182 const auto& split = node.dense_float_binary_split();
183 return {split.left_id(), split.right_id()};
186 const auto& split = node.sparse_float_binary_split_default_left().split();
187 return {split.left_id(), split.right_id()};
190 const auto& split =
191 node.sparse_float_binary_split_default_right().split();
192 return {split.left_id(), split.right_id()};
195 const auto& split = node.categorical_id_binary_split();
196 return {split.left_id(), split.right_id()};
199 const auto& split = node.categorical_id_set_membership_binary_split();
200 return {split.left_id(), split.right_id()};