Home
last modified time | relevance | path

Searched refs:bst_node_t (Results 1 – 25 of 54) sorted by relevance

123

/dports/misc/py-xgboost/xgboost-1.5.1/src/tree/gpu_hist/
H A Drow_partitioner.cuh36 static constexpr bst_node_t kIgnoredTreePosition = -1;
51 dh::TemporaryArray<bst_node_t> position_a_;
52 dh::TemporaryArray<bst_node_t> position_b_;
60 dh::DoubleBuffer<bst_node_t> position_;
75 common::Span<const RowIndexT> GetRows(bst_node_t nidx);
85 common::Span<const bst_node_t> GetPosition();
90 std::vector<RowIndexT> GetRowsHost(bst_node_t nidx);
95 std::vector<bst_node_t> GetPositionHost();
110 void UpdatePosition(bst_node_t nidx, bst_node_t left_nidx, in UpdatePosition()
166 bst_node_t new_position = op(ridx, position); in FinalisePosition()
[all …]
H A Drow_partitioner.cu26 bst_node_t left_nidx;
27 common::Span<bst_node_t> position_in;
28 common::Span<bst_node_t> position_out;
59 bst_node_t left_nidx, bst_node_t, in SortPosition()
81 common::Span<bst_node_t> position) { in Reset()
113 bst_node_t nidx) { in GetRows()
127 common::Span<const bst_node_t> RowPartitioner::GetPosition() { in GetPosition()
131 bst_node_t nidx) { in GetRowsHost()
138 std::vector<bst_node_t> RowPartitioner::GetPositionHost() { in GetPositionHost()
140 std::vector<bst_node_t> position(span.size()); in GetPositionHost()
[all …]
/dports/misc/xgboost/xgboost-1.5.1/src/tree/gpu_hist/
H A Drow_partitioner.cuh36 static constexpr bst_node_t kIgnoredTreePosition = -1;
51 dh::TemporaryArray<bst_node_t> position_a_;
52 dh::TemporaryArray<bst_node_t> position_b_;
60 dh::DoubleBuffer<bst_node_t> position_;
75 common::Span<const RowIndexT> GetRows(bst_node_t nidx);
85 common::Span<const bst_node_t> GetPosition();
90 std::vector<RowIndexT> GetRowsHost(bst_node_t nidx);
95 std::vector<bst_node_t> GetPositionHost();
110 void UpdatePosition(bst_node_t nidx, bst_node_t left_nidx, in UpdatePosition()
166 bst_node_t new_position = op(ridx, position); in FinalisePosition()
[all …]
H A Drow_partitioner.cu26 bst_node_t left_nidx;
27 common::Span<bst_node_t> position_in;
28 common::Span<bst_node_t> position_out;
59 bst_node_t left_nidx, bst_node_t, in SortPosition()
81 common::Span<bst_node_t> position) { in Reset()
113 bst_node_t nidx) { in GetRows()
127 common::Span<const bst_node_t> RowPartitioner::GetPosition() { in GetPosition()
131 bst_node_t nidx) { in GetRowsHost()
138 std::vector<bst_node_t> RowPartitioner::GetPositionHost() { in GetPositionHost()
140 std::vector<bst_node_t> position(span.size()); in GetPositionHost()
[all …]
/dports/misc/py-xgboost/xgboost-1.5.1/src/tree/
H A Dconstraints.h40 void SplitImpl(int32_t node_id, bst_feature_t feature_id, bst_node_t left_id,
41 bst_node_t right_id);
45 void Split(int32_t node_id, bst_feature_t feature_id, bst_node_t left_id, in Split()
46 bst_node_t right_id) { in Split()
54 bool Query(bst_node_t nid, bst_feature_t fid) const { in Query()
H A Dsplit_evaluator.h28 static constexpr bst_node_t kRootParentId =
29 (-1 & static_cast<bst_node_t>((1U << 31) - 1));
72 XGBOOST_DEVICE double CalcSplitGain(const ParamT &param, bst_node_t nidx, in CalcSplitGain()
93 XGBOOST_DEVICE float CalcWeight(bst_node_t nodeid, const ParamT &param, in CalcWeight()
123 XGBOOST_DEVICE float CalcGain(bst_node_t nid, ParamT const &p, in CalcGain()
146 void AddSplit(bst_node_t nodeid, bst_node_t leftid, bst_node_t rightid, in AddSplit()
H A Dconstraints.cc59 bst_node_t node_id, bst_feature_t feature_id, bst_node_t left_id, bst_node_t right_id) { in SplitImpl()
60 bst_node_t newsize = std::max(left_id, right_id) + 1; in SplitImpl()
H A Dconstraints.cuh95 void Split(bst_node_t node_id, bst_feature_t feature_id, bst_node_t left_id, bst_node_t right_id);
H A Dupdater_prune.cc70 bst_node_t TryPruneLeaf(RegTree &tree, int nid, int depth, int npruned) { // NOLINT(*) in TryPruneLeaf()
75 bst_node_t pid = tree[nid].Parent(); in TryPruneLeaf()
95 bst_node_t npruned = 0; in DoPrune()
H A Dtree_model.cc730 constexpr bst_node_t RegTree::kRoot;
760 bst_node_t RegTree::GetNumLeaves() const { in GetNumLeaves()
761 bst_node_t leaves { 0 }; in GetNumLeaves()
763 this->WalkTree([&leaves, &self](bst_node_t nidx) { in GetNumLeaves()
772 bst_node_t RegTree::GetNumSplitNodes() const { in GetNumSplitNodes()
773 bst_node_t splits { 0 }; in GetNumSplitNodes()
775 this->WalkTree([&splits, &self](bst_node_t nidx) { in GetNumSplitNodes()
904 bst_node_t last_cat_node = -1; in LoadCategoricalSplit()
1031 bst_node_t left = get<Integer const>(lefts[i]); in LoadModel()
1099 for (bst_node_t i = 0; i < n_nodes; ++i) { in SaveModel()
[all …]
/dports/misc/xgboost/xgboost-1.5.1/src/tree/
H A Dconstraints.h40 void SplitImpl(int32_t node_id, bst_feature_t feature_id, bst_node_t left_id,
41 bst_node_t right_id);
45 void Split(int32_t node_id, bst_feature_t feature_id, bst_node_t left_id, in Split()
46 bst_node_t right_id) { in Split()
54 bool Query(bst_node_t nid, bst_feature_t fid) const { in Query()
H A Dsplit_evaluator.h28 static constexpr bst_node_t kRootParentId =
29 (-1 & static_cast<bst_node_t>((1U << 31) - 1));
72 XGBOOST_DEVICE double CalcSplitGain(const ParamT &param, bst_node_t nidx, in CalcSplitGain()
93 XGBOOST_DEVICE float CalcWeight(bst_node_t nodeid, const ParamT &param, in CalcWeight()
123 XGBOOST_DEVICE float CalcGain(bst_node_t nid, ParamT const &p, in CalcGain()
146 void AddSplit(bst_node_t nodeid, bst_node_t leftid, bst_node_t rightid, in AddSplit()
H A Dconstraints.cc59 bst_node_t node_id, bst_feature_t feature_id, bst_node_t left_id, bst_node_t right_id) { in SplitImpl()
60 bst_node_t newsize = std::max(left_id, right_id) + 1; in SplitImpl()
H A Dconstraints.cuh95 void Split(bst_node_t node_id, bst_feature_t feature_id, bst_node_t left_id, bst_node_t right_id);
H A Dupdater_prune.cc70 bst_node_t TryPruneLeaf(RegTree &tree, int nid, int depth, int npruned) { // NOLINT(*) in TryPruneLeaf()
75 bst_node_t pid = tree[nid].Parent(); in TryPruneLeaf()
95 bst_node_t npruned = 0; in DoPrune()
H A Dtree_model.cc730 constexpr bst_node_t RegTree::kRoot;
760 bst_node_t RegTree::GetNumLeaves() const { in GetNumLeaves()
761 bst_node_t leaves { 0 }; in GetNumLeaves()
763 this->WalkTree([&leaves, &self](bst_node_t nidx) { in GetNumLeaves()
772 bst_node_t RegTree::GetNumSplitNodes() const { in GetNumSplitNodes()
773 bst_node_t splits { 0 }; in GetNumSplitNodes()
775 this->WalkTree([&splits, &self](bst_node_t nidx) { in GetNumSplitNodes()
904 bst_node_t last_cat_node = -1; in LoadCategoricalSplit()
1031 bst_node_t left = get<Integer const>(lefts[i]); in LoadModel()
1099 for (bst_node_t i = 0; i < n_nodes; ++i) { in SaveModel()
[all …]
/dports/misc/py-xgboost/xgboost-1.5.1/include/xgboost/
H A Dtree_model.h134 static constexpr bst_node_t kInvalidNodeId {-1};
136 static constexpr bst_node_t kRoot { 0 };
376 std::stack<bst_node_t> nodes; in WalkTree()
420 void ExpandNode(bst_node_t nid, unsigned split_index, bst_float split_value,
425 bst_node_t leaf_right_child = kInvalidNodeId);
442 void ExpandCategorical(bst_node_t nid, unsigned split_index,
488 bst_node_t GetNumLeaves() const;
489 bst_node_t GetNumSplitNodes() const;
570 void TreeShap(const RegTree::FVec& feat, bst_float* phi, bst_node_t node_index,
599 FeatureType NodeSplitType(bst_node_t nidx) const { in NodeSplitType()
[all …]
/dports/misc/xgboost/xgboost-1.5.1/include/xgboost/
H A Dtree_model.h134 static constexpr bst_node_t kInvalidNodeId {-1};
136 static constexpr bst_node_t kRoot { 0 };
376 std::stack<bst_node_t> nodes; in WalkTree()
420 void ExpandNode(bst_node_t nid, unsigned split_index, bst_float split_value,
425 bst_node_t leaf_right_child = kInvalidNodeId);
442 void ExpandCategorical(bst_node_t nid, unsigned split_index,
488 bst_node_t GetNumLeaves() const;
489 bst_node_t GetNumSplitNodes() const;
570 void TreeShap(const RegTree::FVec& feat, bst_float* phi, bst_node_t node_index,
599 FeatureType NodeSplitType(bst_node_t nidx) const { in NodeSplitType()
[all …]
/dports/misc/py-xgboost/xgboost-1.5.1/src/predictor/
H A Dpredict_fn.h12 inline XGBOOST_DEVICE bst_node_t
13 GetNextNode(const RegTree::Node &node, const bst_node_t nid, float fvalue, in GetNextNode()
H A Dcpu_predictor.cc32 bst_node_t GetLeafIndex(RegTree const &tree, const RegTree::FVec &feat, in GetLeafIndex()
34 bst_node_t nid = 0; in GetLeafIndex()
56 bst_node_t nidx = -1; in PredValue()
73 const bst_node_t leaf = p_feats.HasMissing() ? in PredValueByOneTree()
216 float FillNodeMeanValues(RegTree const *tree, bst_node_t nidx, std::vector<float> *mean_values) { in FillNodeMeanValues()
432 bst_node_t tid = GetLeafIndex<true, true>(tree, feats, cats); in PredictLeaf()
/dports/misc/xgboost/xgboost-1.5.1/src/predictor/
H A Dpredict_fn.h12 inline XGBOOST_DEVICE bst_node_t
13 GetNextNode(const RegTree::Node &node, const bst_node_t nid, float fvalue, in GetNextNode()
/dports/misc/py-xgboost/xgboost-1.5.1/src/common/
H A Drow_set.h28 bst_node_t node_id{-1};
34 bst_node_t node_id = -1)
/dports/misc/xgboost/xgboost-1.5.1/src/common/
H A Drow_set.h28 bst_node_t node_id{-1};
34 bst_node_t node_id = -1)
/dports/misc/py-xgboost/xgboost-1.5.1/src/gbm/
H A Dgbtree.h324 p_tree->WalkTree([&](bst_node_t nidx) { in FeatureScore()
336 add_score([&](auto const &p_tree, bst_node_t, bst_feature_t split) { in FeatureScore()
340 add_score([&](auto const &p_tree, bst_node_t nidx, bst_feature_t split) { in FeatureScore()
344 add_score([&](auto const &p_tree, bst_node_t nidx, bst_feature_t split) { in FeatureScore()
/dports/misc/xgboost/xgboost-1.5.1/src/gbm/
H A Dgbtree.h324 p_tree->WalkTree([&](bst_node_t nidx) { in FeatureScore()
336 add_score([&](auto const &p_tree, bst_node_t, bst_feature_t split) { in FeatureScore()
340 add_score([&](auto const &p_tree, bst_node_t nidx, bst_feature_t split) { in FeatureScore()
344 add_score([&](auto const &p_tree, bst_node_t nidx, bst_feature_t split) { in FeatureScore()

123