Struct Manager

pub struct Manager<'id, N, ET, TM, R, MD, const PAGE_SIZE: usize, const TAG_BITS: u32>where
    N: NodeBase + InnerNode<Edge<'id, N, ET, TAG_BITS>>,
    ET: Tag,
    TM: TerminalManager<'id, N, ET, MD, PAGE_SIZE, TAG_BITS>,
    MD: DropWith<Edge<'id, N, ET, TAG_BITS>>,
{ /* private fields */ }

Trait Implementations§

Converts this type into a mutable reference of the (usually inferred) input type.

Converts this type into a shared reference of the (usually inferred) input type.

Executes the destructor for this type. Read more

Converts to this type from the input type.

The concrete apply cache type

Get a shared reference to the contained apply cache

Get a mutable reference to the contained apply cache

Type of the worker pool

Get the worker pool

Type of edge

Type of edge tags

Type of inner nodes

Type of terminals

Diagram rules, see DiagramRules for more details

Iterator over all terminals Read more

Node set type, possibly more efficient than a HashSet<NodeID>

A view on a single level of the unique table.

Iterator over levels

Get a reference to the node to which edge points

Clone edge

Drop edge and try to remove the node it points to Read more

Get the count of inner nodes

Get the number of levels Read more

Get the number of named variables

Add additional unnamed variables to the decision diagram Read more

Add named variables to the decision diagram Read more

Add named variables to the decision diagram Read more

Get var’s name Read more

Label var as name Read more

Get the variable number for the given variable name, if present Read more

Get the level for the given variable Read more

Get the variable for the given level Read more

Get the level given by no Read more

Iterate over the levels from top to bottom

Get an edge for the given terminal Read more

Get the number of terminals Read more

Iterator over all terminals Read more

Perform garbage collection Read more

Prepare and postprocess a reordering operation. The reordering itself is performed in f. Read more

Get the count of garbage collections Read more

Get the count of reordering operations Read more

Get an approximate count of inner nodes Read more

Get the number of variables Read more

Auto Trait Implementations§

Blanket Implementations§

Gets the TypeId of self. Read more

Immutably borrows from an owned value. Read more

Mutably borrows from an owned value. Read more

Returns the argument unchanged.

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

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 more

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

The alignment of pointer.

The type for initializers.

Initializes a with the given initializer. Read more

Dereferences the given pointer. Read more

Mutably dereferences the given pointer. Read more

Drops the object pointed to by the given pointer. Read more

The type returned in the event of a conversion error.

Performs the conversion.

The type returned in the event of a conversion error.

Performs the conversion.

Manager

Struct Manager Copy item path

Trait Implementations§

fn as_mut(&mut self) -> &mut T

fn as_ref(&self) -> &T

fn drop(&mut self)

type ApplyCache = <MD as HasApplyCache<Manager<'id, N, ET, TM, R, MD, PAGE_SIZE, TAG_BITS>, O>>::ApplyCache

fn apply_cache(&self) -> &Self::ApplyCache

fn apply_cache_mut(&mut self) -> &mut Self::ApplyCache

type WorkerPool = Workers

fn workers(&self) -> &Self::WorkerPool

type Edge = Edge<'id, N, ET, TAG_BITS>

type EdgeTag = ET

type InnerNode = N

type Terminal = <TM as TerminalManager<'id, N, ET, MD, PAGE_SIZE, TAG_BITS>>::TerminalNode

type TerminalRef<'a> = <TM as TerminalManager<'id, N, ET, MD, PAGE_SIZE, TAG_BITS>>::TerminalNodeRef<'a> where Self: 'a

type Rules = R

type TerminalIterator<'a> = <TM as TerminalManager<'id, N, ET, MD, PAGE_SIZE, TAG_BITS>>::Iterator<'a> where Self: 'a

type NodeSet = NodeSet<PAGE_SIZE, TAG_BITS>

type LevelView<'a> = LevelView<'a, 'id, N, ET, TM, R, MD, PAGE_SIZE, TAG_BITS> where Self: 'a

type LevelIterator<'a> = LevelIter<'a, 'id, N, ET, TM, R, MD, PAGE_SIZE, TAG_BITS> where Self: 'a

