|
void | InitData (const std::vector< GradientPair > &gpair, const DMatrix &fmat) |
|
void | InitNewNode (const std::vector< int > &qexpand, const std::vector< GradientPair > &gpair, const DMatrix &fmat, const RegTree &tree) |
| initialize the base_weight, root_gain, and NodeEntry for all the new nodes in qexpand
|
|
void | UpdateQueueExpand (const RegTree &tree, const std::vector< int > &qexpand, std::vector< int > *p_newnodes) |
| update queue expand add in new leaves
|
|
void | UpdateEnumeration (int nid, GradientPair gstats, bst_float fvalue, int d_step, bst_uint fid, GradStats &c, std::vector< ThreadEntry > &temp, TreeEvaluator::SplitEvaluator< TrainParam > const &evaluator) const |
|
void | EnumerateSplit (const Entry *begin, const Entry *end, int d_step, bst_uint fid, const std::vector< GradientPair > &gpair, std::vector< ThreadEntry > &temp, TreeEvaluator::SplitEvaluator< TrainParam > const &evaluator) const |
|
virtual void | UpdateSolution (const SortedCSCPage &batch, const std::vector< bst_feature_t > &feat_set, const std::vector< GradientPair > &gpair, DMatrix *) |
|
void | FindSplit (int depth, const std::vector< int > &qexpand, const std::vector< GradientPair > &gpair, DMatrix *p_fmat, RegTree *p_tree) |
|
void | ResetPosition (const std::vector< int > &qexpand, DMatrix *p_fmat, const RegTree &tree) |
|
virtual void | SyncBestSolution (const std::vector< int > &qexpand) |
|
virtual void | SetNonDefaultPosition (const std::vector< int > &qexpand, DMatrix *p_fmat, const RegTree &tree) |
|
int | DecodePosition (bst_uint ridx) const |
|
void | SetEncodePosition (bst_uint ridx, int nid) |
|