pub struct ModelPatch<F, O>where
F: Fact + Clone + 'static,
O: Display + Debug + AsRef<dyn Op> + AsMut<dyn Op> + Clone + 'static,{
pub context: Vec<String>,
pub dont_apply_twice: Option<String>,
pub model: Graph<F, O>,
pub inputs: HashMap<usize, usize>,
pub taps: HashMap<OutletId, OutletId>,
pub shunts: HashMap<OutletId, OutletId>,
pub obliterate: Vec<usize>,
}
Expand description
A change to apply to a model.
Actually structured around a model that represent the new nodes to be inserted, plus information about how to connect these new nodes to the pre-existing graph.
Fields§
§context: Vec<String>
patch label for auditing and debugging
dont_apply_twice: Option<String>
optimizer will ignore this patch in node to node loop if it was already encountered
model: Graph<F, O>
the model-like ‘patch’ of nodes to add to the model
inputs: HashMap<usize, usize>
map of replaced inputs (patch node id to model node id)
taps: HashMap<OutletId, OutletId>
map of patch inputs to model wires
shunts: HashMap<OutletId, OutletId>
map of old model wires to be replaced by wires from the patch
obliterate: Vec<usize>
operations to discard from the model
Implementations§
Source§impl<F, O> ModelPatch<F, O>
impl<F, O> ModelPatch<F, O>
pub fn new(s: impl Into<String>) -> ModelPatch<F, O>
pub fn push_context(&mut self, s: impl Into<String>)
pub fn with_context(self, s: impl Into<String>) -> ModelPatch<F, O>
pub fn is_empty(&self) -> bool
Sourcepub fn tap_model(
&mut self,
model: &Graph<F, O>,
outlet: OutletId,
) -> Result<OutletId, Error>
pub fn tap_model( &mut self, model: &Graph<F, O>, outlet: OutletId, ) -> Result<OutletId, Error>
Draw a tap from a preexisting node.
returns an OutletId usable in the little “patch” model
Sourcepub fn taps<'a>(
&mut self,
model: &Graph<F, O>,
outlets: impl IntoIterator<Item = &'a OutletId>,
) -> Result<SmallVec<[OutletId; 4]>, Error>
pub fn taps<'a>( &mut self, model: &Graph<F, O>, outlets: impl IntoIterator<Item = &'a OutletId>, ) -> Result<SmallVec<[OutletId; 4]>, Error>
Draw taps from a preexisting node.
returns an OutletId usable in the little “patch” model
pub unsafe fn shunt_outside_unchecked( &mut self, outlet: OutletId, by: OutletId, ) -> Result<(), Error>
Sourcepub fn shunt_outside(
&mut self,
model: &Graph<F, O>,
outlet: OutletId,
by: OutletId,
) -> Result<(), Error>
pub fn shunt_outside( &mut self, model: &Graph<F, O>, outlet: OutletId, by: OutletId, ) -> Result<(), Error>
Replace an Outlet in the target model by one from the patch.
pub fn obliterate(&mut self, node: usize) -> Result<(), Error>
Sourcepub fn replace_single_op<IO>(
patched_model: &Graph<F, O>,
node: &Node<F, O>,
inputs: &[OutletId],
new_op: IO,
) -> Result<ModelPatch<F, O>, Error>where
IO: Into<O>,
pub fn replace_single_op<IO>(
patched_model: &Graph<F, O>,
node: &Node<F, O>,
inputs: &[OutletId],
new_op: IO,
) -> Result<ModelPatch<F, O>, Error>where
IO: Into<O>,
Convenience method creating a patch that replaces a single operation.
Sourcepub fn fuse_with_next<IO>(
patched_model: &Graph<F, O>,
node: &Node<F, O>,
new_op: IO,
) -> Result<ModelPatch<F, O>, Error>where
IO: Into<O>,
pub fn fuse_with_next<IO>(
patched_model: &Graph<F, O>,
node: &Node<F, O>,
new_op: IO,
) -> Result<ModelPatch<F, O>, Error>where
IO: Into<O>,
Convenience method creating a patch that fuses an op with the next one.
Sourcepub fn shunt_one_op(
patched_model: &Graph<F, O>,
node: &Node<F, O>,
) -> Result<Option<ModelPatch<F, O>>, Error>
pub fn shunt_one_op( patched_model: &Graph<F, O>, node: &Node<F, O>, ) -> Result<Option<ModelPatch<F, O>>, Error>
Convenience method creating a patch that shunts the given node.
pub fn rewire( patched_model: &Graph<F, O>, from: &[OutletId], to: &[OutletId], wiring: &dyn Fn(&mut ModelPatch<F, O>, &[OutletId]) -> Result<SmallVec<[OutletId; 4]>, Error>, ) -> Result<ModelPatch<F, O>, Error>
Sourcepub fn single_unary_op<IO>(
patched_model: &Graph<F, O>,
node: &Node<F, O>,
new_op: IO,
) -> Result<ModelPatch<F, O>, Error>where
IO: Into<O>,
pub fn single_unary_op<IO>(
patched_model: &Graph<F, O>,
node: &Node<F, O>,
new_op: IO,
) -> Result<ModelPatch<F, O>, Error>where
IO: Into<O>,
Convenience method creating a patch that replace a single unary operation.
Sourcepub fn intercept<IO>(
patched_model: &Graph<F, O>,
outlet: OutletId,
name: impl Into<String>,
new_op: IO,
fact: F,
) -> Result<ModelPatch<F, O>, Error>where
IO: Into<O>,
pub fn intercept<IO>(
patched_model: &Graph<F, O>,
outlet: OutletId,
name: impl Into<String>,
new_op: IO,
fact: F,
) -> Result<ModelPatch<F, O>, Error>where
IO: Into<O>,
Convenience method creating a patch that insert an unary op on an outlet.
pub fn wire_node( &mut self, name: impl Into<String>, op: impl Into<O>, inputs: &[OutletId], ) -> Result<SmallVec<[OutletId; 4]>, Error>
Methods from Deref<Target = Graph<F, O>>§
pub fn add_source( &mut self, name: impl Into<String>, fact: F, ) -> Result<OutletId, Error>
pub fn add_node( &mut self, name: impl Into<String>, op: impl Into<O>, output_facts: SmallVec<[F; 4]>, ) -> Result<usize, Error>
Sourcepub fn add_edge(
&mut self,
outlet: OutletId,
inlet: InletId,
) -> Result<(), Error>
pub fn add_edge( &mut self, outlet: OutletId, inlet: InletId, ) -> Result<(), Error>
Connect a node outlet to a node inlet.
Sourcepub fn input_outlets(&self) -> Result<&[OutletId], Error>
pub fn input_outlets(&self) -> Result<&[OutletId], Error>
Get model inputs.
Sourcepub fn set_input_outlets(&mut self, inputs: &[OutletId]) -> Result<(), Error>
pub fn set_input_outlets(&mut self, inputs: &[OutletId]) -> Result<(), Error>
Change model inputs.
Sourcepub fn set_input_names(
&mut self,
inputs: impl IntoIterator<Item = impl AsRef<str>>,
) -> Result<(), Error>
pub fn set_input_names( &mut self, inputs: impl IntoIterator<Item = impl AsRef<str>>, ) -> Result<(), Error>
Set model inputs by the node name.
Sourcepub fn input_fact(&self, ix: usize) -> Result<&F, Error>
pub fn input_fact(&self, ix: usize) -> Result<&F, Error>
Get the ix
-th input tensor type information.
Sourcepub fn input_fact_mut(&mut self, ix: usize) -> Result<&mut F, Error>
pub fn input_fact_mut(&mut self, ix: usize) -> Result<&mut F, Error>
Get the ix
-th input tensor type information, mutably.
Sourcepub fn set_input_fact(&mut self, input: usize, fact: F) -> Result<(), Error>
pub fn set_input_fact(&mut self, input: usize, fact: F) -> Result<(), Error>
Set the ix
-th input tensor type information.
Sourcepub fn output_outlets(&self) -> Result<&[OutletId], Error>
pub fn output_outlets(&self) -> Result<&[OutletId], Error>
Get model outputs.
Sourcepub fn auto_outputs(&mut self) -> Result<(), Error>
pub fn auto_outputs(&mut self) -> Result<(), Error>
Guess outputs from the topology: node or nodes with no successors.
Sourcepub fn set_output_outlets(&mut self, outputs: &[OutletId]) -> Result<(), Error>
pub fn set_output_outlets(&mut self, outputs: &[OutletId]) -> Result<(), Error>
Change model outputs.
Sourcepub fn set_output_names(
&mut self,
outputs: impl IntoIterator<Item = impl AsRef<str>>,
) -> Result<(), Error>
pub fn set_output_names( &mut self, outputs: impl IntoIterator<Item = impl AsRef<str>>, ) -> Result<(), Error>
Set model outputs by node names.
Sourcepub fn output_fact(&self, ix: usize) -> Result<&F, Error>
pub fn output_fact(&self, ix: usize) -> Result<&F, Error>
Get the ix
-th input tensor type information.
Sourcepub fn output_fact_mut(&mut self, ix: usize) -> Result<&mut F, Error>
pub fn output_fact_mut(&mut self, ix: usize) -> Result<&mut F, Error>
Get the ix
-th input tensor type information, mutably.
Sourcepub fn set_output_fact(&mut self, output: usize, fact: F) -> Result<(), Error>
pub fn set_output_fact(&mut self, output: usize, fact: F) -> Result<(), Error>
Set the ix
-th output tensor type information.
Sourcepub fn node_names(&self) -> impl Iterator<Item = &str>
pub fn node_names(&self) -> impl Iterator<Item = &str>
Iterate over all node names.
pub fn node_id_by_name(&self, name: &str) -> Result<usize, Error>
Sourcepub fn node_by_name(&self, name: impl AsRef<str>) -> Result<&Node<F, O>, Error>
pub fn node_by_name(&self, name: impl AsRef<str>) -> Result<&Node<F, O>, Error>
Find a node by its name.
Sourcepub fn node_by_name_mut(
&mut self,
name: impl AsRef<str>,
) -> Result<&mut Node<F, O>, Error>
pub fn node_by_name_mut( &mut self, name: impl AsRef<str>, ) -> Result<&mut Node<F, O>, Error>
Borrow mutably a node by its name.
pub fn rename_node(&mut self, id: usize, name: &str) -> Result<(), Error>
Sourcepub fn node_facts(
&self,
id: usize,
) -> Result<(SmallVec<[&F; 4]>, SmallVec<[&F; 4]>), Error>
pub fn node_facts( &self, id: usize, ) -> Result<(SmallVec<[&F; 4]>, SmallVec<[&F; 4]>), Error>
Get input and output tensor information for a node.
Sourcepub fn node_input_facts(
&self,
node_id: usize,
) -> Result<SmallVec<[&F; 4]>, Error>
pub fn node_input_facts( &self, node_id: usize, ) -> Result<SmallVec<[&F; 4]>, Error>
Get input tensor information for a node.
Sourcepub fn node_output_facts(
&self,
node_id: usize,
) -> Result<SmallVec<[&F; 4]>, Error>
pub fn node_output_facts( &self, node_id: usize, ) -> Result<SmallVec<[&F; 4]>, Error>
Get output tensor information for a node.
Sourcepub fn outlet_fact(&self, outlet: OutletId) -> Result<&F, Error>
pub fn outlet_fact(&self, outlet: OutletId) -> Result<&F, Error>
Get tensor information for a single outlet.
Sourcepub fn outlet_fact_mut(&mut self, outlet: OutletId) -> Result<&mut F, Error>
pub fn outlet_fact_mut(&mut self, outlet: OutletId) -> Result<&mut F, Error>
Get tensor information for a single outlet.
Sourcepub fn outlets_fact_mut(
&mut self,
outlets: &[OutletId],
) -> Result<SmallVec<[&mut F; 4]>, Error>
pub fn outlets_fact_mut( &mut self, outlets: &[OutletId], ) -> Result<SmallVec<[&mut F; 4]>, Error>
Get multiple mutable tensor information for outlets.
Sourcepub fn set_outlet_fact(
&mut self,
outlet: OutletId,
fact: F,
) -> Result<(), Error>
pub fn set_outlet_fact( &mut self, outlet: OutletId, fact: F, ) -> Result<(), Error>
Set tensor information for a single outlet.
Sourcepub fn outlet_label(&self, outlet: OutletId) -> Option<&str>
pub fn outlet_label(&self, outlet: OutletId) -> Option<&str>
Get label for an outlet.
Sourcepub fn set_outlet_label(
&mut self,
outlet: OutletId,
label: String,
) -> Result<(), Error>
pub fn set_outlet_label( &mut self, outlet: OutletId, label: String, ) -> Result<(), Error>
Set label for an outlet.
Sourcepub fn find_outlet_label(&self, label: &str) -> Option<OutletId>
pub fn find_outlet_label(&self, label: &str) -> Option<OutletId>
Find outlet by label.
Sourcepub fn eval_order(&self) -> Result<Vec<usize>, Error>
pub fn eval_order(&self) -> Result<Vec<usize>, Error>
Computes an evalutation order for the graph inputs and outputs
Sourcepub fn eval_order_opt_ram(&self) -> Result<Vec<usize>, Error>
pub fn eval_order_opt_ram(&self) -> Result<Vec<usize>, Error>
Computes an evalutation order for the graph inputs and outputs. This order will minimize temporary buffers.
pub fn check_edges(&self) -> Result<(), Error>
Sourcepub fn eval_tmp_memory_usage<Flushable>(
&self,
order: &[usize],
flushable: Flushable,
) -> Result<SmallVec<[(usize, TDim); 4]>, Error>
pub fn eval_tmp_memory_usage<Flushable>( &self, order: &[usize], flushable: Flushable, ) -> Result<SmallVec<[(usize, TDim); 4]>, Error>
Evaluate temporary memory usage with its related node at each step of the given order.
pub fn check_names(&self) -> Result<(), Error>
pub fn single_prec(&self, id: usize) -> Result<Option<&Node<F, O>>, Error>
pub fn single_prec_at( &self, id: usize, count: usize, ) -> Result<Option<&Node<F, O>>, Error>
pub fn single_succ_at( &self, id: usize, count: usize, ) -> Result<Option<&Node<F, O>>, Error>
Sourcepub fn single_succ(&self, id: usize) -> Result<Option<&Node<F, O>>, Error>
pub fn single_succ(&self, id: usize) -> Result<Option<&Node<F, O>>, Error>
single_succ is only intended for optimisation of simple operators with 1 output, and only 1 output successors (successor with only 1 input)
pub fn outlet_successors(&self, outlet: OutletId) -> &[InletId]
Sourcepub fn new_sym_with_prefix(&self, prefix: &str) -> Symbol
pub fn new_sym_with_prefix(&self, prefix: &str) -> Symbol
create a new symbol with the prefix
Sourcepub fn unique_name<'n>(&self, prefix: impl Into<Cow<'n, str>>) -> Cow<'n, str>
pub fn unique_name<'n>(&self, prefix: impl Into<Cow<'n, str>>) -> Cow<'n, str>
generates a name for a new node in the model that will not conflict (by suffixing with a dot and number)
pub fn check_compact(&self) -> Result<(), Error>
pub fn compact(&mut self) -> Result<(), Error>
Trait Implementations§
Source§impl<F, O> Clone for ModelPatch<F, O>
impl<F, O> Clone for ModelPatch<F, O>
Source§fn clone(&self) -> ModelPatch<F, O>
fn clone(&self) -> ModelPatch<F, O>
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moreSource§impl<F, O> Debug for ModelPatch<F, O>
impl<F, O> Debug for ModelPatch<F, O>
Source§impl<F, O> Default for ModelPatch<F, O>
impl<F, O> Default for ModelPatch<F, O>
Source§fn default() -> ModelPatch<F, O>
fn default() -> ModelPatch<F, O>
Source§impl<F, O> DerefMut for ModelPatch<F, O>
impl<F, O> DerefMut for ModelPatch<F, O>
Auto Trait Implementations§
impl<F, O> Freeze for ModelPatch<F, O>
impl<F, O> !RefUnwindSafe for ModelPatch<F, O>
impl<F, O> Send for ModelPatch<F, O>where
O: Send,
impl<F, O> Sync for ModelPatch<F, O>where
O: Sync,
impl<F, O> Unpin for ModelPatch<F, O>
impl<F, O> !UnwindSafe for ModelPatch<F, O>
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
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>
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>
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)
&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)
&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<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> ⓘ
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> ⓘ
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