cuML C++ API: SparseTreeNode< DataT, LabelT, IdxT > Struct Template Reference

#include <flatnode.h>

Collaboration diagram for SparseTreeNode< DataT, LabelT, IdxT >:

Collaboration graph

Public Member Functions
FLATNODE_HD IdxT	ColumnId () const

FLATNODE_HD DataT	QueryValue () const

FLATNODE_HD DataT	BestMetric () const

FLATNODE_HD int64_t	LeftChildId () const

FLATNODE_HD int64_t	RightChildId () const

FLATNODE_HD IdxT	InstanceCount () const

FLATNODE_HD bool	IsLeaf () const

bool	operator== (const SparseTreeNode &other) const

Static Public Member Functions
static FLATNODE_HD SparseTreeNode	CreateSplitNode (IdxT colid, DataT quesval, DataT best_metric_val, int64_t left_child_id, IdxT instance_count)

static FLATNODE_HD SparseTreeNode	CreateLeafNode (IdxT instance_count)

Detailed Description

template<typename DataT, typename LabelT, typename IdxT = int>
struct SparseTreeNode< DataT, LabelT, IdxT >

A node in Decision Tree.

Template Parameters

T	data type
L	label type
IdxT	type used for indexing operations

Member Function Documentation

◆ BestMetric()

template<typename DataT , typename LabelT , typename IdxT = int>

FLATNODE_HD DataT SparseTreeNode< DataT, LabelT, IdxT >::BestMetric ( ) const

inline

◆ ColumnId()

template<typename DataT , typename LabelT , typename IdxT = int>

FLATNODE_HD IdxT SparseTreeNode< DataT, LabelT, IdxT >::ColumnId ( ) const

inline

◆ CreateLeafNode()

template<typename DataT , typename LabelT , typename IdxT = int>

static FLATNODE_HD SparseTreeNode SparseTreeNode< DataT, LabelT, IdxT >::CreateLeafNode ( IdxT instance_count )

inlinestatic

◆ CreateSplitNode()

template<typename DataT , typename LabelT , typename IdxT = int>

static FLATNODE_HD SparseTreeNode SparseTreeNode< DataT, LabelT, IdxT >::CreateSplitNode	(	IdxT	colid,
		DataT	quesval,
		DataT	best_metric_val,
		int64_t	left_child_id,
		IdxT	instance_count
	)

inlinestatic

◆ InstanceCount()

template<typename DataT , typename LabelT , typename IdxT = int>

FLATNODE_HD IdxT SparseTreeNode< DataT, LabelT, IdxT >::InstanceCount ( ) const

inline

◆ IsLeaf()

template<typename DataT , typename LabelT , typename IdxT = int>

FLATNODE_HD bool SparseTreeNode< DataT, LabelT, IdxT >::IsLeaf ( ) const

inline

◆ LeftChildId()

template<typename DataT , typename LabelT , typename IdxT = int>

FLATNODE_HD int64_t SparseTreeNode< DataT, LabelT, IdxT >::LeftChildId ( ) const

inline

◆ operator==()

template<typename DataT , typename LabelT , typename IdxT = int>

bool SparseTreeNode< DataT, LabelT, IdxT >::operator== ( const SparseTreeNode< DataT, LabelT, IdxT > & other ) const

inline

◆ QueryValue()

template<typename DataT , typename LabelT , typename IdxT = int>

FLATNODE_HD DataT SparseTreeNode< DataT, LabelT, IdxT >::QueryValue ( ) const

inline

◆ RightChildId()

template<typename DataT , typename LabelT , typename IdxT = int>

FLATNODE_HD int64_t SparseTreeNode< DataT, LabelT, IdxT >::RightChildId ( ) const

inline

The documentation for this struct was generated from the following file:

include/cuml/tree/flatnode.h