Struct Lowered 

pub struct Lowered {
    pub cases: usize,
    pub clusters: usize,
    pub tables: usize,
    pub bits: usize,
    pub searched: bool,
    pub peeled: bool,
}

What one switch became, which is what -fopt-info says about it.

Fields

cases: usize

How many case labels it had, not counting the default.

clusters: usize

How many clusters those fell into, with a table or a bit test counting as one.

tables: usize

How many of the clusters are jump tables.

bits: usize

How many are bit tests.

searched: bool

Whether the clusters are searched rather than tested one after another.

peeled: bool

Whether a hot case was tested on its own ahead of the rest.

Implementations

impl Lowered

pub fn shape(&self) -> &'static str

One word for the shape, in gcc’s terms: a table when any part of it is one, then a bit test, then a tree or a walk.

A switch is a partition and can be several of these at once. The word names the part that decides what it costs, which is what a comparison with gcc’s choice wants, and the counts in Lowered::describe say the rest.

pub fn describe(&self) -> String

The remark, as -fopt-info prints it after the function’s name.

Trait Implementations

impl Clone for Lowered

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 Lowered

impl Debug for Lowered

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

Formats the value using the given formatter.

impl Eq for Lowered

impl PartialEq for Lowered

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for Lowered