Module transitive_relation 

Re-exports

use std::fmt::Debug; 🔒

use std::fmt::Debug; 🔒

use std::hash::Hash; 🔒

use std::hash::Hash; 🔒

use std::mem; 🔒

use std::ops::Deref; 🔒

use rustc_index::bit_set::BitMatrix; 🔒

use crate::frozen::Frozen; 🔒

use crate::fx::FxHashSet; 🔒

use crate::fx::FxIndexSet; 🔒

Structs

Edge 🔒

Index 🔒

TransitiveRelation

TransitiveRelationBuilder

Functions

pare_down 🔒

Pare down is used as a step in the LUB computation. It edits the candidates array in place by removing any element j for which there exists an earlier element i<j such that i -> j. That is, after you run pare_down, you know that for all elements that remain in candidates, they cannot reach any of the elements that come after them.