GBDTModel

Struct GBDTModel 

Source
pub struct GBDTModel { /* private fields */ }
Expand description

Trained GBDT model

Implementations§

Source§

impl GBDTModel

Source

pub fn train( features: &[f32], num_features: usize, targets: &[f32], config: GBDTConfig, feature_names: Option<Vec<String>>, ) -> Result<Self>

Train a GBDT model from raw feature data (high-level API)

This is the primary training API that handles binning automatically. Features are discretized using T-Digest quantile binning with parallelization.

§Arguments
  • features - Row-major feature matrix: features[row * num_features + feature] Shape: (num_rows, num_features) flattened to 1D
  • num_features - Number of features (columns)
  • targets - Target values, one per row
  • config - Training configuration
  • feature_names - Optional feature names (defaults to “feature_0”, “feature_1”, …)
§Example
let features = vec![1.0, 2.0, 3.0, 4.0, 5.0, 6.0]; // 2 rows × 3 features
let targets = vec![0.5, 1.5];
let config = GBDTConfig::new().with_num_rounds(100);
let model = GBDTModel::train(&features, 3, &targets, config, None)?;
Source

pub fn train_with_output( features: &[f32], num_features: usize, targets: &[f32], config: GBDTConfig, feature_names: Option<Vec<String>>, output_dir: impl AsRef<Path>, formats: &[ModelFormat], ) -> Result<Self>

Train a GBDT model and save to output directory

This is a convenience method that trains a model and automatically saves:

  • The trained model in the specified format(s)
  • config.json with the training configuration for reproducibility
§Arguments
  • features - Row-major feature matrix: features[row * num_features + feature]
  • num_features - Number of features (columns)
  • targets - Target values, one per row
  • config - Training configuration
  • feature_names - Optional feature names
  • output_dir - Directory to save the model and config
  • formats - Model formats to save (e.g., [ModelFormat::Rkyv])
§Example
let features = vec![1.0, 2.0, 3.0, 4.0, 5.0, 6.0]; // 2 rows × 3 features
let targets = vec![0.5, 1.5];
let config = GBDTConfig::new().with_num_rounds(100);

let model = GBDTModel::train_with_output(
    &features, 3, &targets, config, None,
    "output/my_model",
    &[ModelFormat::Rkyv],
)?;
// Creates: output/my_model/model.rkyv and output/my_model/config.json
Source

pub fn save_to_directory( &self, output_dir: impl AsRef<Path>, config: &GBDTConfig, formats: &[ModelFormat], ) -> Result<()>

Save a trained model to a directory

Creates the directory if it doesn’t exist and saves:

  • The model in each specified format
  • config.json with the training configuration
§Arguments
  • output_dir - Directory to save the model
  • config - Training configuration (for config.json)
  • formats - Model formats to save (must not be empty)
§Errors

Returns an error if formats is empty or if I/O operations fail.

Source

pub fn train_with_eras( features: &[f32], num_features: usize, targets: &[f32], era_indices: &[u16], config: GBDTConfig, feature_names: Option<Vec<String>>, ) -> Result<Self>

Train a GBDT model with Directional Era Splitting (DES)

Era splitting filters out spurious correlations by requiring all eras to agree on split direction. This is useful for time-series or financial data where patterns may not generalize across time periods.

§Arguments
  • features - Row-major feature matrix: features[row * num_features + feature]
  • num_features - Number of features (columns)
  • targets - Target values, one per row
  • era_indices - Era index (0-based) for each row
  • config - Training configuration (era_splitting must be enabled)
  • feature_names - Optional feature names
§Example
let features = vec![1.0, 2.0, 3.0, 4.0, 5.0, 6.0]; // 2 rows × 3 features
let targets = vec![0.5, 1.5];
let era_indices = vec![0, 1]; // Row 0 in era 0, row 1 in era 1
let config = GBDTConfig::new()
    .with_num_rounds(100)
    .with_era_splitting(true);
let model = GBDTModel::train_with_eras(&features, 3, &targets, &era_indices, config, None)?;
Source

pub fn train_binned(dataset: &BinnedDataset, config: GBDTConfig) -> Result<Self>

Train a GBDT model from pre-binned data (low-level API)

