Struct ModelPatch

Source
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>
where F: Fact + Clone + 'static, O: Display + Debug + AsRef<dyn Op> + AsMut<dyn Op> + Clone + 'static, Graph<F, O>: SpecialOps<F, O>,

Source

pub fn new(s: impl Into<String>) -> ModelPatch<F, O>

Source

pub fn push_context(&mut self, s: impl Into<String>)

Source

pub fn with_context(self, s: impl Into<String>) -> ModelPatch<F, O>

Source

pub fn is_empty(&self) -> bool

Source

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

Source

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

Source

pub unsafe fn shunt_outside_unchecked( &mut self, outlet: OutletId, by: OutletId, ) -> Result<(), Error>

Source

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.

Source

pub fn obliterate(&mut self, node: usize) -> Result<(), Error>

Source

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.

Source

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.

Source

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.

Source

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>

Source

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.

Source

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.

Source

pub fn wire_node( &mut self, name: impl Into<String>, op: impl Into<O>, inputs: &[OutletId], ) -> Result<SmallVec<[OutletId; 4]>, Error>

Source

pub fn apply(self, target: &mut Graph<F, O>) -> Result<(), Error>

Apply all changes in the patch to the target model.

Methods from Deref<Target = Graph<F, O>>§

Source

pub fn add_source( &mut self, name: impl Into<String>, fact: F, ) -> Result<OutletId, Error>

Source

pub fn add_node( &mut self, name: impl Into<String>, op: impl Into<O>, output_facts: SmallVec<[F; 4]>, ) -> Result<usize, Error>

Source

pub fn add_edge( &mut self, outlet: OutletId, inlet: InletId, ) -> Result<(), Error>

Connect a node outlet to a node inlet.

Source

pub fn input_outlets(&self) -> Result<&[OutletId], Error>

Get model inputs.

Source

pub fn set_input_outlets(&mut self, inputs: &[OutletId]) -> Result<(), Error>

Change model inputs.

Source

pub fn set_input_names( &mut self, inputs: impl IntoIterator<Item = impl AsRef<str>>, ) -> Result<(), Error>

Set model inputs by the node name.

Source

pub fn input_fact(&self, ix: usize) -> Result<&F, Error>

Get the ix-th input tensor type information.

Source

pub fn input_fact_mut(&mut self, ix: usize) -> Result<&mut F, Error>

Get the ix-th input tensor type information, mutably.

Source

pub fn set_input_fact(&mut self, input: usize, fact: F) -> Result<(), Error>

Set the ix-th input tensor type information.

Source

pub fn output_outlets(&self) -> Result<&[OutletId], Error>

Get model outputs.

Source

pub fn auto_outputs(&mut self) -> Result<(), Error>

Guess outputs from the topology: node or nodes with no successors.

Source

pub fn set_output_outlets(&mut self, outputs: &[OutletId]) -> Result<(), Error>

Change model outputs.

Source

pub fn set_output_names( &mut self, outputs: impl IntoIterator<Item = impl AsRef<str>>, ) -> Result<(), Error>

Set model outputs by node names.

Source

pub fn output_fact(&self, ix: usize) -> Result<&F, Error>

Get the ix-th input tensor type information.

Source

pub fn output_fact_mut(&mut self, ix: usize) -> Result<&mut F, Error>

Get the ix-th input tensor type information, mutably.

Source

pub fn set_output_fact(&mut self, output: usize, fact: F) -> Result<(), Error>

Set the ix-th output tensor type information.

Source

pub fn node_names(&self) -> impl Iterator<Item = &str>

Iterate over all node names.

Source

pub fn node_id_by_name(&self, name: &str) -> Result<usize, Error>

Source

pub fn node_by_name(&self, name: impl AsRef<str>) -> Result<&Node<F, O>, Error>

Find a node by its name.

Source

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.

Source

pub fn rename_node(&mut self, id: usize, name: &str) -> Result<(), Error>

Source

pub fn node(&self, id: usize) -> &Node<F, O>

Find a node by its id.

Source

pub fn node_mut(&mut self, id: usize) -> &mut Node<F, O>

Find a node by its id.

Source

pub fn nodes(&self) -> &[Node<F, O>]

Access the nodes table.

Source

pub fn nodes_mut(&mut self) -> &mut [Node<F, O>]

Access the nodes table.

Source

pub fn node_facts( &self, id: usize, ) -> Result<(SmallVec<[&F; 4]>, SmallVec<[&F; 4]>), Error>

Get input and output tensor information for a node.

Source

pub fn node_input_facts( &self, node_id: usize, ) -> Result<SmallVec<[&F; 4]>, Error>

Get input tensor information for a node.

Source

pub fn node_output_facts( &self, node_id: usize, ) -> Result<SmallVec<[&F; 4]>, Error>

Get output tensor information for a node.

Source

pub fn outlet_fact(&self, outlet: OutletId) -> Result<&F, Error>

Get tensor information for a single outlet.

