Struct UniqueCrateData

pub struct UniqueCrateData { /* private fields */ }

The crate data from which we derive the Crate.

We want this to contain as little data as possible, because if it contains dependencies and something changes, this crate and all of its dependencies ids are invalidated, which causes pretty much everything to be recomputed. If the crate id is not invalidated, only this crate’s information needs to be recomputed.

Most different crates have different root files (actually, pretty much all of them). Still, it is possible to have crates distinguished by other factors (e.g. dependencies). So we store only the root file - unless we find that this crate has the same root file as another crate, in which case we store all data for one of them (if one is a dependency of the other, we store for it, because it has more dependencies to be invalidated).

Trait Implementations

impl Clone for UniqueCrateData

fn clone(&self) -> UniqueCrateData

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for UniqueCrateData

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

Formats the value using the given formatter.

impl Hash for UniqueCrateData

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for UniqueCrateData

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

impl StructuralPartialEq for UniqueCrateData