Shortest accepted refresh_period. A zero period makes the sweep loop rebuild every cached
multi-hop path back to back, keeping the selector and resolver continuously busy.
Records a diversity transition and logs it once: a WARN when a key first collapses to a single
relayer, an INFO when it first recovers. Idempotent across repeated rebuilds of the same state,
so the WARN fires on the transition, not on every rebuild.
Zeroes every weight below PLAUSIBLE_WEIGHT_FRACTION of the best, so that a weighted draw over
weights never lands on a candidate the weights all but reject.
Gives every rebuilt collection a new process-local ID before any dictionary records are emitted.
All production rebuilds and test-created replacements use this constructor; cache hits reuse the
pair through its Arc. The counter is shared across planners to keep their logs unambiguous.
An exploring draw: uniform over the candidates whose weight is at least
PLAUSIBLE_WEIGHT_FRACTION of the best, and over the others only when allow_implausible
grants it (it is asked only when the draw lands on one).
The weight a candidate is drawn by, as the walk valued it, tempered to spread the draws over
relayers (see PathPlannerConfig::return_path_weight_temper), relayer health included.
A share of loops that must return, in (0.0, 1.0]: zero is met by any relay returning the odd loop, which
is what a dropping relay does, so it would never starve one.
A sweep that runs less often than entries expire never reaches them: the sweep walks live entries
only, so an expired one is refilled on demand, and a refill that finds no paths is PathNotFound
where a refreshed entry would have kept its previous weights.
A dictionary key paired with the immutable collection it identifies. IDs do not order cache
updates: pointer equality below remains the authority for rejecting stale refreshes.