Struct NodeInner

pub struct NodeInner<D: Domain> { /* private fields */ }

The data associated to a node that form its key.

Implementations

impl<D: Domain> NodeInner<D>

pub fn new( initial_state: &D::State, start_tick: u64, diff: D::Diff, active_agent: AgentId, tick: u64, tasks: BTreeSet<ActiveTask<D>>, ) -> Self

Create a new node, check for visible agents, and re-assign current tasks to the matching ones. Return None if no active agent is not visible, and Some(node) otherwise.

pub fn agent(&self) -> AgentId

Returns the agent who owns the node

pub fn tick(&self) -> u64

Returns the tick

pub fn agents(&self) -> BTreeSet<AgentId>

Returns all agents that are in considered by this node

pub fn diff(&self) -> &D::Diff

Returns the diff of current node.

pub fn current_value(&self, agent: AgentId) -> AgentValue

Returns the current value from an agent, panic if not present in the node

pub fn current_value_or_compute( &self, agent: AgentId, initial_state: &D::State, ) -> AgentValue

Returns the current value from an agent, compute if not present in the node

pub fn current_values(&self) -> &BTreeMap<AgentId, AgentValue>

Returns all current values

pub fn size(&self, task_size: fn(&dyn Task<D>) -> usize) -> usize

Trait Implementations

impl<D: Domain> Debug for NodeInner<D>

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

Formats the value using the given formatter.

impl<D: Domain> Hash for NodeInner<D>

fn hash<H: Hasher>(&self, hasher: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<D: Domain> PartialEq for NodeInner<D>

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.

impl<D: Domain> Eq for NodeInner<D>