Use this when you have already binned your data (e.g., for repeated training with different hyperparameters on the same binned dataset).

For most use cases, prefer train() which handles binning automatically.

Source

pub fn train_binned_with_validation( train_dataset: &BinnedDataset, val_dataset: &BinnedDataset, val_targets: &[f32], config: GBDTConfig, ) -> Result<Self>

Train a GBDT model with an external validation set for early stopping

Use this when you have a separate validation set that was properly prepared (e.g., encoded separately to avoid target leakage). The external validation set is used for early stopping decisions while training uses the full train set.

§Note on Implementation

This method shares ~90% of logic with train_binned(). The duplication is intentional due to the complexity of the training loop (CUDA/WGPU backends, fused gradient paths, GOSS sampling). Extracting shared logic would require significant refactoring and testing to maintain correctness.

Key differences from train_binned():

  • Uses external validation set instead of internal split
  • Maintains separate validation predictions array
  • No calibration set for conformal prediction
Source

pub fn predict_row(&self, dataset: &BinnedDataset, row_idx: usize) -> f32

Predict for a single row

Source

pub fn predict(&self, dataset: &BinnedDataset) -> Vec<f32>

Predict for all rows using tree-wise batch prediction

This approach traverses one tree for ALL rows before moving to the next tree, which is more cache-friendly than row-wise traversal.

Routes to parallel or sequential based on config.parallel_prediction

Source

pub fn predict_sequential(&self, dataset: &BinnedDataset) -> Vec<f32>

Single-threaded tree-wise batch prediction

Traverses each tree for all rows before moving to the next tree. More cache-friendly than row-wise traversal.

Source

pub fn predict_parallel(&self, dataset: &BinnedDataset) -> Vec<f32>

Parallel tree-wise batch prediction

Splits rows into chunks and processes each chunk in parallel. Each chunk uses tree-wise traversal internally.

Source

pub fn predict_with_intervals( &self, dataset: &BinnedDataset, ) -> (Vec<f32>, Vec<f32>, Vec<f32>)

Predict with conformal intervals

Returns (predictions, lower_bounds, upper_bounds)

Source

pub fn predict_proba(&self, dataset: &BinnedDataset) -> Vec<f32>

Predict class probabilities for binary classification

Applies sigmoid to raw predictions to get probabilities in [0, 1]. Only meaningful when trained with with_binary_logloss().

§Returns

Vector of probabilities (probability of class 1)

Source

pub fn predict_class(&self, dataset: &BinnedDataset, threshold: f32) -> Vec<u32>

Predict class labels for binary classification

Applies sigmoid to raw predictions and thresholds at 0.5 (or custom threshold). Only meaningful when trained with with_binary_logloss().

§Arguments
  • dataset - The binned dataset to predict on
  • threshold - Classification threshold (default 0.5)
§Returns

Vector of class labels (0 or 1)

Source

pub fn is_multiclass(&self) -> bool

Check if this is a multi-class model

Source

pub fn get_num_classes(&self) -> usize

Get number of classes (0 for regression/binary)

Source

pub fn predict_proba_multiclass(&self, dataset: &BinnedDataset) -> Vec<Vec<f32>>

Predict class probabilities for multi-class classification

Applies softmax to raw predictions to get probabilities for each class. Only meaningful when trained with with_multiclass_logloss().

§Returns

Vector of probability vectors: result[sample][class]

Source

pub fn predict_class_multiclass(&self, dataset: &BinnedDataset) -> Vec<u32>

Predict class labels for multi-class classification

Returns the class with highest probability (argmax of softmax). Only meaningful when trained with with_multiclass_logloss().

§Returns

Vector of class labels (0, 1, 2, …, K-1)

Source

pub fn predict_raw_multiclass(&self, dataset: &BinnedDataset) -> Vec<Vec<f32>>

Predict raw scores for multi-class classification (before softmax)

Returns raw predictions for each class (not probabilities). Shape: result[sample][class]

Source

pub fn predict_raw(&self, features: &[f64]) -> Vec<f32>

Predict using raw feature values (no binning needed)

This is the primary prediction method for external use (e.g., Python bindings). Uses the split_value stored in tree nodes to compare directly against raw values, avoiding the overhead of binning on every prediction call.

