Skip to main content

GemmPlan

Struct GemmPlan 

Source
pub struct GemmPlan<'a> { /* private fields */ }
Expand description

Read-only GEMM decomposition plan for a pairwise contraction step.

§Examples

use tenferro_einsum::{ContractionTree, Subscripts};

let subs = Subscripts::new(&[&[0, 1], &[1, 2]], &[0, 2]);
let tree = ContractionTree::from_pairs(&subs, &[&[2, 3], &[3, 4]], &[(0, 1)]).unwrap();
let gemm = tree.step_plan(0).unwrap().gemm();

assert_eq!(gemm.lhs_gemm_shape(), &[2, 3]);

Implementations§

Source§

impl<'a> GemmPlan<'a>

Source

pub fn left_only_modes(&self) -> &'a [u32]

Return modes present only on the left operand and output.

§Examples
use tenferro_einsum::{ContractionTree, Subscripts};

let subs = Subscripts::new(&[&[0, 1], &[1, 2]], &[0, 2]);
let tree = ContractionTree::from_pairs(&subs, &[&[2, 3], &[3, 4]], &[(0, 1)]).unwrap();
let gemm = tree.step_plan(0).unwrap().gemm();

assert_eq!(gemm.left_only_modes(), &[0]);
Source

pub fn left_only_shape(&self) -> &'a [usize]

Return dimension sizes for Self::left_only_modes.

§Examples
use tenferro_einsum::{ContractionTree, Subscripts};

let subs = Subscripts::new(&[&[0, 1], &[1, 2]], &[0, 2]);
let tree = ContractionTree::from_pairs(&subs, &[&[2, 3], &[3, 4]], &[(0, 1)]).unwrap();
let gemm = tree.step_plan(0).unwrap().gemm();

assert_eq!(gemm.left_only_shape(), &[2]);
Source

pub fn right_only_modes(&self) -> &'a [u32]

Return modes present only on the right operand and output.

§Examples
use tenferro_einsum::{ContractionTree, Subscripts};

let subs = Subscripts::new(&[&[0, 1], &[1, 2]], &[0, 2]);
let tree = ContractionTree::from_pairs(&subs, &[&[2, 3], &[3, 4]], &[(0, 1)]).unwrap();
let gemm = tree.step_plan(0).unwrap().gemm();

assert_eq!(gemm.right_only_modes(), &[2]);
Source

pub fn right_only_shape(&self) -> &'a [usize]

Return dimension sizes for Self::right_only_modes.

§Examples
use tenferro_einsum::{ContractionTree, Subscripts};

let subs = Subscripts::new(&[&[0, 1], &[1, 2]], &[0, 2]);
let tree = ContractionTree::from_pairs(&subs, &[&[2, 3], &[3, 4]], &[(0, 1)]).unwrap();
let gemm = tree.step_plan(0).unwrap().gemm();

assert_eq!(gemm.right_only_shape(), &[4]);
Source

pub fn contracted_modes(&self) -> &'a [u32]

Return modes contracted between the pairwise operands.

§Examples
use tenferro_einsum::{ContractionTree, Subscripts};

let subs = Subscripts::new(&[&[0, 1], &[1, 2]], &[0, 2]);
let tree = ContractionTree::from_pairs(&subs, &[&[2, 3], &[3, 4]], &[(0, 1)]).unwrap();
let gemm = tree.step_plan(0).unwrap().gemm();

assert_eq!(gemm.contracted_modes(), &[1]);
Source

pub fn contracted_shape(&self) -> &'a [usize]

Return dimension sizes for Self::contracted_modes.

§Examples
use tenferro_einsum::{ContractionTree, Subscripts};

let subs = Subscripts::new(&[&[0, 1, 2], &[1, 2, 3]], &[0, 3]);
let tree = ContractionTree::from_pairs(
    &subs,
    &[&[2, 3, 4], &[3, 4, 5]],
    &[(0, 1)],
)
.unwrap();
let gemm = tree.step_plan(0).unwrap().gemm();

assert_eq!(gemm.contracted_shape(), &[3, 4]);
Source

pub fn batch_modes(&self) -> &'a [u32]

Return modes shared by both operands and preserved in the output.

§Examples
use tenferro_einsum::{ContractionTree, Subscripts};

