Struct GraphNode

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

Implementations

impl<T> GraphNode<T>

pub fn new(index: usize, node_type: NodeType, value: T) -> Self

pub fn with_arity( index: usize, node_type: NodeType, value: T, arity: Arity, ) -> Self

pub fn direction(&self) -> Direction

pub fn set_direction(&mut self, direction: Direction)

pub fn is_enabled(&self) -> bool

pub fn enable(&mut self)

pub fn disable(&mut self)

pub fn index(&self) -> usize

pub fn id(&self) -> &Uuid

pub fn is_recurrent(&self) -> bool

pub fn incoming(&self) -> &BTreeSet<usize>

pub fn outgoing(&self) -> &BTreeSet<usize>

pub fn incoming_mut(&mut self) -> &mut BTreeSet<usize>

pub fn outgoing_mut(&mut self) -> &mut BTreeSet<usize>

pub fn is_locked(&self) -> bool

Trait Implementations

impl<T: Clone> Clone for GraphNode<T>

fn clone(&self) -> GraphNode<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for GraphNode<T>

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

Formats the value using the given formatter.

impl<T: Default> Default for GraphNode<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T: Eval<[V], V>, V: Clone> Eval<[V], V> for GraphNode<T>

fn eval(&self, inputs: &[V]) -> V

Evaluates the GraphNode with the given input. Returns the output of the GraphNode.

Arguments

• inputs - A Vec of T to evaluate the GraphNode with.

Returns

• A T which is the output of the GraphNode.

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

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

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

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

fn new_instance(&self, input: (usize, NodeType, F)) -> GraphNode<T>

impl<T> FromIterator<GraphNode<T>> for Graph<T>

fn from_iter<I: IntoIterator<Item = GraphNode<T>>>(iter: I) -> Self

Creates a value from an iterator.

impl<T> FromIterator<GraphNode<T>> for GraphChromosome<T>

fn from_iter<I: IntoIterator<Item = GraphNode<T>>>(iter: I) -> Self

Creates a value from an iterator.

impl<T> Gene for GraphNode<T>

where T: Clone + PartialEq + Default,

type Allele = T

fn allele(&self) -> &Self::Allele

Get the allele of the Gene. This is the value that the Gene represents or “expresses”.

fn new_instance(&self) -> GraphNode<T>

Create a new instance of the Gene.

fn with_allele(&self, allele: &Self::Allele) -> GraphNode<T>

Create a new Gene with the given allele.

impl<T> Into<GraphNode<T>> for (usize, NodeType, T)

fn into(self) -> GraphNode<T>

Converts this type into the (usually inferred) input type.

impl<T: Default> Into<GraphNode<T>> for (usize, NodeType, T, Arity)

fn into(self) -> GraphNode<T>

Converts this type into the (usually inferred) input type.

impl<T: Default> Into<GraphNode<T>> for (usize, T)

fn into(self) -> GraphNode<T>

Converts this type into the (usually inferred) input type.

impl<T: Default> Into<GraphNode<T>> for (usize, T, Arity)

fn into(self) -> GraphNode<T>

Converts this type into the (usually inferred) input type.

impl<T> Node for GraphNode<T>

type Value = T

fn value(&self) -> &Self::Value

fn node_type(&self) -> NodeType

fn arity(&self) -> Arity

impl<T: PartialEq> PartialEq for GraphNode<T>

fn eq(&self, other: &GraphNode<T>) -> 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<T> Valid for GraphNode<T>

fn is_valid(&self) -> bool

impl<T> StructuralPartialEq for GraphNode<T>