org.bytedeco.opencv.opencv_ml

Class DTrees.Split

java.lang.Object

org.bytedeco.javacpp.Pointer

org.bytedeco.opencv.opencv_ml.DTrees.Split

All Implemented Interfaces:

AutoCloseable

Enclosing class:

DTrees

@NoOffset
public static class DTrees.Split
extends Pointer

\brief The class represents split in a decision tree.

Nested Class Summary

Nested classes/interfaces inherited from class org.bytedeco.javacpp.Pointer

Pointer.CustomDeallocator, Pointer.Deallocator, Pointer.NativeDeallocator, Pointer.ReferenceCounter

Field Summary

Fields inherited from class org.bytedeco.javacpp.Pointer

address, capacity, limit, position

Constructor Summary

Constructors

Constructor and Description
Split()
Split(long size) Native array allocator.
Split(Pointer p) Pointer cast constructor.

Method Summary

Modifier and Type	Method and Description
float	c() The threshold value in case of split on an ordered variable.
DTrees.Split	c(float setter)
boolean	inversed() If true, then the inverse split rule is used (i.e.
DTrees.Split	inversed(boolean setter)
int	next() Index of the next split in the list of splits for the node
DTrees.Split	next(int setter)
DTrees.Split	position(long position)
float	quality() The split quality, a positive number.
DTrees.Split	quality(float setter)
int	subsetOfs() Offset of the bitset used by the split on a categorical variable.
DTrees.Split	subsetOfs(int setter)
int	varIdx() Index of variable on which the split is created.
DTrees.Split	varIdx(int setter)

Methods inherited from class org.bytedeco.javacpp.Pointer

address, asBuffer, asByteBuffer, availablePhysicalBytes, calloc, capacity, capacity, close, deallocate, deallocate, deallocateReferences, deallocator, deallocator, equals, fill, formatBytes, free, hashCode, isNull, isNull, limit, limit, malloc, maxBytes, maxPhysicalBytes, memchr, memcmp, memcpy, memmove, memset, offsetof, parseBytes, physicalBytes, position, put, realloc, referenceCount, releaseReference, retainReference, setNull, sizeof, toString, totalBytes, totalPhysicalBytes, withDeallocator, zero

Methods inherited from class java.lang.Object

clone, finalize, getClass, notify, notifyAll, wait, wait, wait

Constructor Detail

Split

public Split(Pointer p)

Pointer cast constructor. Invokes Pointer.Pointer(Pointer).

Split

public Split(long size)

Native array allocator. Access with Pointer.position(long).

Split

public Split()

Method Detail

position

public DTrees.Split position(long position)

Overrides:

position in class Pointer

varIdx

public int varIdx()

Index of variable on which the split is created.

varIdx

public DTrees.Split varIdx(int setter)

inversed

@Cast(value="bool")
public boolean inversed()

If true, then the inverse split rule is used (i.e. left and right branches are exchanged in the rule expressions below).

inversed

public DTrees.Split inversed(boolean setter)

quality

public float quality()

The split quality, a positive number. It is used to choose the best split.

quality

public DTrees.Split quality(float setter)

next

public int next()

Index of the next split in the list of splits for the node

next

public DTrees.Split next(int setter)

c

public float c()

The threshold value in case of split on an ordered variable. The rule is:

 {.none}
                              if var_value < c
                                then next_node <- left
                                else next_node <- right
                              

c

public DTrees.Split c(float setter)

subsetOfs

public int subsetOfs()

Offset of the bitset used by the split on a categorical variable. The rule is:

 {.none}
                                    if bitset[var_value] == 1
                                        then next_node <- left
                                        else next_node <- right
                                    

subsetOfs

public DTrees.Split subsetOfs(int setter)