Enum cargo::core::resolver::conflict_cache::ConflictStoreTrie

enum ConflictStoreTrie {
    Leaf(BTreeMap<PackageId, ConflictReason>),
    Node(BTreeMap<PackageId, ConflictStoreTrie>),
}

This is a trie for storing a large number of sets designed to efficiently see if any of the stored sets are a subset of a search set.

Variants

Leaf(BTreeMap<PackageId, ConflictReason>)

One of the stored sets.

Node(BTreeMap<PackageId, ConflictStoreTrie>)

A map from an element to a subtrie where all the sets in the subtrie contains that element.

Implementations

impl ConflictStoreTrie

fn find( &self, is_active: &impl Fn(PackageId) -> Option<usize>, must_contain: Option<PackageId>, max_age: usize, ) -> Option<(&BTreeMap<PackageId, ConflictReason>, usize)>

Finds any known set of conflicts, if any, where all elements return some from is_active and contain PackageId specified. If more than one are activated, then it will return one that will allow for the most jump-back.

fn insert( &mut self, iter: impl Iterator<Item = PackageId>, con: BTreeMap<PackageId, ConflictReason>, )

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

Size for each variant:

• Leaf: 24 bytes
• Node: 24 bytes