Enum TraversalPattern 

pub enum TraversalPattern {
    Unknown,
    Linear,
    Branching,
}

Traversal pattern classification.

Represents the detected traversal pattern based on observed node degrees. This classification determines whether sequential I/O optimization should be applied.

Variants

• Unknown: Not enough data to classify (0-2 observations, or degree 0 encountered)
• Linear: Confirmed linear pattern (3+ consecutive degree-1 steps)
• Branching: Branching detected (degree > 1 at any point)

Example

use crate::backend::native::adjacency::{LinearDetector, TraversalPattern};

let mut detector = LinearDetector::new();

// First observation: degree 1
assert_eq!(detector.observe(1, 1), TraversalPattern::Unknown);

// Second observation: degree 1
assert_eq!(detector.observe(2, 1), TraversalPattern::Unknown);

// Third observation: degree 1 - threshold reached!
assert_eq!(detector.observe(3, 1), TraversalPattern::Linear);

// Fourth observation: degree 2 - branching detected
assert_eq!(detector.observe(4, 2), TraversalPattern::Branching);

Variants

Unknown

Not enough data to classify pattern

Linear

Confirmed linear: 3+ consecutive degree-1 steps

Branching

Branching detected: degree > 1 at any point

Trait Implementations

impl Clone for TraversalPattern

fn clone(&self) -> TraversalPattern

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for TraversalPattern

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

Formats the value using the given formatter.

impl PartialEq for TraversalPattern

fn eq(&self, other: &TraversalPattern) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for TraversalPattern

impl Eq for TraversalPattern

impl StructuralPartialEq for TraversalPattern