Struct AffineQuantization

pub struct AffineQuantization<E: Float + Send + Sync, Q: PrimInt + Send + Sync, A: PrimInt> {
    pub scale: E,
    pub offset: Q,
    /* private fields */
}

Affine quantization scheme.

Note that the accumulation type A should have a bigger range than quantized type Q.

Fields

scale: E

The scaling factor.

offset: Q

The zero-point offset.

Implementations

impl<E: Float + Send + Sync, Q: PrimInt + Send + Sync, A: PrimInt> AffineQuantization<E, Q, A>

pub fn init(scale: E, offset: Q) -> Self

Initialize an affine quantization scheme with the given parameters.

Trait Implementations

impl<E: Clone + Float + Send + Sync, Q: Clone + PrimInt + Send + Sync, A: Clone + PrimInt> Clone for AffineQuantization<E, Q, A>

fn clone(&self) -> AffineQuantization<E, Q, A>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<E: Debug + Float + Send + Sync, Q: Debug + PrimInt + Send + Sync, A: Debug + PrimInt> Debug for AffineQuantization<E, Q, A>

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

Formats the value using the given formatter.

impl<'de, E, Q, A: PrimInt> Deserialize<'de> for AffineQuantization<E, Q, A>

where E: Deserialize<'de> + Float + Send + Sync, Q: Deserialize<'de> + PrimInt + Send + Sync,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<E: Float + Send + Sync, Q: PrimInt + Hash + Send + Sync, A: PrimInt> Hash for AffineQuantization<E, Q, A>

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<E: Float + Send + Sync, Q: PrimInt + Send + Sync, A: PrimInt> PartialEq for AffineQuantization<E, Q, A>

fn eq(&self, other: &Self) -> 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<E: Float + Send + Sync, Q: PrimInt + Send + Sync, A: PrimInt + Send + Sync> Quantization<E, Q> for AffineQuantization<E, Q, A>

fn new(alpha: E, beta: E) -> Self

Create a new quantization scheme for an input range [alpha, beta].

fn quantize(&self, values: &[E]) -> Vec<Q>

Convert the values to a lower precision data type.

fn dequantize(&self, values: &[Q]) -> Vec<E>

Convert the values back to a higher precision data type.

impl<E, Q, A: PrimInt> Serialize for AffineQuantization<E, Q, A>

where E: Serialize + Float + Send + Sync, Q: Serialize + PrimInt + Send + Sync,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<E: Copy + Float + Send + Sync, Q: Copy + PrimInt + Send + Sync, A: Copy + PrimInt> Copy for AffineQuantization<E, Q, A>

impl<E: Float + Send + Sync, Q: PrimInt + Send + Sync, A: PrimInt> Eq for AffineQuantization<E, Q, A>