Struct rustc_type_ir::search_graph::CycleHeads

struct CycleHeads {
    heads: BTreeSet<StackDepth>,
}

All cycle heads a given goal depends on, ordered by their stack depth.

We therefore pop the cycle heads from highest to lowest.

Fields

heads: BTreeSet<StackDepth>

Implementations

impl CycleHeads

fn is_empty(&self) -> bool

fn highest_cycle_head(&self) -> StackDepth

fn opt_highest_cycle_head(&self) -> Option<StackDepth>

fn opt_lowest_cycle_head(&self) -> Option<StackDepth>

fn remove_highest_cycle_head(&mut self)

fn insert(&mut self, head: StackDepth)

fn merge(&mut self, heads: &CycleHeads)

fn extend_from_child(&mut self, this: StackDepth, child: &CycleHeads)

Update the cycle heads of a goal at depth this given the cycle heads of a nested goal. This merges the heads after filtering the parent goal itself.

Trait Implementations

impl Clone for CycleHeads

fn clone(&self) -> CycleHeads

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for CycleHeads

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

Formats the value using the given formatter.

impl Default for CycleHeads

fn default() -> CycleHeads

Returns the “default value” for a type.

impl PartialEq for CycleHeads

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

impl StructuralPartialEq for CycleHeads

Layout

Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.

Size: 24 bytes