Enum GraphError 

#[non_exhaustive]
pub enum GraphError {
    UnknownNode {
        id: u32,
    },
    UnknownVariableName {
        name: String,
    },
    Cycle {
        from: u32,
        to: u32,
    },
    InvalidEndpoints {
        message: &'static str,
    },
    ContemporaneousSelfEdge {
        variable: VariableId,
    },
    DuplicateEdge {
        from: u32,
        to: u32,
    },
    InvalidLag {
        lag: Lag,
    },
    FutureToPast {
        from: u32,
        to: u32,
        from_lag: Lag,
        to_lag: Lag,
    },
    TooManyNodes,
    InvalidSelectionDiagram {
        message: String,
    },
    SearchBudgetExhausted {
        max_paths: usize,
        max_len: usize,
    },
}

Graph-layer errors.

Variants (Non-exhaustive)

Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.

UnknownNode

Unknown dense node.

Fields

id: u32

Dense id.

UnknownVariableName

Unknown variable name at an API boundary.

Fields

name: String

Requested name.

Cycle

Edge would introduce a directed cycle.

Fields

from: u32

Source dense id.

to: u32

Target dense id.

InvalidEndpoints

Invalid endpoint combination for this graph class.

Fields

message: &'static str

Explanation.

ContemporaneousSelfEdge

Contemporaneous self-edge is invalid.

Fields

variable: VariableId

Variable.

DuplicateEdge

Duplicate edge.

Fields

from: u32

From.

to: u32

To.

InvalidLag

Lagged self-edge with lag 0.

Fields

lag: Lag

Lag value.

FutureToPast

Edge points from the future into the past (source lag nearer the present than target lag).

Fields

from: u32

Source dense id.

to: u32

Target dense id.

from_lag: Lag

Source lag.

to_lag: Lag

Target lag.

TooManyNodes

Node capacity exceeded.

InvalidSelectionDiagram

Invalid selection-diagram metadata.

Fields

message: String

Explanation.

SearchBudgetExhausted

Bounded path search hit max_paths or max_len before exploring all candidates.

Returned when m-separation would otherwise conclude “separated” after an incomplete search (an unexplored active path may still exist). Finding an active path remains conclusive even under truncation.

Fields

max_paths: usize

Path-count budget.

max_len: usize

Path-length budget.

Trait Implementations

impl Clone for GraphError

fn clone(&self) -> GraphError

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GraphError

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

Formats the value using the given formatter.

impl Display for GraphError

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

Formats the value using the given formatter.

impl Eq for GraphError

impl Error for GraphError

fn source(&self) -> Option<&(dyn Error + 'static)>

Returns the lower-level source of this error, if any.

fn description(&self) -> &str

👎Deprecated since 1.42.0:

use the Display impl or to_string()

fn cause(&self) -> Option<&dyn Error>

👎Deprecated since 1.33.0:

replaced by Error::source, which can support downcasting

fn provide<'a>(&'a self, request: &mut Request<'a>)

🔬This is a nightly-only experimental API. (error_generic_member_access)

Provides type-based access to context intended for error reports.

impl PartialEq for GraphError

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for GraphError