§Arguments
  • features - Row-major feature matrix: features[row * num_features + feature] Shape: (num_rows, num_features)
§Returns

Vector of predictions for each row

Source

pub fn predict_raw_with_intervals( &self, features: &[f64], ) -> (Vec<f32>, Vec<f32>, Vec<f32>)

Predict raw with conformal intervals

Returns (predictions, lower_bounds, upper_bounds)

Source

pub fn predict_proba_raw(&self, features: &[f64]) -> Vec<f32>

Predict class probabilities from raw features (for binary classification)

Applies sigmoid to raw predictions to get probabilities in [0, 1]. Only meaningful when trained with with_binary_logloss().

Source

pub fn predict_class_raw(&self, features: &[f64], threshold: f32) -> Vec<u32>

Predict class labels from raw features (for binary classification)

Applies sigmoid to raw predictions and thresholds. Only meaningful when trained with with_binary_logloss().

Source

pub fn predict_proba_multiclass_raw(&self, features: &[f64]) -> Vec<Vec<f32>>

Predict class probabilities from raw features (for multi-class classification)

Uses the split_value stored in tree nodes to compare directly against raw values. Applies softmax to raw predictions to get probabilities for each class. Only meaningful when trained with with_multiclass_logloss().

§Arguments
  • features - Row-major feature matrix: features[row * num_features + feature]
§Returns

Vector of probability vectors: result[sample][class]

Source

pub fn predict_class_multiclass_raw(&self, features: &[f64]) -> Vec<u32>

Predict class labels from raw features (for multi-class classification)

Returns the class with highest probability (argmax of softmax). Only meaningful when trained with with_multiclass_logloss().

§Arguments
  • features - Row-major feature matrix: features[row * num_features + feature]
§Returns

Vector of class labels (0, 1, 2, …, K-1)

Source

pub fn predict_raw_multiclass_raw(&self, features: &[f64]) -> Vec<Vec<f32>>

Predict raw scores from raw features (for multi-class, before softmax)

Returns raw predictions for each class (not probabilities).

§Arguments
  • features - Row-major feature matrix: features[row * num_features + feature]
§Returns

Vector of raw score vectors: result[sample][class]

Source

pub fn num_trees(&self) -> usize

Get number of trees

Source

pub fn config(&self) -> &GBDTConfig

Get configuration

Source

pub fn base_prediction(&self) -> f32

Get base prediction

Source

pub fn conformal_quantile(&self) -> Option<f32>

Get conformal quantile (if calibrated)

Source

pub fn trees(&self) -> &[Tree]

Get trees

Source

pub fn feature_info(&self) -> &[FeatureInfo]

Get feature info (for consistent binning during prediction)

Source

pub fn num_features(&self) -> usize

Get number of features

Source

pub fn column_permutation(&self) -> Option<&ColumnPermutation>

Get column permutation (if optimized layout was applied)

Source

pub fn feature_importance(&self) -> Vec<f32>

Compute feature importance (gain-based)

Source

pub fn optimize_dataset_layout( &self, dataset: &BinnedDataset, ) -> (BinnedDataset, ColumnPermutation)

Create a cache-optimized dataset by reordering columns based on feature importance

More frequently used features are placed at the beginning of the dataset for better CPU cache locality during tree traversal.

Returns the reordered dataset and the permutation mapping (new_idx -> original_idx)

Source

pub fn create_packed_dataset(&self, dataset: &BinnedDataset) -> PackedDataset

Create a memory-optimized packed dataset from a BinnedDataset

Uses 4-bit packing for features with ≤16 unique bins, providing up to 50% memory savings for low-cardinality features.

Source

pub fn num_rounds(&self) -> usize

Get number of completed rounds

For regression/binary: num_rounds == num_trees For multi-class: num_rounds = num_trees / num_classes

Source

pub fn append_trees(&mut self, new_trees: Vec<Tree>)

Append new trees to the ensemble (incremental learning)

§Arguments
  • new_trees - Trees trained on residuals from current ensemble
§Multi-class Note

For multi-class classification, trees must be provided in round-major order: [round_n_class_0, round_n_class_1, ..., round_n_class_k, round_n+1_class_0, ...]

§Example
// Get current predictions
let preds = model.predict(&dataset);

