Skip to main content

LazyExecutor

Struct LazyExecutor 

Source
pub struct LazyExecutor { /* private fields */ }
Expand description

A lazy executor that caches computed tensors by node index.

All tensor operations are delegated to an inner Scirs2Exec; the cache layer sits above it and avoids redundant work when the same node is requested multiple times (e.g. during iterative training with a static graph).

Implementations§

Source§

impl LazyExecutor

Source

pub fn new() -> Self

Create a new LazyExecutor with an empty cache.

Source

pub fn with_capacity(capacity: usize) -> Self

Create a LazyExecutor with a pre-allocated cache capacity.

Source

pub fn invalidate_cache(&mut self)

Discard all cached tensors.

Source

pub fn invalidate_node(&mut self, node_id: usize)

Remove a single node from the cache. The next access to that node will be a miss and will increment tensors_recomputed.

Source

pub fn stats(&self) -> &LazyStats

Read-only reference to the accumulated statistics.

Source

pub fn memory_estimate_for(&self, graph: &EinsumGraph) -> usize

Rough total memory estimate for all tensors currently held by graph.

Computed as number_of_nodes * average_cached_tensor_size — a simple heuristic based on what is already in the cache.

Source

pub fn cached_count(&self) -> usize

Number of tensors currently in the cache.

Source§

impl LazyExecutor

Source

pub fn get_cached(&mut self, node_id: usize) -> Option<Scirs2Tensor>

Retrieve a cached tensor for the given node index (if available).

This is the primary entry-point for lazy graph traversal: call this before scheduling a node for execution. On a hit the value is returned without calling any inner operations.

Source

pub fn put_cached(&mut self, node_id: usize, tensor: Scirs2Tensor)

Store a tensor result for a node. Subsequent calls to get_cached(node_id) will return this value.

Source

pub fn inner_mut(&mut self) -> &mut Scirs2Exec

Access the inner Scirs2Exec (e.g. to register input tensors).

Trait Implementations§

Source§

impl Default for LazyExecutor

Source§

fn default() -> Self

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

impl TlAutodiff for LazyExecutor

Source§

fn forward(&mut self, graph: &EinsumGraph) -> Result<Self::Tensor, Self::Error>

Execute the forward pass, caching every node output.

Node outputs are stored in self.cache keyed by their index in graph.nodes so that subsequent forward calls on the same (or an overlapping) graph reuse already-computed tensors.

Source§

fn backward( &mut self, graph: &EinsumGraph, loss: &Self::Tensor, ) -> Result<Self::Tape, Self::Error>

Execute the backward pass, delegating to the inner executor.

Source§

type Tape = ForwardTape

Source§

impl TlExecutor for LazyExecutor

Source§

type Tensor = ArrayBase<OwnedRepr<f64>, Dim<IxDynImpl>>

Source§

type Error = ExecutorError

Source§

fn einsum( &mut self, spec: &str, inputs: &[Self::Tensor], ) -> Result<Self::Tensor, Self::Error>

Execute an einsum operation on input tensors.
Source§

fn elem_op( &mut self, op: ElemOp, x: &Self::Tensor, ) -> Result<Self::Tensor, Self::Error>

Apply an element-wise unary operation.
Source§

fn elem_op_binary( &mut self, op: ElemOp, x: &Self::Tensor, y: &Self::Tensor, ) -> Result<Self::Tensor, Self::Error>

Apply an element-wise binary operation.
Source§

fn reduce( &mut self, op: ReduceOp, x: &Self::Tensor, axes: &[usize], ) -> Result<Self::Tensor, Self::Error>

Reduce a tensor along specified axes.

Auto Trait Implementations§

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> 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<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. 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<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V