pub struct ScaleBindings<C: Coordinates, R: Runtime> { /* private fields */ }Expand description
The scale bindings of a quantized view, one per scheme level.
Only the block scales are addressed per position, so they bind as a view; the per-tensor scale of a two-level scheme covers the whole tensor and binds as a buffer holding its one scale in the first element, read once per kernel as f32.
Implementations§
Source§impl<C: Coordinates, R: Runtime> ScaleBindings<C, R>
impl<C: Coordinates, R: Runtime> ScaleBindings<C, R>
Sourcepub fn two(scales: ViewArg<C, R>, global_scale: BufferArg<R>) -> Self
pub fn two(scales: ViewArg<C, R>, global_scale: BufferArg<R>) -> Self
The bindings of a two-level scheme: the block scales and the per-tensor scale they are normalized against.
Sourcepub fn lookup(scales: ViewArg<C, R>, table: BufferArg<R>) -> Self
pub fn lookup(scales: ViewArg<C, R>, table: BufferArg<R>) -> Self
The bindings of a one-level lookup scheme
(QuantMode::Lookup): the scales and the
table each stored field indexes, so a read reconstructs table[field] * scale.
table must hold 2^bits f32 entries — registration checks its length against the
scheme, and the unpack’s mask bounds every index to that range.
Sourcepub fn len(&self) -> usize
pub fn len(&self) -> usize
The number of bound scale levels, matched against the scheme’s at construction: the
inner binding plus the global scale when bound. The lookup table is not a level and is
never counted; its presence is checked against the scheme’s mode instead
(quant::check_table_bindings).
Auto Trait Implementations§
impl<C, R> !RefUnwindSafe for ScaleBindings<C, R>
impl<C, R> !UnwindSafe for ScaleBindings<C, R>
impl<C, R> Freeze for ScaleBindings<C, R>
impl<C, R> Send for ScaleBindings<C, R>
impl<C, R> Sync for ScaleBindings<C, R>
impl<C, R> Unpin for ScaleBindings<C, R>
impl<C, R> UnsafeUnpin for ScaleBindings<C, R>where
<C as CubeType>::ExpandType: Sized,
Box<ViewArg<C, R>>: UnsafeUnpin,
Option<BufferArg<R>>: UnsafeUnpin,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
Source§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>, which can then be
downcast into Box<dyn ConcreteType> where ConcreteType implements Trait.Source§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Rc<Trait> (where Trait: Downcast) to Rc<Any>, which can then be further
downcast into Rc<ConcreteType> where ConcreteType implements Trait.Source§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
&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)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
&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> DowncastSend for T
impl<T> DowncastSend for T
Source§impl<T> DowncastSync for T
impl<T> DowncastSync for T
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
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 moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
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