Struct WaveletPacketTree 

pub struct WaveletPacketTree {
    pub max_level: usize,
    pub wavelet: Wavelet,
    pub signal_len: usize,
    /* private fields */
}

A full binary tree of wavelet packet nodes.

Nodes are stored in a HashMap keyed by (level, index). The tree is built by wpd and each interior node stores both the node’s own coefficients and its children (low/high subbands).

Fields

max_level: usize

Maximum decomposition depth.

wavelet: Wavelet

Wavelet used to build this tree.

signal_len: usize

Length of the original signal (needed for reconstruction).

Implementations

impl WaveletPacketTree

pub fn new(wavelet: Wavelet, max_level: usize, signal_len: usize) -> Self

Create an empty tree.

pub fn insert(&mut self, node: WaveletPacketNode)

Insert a node into the tree.

pub fn get(&self, level: usize, index: usize) -> Option<&WaveletPacketNode>

Retrieve a node by (level, index).

pub fn nodes_at_level( &self, level: usize, ) -> impl Iterator<Item = &WaveletPacketNode>

Iterate over all nodes at a given level.

pub fn all_nodes(&self) -> impl Iterator<Item = &WaveletPacketNode>

All nodes in the tree.

Trait Implementations

impl Clone for WaveletPacketTree

fn clone(&self) -> WaveletPacketTree

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for WaveletPacketTree

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

Formats the value using the given formatter.