Source

pub fn outlet_fact_mut(&mut self, outlet: OutletId) -> Result<&mut F, Error>

Get tensor information for a single outlet.

Source

pub fn outlets_fact_mut( &mut self, outlets: &[OutletId], ) -> Result<SmallVec<[&mut F; 4]>, Error>

Get multiple mutable tensor information for outlets.

Source

pub fn set_outlet_fact( &mut self, outlet: OutletId, fact: F, ) -> Result<(), Error>

Set tensor information for a single outlet.

Source

pub fn outlet_label(&self, outlet: OutletId) -> Option<&str>

Get label for an outlet.

Source

pub fn set_outlet_label( &mut self, outlet: OutletId, label: String, ) -> Result<(), Error>

Set label for an outlet.

Source

pub fn find_outlet_label(&self, label: &str) -> Option<OutletId>

Find outlet by label.

Source

pub fn eval_order(&self) -> Result<Vec<usize>, Error>

Computes an evalutation order for the graph inputs and outputs

Source

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.

Source

pub fn check_edges(&self) -> Result<(), Error>

Source

pub fn eval_tmp_memory_usage<Flushable>( &self, order: &[usize], flushable: Flushable, ) -> Result<SmallVec<[(usize, TDim); 4]>, Error>
where Flushable: Fn(&Node<F, O>) -> bool,

Evaluate temporary memory usage with its related node at each step of the given order.

Source

pub fn check_names(&self) -> Result<(), Error>

Source

pub fn single_prec(&self, id: usize) -> Result<Option<&Node<F, O>>, Error>

Source

pub fn single_prec_at( &self, id: usize, count: usize, ) -> Result<Option<&Node<F, O>>, Error>

Source

pub fn single_succ_at( &self, id: usize, count: usize, ) -> Result<Option<&Node<F, O>>, Error>

Source

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)

Source

pub fn outlet_successors(&self, outlet: OutletId) -> &[InletId]

Source

pub fn sym(&self, s: &str) -> Symbol

retrieve of create a symbol

Source

pub fn new_sym_with_prefix(&self, prefix: &str) -> Symbol

create a new symbol with the prefix

Source

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)

Source

pub fn check_compact(&self) -> Result<(), Error>

Source

pub fn compact(&mut self) -> Result<(), Error>

Trait Implementations§

Source§

impl<F, O> Clone for ModelPatch<F, O>
where F: Clone + Fact + 'static, O: Clone + Display + Debug + AsRef<dyn Op> + AsMut<dyn Op> + 'static,

Source§

fn clone(&self) -> ModelPatch<F, O>

Returns a copy of the value. Read more
1.0.0 · Source§

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

Performs copy-assignment from source. Read more
Source§

impl<F, O> Debug for ModelPatch<F, O>
where F: Debug + Fact + Clone + 'static, O: Debug + Display + AsRef<dyn Op> + AsMut<dyn Op> + Clone + 'static,

Source§

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

Formats the value using the given formatter. Read more
Source§

impl<F, O> Default for ModelPatch<F, O>
where F: Fact + Clone + 'static, O: Display + Debug + AsRef<dyn Op> + AsMut<dyn Op> + Clone + 'static,

Source§

fn default() -> ModelPatch<F, O>

Returns the “default value” for a type. Read more
Source§

impl<F, O> DerefMut for ModelPatch<F, O>
where F: Fact + Clone + 'static, O: Display + Debug + AsRef<dyn Op> + AsMut<dyn Op> + Clone + 'static,

Source§

fn deref_mut(&mut self) -> &mut Graph<F, O>

Mutably dereferences the value.
Source§

impl<F, O> Deref for ModelPatch<F, O>
where F: Fact + Clone + 'static, O: Display + Debug + AsRef<dyn Op> + AsMut<dyn Op> + Clone + 'static,

Source§

type Target = Graph<F, O>

The resulting type after dereferencing.
Source§

fn deref(&self) -> &Graph<F, O>

Dereferences the value.

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>
where O: Unpin, F: Unpin,

§

impl<F, O> !UnwindSafe for ModelPatch<F, O>

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> Downcast for T
where T: Any,

Source§

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>

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)

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)

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
where T: Any + Send + Sync,

Source§

fn into_any_arc(self: Arc<T>) -> Arc<dyn Any + Sync + Send>

Convert Arc<Trait> (where Trait: Downcast) to Arc<Any>. Arc<Any> can then be further downcast into Arc<ConcreteType> where ConcreteType implements Trait.
Source§

impl<T> DynClone for T
where T: Clone,

Source§

fn __clone_box(&self, _: Private) -> *mut ()

Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

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 more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

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
Source§

impl<P, T> Receiver for P
where P: Deref<Target = T> + ?Sized, T: ?Sized,

Source§

type Target = T

🔬This is a nightly-only experimental API. (arbitrary_self_types)
The target type on which the method may be called.
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<T> CloneAny for T
where T: Any + Clone,