pub struct NextIteration { /* private fields */ }
Implementations§
Source§impl NextIteration
impl NextIteration
Sourcepub fn new(name: String, role: NextIterationRole) -> Self
pub fn new(name: String, role: NextIterationRole) -> Self
Constructs a new NextIteration
.
Trait Implementations§
Source§impl Clone for NextIteration
impl Clone for NextIteration
Source§fn clone(&self) -> NextIteration
fn clone(&self) -> NextIteration
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moreSource§impl Debug for NextIteration
impl Debug for NextIteration
Source§impl EvalOp for NextIteration
impl EvalOp for NextIteration
fn is_stateless(&self) -> bool
fn state( &self, _state: &mut SessionState, _id: usize, ) -> TractResult<Option<Box<dyn OpState>>>
fn eval( &self, inputs: SmallVec<[TValue; 4]>, ) -> Result<SmallVec<[TValue; 4]>, Error>
fn eval_with_session( &self, node_id: usize, session: &SessionState, inputs: SmallVec<[TValue; 4]>, ) -> Result<SmallVec<[TValue; 4]>, Error>
Source§impl Hash for NextIteration
impl Hash for NextIteration
Source§impl InferenceRulesOp for NextIteration
impl InferenceRulesOp for NextIteration
Source§fn rules<'r, 'p: 'r, 's: 'r>(
&'s self,
_s: &mut Solver<'r>,
inputs: &'p [TensorProxy],
outputs: &'p [TensorProxy],
) -> InferenceResult
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>
Source§impl Op for NextIteration
impl Op for NextIteration
fn name(&self) -> StaticName
fn as_typed(&self) -> Option<&dyn TypedOp>
Source§fn validation(&self) -> Validation
fn validation(&self) -> Validation
The kind of accuracy check that should be performed on operation when
testing them.
Auto Trait Implementations§
impl Freeze for NextIteration
impl RefUnwindSafe for NextIteration
impl Send for NextIteration
impl Sync for NextIteration
impl Unpin for NextIteration
impl UnwindSafe for NextIteration
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
Source§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Convert
Box<dyn Trait>
(where Trait: Downcast
) to Box<dyn Any>
. Box<dyn Any>
can
then be further downcast
into Box<ConcreteType>
where ConcreteType
implements Trait
.Source§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Convert
Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
.Source§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Convert
&Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s.Source§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Convert
&mut Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &mut Any
’s vtable from &mut Trait
’s.Source§impl<T> DowncastSync for T
impl<T> DowncastSync for T
Source§impl<O> InferenceOp for Owhere
O: InferenceRulesOp + Op,
impl<O> InferenceOp for Owhere
O: InferenceRulesOp + Op,
Source§fn infer_facts(
&mut self,
inputs: SmallVec<[&InferenceFact; 4]>,
outputs: SmallVec<[&InferenceFact; 4]>,
observed: SmallVec<[&InferenceFact; 4]>,
) -> Result<(SmallVec<[InferenceFact; 4]>, SmallVec<[InferenceFact; 4]>, SmallVec<[InferenceFact; 4]>), Error>
fn infer_facts( &mut self, inputs: SmallVec<[&InferenceFact; 4]>, outputs: SmallVec<[&InferenceFact; 4]>, observed: SmallVec<[&InferenceFact; 4]>, ) -> Result<(SmallVec<[InferenceFact; 4]>, SmallVec<[InferenceFact; 4]>, SmallVec<[InferenceFact; 4]>), Error>
Infer properties about inputs and output tensors. This method does not
need to deal with the “trivial” stateless op with fully determined
inputs cases. Read more
fn nboutputs(&self) -> Result<usize, Error>
Source§fn observe_outlets(
&self,
_model: &Graph<InferenceFact, Box<dyn InferenceOp>>,
_node: &Node<InferenceFact, Box<dyn InferenceOp>>,
) -> Result<Vec<OutletId>, Error>
fn observe_outlets( &self, _model: &Graph<InferenceFact, Box<dyn InferenceOp>>, _node: &Node<InferenceFact, Box<dyn InferenceOp>>, ) -> Result<Vec<OutletId>, Error>
Allow an op to specify a supplementary list of outlets facts that
will trigger inference again.
Source§fn as_op_mut(&mut self) -> &mut (dyn Op + 'static)
fn as_op_mut(&mut self) -> &mut (dyn Op + 'static)
Reinterpret the InferenceOp as an Op, mutably.
Source§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 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>
Called during translation to TypedModel.
Source§fn incorporate(
&self,
model: &Graph<InferenceFact, Box<dyn InferenceOp>>,
node: &Node<InferenceFact, Box<dyn InferenceOp>>,
) -> Result<Option<ModelPatch<InferenceFact, Box<dyn InferenceOp>>>, Error>
fn incorporate( &self, model: &Graph<InferenceFact, Box<dyn InferenceOp>>, node: &Node<InferenceFact, Box<dyn InferenceOp>>, ) -> Result<Option<ModelPatch<InferenceFact, Box<dyn InferenceOp>>>, Error>
Early pass on inference model, after analyse, but before translation to
typed network. Meant to deal with some framework idiosyncrasies that
manifest with temporaries nodes that can run some form of inference but
require refactoring the network before it can be evaluated. Read more
Source§fn infer(
&mut self,
inputs: SmallVec<[&InferenceFact; 4]>,
outputs: SmallVec<[&InferenceFact; 4]>,
observed: SmallVec<[&InferenceFact; 4]>,
) -> Result<(SmallVec<[InferenceFact; 4]>, SmallVec<[InferenceFact; 4]>, SmallVec<[InferenceFact; 4]>), Error>
fn infer( &mut self, inputs: SmallVec<[&InferenceFact; 4]>, outputs: SmallVec<[&InferenceFact; 4]>, observed: SmallVec<[&InferenceFact; 4]>, ) -> Result<(SmallVec<[InferenceFact; 4]>, SmallVec<[InferenceFact; 4]>, SmallVec<[InferenceFact; 4]>), Error>
Infers properties about the input and output tensors. Read more
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
Converts
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
Converts
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more