Struct NextIteration 

pub struct NextIteration { /* private fields */ }

Implementations

impl NextIteration

pub fn new(name: String, role: NextIterationRole) -> Self

Constructs a new NextIteration.

Trait Implementations

impl Clone for NextIteration

fn clone(&self) -> NextIteration

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for NextIteration

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

Formats the value using the given formatter.

impl Eq for NextIteration

impl EvalOp for NextIteration

fn eval_out_of_plan( &self, _inputs: TVec<TValue>, ) -> TractResult<Option<TVec<TValue>>>

Evaluate with no plan around the node – const folding, shape inference, tests – or None when there is no answer without one, because the op reads the context or keeps state between turns. Required, with no default: an op answering Some has produced the value from inputs alone, by construction, so the claim and the act cannot disagree. Write it with op_out_of_plan!() or not_out_of_plan!().

fn state(&self, _ctx: &EvalContext<'_>) -> TractResult<Option<Box<dyn OpState>>>

Build this node’s inter-turn state, or None when the op keeps nothing between turns. This is what decides whether the plan holds an OpState for the node; there is no separate predicate.

fn eval( &self, ctx: &EvalContext<'_>, inputs: SmallVec<[TValue; 4]>, ) -> Result<SmallVec<[TValue; 4]>, Error>

Evaluate the op. ctx says where and when: the turn’s symbols, the shared resources a handler installed, and (session, node_id) so an op can key whatever scratch it manages for itself. Ops carrying state that must survive from one turn to the next build it in EvalOp::state instead, and evaluate through OpState::eval.

fn drop_session(&self, session: SessionId, node_id: usize)

Release whatever the op manages for session, called for every node as a state is dropped. Ops keeping scratch keyed by (session, node_id) must implement it, or that scratch outlives the session that made it.

impl Hash for NextIteration

fn hash<__H: Hasher>(&self, state: &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 InferenceRulesOp for NextIteration

fn rules<'r, 'p: 'r, 's: 'r>( &'s self, _s: &mut Solver<'r>, inputs: &'p [TensorProxy], outputs: &'p [TensorProxy], ) -> InferenceResult

Registers the inference rules of the operator.

fn as_op(&self) -> &dyn Op

fn as_op_mut(&mut self) -> &mut dyn Op

fn to_typed( &self, source: &Graph<InferenceFact, Box<dyn InferenceOp>>, node: &Node<InferenceFact, Box<dyn InferenceOp>>, target: &mut Graph<TypedFact, Box<dyn TypedOp>>, mapping: &HashMap<OutletId, OutletId>, ) -> Result<SmallVec<[OutletId; 4]>, Error>

fn nboutputs(&self) -> Result<usize, Error>

fn incorporate( &self, model: &Graph<InferenceFact, Box<dyn InferenceOp>>, node: &Node<InferenceFact, Box<dyn InferenceOp>>, ) -> Result<Option<ModelPatch<InferenceFact, Box<dyn InferenceOp>>>, Error>

impl Op for NextIteration

fn name(&self) -> StaticName

fn as_typed(&self) -> Option<&dyn TypedOp>

fn validation(&self) -> Validation

The kind of accuracy check that should be performed on operation when testing them.

fn info(&self) -> Result<Vec<String>, Error>

Short (one-line) strings giving hints on internal implementation or important configuration details to be displayed in dumps.

impl PartialEq for NextIteration

fn eq(&self, other: &NextIteration) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for NextIteration