Expand description
Tree node data structures and compact representations
This module contains various tree node representations including compact, bit-packed, and shared node structures for memory efficiency and optimization.
Structsยง
- BitPacked
Path - Bit-packed decision path for ultra-compact storage
- BitPacked
Tree - Ultra-compact tree using bit-packed decision paths
- Compact
Ensemble - Memory-efficient ensemble representation
- Compact
Tree - Compact tree representation for memory efficiency
- Compact
Tree Node - Compact tree node representation for memory efficiency
- Custom
Split - Custom split information for tree nodes
- Node
Priority - Priority wrapper for nodes in the queue
- Ordered
Float - Wrapper for f64 to make it hashable and orderable
- Shared
Subtree Manager - Shared subtree manager for memory optimization
- Shared
Tree Ensemble - Ensemble of trees with shared subtree optimization
- Shared
Tree Node - A shared tree node that can be referenced by multiple trees
- Subtree
Config - Configuration for shared subtree optimization
- Subtree
Pattern - Subtree pattern for identifying reusable subtrees
- Subtree
Reference - Reference to a shared subtree in a tree ensemble
- Subtree
Sharing Stats - Statistics about subtree sharing efficiency
- Surrogate
Split - Surrogate split information for handling missing values
- Tree
Node - Tree node for building algorithms
- Tree
Specific Data - Tree-specific data that cannot be shared