Module rustc_data_structures::transitive_relation[][src]

🔬 This is a nightly-only experimental API. (rustc_private)

this crate is being loaded from the sysroot, an unstable location; did you mean to load this crate from crates.io via Cargo.toml instead?

Re-exports

use bitvec::BitMatrix;
use fx::FxHashMap;
use fx::FxHashMap;
use sync::Lock;
use rustc_serialize::Encodable;
use rustc_serialize::Encoder;
use rustc_serialize::Decodable;
use rustc_serialize::Decoder;
use stable_hasher::HashStable;
use stable_hasher::StableHasher;
use stable_hasher::StableHasherResult;
use std::fmt::Debug;
use std::hash::Hash;
use std::mem;

Structs

Edge [
Experimental
]
Index [
Experimental
]
TransitiveRelation [
Experimental
]

Functions

pare_down [
Experimental
]

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.