Struct CompositeKey 

pub struct CompositeKey { /* private fields */ }

A MergeIdentity over several fields, each addressed by a dotted path.

Use this when no single field identifies an element — for example an edge identified by both of its structured endpoints. Each field is a .-separated path walked through nested objects ("from.ecosystem" reads element["from"]["ecosystem"]); the resulting scalar tokens are combined into one injective composite identity. An element missing any field has no identity and is skipped (the typed schema step reports it); likewise a key built from an empty field list has no identity and never reports duplicates.

Implementations

impl CompositeKey

pub fn new<I, S>(fields: I) -> Self

where I: IntoIterator<Item = S>, S: Into<String>,

Identify array elements by the joined values of fields.

Each entry is a dotted path into the element ("to.module").

Trait Implementations

impl Clone for CompositeKey

fn clone(&self) -> CompositeKey

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for CompositeKey

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

Formats the value using the given formatter.

impl MergeIdentity for CompositeKey

fn label(&self) -> &str

Human-facing label for the identity, used in duplicate-error messages.

fn identity_of(&self, element: &Value) -> Option<String>

Extract the identity token of element, or None when the element lacks a complete identity (a missing/non-scalar field is a schema error surfaced by the typed deserialize step, so the merge layer simply skips it here).