pub struct DummyManager;Expand description
Dummy manager that does not actually manage anything. It is only useful to clone and drop edges.
Trait Implementations§
Source§impl HasWorkers for DummyManager
impl HasWorkers for DummyManager
Source§type WorkerPool = Workers
type WorkerPool = Workers
Type of the worker pool
Source§fn workers(&self) -> &Self::WorkerPool
fn workers(&self) -> &Self::WorkerPool
Get the worker pool
Source§impl Manager for DummyManager
impl Manager for DummyManager
Source§type TerminalRef<'a> = &'a ()
type TerminalRef<'a> = &'a ()
References to
Self::Terminals Read moreSource§type TerminalIterator<'a> = Empty<DummyEdge>
where
Self: 'a
type TerminalIterator<'a> = Empty<DummyEdge> where Self: 'a
Iterator over all terminals Read more
Source§type Rules = DummyRules
type Rules = DummyRules
Diagram rules, see
DiagramRules for more detailsSource§type LevelView<'a> = DummyLevelView
where
Self: 'a
type LevelView<'a> = DummyLevelView where Self: 'a
A view on a single level of the unique table.
Source§type LevelIterator<'a> = Empty<DummyLevelView>
where
Self: 'a
type LevelIterator<'a> = Empty<DummyLevelView> where Self: 'a
Iterator over levels
Source§fn get_node(&self, _edge: &Self::Edge) -> Node<'_, Self>
fn get_node(&self, _edge: &Self::Edge) -> Node<'_, Self>
Get a reference to the node to which
edge pointsSource§fn clone_edge(&self, edge: &Self::Edge) -> Self::Edge
fn clone_edge(&self, edge: &Self::Edge) -> Self::Edge
Clone
edgeSource§fn num_inner_nodes(&self) -> usize
fn num_inner_nodes(&self) -> usize
Get the count of inner nodes
Source§fn num_levels(&self) -> LevelNo
fn num_levels(&self) -> LevelNo
Get the number of levels
Source§fn add_level(
&mut self,
_f: impl FnOnce(LevelNo) -> Self::InnerNode,
) -> AllocResult<Self::Edge>
fn add_level( &mut self, _f: impl FnOnce(LevelNo) -> Self::InnerNode, ) -> AllocResult<Self::Edge>
Add a level with the given node to the unique table. Read more
Source§fn levels(&self) -> Self::LevelIterator<'_>
fn levels(&self) -> Self::LevelIterator<'_>
Iterate over the levels from top to bottom
Source§fn get_terminal(&self, _terminal: Self::Terminal) -> AllocResult<Self::Edge>
fn get_terminal(&self, _terminal: Self::Terminal) -> AllocResult<Self::Edge>
Get an edge for the given terminal Read more
Source§fn num_terminals(&self) -> usize
fn num_terminals(&self) -> usize
Get the number of terminals Read more
Source§fn terminals(&self) -> Self::TerminalIterator<'_>
fn terminals(&self) -> Self::TerminalIterator<'_>
Iterator over all terminals Read more
Source§fn reorder<T>(&mut self, f: impl FnOnce(&mut Self) -> T) -> T
fn reorder<T>(&mut self, f: impl FnOnce(&mut Self) -> T) -> T
Prepare and postprocess a reordering operation. The reordering itself is
performed in
f. Read moreSource§fn reorder_count(&self) -> u64
fn reorder_count(&self) -> u64
Get the count of reordering operations Read more
Source§fn approx_num_inner_nodes(&self) -> usize
fn approx_num_inner_nodes(&self) -> usize
Get an approximate count of inner nodes Read more
Auto Trait Implementations§
impl Freeze for DummyManager
impl RefUnwindSafe for DummyManager
impl Send for DummyManager
impl Sync for DummyManager
impl Unpin for DummyManager
impl UnwindSafe for DummyManager
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more