From bda2b8178205362ebf3e35abaf68077cc038ef14 Mon Sep 17 00:00:00 2001 From: konstin Date: Thu, 19 Dec 2024 09:43:34 +0100 Subject: [PATCH] Lints and docs --- src/internal/partial_solution.rs | 4 ++++ src/solver.rs | 4 ++-- 2 files changed, 6 insertions(+), 2 deletions(-) diff --git a/src/internal/partial_solution.rs b/src/internal/partial_solution.rs index ba9750e2..f1345634 100644 --- a/src/internal/partial_solution.rs +++ b/src/internal/partial_solution.rs @@ -67,6 +67,10 @@ pub(crate) struct PartialSolution { /// The undecided packages order by their `Priority`. /// /// The max heap allows quickly `pop`ing the highest priority package. + /// + /// The `Reverse` 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, (DP::Priority, Reverse), BuildHasherDefault>, /// Whether we have never backtracked, to enable fast path optimizations. diff --git a/src/solver.rs b/src/solver.rs index d7802656..7c4ed0f8 100644 --- a/src/solver.rs +++ b/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(