Enum RankEdgeKind 

pub enum RankEdgeKind {
    Contains,
    MemberOf,
    ParticipatesIn,
    FlowReachesParticipant,
    Handles,
    HandledBy,
    Defines,
    DefinedBy,
}

A directed rank edge in the heterogeneous PageRank adjacency: which trusted predicates enter the rank graph and in which direction/with which weight. Distinct from ReferenceKind (the normalized reference surface — these edges are the RANK-edge ontology, never reference_kind doubling). Every edge traces to one trusted relationship; the reverse directions of contains/participates_in/ handles/defines are explicit RANKING TRANSITIONS — edges that exist only so container/flow/route/schema importance reaches its members/participants/handlers/definers — and are labeled as such, never as Reality Graph relationships.

Variants

Contains

Container → member: a kind earlier in [CONTAINMENT_HIERARCHY] (System/Subsystem/Service/Component/File) CONTAINS a kind later in it (Subsystem/Service/Component/File/Symbol) — membership evidence, weight 0.4.

MemberOf

RANKING TRANSITION (never a Reality Graph relationship): member → its container, so container importance is derived from the members’ aggregate (weight 0.8).

ParticipatesIn

Symbol PARTICIPATES_IN a Flow (weight 0.6).

FlowReachesParticipant

RANKING TRANSITION: Flow → its participant symbol, so flow importance reaches the participants — the mechanism that connects flow nodes into the rank graph (weight 1.2).

Handles

Symbol HANDLES a Route (invocation-strong, weight 1.5).

HandledBy

RANKING TRANSITION: Route → its handler symbol, so route importance reaches the handler — the reverse of Handles (weight 1.5).

Defines

Symbol DEFINES a Schema (weight 1.2).

DefinedBy

RANKING TRANSITION: Schema → its defining symbol, so schema importance reaches the definer — the reverse of Defines (weight 1.2).

Implementations

impl RankEdgeKind

pub fn reverse_ranking_transition(self) -> Option<RankEdgeKind>

The reverse ranking transition of this edge: Contains ↔ MemberOf, ParticipatesIn ↔ FlowReachesParticipant, Handles ↔ HandledBy, Defines ↔ DefinedBy. Every evidence edge has a ranking-only reverse — it propagates container/flow/ route/schema importance back to members/participants/handlers/ definers and NEVER claims a Reality Graph relationship.

pub fn weight(self) -> f64

Base weight of the rank edge (before provenance × confidence).

Trait Implementations

impl Clone for RankEdgeKind

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for RankEdgeKind

impl Debug for RankEdgeKind

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

Formats the value using the given formatter.

impl Eq for RankEdgeKind

impl PartialEq for RankEdgeKind

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for RankEdgeKind