Struct EdgeBase 

pub struct EdgeBase<N = Uuid> {
    pub source: N,
    pub target: N,
    pub created_at: DateTime<Utc>,
    pub archived_at: Option<DateTime<Utc>>,
}

Common edge data: endpoints plus creation / archival timestamps, generic over the node identity type N.

Per-kind edge structs embed this and add their own kind-specific fields. Concrete kinds live in domain crates (kanban-domain holds SpawnsEdge / BlocksEdge / RelatesEdge, all keyed on Uuid); external crates can define their own structs the same way and pick any node identity that satisfies the Edge::NodeId bounds.

Directionality is not on EdgeBase: it’s encoded by the sub-graph type the edge lives in. DagGraph carries directed edges, UndirectedGraph carries undirected edges.

Fields

source: N

target: N

created_at: DateTime<Utc>

archived_at: Option<DateTime<Utc>>

Implementations

impl<N> EdgeBase<N>

pub fn new(source: N, target: N) -> Self

Trait Implementations

impl<N: Clone> Clone for EdgeBase<N>

fn clone(&self) -> EdgeBase<N>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<N: Debug> Debug for EdgeBase<N>

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

Formats the value using the given formatter.

impl<'de, N> Deserialize<'de> for EdgeBase<N>

where N: Deserialize<'de>,

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<N> Edge for EdgeBase<N>

where N: Copy + Eq + Hash,

type NodeId = N

Node identity type for both endpoints. Copy + Eq + Hash is what the algorithms need (cycle / reachability work over HashMap<NodeId, Vec<NodeId>>).

fn source(&self) -> N

fn target(&self) -> N

fn created_at(&self) -> DateTime<Utc>

fn archived_at(&self) -> Option<DateTime<Utc>>

fn archive(&mut self)

fn unarchive(&mut self)

fn from_endpoints(source: N, target: N) -> Self

Construct an edge from just its endpoints, filling per-kind metadata with defaults. Lets the generic Graph::add_edge / UndirectedGraph::add_edge trait methods work uniformly across edge kinds without taking kind-specific parameters. Kind-specific code that wants to set metadata explicitly constructs the concrete struct directly (e.g. BlocksEdge::new(blocker, blocked, Severity::High)) and pushes it via add_edge_with_metadata.

fn is_active(&self) -> bool

fn is_archived(&self) -> bool

fn involves(&self, node: Self::NodeId) -> bool

impl<N: PartialEq> PartialEq for EdgeBase<N>

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

where N: Serialize,

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<N> StructuralPartialEq for EdgeBase<N>