let subs = Subscripts::new(&[&[3, 0, 1], &[1, 2, 3]], &[3, 0, 2]);
let tree = ContractionTree::from_pairs(&subs, &[&[5, 2, 3], &[3, 4, 5]], &[(0, 1)]).unwrap();
let gemm = tree.step_plan(0).unwrap().gemm();

assert_eq!(gemm.batch_modes(), &[3]);
Source

pub fn batch_shape(&self) -> &'a [usize]

Return dimension sizes for Self::batch_modes.

§Examples
use tenferro_einsum::{ContractionTree, Subscripts};

let subs = Subscripts::new(&[&[3, 0, 1], &[1, 2, 3]], &[3, 0, 2]);
let tree = ContractionTree::from_pairs(&subs, &[&[5, 2, 3], &[3, 4, 5]], &[(0, 1)]).unwrap();
let gemm = tree.step_plan(0).unwrap().gemm();

assert_eq!(gemm.batch_shape(), &[5]);
Source

pub fn lhs_target_modes(&self) -> &'a [u32]

Return target mode order for preparing the left GEMM operand.

§Examples
use tenferro_einsum::{ContractionTree, Subscripts};

let subs = Subscripts::new(&[&[0, 1], &[1, 2]], &[0, 2]);
let tree = ContractionTree::from_pairs(&subs, &[&[2, 3], &[3, 4]], &[(0, 1)]).unwrap();
let gemm = tree.step_plan(0).unwrap().gemm();

assert_eq!(gemm.lhs_target_modes(), &[0, 1]);
Source

pub fn rhs_target_modes(&self) -> &'a [u32]

Return target mode order for preparing the right GEMM operand.

§Examples
use tenferro_einsum::{ContractionTree, Subscripts};

let subs = Subscripts::new(&[&[0, 1], &[1, 2]], &[0, 2]);
let tree = ContractionTree::from_pairs(&subs, &[&[2, 3], &[3, 4]], &[(0, 1)]).unwrap();
let gemm = tree.step_plan(0).unwrap().gemm();

assert_eq!(gemm.rhs_target_modes(), &[1, 2]);
Source

pub fn canonical_output_modes(&self) -> &'a [u32]

Return canonical output mode order before any final permutation.

§Examples
use tenferro_einsum::{ContractionTree, Subscripts};

let subs = Subscripts::new(&[&[0, 1], &[1, 2]], &[2, 0]);
let tree = ContractionTree::from_pairs(&subs, &[&[2, 3], &[3, 4]], &[(0, 1)]).unwrap();
let gemm = tree.step_plan(0).unwrap().gemm();

assert_eq!(gemm.canonical_output_modes(), &[0, 2]);
Source

pub fn m(&self) -> usize

Return fused left-only dimension size.

§Examples
use tenferro_einsum::{ContractionTree, Subscripts};

let subs = Subscripts::new(&[&[0, 1], &[1, 2]], &[0, 2]);
let tree = ContractionTree::from_pairs(&subs, &[&[2, 3], &[3, 4]], &[(0, 1)]).unwrap();
let gemm = tree.step_plan(0).unwrap().gemm();

assert_eq!(gemm.m(), 2);
Source

pub fn n(&self) -> usize

Return fused right-only dimension size.

§Examples
use tenferro_einsum::{ContractionTree, Subscripts};

let subs = Subscripts::new(&[&[0, 1], &[1, 2]], &[0, 2]);
let tree = ContractionTree::from_pairs(&subs, &[&[2, 3], &[3, 4]], &[(0, 1)]).unwrap();
let gemm = tree.step_plan(0).unwrap().gemm();

assert_eq!(gemm.n(), 4);
Source

pub fn k(&self) -> usize

Return fused contracted dimension size.

§Examples
use tenferro_einsum::{ContractionTree, Subscripts};

let subs = Subscripts::new(&[&[0, 1], &[1, 2]], &[0, 2]);
let tree = ContractionTree::from_pairs(&subs, &[&[2, 3], &[3, 4]], &[(0, 1)]).unwrap();
let gemm = tree.step_plan(0).unwrap().gemm();

assert_eq!(gemm.k(), 3);
Source

pub fn lhs_gemm_shape(&self) -> &'a [usize]

Return prepared left operand GEMM shape.

§Examples
use tenferro_einsum::{ContractionTree, Subscripts};

