pub struct FocusMap {
pub review_here: Vec<FocusUnit>,
pub deprioritized: Vec<FocusUnit>,
}Expand description
The weighted focus map: the ranked review-here units plus the FULL
deprioritized escape-hatch list, so nothing is hidden.
Completeness invariant (the escape-hatch done-condition): the two lists
partition the unit set, so review_here.len() + deprioritized.len() equals
the total unit count by construction.
Fields§
§review_here: Vec<FocusUnit>Units labeled review-here, ranked by composite score (descending), ties
broken by path for determinism.
deprioritized: Vec<FocusUnit>EVERY de-prioritized unit (not-prioritized, plus runtime-backed skip
units on the paid path) – the escape hatch. Always present and fully
enumerated so a reviewer can always “show me what you de-prioritized”; the
human brief collapses it by default and re-expands under
--show-deprioritized. Nothing is ever hidden, including a skip.
Implementations§
Trait Implementations§
Auto Trait Implementations§
impl Freeze for FocusMap
impl RefUnwindSafe for FocusMap
impl Send for FocusMap
impl Sync for FocusMap
impl Unpin for FocusMap
impl UnsafeUnpin for FocusMap
impl UnwindSafe for FocusMap
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more