Enum BehaviorNode

pub enum BehaviorNode<B>
where
    B: Clone,
{
    Root(RootNode<B>),
    Composite(CompositeNode<B>),
    Leaf(LeafNode<B>),
    Inverter(Inverter<B>),
    // some variants omitted
}

Possible variations of behavior nodes.

Variants

Root(RootNode<B>)

Root node of the tree.

Composite(CompositeNode<B>)

Composite (sequence or selector) node of the tree.

Leaf(LeafNode<B>)

A node with custom logic.

Inverter(Inverter<B>)

A node, that inverts its child state (Status::Failure becomes Status::Success and vice versa, Status::Running remains unchanged)

Trait Implementations

impl<B> Clone for BehaviorNode<B>

where B: Clone + Clone,

fn clone(&self) -> BehaviorNode<B>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<B> Debug for BehaviorNode<B>

where B: Clone + Debug,

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

Formats the value using the given formatter.

impl<B> Default for BehaviorNode<B>

where B: Clone,

fn default() -> Self

Returns the “default value” for a type.

impl<B> PartialEq for BehaviorNode<B>

where B: Clone + PartialEq,

fn eq(&self, other: &BehaviorNode<B>) -> 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<B> Visit for BehaviorNode<B>

where B: Clone, RootNode<B>: Visit, CompositeNode<B>: Visit, LeafNode<B>: Visit, Inverter<B>: Visit,

fn visit(&mut self, name: &str, visitor: &mut Visitor) -> VisitResult

Read or write this value, depending on whether Visitor::is_reading() is true or false.

impl<B> Eq for BehaviorNode<B>

where B: Clone + Eq,

impl<B> StructuralPartialEq for BehaviorNode<B>

where B: Clone,