Lints and docs

src/internal/partial_solution.rs

@@ -67,6 +67,10 @@ pub(crate) struct PartialSolution<DP: DependencyProvider> {
     /// The undecided packages order by their `Priority`.
     ///
     /// The max heap allows quickly `pop`ing the highest priority package.
+    ///
+    /// The `Reverse<u32>` is the discovery order of packages used as tiebreaker. Its order is that
+    /// of a breadth-first search.
+    #[allow(clippy::type_complexity)]
     prioritized_potential_packages:
         PriorityQueue<Id<DP::P>, (DP::Priority, Reverse<u32>), BuildHasherDefault<FxHasher>>,
     /// Whether we have never backtracked, to enable fast path optimizations.

src/solver.rs

@@ -325,9 +325,9 @@ pub trait DependencyProvider {
     ///
     /// The `package_conflicts_counts` argument provides access to some other heuristics that
     /// are production users have found useful. Although the exact meaning/efficacy of those arguments may change.
-    /// 
+    ///
     /// If two packages have the same priority, PubGrub will biased toward a breadth first search.
-    /// 
+    ///
     /// Note: the resolver may call this even when the range has not changed,
     /// if it is more efficient for the resolvers internal data structures.
     fn prioritize(