Struct NodeStore 

pub struct NodeStore<T> { /* private fields */ }

Implementations

impl<T> NodeStore<T>

pub fn new() -> Self

pub fn ref_count(&self) -> usize

pub fn count_type(&self, node_type: NodeType) -> usize

pub fn contains_type(&self, node_type: NodeType) -> bool

pub fn add(&self, values: Vec<T>)

where T: Into<NodeValue<T>> + Clone,

pub fn insert<K>(&self, node_type: NodeType, values: Vec<K>)

where K: Into<NodeValue<T>>,

pub fn map<F, K>(&self, mapper: F) -> Option<K>

where F: Fn(Vec<&NodeValue<T>>) -> K,

pub fn map_by_type<F, K>(&self, node_type: NodeType, mapper: F) -> Option<K>

where F: Fn(&[NodeValue<T>]) -> K,

Trait Implementations

impl<T> Clone for NodeStore<T>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for NodeStore<T>

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

Formats the value using the given formatter.

impl<T: Default> Default for NodeStore<T>

fn default() -> NodeStore<T>

Returns the “default value” for a type.

impl<T: Default + Clone> Factory<(usize, NodeType), Option<GraphNode<T>>> for NodeStore<T>

fn new_instance( &self, (index, node_type): (usize, NodeType), ) -> Option<GraphNode<T>>

impl<T, F> Factory<(usize, NodeType, F), Option<GraphNode<T>>> for NodeStore<T>

where T: Default + Clone, F: Fn(Arity) -> bool,

fn new_instance( &self, (index, node_type, filter): (usize, NodeType, F), ) -> Option<GraphNode<T>>

impl<T, F> Factory<F, Option<TreeNode<T>>> for NodeStore<T>

where T: Default + Clone, F: Fn(Arity) -> bool,

fn new_instance(&self, input: F) -> Option<TreeNode<T>>

impl<T: Clone + Default> Factory<NodeType, Option<TreeNode<T>>> for NodeStore<T>

fn new_instance(&self, input: NodeType) -> Option<TreeNode<T>>

impl<T> Factory<NodeType, T> for NodeStore<T>

where T: Factory<(), T> + Default,

fn new_instance(&self, input: NodeType) -> T

impl<T: Clone> From<&NodeStore<T>> for NodeStore<T>

fn from(store: &NodeStore<T>) -> Self

Converts to this type from the input type.

impl<T> From<HashMap<NodeType, Vec<T>>> for NodeStore<T>

where T: Into<NodeValue<T>>,

fn from(values: HashMap<NodeType, Vec<T>>) -> Self

Converts to this type from the input type.

impl<T: Clone> From<Op<T>> for NodeStore<Op<T>>

fn from(value: Op<T>) -> Self

Converts to this type from the input type.

impl<T> From<Vec<(NodeType, Vec<T>)>> for NodeStore<T>

where T: Into<NodeValue<T>> + Clone,

fn from(values: Vec<(NodeType, Vec<T>)>) -> Self

Converts to this type from the input type.

impl<T> From<Vec<T>> for NodeStore<T>

where T: Into<NodeValue<T>> + Clone,

fn from(values: Vec<T>) -> Self

Converts to this type from the input type.

impl<T: PartialEq> PartialEq for NodeStore<T>

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.