pub struct RegistryQueryer<'a> {
    pub registry: &'a mut (dyn Registry + 'a),
    replacements: &'a [(PackageIdSpec, Dependency)],
    version_prefs: &'a VersionPreferences,
    minimal_versions: bool,
    max_rust_version: Option<RustVersion>,
    registry_cache: HashMap<(Dependency, bool), Poll<Rc<Vec<Summary>>>>,
    summary_cache: HashMap<(Option<PackageId>, Summary, ResolveOpts), (Rc<(HashSet<InternedString>, Rc<Vec<(Dependency, Rc<Vec<Summary>>, Rc<BTreeSet<InternedString>>)>>)>, bool)>,
    used_replacements: HashMap<PackageId, Summary>,
}

Fields§

§registry: &'a mut (dyn Registry + 'a)§replacements: &'a [(PackageIdSpec, Dependency)]§version_prefs: &'a VersionPreferences§minimal_versions: bool

If set the list of dependency candidates will be sorted by minimal versions first. That allows cargo update -Z minimal-versions which will specify minimum dependency versions to be used.

§max_rust_version: Option<RustVersion>§registry_cache: HashMap<(Dependency, bool), Poll<Rc<Vec<Summary>>>>

a cache of Candidates that fulfil a Dependency (and whether first_minimal_version)

§summary_cache: HashMap<(Option<PackageId>, Summary, ResolveOpts), (Rc<(HashSet<InternedString>, Rc<Vec<(Dependency, Rc<Vec<Summary>>, Rc<BTreeSet<InternedString>>)>>)>, bool)>

a cache of Dependencys that are required for a Summary

HACK: first_minimal_version is not kept in the cache key is it is 1:1 with parent.is_none() (the first element of the cache key) as it doesn’t change through execution.

§used_replacements: HashMap<PackageId, Summary>

all the cases we ended up using a supplied replacement

Implementations§

source§

impl<'a> RegistryQueryer<'a>

source

pub fn new( registry: &'a mut dyn Registry, replacements: &'a [(PackageIdSpec, Dependency)], version_prefs: &'a VersionPreferences, minimal_versions: bool, max_rust_version: Option<&RustVersion> ) -> Self

source

pub fn reset_pending(&mut self) -> bool

source

pub fn used_replacement_for( &self, p: PackageId ) -> Option<(PackageId, PackageId)>

source

pub fn replacement_summary(&self, p: PackageId) -> Option<&Summary>

source

pub fn query( &mut self, dep: &Dependency, first_minimal_version: bool ) -> Poll<CargoResult<Rc<Vec<Summary>>>>

Queries the registry to return a list of candidates for dep.

This method is the location where overrides are taken into account. If any candidates are returned which match an override then the override is applied by performing a second query for what the override should return.

source

pub fn build_deps( &mut self, cx: &Context, parent: Option<PackageId>, candidate: &Summary, opts: &ResolveOpts, first_minimal_version: bool ) -> ActivateResult<Rc<(HashSet<InternedString>, Rc<Vec<(Dependency, Rc<Vec<Summary>>, Rc<BTreeSet<InternedString>>)>>)>>

Find out what dependencies will be added by activating candidate, with features described in opts. Then look up in the registry the candidates that will fulfil each of these dependencies, as it is the next obvious question.

Auto Trait Implementations§

§

impl<'a> !RefUnwindSafe for RegistryQueryer<'a>

§

impl<'a> !Send for RegistryQueryer<'a>

§

impl<'a> !Sync for RegistryQueryer<'a>

§

impl<'a> Unpin for RegistryQueryer<'a>

§

impl<'a> !UnwindSafe for RegistryQueryer<'a>

Blanket Implementations§

source§

impl<T> Any for Twhere T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T> Instrument for T

source§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
source§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
source§

impl<T, U> Into<U> for Twhere U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> Same<T> for T

§

type Output = T

Should always be Self
source§

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<V, T> VZip<V> for Twhere V: MultiLane<T>,

§

fn vzip(self) -> V

source§

impl<T> WithSubscriber for T

source§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
source§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more

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: 248 bytes