Struct Resolution 

pub struct Resolution {
    pub roots: HashMap<String, RootInfo>,
    pub gap_filled: Vec<Clip>,
    pub bridges: Vec<(String, String)>,
}

The outcome of resolve_roots: a root for every input clip, plus the ancestor clips fetched to bridge gaps.

gap_filled is kept structurally separate from roots on purpose. Those ancestors (often trashed) exist only so lineage could be walked; a later phase persists them to the graph store so a trashed ancestor is archived before Suno’s purge, but they must never be treated as download candidates.

Fields

roots: HashMap<String, RootInfo>

The resolved root for every clip passed to resolve_roots, keyed by clip id.

gap_filled: Vec<Clip>

Ancestor clips fetched during gap-fill, sorted by id. Not download candidates: they were pulled solely to complete the lineage walk.

bridges: Vec<(String, String)>

Parent links discovered via the parent endpoint (get_clip_parent) as (child_id, parent_id), sorted. The child is a bridged id that may have no clip of its own, so it is persisted as an archived edge (never a download candidate) to keep the parent-endpoint hop durable.

Trait Implementations

impl Clone for Resolution

fn clone(&self) -> Resolution

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Resolution

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

Formats the value using the given formatter.

impl PartialEq for Resolution

fn eq(&self, other: &Resolution) -> 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 StructuralPartialEq for Resolution