fn get_node(&self, edge: &Self::Edge) -> Node<'_, Self>

fn clone_edge(&self, edge: &Self::Edge) -> Self::Edge

fn drop_edge(&self, edge: Self::Edge)

fn try_remove_node(&self, edge: Self::Edge, level: LevelNo) -> bool

fn num_inner_nodes(&self) -> usize

fn num_levels(&self) -> LevelNo

fn num_named_vars(&self) -> VarNo

fn add_vars(&mut self, additional: VarNo) -> Range<VarNo>

fn add_named_vars<S: Into<String>>( &mut self, names: impl IntoIterator<Item = S>, ) -> Result<Range<VarNo>, DuplicateVarName>

fn add_named_vars_from_map( &mut self, map: VarNameMap, ) -> Result<Range<VarNo>, DuplicateVarName>

fn var_name(&self, var: VarNo) -> &str

fn set_var_name( &mut self, var: VarNo, name: impl Into<String>, ) -> Result<(), DuplicateVarName>

fn name_to_var(&self, name: impl AsRef<str>) -> Option<VarNo>

fn var_to_level(&self, var: VarNo) -> LevelNo

fn level_to_var(&self, level: LevelNo) -> VarNo

fn level(&self, no: LevelNo) -> Self::LevelView<'_>

fn levels(&self) -> Self::LevelIterator<'_>

fn get_terminal(&self, terminal: Self::Terminal) -> AllocResult<Self::Edge>

fn num_terminals(&self) -> usize

fn terminals(&self) -> Self::TerminalIterator<'_>

fn gc(&self) -> usize

fn reorder<T>(&mut self, f: impl FnOnce(&mut Self) -> T) -> T

fn gc_count(&self) -> u64

fn reorder_count(&self) -> u64

fn approx_num_inner_nodes(&self) -> usize

fn num_vars(&self) -> u32

Auto Trait Implementations§

impl<'id, N, ET, TM, R, MD, const PAGE_SIZE: usize, const TAG_BITS: u32> !Freeze for Manager<'id, N, ET, TM, R, MD, PAGE_SIZE, TAG_BITS>

impl<'id, N, ET, TM, R, MD, const PAGE_SIZE: usize, const TAG_BITS: u32> !RefUnwindSafe for Manager<'id, N, ET, TM, R, MD, PAGE_SIZE, TAG_BITS>

impl<'id, N, ET, TM, R, MD, const PAGE_SIZE: usize, const TAG_BITS: u32> Unpin for Manager<'id, N, ET, TM, R, MD, PAGE_SIZE, TAG_BITS>where MD: Unpin, TM: Unpin, R: Unpin,

impl<'id, N, ET, TM, R, MD, const PAGE_SIZE: usize, const TAG_BITS: u32> !UnwindSafe for Manager<'id, N, ET, TM, R, MD, PAGE_SIZE, TAG_BITS>

Blanket Implementations§

impl<T> Any for Twhere T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for Twhere T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for Twhere T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<T> From<T> for T

fn from(t: T) -> T

impl<T, U> Into<U> for Twhere U: From<T>,

fn into(self) -> U

impl<T> IntoEither for T

fn into_either(self, into_left: bool) -> Either<Self, Self>

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>where F: FnOnce(&Self) -> bool,

impl<T> Pointable for T

const ALIGN: usize

type Init = T

unsafe fn init(init: <T as Pointable>::Init) -> usize

unsafe fn deref<'a>(ptr: usize) -> &'a T

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

unsafe fn drop(ptr: usize)

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

type Error = Infallible

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Struct Manager

impl<'id, N, ET, TM, R, MD, const PAGE_SIZE: usize, const TAG_BITS: u32> Unpin for Manager<'id, N, ET, TM, R, MD, PAGE_SIZE, TAG_BITS>
where MD: Unpin, TM: Unpin, R: Unpin,

impl<T> Any for T
where T: 'static + ?Sized,

impl<T> Borrow<T> for T
where T: ?Sized,

impl<T> BorrowMut<T> for T
where T: ?Sized,

impl<T, U> Into<U> for T
where U: From<T>,

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

impl<T, U> TryFrom<U> for T
where U: Into<T>,

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,