Struct ChangeSet 

pub struct ChangeSet {
    pub vertices_added: Vec<VertexId>,
    pub vertices_removed: Vec<VertexId>,
    pub vertices_moved: Vec<VertexId>,
    pub triangles_added: Vec<TriangleId>,
    pub triangles_removed: Vec<TriangleId>,
    pub triangles_changed: Vec<TriangleId>,
    pub channels: Vec<(String, Vec<VertexId>)>,
    pub channels_toggled: Vec<String>,
}

What an edit, undo or redo changed. All lists are sorted and free of duplicates.

Fields

vertices_added: Vec<VertexId>

vertices_removed: Vec<VertexId>

vertices_moved: Vec<VertexId>

Existing vertices whose position changed. In a set produced by ChangeSet::merge, such a vertex may also have changed values in any channel, so treat it as dirty for all channels.

triangles_added: Vec<TriangleId>

triangles_removed: Vec<TriangleId>

triangles_changed: Vec<TriangleId>

Existing triangles whose vertex ids changed.

channels: Vec<(String, Vec<VertexId>)>

Source channels written for existing vertices: (channel name, vertex ids).

channels_toggled: Vec<String>

Channels that went away or came back whole (a crate::Transaction::drop_channel, its undo or redo), sorted by name: read Mesh::channel for where they stand now. Their values are not listed in ChangeSet::channels.

Implementations

impl ChangeSet

pub fn topology_changed(&self) -> bool

True when triangles were added, removed or rewritten.

pub fn is_empty(&self) -> bool

pub fn merge(&mut self, later: &ChangeSet)

Folds later, the change set of an edit (or undo or redo) made after self, into self, so that self describes the net effect of both. Per slot:

• added, then removed: reported as neither;
• removed, then added again (slot reuse): reported as moved (vertex) or changed (triangle), because the slot was alive before and is alive after;
• moved and changed are unions, minus slots that end up added or removed;
• channel lists are unioned per channel name, minus vertices that end up added or removed. A reused (removed, then added) vertex is added to every channel list named in either input, because its slot got brand-new contents. Names are kept even when their list ends up empty.

A slot that was written and then restored to its original value stays in the moved, changed and channel lists; the lists are supersets of the real differences. All lists stay sorted, duplicate-free and disjoint.

In a merged set, a vertex in vertices_moved may have changed values in any channel (a reused slot may differ in channels no input named), so consumers must treat it as dirty for all channels.

Both sets must satisfy the ChangeSet invariants: every list sorted and duplicate-free, added, removed and moved/changed disjoint, and channel lists free of added and removed vertices. Sets returned by this crate do.

Trait Implementations

impl Clone for ChangeSet

fn clone(&self) -> ChangeSet

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ChangeSet

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

Formats the value using the given formatter.

impl Default for ChangeSet

fn default() -> ChangeSet

Returns the “default value” for a type.

impl Eq for ChangeSet

impl PartialEq for ChangeSet

fn eq(&self, other: &ChangeSet) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for ChangeSet