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

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§

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.

Auto Trait Implementations§

Blanket Implementations§

Gets the TypeId of self. Read more
Immutably borrows from an owned value. Read more
Mutably borrows from an owned value. Read more

Returns the argument unchanged.

Calls U::from(self).

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

Should always be Self
The type returned in the event of a conversion error.
Performs the conversion.
The type returned in the event of a conversion error.
Performs the conversion.

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