let subs = Subscripts::new(&[&[0, 1], &[1, 2]], &[0, 2]);
let tree = ContractionTree::from_pairs(&subs, &[&[2, 3], &[3, 4]], &[(0, 1)]).unwrap();
let gemm = tree.step_plan(0).unwrap().gemm();

assert_eq!(gemm.lhs_gemm_shape(), &[2, 3]);
Source

pub fn rhs_gemm_shape(&self) -> &'a [usize]

Return prepared right operand GEMM shape.

§Examples
use tenferro_einsum::{ContractionTree, Subscripts};

let subs = Subscripts::new(&[&[0, 1], &[1, 2]], &[0, 2]);
let tree = ContractionTree::from_pairs(&subs, &[&[2, 3], &[3, 4]], &[(0, 1)]).unwrap();
let gemm = tree.step_plan(0).unwrap().gemm();

assert_eq!(gemm.rhs_gemm_shape(), &[3, 4]);
Source

pub fn output_gemm_shape(&self) -> &'a [usize]

Return GEMM output shape before expanding fused dimensions.

§Examples
use tenferro_einsum::{ContractionTree, Subscripts};

let subs = Subscripts::new(&[&[0, 1], &[1, 2]], &[0, 2]);
let tree = ContractionTree::from_pairs(&subs, &[&[2, 3], &[3, 4]], &[(0, 1)]).unwrap();
let gemm = tree.step_plan(0).unwrap().gemm();

assert_eq!(gemm.output_gemm_shape(), &[2, 4]);
Source

pub fn expanded_output_shape(&self) -> &'a [usize]

Return expanded output shape in canonical output mode order.

§Examples
use tenferro_einsum::{ContractionTree, Subscripts};

let subs = Subscripts::new(&[&[0, 1], &[1, 2]], &[0, 2]);
let tree = ContractionTree::from_pairs(&subs, &[&[2, 3], &[3, 4]], &[(0, 1)]).unwrap();
let gemm = tree.step_plan(0).unwrap().gemm();

assert_eq!(gemm.expanded_output_shape(), &[2, 4]);
Source

pub fn needs_final_permute(&self) -> bool

Return whether canonical output requires a final permutation.

§Examples
use tenferro_einsum::{ContractionTree, Subscripts};

let subs = Subscripts::new(&[&[0, 1], &[1, 2]], &[2, 0]);
let tree = ContractionTree::from_pairs(&subs, &[&[2, 3], &[3, 4]], &[(0, 1)]).unwrap();
let gemm = tree.step_plan(0).unwrap().gemm();

assert!(gemm.needs_final_permute());

Trait Implementations§

Source§

impl<'a> Clone for GemmPlan<'a>

Source§

fn clone(&self) -> GemmPlan<'a>

Returns a duplicate 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<'a> Debug for GemmPlan<'a>

Source§

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

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

impl<'a> Copy for GemmPlan<'a>

Auto Trait Implementations§

§

impl<'a> Freeze for GemmPlan<'a>

§

impl<'a> RefUnwindSafe for GemmPlan<'a>

§

impl<'a> Send for GemmPlan<'a>

§

impl<'a> Sync for GemmPlan<'a>

§

impl<'a> Unpin for GemmPlan<'a>

§

impl<'a> UnsafeUnpin for GemmPlan<'a>

§

impl<'a> UnwindSafe for GemmPlan<'a>

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
§

impl<T> ByRef<T> for T

§

fn by_ref(&self) -> &T

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
§

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

§

fn rand<T>(&self, rng: &mut (impl Rng + ?Sized)) -> T
where Self: Distribution<T>,

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
§

impl<T> Pointable for T

§

const ALIGN: usize

The alignment of pointer.
§

type Init = T

The type for initializers.
§

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

Initializes a with the given initializer. Read more
§

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

Dereferences the given pointer. Read more
§

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

Mutably dereferences the given pointer. Read more
§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
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.
§

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

§

fn vzip(self) -> V

§

impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
where ST: ?Sized, DT: ?Sized,

§

impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
where ST: ?Sized, DT: ?Sized,

§

impl<T, U> Imply<T> for U
where T: ?Sized, U: ?Sized,

§

impl<T> MaybeSend for T
where T: Send,

§

impl<T> MaybeSendSync for T
where T: Send + Sync,

§

impl<T> MaybeSync for T
where T: Sync,

§

impl<T> Read<Exclusive, BecauseExclusive> for T
where T: ?Sized,