Struct RankedNode 

pub struct RankedNode {
    pub node: IndexedNode,
    pub reasons: Vec<String>,
    pub reason_codes: Vec<RankedReasonCode>,
    pub connection_counts: Vec<RankedConnectionCount>,
    pub connections: Vec<RankedConnection>,
    pub connections_truncated: bool,
    pub next_call: NavigationNextCall,
}

A ranked node with concise evidence for why it was selected.

Fields

node: IndexedNode

Selected indexed node.

reasons: Vec<String>

Bounded human-readable ranking signals.

reason_codes: Vec<RankedReasonCode>

Bounded stable ranking signals for programmatic consumers.

connection_counts: Vec<RankedConnectionCount>

Sparse stable-order connection counts.

connections: Vec<RankedConnection>

Bounded high-value current connection sample.

connections_truncated: bool

Whether the bounded sample omitted any validated relation through family or global overflow.

next_call: NavigationNextCall

Existing navigation capability recommended after this row.

Trait Implementations

impl Clone for RankedNode

fn clone(&self) -> RankedNode

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for RankedNode

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for RankedNode

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for RankedNode

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

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Eq for RankedNode

impl StructuralPartialEq for RankedNode