Struct DummyEdge 

pub struct DummyEdge(/* private fields */);

Simple dummy edge implementation based on Arc

The implementation is very limited but perfectly fine to test e.g. an apply cache.

Implementations

impl DummyEdge

pub fn new() -> Self

Create a new DummyEdge

pub fn ref_count(&self) -> usize

Get the node’s reference count (note: Node::ref_count() is unimplemented)

Trait Implementations

impl Debug for DummyEdge

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

Formats the value using the given formatter.

impl Default for DummyEdge

fn default() -> Self

Returns the “default value” for a type.

impl DiagramRules<DummyEdge, DummyNode, ()> for DummyRules

type Cofactors<'a> = Empty<Borrowed<'a, DummyEdge>>

Iterator created by DiagramRules::cofactors()

fn reduce<M>( _manager: &M, _level: LevelNo, _children: impl IntoIterator<Item = DummyEdge>, ) -> ReducedOrNew<DummyEdge, DummyNode>

where M: Manager<Edge = DummyEdge, InnerNode = DummyNode>,

Apply the reduction rule(s)

fn cofactors(_tag: (), _node: &DummyNode) -> Self::Cofactors<'_>

Get the cofactors of node assuming an incoming edge with tag

fn cofactor(tag: <E as Edge>::Tag, node: &N, n: usize) -> Borrowed<'_, E>

Get the n-th cofactor of node assuming an incoming edge with tag

impl Drop for DummyEdge

fn drop(&mut self)

Executes the destructor for this type.

impl DropWith<DummyEdge> for DummyNode

fn drop_with(self, _drop_edge: impl Fn(DummyEdge))

Drop self

fn drop_with_manager<M>(self, manager: &M)

where M: Manager<Edge = E>,

Drop self

impl Edge for DummyEdge

type Tag = ()

Edge tag

fn borrowed(&self) -> Borrowed<'_, Self>

Turn a reference into a borrowed handle

fn with_tag(&self, _tag: ()) -> Borrowed<'_, Self>

Get a version of this Edge with the given tag

fn with_tag_owned(self, _tag: ()) -> Self

Get a version of this Edge with the given tag

fn tag(&self) -> Self::Tag

Get the Tag of this Edge

fn node_id(&self) -> NodeID

Returns some unique identifier for the node, e.g. for I/O purposes

impl Hash for DummyEdge

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl InnerNode<DummyEdge> for DummyNode

const ARITY: usize = 0usize

The node’s arity (upper bound)

type ChildrenIter<'a> = Empty<Borrowed<'a, DummyEdge>> where Self: 'a

Iterator over children of an inner node

fn new(_level: LevelNo, _children: impl IntoIterator<Item = DummyEdge>) -> Self

Create a new node

fn check_level(&self, _check: impl FnOnce(LevelNo) -> bool) -> bool

Returns the result of check applied to the node’s level in case this node type stores levels, otherwise returns true.

fn assert_level_matches(&self, _level: LevelNo)

Panics if the node types stores a level and the node’s level is not level

fn children(&self) -> Self::ChildrenIter<'_>

Get the children of this node as an iterator

fn child(&self, _n: usize) -> Borrowed<'_, DummyEdge>

Get the n-th child of this node

unsafe fn set_child(&self, _n: usize, _child: DummyEdge) -> DummyEdge

Set the n-th child of this node

fn ref_count(&self) -> usize

Get the node’s reference count

impl LevelView<DummyEdge, DummyNode> for DummyLevelView

type Iterator<'a> = Empty<&'a DummyEdge> where Self: 'a, DummyEdge: 'a

Iterator over Edges pointing to nodes at this level

type Taken = DummyLevelView

Taken level view, see LevelView::take()

fn len(&self) -> usize

Get the number of nodes on this level

fn level_no(&self) -> LevelNo

Get the level number of this level

fn reserve(&mut self, _additional: usize)

Reserve space for additional nodes on this level

fn get(&self, _node: &DummyNode) -> Option<&DummyEdge>

Get the edge corresponding to the given node (if present)

fn insert(&mut self, _edge: DummyEdge) -> bool

Insert the given edge into the unique table at this level, assuming that the referenced node is already stored in the associated manager.

fn get_or_insert(&mut self, _node: DummyNode) -> AllocResult<DummyEdge>

Get the edge corresponding to level and node if present, or insert it.

unsafe fn gc(&mut self)

Perform garbage collection on this level

unsafe fn remove(&mut self, _node: &DummyNode) -> bool

Remove node from (this level of) the manager

unsafe fn swap(&mut self, _other: &mut Self)

Move all nodes from this level to the other level and vice versa.

fn iter(&self) -> Self::Iterator<'_>

Iterate over all the edges at this level

fn take(&mut self) -> Self::Taken

Clear this level, returning a level view containing all the previous edges.

fn is_empty(&self) -> bool

Returns true iff this level contains nodes

impl Ord for DummyEdge

fn cmp(&self, other: &Self) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for DummyEdge

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.

impl PartialOrd for DummyEdge

fn partial_cmp(&self, other: &Self) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Eq for DummyEdge