Struct Cell 

pub struct Cell<D, Ix = DefaultIx>
where
    Ix: IndexType,
{
    pub data: Option<Box<D>>,
    /* private fields */
}

A Cell is an entry point for data within the graph structure. It is formed by surrounding super::Edges and represents area data.

Fields

data: Option<Box<D>>

The assosiated data attached to this Cell.

Implementations

impl<D, Ix> Cell<D, Ix>

where Ix: IndexType,

pub fn new(edges: Vec<EdgeIndex<Ix>>, data: Option<Box<D>>) -> Self

Produces a new Cell with the given edges and (optional) data.

pub fn edges(&self) -> Vec<EdgeIndex<Ix>>

Returns a vec of assosiated edge indicies.

Trait Implementations

impl<D: Clone, Ix> Clone for Cell<D, Ix>

where Ix: IndexType + Clone,

fn clone(&self) -> Cell<D, Ix>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<D: Debug, Ix> Debug for Cell<D, Ix>

where Ix: IndexType + Debug,

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

Formats the value using the given formatter.

impl<D, Ix> GraphData<D> for Cell<D, Ix>

where Ix: IndexType,

fn data(&self) -> Option<&Box<D>>

Returns a borrowed refference to the data.

fn data_mut(&mut self) -> Option<&mut Box<D>>

Returns a borrowed mutable refference to the data.

impl<D, Ix> PartialEq for Cell<D, Ix>

where Ix: IndexType,

fn eq(&self, other: &Self) -> 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.