Struct LatentCode 

pub struct LatentCode {
    pub vector: Vec<f32>,
}

Latent code representation (vector in latent space)

Fields

vector: Vec<f32>

The latent vector

Implementations

impl LatentCode

pub fn new(vector: Vec<f32>) -> Self

Create a new latent code from a vector

pub fn sample<R: Rng>(rng: &mut R, dim: usize) -> Self

Sample from standard normal distribution using Box-Muller transform

pub fn dim(&self) -> usize

Dimension of the latent code

pub fn lerp(&self, other: &Self, t: f32) -> Self

Linear interpolation between two latent codes

pub fn slerp(&self, other: &Self, t: f32) -> Self

Spherical linear interpolation between two latent codes

pub fn norm(&self) -> f32

Compute L2 norm

pub fn normalize(&self) -> Self

Normalize to unit length

Trait Implementations

impl Clone for LatentCode

fn clone(&self) -> LatentCode

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for LatentCode

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

Formats the value using the given formatter.

impl PartialEq for LatentCode

fn eq(&self, other: &LatentCode) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for LatentCode