Struct burn_tensor::container::TensorContainer

impl<B, ID> TensorContainer<B, ID>where B: Backend, ID: Hash + PartialEq + Eq,

pub fn new() -> Self

Create an empty container.

pub fn get<const D: usize>(&self, id: &ID) -> Option<Tensor<B, D>>

Get a tensor with the given ID.

pub fn register<const D: usize>(&mut self, id: ID, value: Tensor<B, D>)

Register a new tensor for the given ID.

Notes

If a tensor is already registered for the given ID, it will be replaced.

pub fn remove<const D: usize>(&mut self, id: &ID) -> Option<Tensor<B, D>>

Remove a tensor for the given ID and returns it.

pub fn len(&self) -> usize

The number of tensors registered.

pub fn is_empty(&self) -> bool

If any tensor is contained.

Trait Implementations§

impl<B: Debug + Backend, ID: Debug> Debug for TensorContainer<B, ID>

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

Formats the value using the given formatter. Read more

impl<B, ID> Default for TensorContainer<B, ID>where B: Backend, ID: Hash + PartialEq + Eq,

fn default() -> Self

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

Auto Trait Implementations§

impl<B, ID> !UnwindSafe for TensorContainer<B, ID>

Blanket Implementations§

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

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

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

const: unstable · source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

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

const: unstable · source§

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

Mutably borrows from an owned value. Read more

impl<T> From<T> for T

const: unstable · source§

fn from(t: T) -> T

Returns the argument unchanged.

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

const: unstable · 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.

impl<T> Same<T> for T

type Output = T

Should always be Self

impl<SS, SP> SupersetOf<SS> for SPwhere SS: SubsetOf<SP>,

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.

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

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source§

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

Performs the conversion.

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

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source§

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

Performs the conversion.

impl<V, T> VZip<V> for Twhere V: MultiLane<T>,