Searched refs:splits_ (Results 1 – 2 of 2) sorted by relevance
53 return splits_[split_num]; in Split()59 splits_.clear(); in Clear()76 int num_splits() const { return splits_.size(); } in num_splits()81 return weight_sum_ > 0 || splits_.size() == num_splits_to_consider_; in IsInitialized()97 std::vector<decision_trees::BinaryNode> splits_; variable182 return weight_sum_ > 0 || (splits_.size() == num_splits_to_consider_ && in IsInitialized()220 if (splits_[splits_.size() - 1].has_inequality_left_child_test()) { in AddSplitStats()221 half_initialized_splits_[splits_.size() - 1] = in AddSplitStats()
47 if (splits_.size() < num_splits_to_consider_) { in AddSplit()48 splits_.push_back(split); in AddSplit()61 splits_.erase(splits_.begin() + split_num); in RemoveSplit()140 auto& split = splits_[it->first]; in AdditionalInitializationExample()404 *best->mutable_split() = splits_[best_index]; in BestSplit()458 *cand->mutable_split() = splits_[split_num]; in PackToProto()550 *cand->mutable_split() = splits_[split_num]; in PackToProto()758 *cand->mutable_split() = splits_[split_num]; in PackToProto()848 *cand->mutable_split() = splits_[split_num]; in PackToProto()928 *best->mutable_split() = splits_[best_index]; in BestSplit()