// Compute residuals (new_targets - preds)
let residuals: Vec<f32> = targets.iter().zip(&preds)
    .map(|(t, p)| t - p).collect();

// Compute gradients/hessians for new trees
// ... train new trees on residuals ...

// Append to model
model.append_trees(new_trees);
Source

pub fn append_tree(&mut self, tree: Tree)

Append a single tree to the ensemble

Convenience method for adding one tree at a time.

Source

pub fn compute_residuals( &self, dataset: &BinnedDataset, targets: &[f32], ) -> Vec<f32>

Compute residuals from current ensemble predictions

Residuals are target - prediction, which become the training targets for new trees in incremental learning.

§Arguments
  • dataset - Binned dataset for prediction
  • targets - Original target values
§Returns

Residuals (target - prediction) for each sample

Source

pub fn compute_residuals_raw( &self, features: &[f64], targets: &[f32], ) -> Vec<f32>

Compute residuals from raw feature data

§Arguments
  • features - Row-major feature matrix (f64 for raw prediction API)
  • targets - Original target values
§Returns

Residuals (target - prediction) for each sample

Source

pub fn is_compatible_for_update(&self, num_features: usize) -> bool

Check if incremental update is compatible

Verifies that new data has the same number of features as the trained model.

Source

pub fn trees_mut(&mut self) -> &mut Vec<Tree>

Get mutable reference to trees (for advanced manipulation)

Use with caution - modifying trees directly may break model invariants.

Source

pub fn truncate_to_rounds(&mut self, num_rounds: usize)

Truncate trees to a specific number of rounds

Useful for early stopping or reducing model complexity.

§Arguments
  • num_rounds - Number of rounds to keep
§Multi-class Note

Truncates to num_rounds * num_classes trees for multi-class models.

Trait Implementations§

Source§

impl Archive for GBDTModel

Source§

const COPY_OPTIMIZATION: CopyOptimization<Self>

An optimization flag that allows the bytes of this type to be copied directly to a writer instead of calling serialize. Read more
Source§

type Archived = ArchivedGBDTModel

The archived representation of this type. Read more
Source§

type Resolver = GBDTModelResolver

The resolver for this type. It must contain all the additional information from serializing needed to make the archived type from the normal type.
Source§

fn resolve(&self, resolver: Self::Resolver, out: Place<Self::Archived>)

Creates the archived version of this value at the given position and writes it to the given output. Read more
Source§

impl Clone for GBDTModel

Source§

fn clone(&self) -> GBDTModel

Returns a duplicate of the value. Read more
1.0.0 · Source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
Source§

impl Debug for GBDTModel

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
Source§

impl<'de> Deserialize<'de> for GBDTModel

Source§

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>
where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer. Read more
Source§

impl<__D: Fallible + ?Sized> Deserialize<GBDTModel, __D> for Archived<GBDTModel>

Source§

fn deserialize( &self, deserializer: &mut __D, ) -> Result<GBDTModel, <__D as Fallible>::Error>

Deserializes using the given deserializer
Source§

impl<__S: Fallible + ?Sized> Serialize<__S> for GBDTModel

Source§

fn serialize( &self, serializer: &mut __S, ) -> Result<<Self as Archive>::Resolver, <__S as Fallible>::Error>

Writes the dependencies for the object and returns a resolver that can create the archived type.
Source§

impl Serialize for GBDTModel

Source§

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>
where __S: Serializer,

Serialize this value into the given Serde serializer. Read more
Source§

impl TunableModel for GBDTModel

Source§

type Config = GBDTConfig

Configuration type for this model
Source§

fn train(dataset: &BinnedDataset, config: &Self::Config) -> Result<Self>

Train a model on the given dataset with the given configuration
Source§

fn train_with_validation( train_data: &BinnedDataset, val_data: &BinnedDataset, val_targets: &[f32], config: &Self::Config, ) -> Result<Self>

Train a model with explicit validation set for early stopping Read more
Source§

fn predict(&self, dataset: &BinnedDataset) -> Vec<f32>

Predict on a dataset
Source§

fn num_trees(&self) -> usize

Get the number of trees/boosters in the trained model
Source§

fn apply_params(config: &mut Self::Config, params: &HashMap<String, ParamValue>)

