Enum FinalAdd 

pub enum FinalAdd {
    PrefixTree,
    Native,
}

How the two words a sum’s compressor tree leaves are added.

Variants

PrefixTree

A Kogge-Stone prefix network written out in bitwise ops: no op more than one gate deep, so a register can sit inside the add.

Native

One add, left to synthesis, which picks the adder the clock needs (on standard cells, a smaller one than the widest prefix network wherever the clock allows).

Trait Implementations

impl Clone for FinalAdd

fn clone(&self) -> FinalAdd

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for FinalAdd

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

Formats the value using the given formatter.

impl PartialEq for FinalAdd

fn eq(&self, other: &FinalAdd) -> 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 Copy for FinalAdd

impl Eq for FinalAdd

impl StructuralPartialEq for FinalAdd