Enum Force 

pub enum Force {
    Table,
    Tree,
    Walk,
}

A shape forced on every switch, which is what -Zswitch= asks for.

For measuring and for nothing else. Section 24.7 asks what each shape costs on a hot switch, and the only way to know what a table would have cost where a tree was chosen is to build the table. A bit test is not one of these, since it holds three destinations inside one word and a switch hot enough to be worth measuring is neither.

Variants

Table

One jump table over every case, when their span is at most FORCED_CELLS.

Tree

A binary search all the way down to single clusters, with no table and no bit test.

Walk

Every cluster tested one after another, with no table and no bit test.

Implementations

impl Force

pub fn named(name: &str) -> Option<Self>

The shape a -Zswitch= argument names, which is table, tree or walk.

Trait Implementations

impl Clone for Force

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for Force

impl Debug for Force

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

Formats the value using the given formatter.

impl Eq for Force

impl PartialEq for Force

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for Force