Apply parameter values to a configuration Read more
Source§

fn valid_params() -> &'static [&'static str]

Get the list of valid parameter names for this model type
Source§

fn default_config() -> Self::Config

Create a default configuration
Source§

fn is_gpu_config(config: &Self::Config) -> bool

Check if the configuration uses GPU backend Read more
Source§

fn get_learning_rate(config: &Self::Config) -> f32

Get learning rate from configuration Read more
Source§

fn configure_validation( config: &mut Self::Config, validation_ratio: f32, early_stopping_rounds: usize, )

Configure validation settings for early stopping Read more
Source§

fn set_num_rounds(config: &mut Self::Config, num_rounds: usize)

Configure number of training rounds
Source§

fn save_rkyv(&self, path: &Path) -> Result<()>

Save the model to a file in rkyv format Read more
Source§

fn save_bincode(&self, path: &Path) -> Result<()>

Save the model to a file in bincode format Read more
Source§

fn supports_conformal() -> bool

Check if this model type supports conformal prediction Read more
Source§

fn conformal_quantile(&self) -> Option<f32>

Get the conformal quantile from a trained model Read more
Source§

fn configure_conformal( config: &mut Self::Config, calibration_ratio: f32, quantile: f32, )

Configure conformal prediction settings in the model config Read more

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> ArchivePointee for T

Source§

type ArchivedMetadata = ()

The archived version of the pointer metadata for this type.
Source§

fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata

Converts some archived metadata to the pointer metadata for itself.
Source§

impl<T> ArchiveUnsized for T
where T: Archive,

Source§

type Archived = <T as Archive>::Archived

The archived counterpart of this type. Unlike Archive, it may be unsized. Read more
Source§

fn archived_metadata( &self, ) -> <<T as ArchiveUnsized>::Archived as ArchivePointee>::ArchivedMetadata

Creates the archived version of the metadata for this value.
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> DynClone for T
where T: Clone,

Source§

fn __clone_box(&self, _: Private) -> *mut ()

Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T> Instrument for T

Source§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
Source§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

impl<T> Key for T
where T: Clone,

Source§

fn align() -> usize

The alignment necessary for the key. Must return a power of two.
Source§

fn size(&self) -> usize

The size of the key in bytes.
Source§

unsafe fn init(&self, ptr: *mut u8)

Initialize the key in the given memory location. Read more
Source§

unsafe fn get<'a>(ptr: *const u8) -> &'a T

Get a reference to the key from the given memory location. Read more
Source§

unsafe fn drop_in_place(ptr: *mut u8)

Drop the key in place. Read more
Source§

impl<T> LayoutRaw for T

Source§

fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>

Returns the layout of the type.
Source§

impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
where T: SharedNiching<N1, N2>, N1: Niching<T>, N2: Niching<T>,

Source§

unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool

Returns whether the given value has been niched. Read more
Source§

fn resolve_niched(out: Place<NichedOption<T, N1>>)

Writes data to out indicating that a T is niched.
Source§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> Pointee for T

Source§

type Metadata = ()

The metadata type for pointers and references to this type.
Source§

impl<T> PolicyExt for T
where T: ?Sized,

Source§

fn and<P, B, E>(self, other: P) -> And<T, P>
where T: Policy<B, E>, P: Policy<B, E>,

Create a new Policy that returns Action::Follow only if self and other return Action::Follow. Read more
Source§

fn or<P, B, E>(self, other: P) -> Or<T, P>
where T: Policy<B, E>, P: Policy<B, E>,

Create a new Policy that returns Action::Follow if either self or other returns Action::Follow. Read more
Source§

impl<T, S> SerializeUnsized<S> for T
where T: Serialize<S>, S: Fallible + Writer + ?Sized,

Source§

fn serialize_unsized( &self, serializer: &mut S, ) -> Result<usize, <S as Fallible>::Error>

Writes the object and returns the position of the archived type.
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V

Source§

impl<T> WithSubscriber for T

Source§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
Source§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more
Source§

impl<T> DeserializeOwned for T
where T: for<'de> Deserialize<'de>,

Source§

impl<T> PlanCallbackArgs for T

Source§

impl<T> PlanCallbackOut for T