1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
// SPDX-License-Identifier: BUSL-1.1
//! Control-Plane implicit graph-edge extraction and lifecycle.
//!
//! A schemaless document carrying the reserved `_from` / `_to` (and optional
//! `_type` / `weight`) fields is mirrored as a graph edge so `MATCH ...` and
//! `GRAPH ALGO ...` see edges inserted via plain document `INSERT`. The
//! mirrored edge is maintained as a transactionally-consistent secondary index
//! in the SAME distributed (Calvin) transaction as the document write.
//!
//! This extraction runs on the Control Plane — BEFORE dispatch classification —
//! so an implicit edge routes through the SAME path as an explicit
//! `GRAPH INSERT EDGE` (`GraphOp::EdgePut`): single-home Raft dispatch when src
//! and dst share a home vShard, Calvin dual-home when they straddle a shard
//! boundary. Resolving each endpoint's home vShard and canonical surrogate here
//! makes implicit edges identical to explicit ones.
//!
//! # Plane discipline
//!
//! Runs on the coordinator's Control Plane (Tokio). `assign_surrogate_routed`
//! performs Control-Plane RPC I/O only — no storage I/O, no io_uring, no
//! Data-Plane access from this module.
pub use mark_collection_edge_bearing;
pub use append_implicit_edge_delete_tasks;
pub use append_implicit_edge_tasks;
pub use ;