Struct Compaction 

pub struct Compaction {
    pub geometry: Geometry,
    pub points: Vec<usize>,
    pub cells: Vec<usize>,
    pub dropped_points: usize,
    pub dropped_cells: usize,
}

A geometry with its undefined nodes removed, and the maps to follow it.

The maps are in merged order - the order Geometry::merged and Geometry::cell_count produce, patch after patch - because that is the order an attribute’s values are in.

Fields

geometry: Geometry

The geometry, with undefined nodes and everything touching them gone.

points: Vec<usize>

For each surviving point, its index in the original merged order.

cells: Vec<usize>

For each surviving cell, its index in the original cell order.

dropped_points: usize

How many nodes had no position.

dropped_cells: usize

How many cells touched one.

Trait Implementations

impl Clone for Compaction

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 Compaction

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

Formats the value using the given formatter.

impl PartialEq for Compaction

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for Compaction