Struct EdgeTransform 

pub struct EdgeTransform {
    pub edge_type: String,
    pub src: EndpointSpec,
    pub dst: EndpointSpec,
    pub properties: Vec<String>,
    pub rename: HashMap<String, String>,
    pub key: Vec<String>,
    pub replace: Option<bool>,
}

Rows → relationships. src.column/dst.column become the src/dst columns of the output batch; the properties columns ride along and the sink folds them into the relationship’s props (SET e += r.props). rename maps a source column to the relationship-property name it lands under, mirroring VertexTransform; the endpoint columns always become src/dst regardless of rename.

Fields

edge_type: String

src: EndpointSpec

dst: EndpointSpec

properties: Vec<String>

rename: HashMap<String, String>

Optional source-column → property-name remapping for the property columns (the endpoint columns are renamed to src/dst for free).

key: Vec<String>

Source columns that tell parallel edges apart: they join the relationship’s MERGE key (-[e:type {k: …}]->), so two rows with the same endpoints and different keys are two edges. Empty (the default) keeps one edge per (src, type, dst). A key column is written as a property too.

replace: Option<bool>

One edge of this type per source node: an upsert first deletes the source’s other outgoing edges of this type (see EdgeSet::replace_outgoing). Unset means: yes for an fk_edges step on an entity row — the table’s vertex step IS the edge’s source (label and id column) — no for a junction table and for an edge step (their rows are independent edges). Never with key.

Trait Implementations

impl Clone for EdgeTransform

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for EdgeTransform

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for EdgeTransform

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for EdgeTransform

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Transform for EdgeTransform

fn apply( &self, _ctx: &TableContext, batches: &[RecordBatch], ) -> Result<GraphMutation>

fn apply_deletes( &self, ctx: &TableContext, batches: &[RecordBatch], ) -> Result<GraphMutation>

The same step over a changelog round’s DELETE rows, whose nodes and edges are then removed. Such a row may carry only its key — every other column null — so a step that filters or computes on other columns must not let that drop the delete. The default is Self::apply, right for every step that only picks columns.