Struct TraverseLimits 

pub struct TraverseLimits {
    pub result_limit: NonZeroUsize,
    pub max_depth: Option<NonZeroU32>,
}

Limits for a single traverse query (result cap and optional hop bound).

Semantics

• result_limit: maximum nodes returned or counted; each seed counts toward the cap.
• max_depth: when Some(d), discovers all nodes within d hops of a seed (boundary nodes are counted but not enqueued past the depth cap). When None, expansion is unbounded by depth (still capped by result_limit).

Fields

result_limit: NonZeroUsize

Maximum nodes returned (each seed counts toward the cap).

max_depth: Option<NonZeroU32>

None = unlimited hops; Some(d) discovers nodes within d hops of a seed.

Implementations

impl TraverseLimits

pub const fn bounded(result_limit: NonZeroUsize) -> Self

Creates limits with only a result cap.

Performance

This method is O(1).

pub fn capped_by(self, config: &Config) -> Result<Self, PostgresGraphError>

Applies configured traverse cap from config.

Errors

Returns PostgresGraphError::Query when the capped limit is zero.

Performance

This method is O(1).

Trait Implementations

impl Clone for TraverseLimits

fn clone(&self) -> TraverseLimits

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for TraverseLimits

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

Formats the value using the given formatter.

impl PartialEq for TraverseLimits

fn eq(&self, other: &TraverseLimits) -> 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 TraverseLimits

impl Eq for TraverseLimits

impl StructuralPartialEq for TraverseLimits