GoldschmidtDivision

Struct GoldschmidtDivision 

Source
pub struct GoldschmidtDivision {
    pub iterations: u64,
    pub denominator_cap_2k: u64,
}
Expand description

A structure that defines the custom operation GoldSchmidtDivision that computes division of two numbers via the Goldschmidt method.

In particular, this operation computes an approximation of 2denominator_cap_2k divdend / divisor.

Inputs must be of the scalar type UINT64 or INT64 and be in (0, 2denominator_cap_2k - 1) range. The divisor is also assumed to be small enough (less than 232), otherwise integer overflows are possible, yielding incorrect results.

Optionally, an initial approximation for the Goldschmidt method can be provided. In this case, the operation might be faster and of lower depth, however, it must be guaranteed that 2denominator_cap_2k - 1 <= input * initial_approximation < 2denominator_cap_2k + 1.

§Custom operation arguments

  • Node containing an unsigned or signed 64-bit array or scalar as the dividend.
  • Node containing an unsigned or signed 64-bit array or scalar as the divisor.
  • Negative values are currently unsupported as sign extraction is quite expensive
  • (optional) Node containing an array or scalar that serves as an initial approximation of the GoldSchmidt method

§Custom operation returns

New GoldschmidtDivision node

§Example

let c = create_context().unwrap();
let g = c.create_graph().unwrap();
let t = array_type(vec![2, 3], UINT64);
let dividend = g.input(t.clone()).unwrap();
let divisor = g.input(t.clone()).unwrap();
let guess_n = g.input(t.clone()).unwrap();
let n2 = g.custom_op(CustomOperation::new(GoldschmidtDivision {iterations: 10, denominator_cap_2k: 4}), vec![dividend,divisor, guess_n]).unwrap();

Fields§

§iterations: u64

Number of iterations of the Goldschmidt method; rule of thumb is to set it to 1 + log(denominator_cap_2k)

§denominator_cap_2k: u64

Number of output bits that are approximated

Trait Implementations§

Source§

impl CustomOperationBody for GoldschmidtDivision

Source§

fn instantiate( &self, context: Context, arguments_types: Vec<Type>, ) -> Result<Graph>

Defines the logic of a custom operation. Read more
Source§

fn get_name(&self) -> String

Specifies and returns the name of this custom operation. Read more
Source§

impl Debug for GoldschmidtDivision

Source§

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

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

impl<'de> Deserialize<'de> for GoldschmidtDivision

Source§

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>
where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer. Read more
Source§

impl Hash for GoldschmidtDivision

Source§

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

Feeds this value into the given Hasher. Read more
1.3.0 · Source§

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

Feeds a slice of this type into the given Hasher. Read more
Source§

impl PartialEq for GoldschmidtDivision

Source§

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

Tests for self and other values to be equal, and is used by ==.
1.0.0 · Source§

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

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

impl Serialize for GoldschmidtDivision

Source§

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

Serialize this value into the given Serde serializer. Read more
Source§

impl Eq for GoldschmidtDivision

Source§

impl StructuralPartialEq for GoldschmidtDivision

Auto Trait Implementations§

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
Source§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

Source§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
Source§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

Source§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
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> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<T> Serialize for T
where T: Serialize + ?Sized,

Source§

fn erased_serialize(&self, serializer: &mut dyn Serializer) -> Result<(), Error>

Source§

fn do_erased_serialize( &self, serializer: &mut dyn Serializer, ) -> Result<(), ErrorImpl>

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.
Source§

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

Source§

fn vzip(self) -> V

Source§

impl<T> DeserializeOwned for T
where T: for<'de> Deserialize<'de>,