Trait softposit::Quire

pub trait Quire<P> {
type Bits;
    fn init() -> Self;
    fn from_posit(p: P) -> Self;
    fn to_posit(self) -> P;
    fn from_bits(v: Self::Bits) -> Self;
    fn to_bits(&self) -> Self::Bits;
    fn is_zero(&self) -> bool;
    fn is_nar(&self) -> bool;
    fn add_product(&mut self, p_a: P, p_b: P);
    fn sub_product(&mut self, p_a: P, p_b: P);
    fn clear(&mut self);
    fn neg(&mut self);
}

Associated Types

type Bits

Loading content...

Required methods

fn init() -> Self

fn from_posit(p: P) -> Self

fn to_posit(self) -> P

fn from_bits(v: Self::Bits) -> Self

fn to_bits(&self) -> Self::Bits

fn is_zero(&self) -> bool

fn is_nar(&self) -> bool

fn add_product(&mut self, p_a: P, p_b: P)

fn sub_product(&mut self, p_a: P, p_b: P)

fn clear(&mut self)

fn neg(&mut self)

Loading content...

Implementors

impl Quire<P16E1> for Q16E1

type Bits = [u64; 2]

fn init() -> Self

fn from_posit(p: P16E1) -> Self

fn to_posit(self) -> P16E1

fn from_bits(v: Self::Bits) -> Self

fn to_bits(&self) -> Self::Bits

fn is_zero(&self) -> bool

fn is_nar(&self) -> bool

fn add_product(&mut self, p_a: P16E1, p_b: P16E1)

fn sub_product(&mut self, p_a: P16E1, p_b: P16E1)

fn clear(&mut self)

fn neg(&mut self)

impl Quire<P32E2> for Q32E2

type Bits = [u64; 8]

fn init() -> Self

fn from_posit(p: P32E2) -> Self

fn to_posit(self) -> P32E2

fn from_bits(v: Self::Bits) -> Self

fn to_bits(&self) -> Self::Bits

fn is_zero(&self) -> bool

fn is_nar(&self) -> bool

fn add_product(&mut self, p_a: P32E2, p_b: P32E2)

fn sub_product(&mut self, p_a: P32E2, p_b: P32E2)

fn clear(&mut self)

fn neg(&mut self)

impl Quire<P8E0> for Q8E0

type Bits = u32

fn init() -> Self

fn from_posit(p: P8E0) -> Self

fn to_posit(self) -> P8E0

fn from_bits(v: Self::Bits) -> Self

fn to_bits(&self) -> Self::Bits

fn is_zero(&self) -> bool

fn is_nar(&self) -> bool

fn add_product(&mut self, p_a: P8E0, p_b: P8E0)

fn sub_product(&mut self, p_a: P8E0, p_b: P8E0)

fn clear(&mut self)

fn neg(&mut self)

Loading content...