keyhog-scanner 0.5.50

//! Match resolution: when multiple detectors match the same region, keep only
//! the most specific, highest-confidence match. Eliminates duplicates.

use std::collections::{BTreeMap, HashMap, HashSet};
use std::sync::{Arc, LazyLock};

use keyhog_core::RawMatch;

const NAMED_DUPLICATE_LINE_DISTANCE: usize = 2;
const SINGLE_MATCH_COUNT: usize = 1;
const PRIORITY_EPSILON: f64 = 1e-9;
const ENTROPY_MATCH_PRIORITY: f64 = 0.0;
const NAMED_DETECTOR_PRIORITY: f64 = 10.0;
const CONFIDENCE_WEIGHT: f64 = 5.0;
const MAX_CREDENTIAL_PRIORITY_LENGTH: usize = 200;
const CREDENTIAL_LENGTH_WEIGHT: f64 = 0.01;
const KNOWN_PREFIX_SERVICE_BONUS: f64 = 5.0;
const DECODED_EVIDENCE_PRIORITY: f64 = 1.0;

/// Resolve overlapping matches: for each credential text region,
/// keep only the best match. Also suppress duplicate entropy findings when
/// a named detector already covers the same evidence nearby.
pub fn resolve_matches(matches: Vec<RawMatch>) -> Vec<RawMatch> {
    match try_resolve_matches(matches) {
        Ok(resolved) => resolved,
        Err(error) => {
            panic!(
                "detector classification policy is invalid during match resolution: {error}. Fix: correct the affected detector TOML in detectors/"
            );
        }
    }
}

/// Checked match resolution for operator paths that must report rule failures
/// instead of aborting through the compatibility API.
pub fn try_resolve_matches(mut matches: Vec<RawMatch>) -> Result<Vec<RawMatch>, String> {
    let resolution = embedded_resolution_index()?;
    try_resolve_matches_with_policy(
        &mut matches,
        ResolutionPolicy::Embedded {
            resolution,
            private_key_block_detectors: None,
        },
    )?;
    Ok(matches)
}

/// Compatibility resolver with a caller-supplied private-key-block family.
/// Production scanners use their complete compiled detector plan instead.
pub fn try_resolve_matches_with_private_key_blocks(
    mut matches: Vec<RawMatch>,
    private_key_block_detectors: &HashSet<String>,
) -> Result<Vec<RawMatch>, String> {
    let resolution = embedded_resolution_index()?;
    try_resolve_matches_with_policy(
        &mut matches,
        ResolutionPolicy::Embedded {
            resolution,
            private_key_block_detectors: Some(private_key_block_detectors),
        },
    )?;
    Ok(matches)
}

pub(crate) fn try_resolve_matches_with_compiled_plan(
    mut matches: Vec<RawMatch>,
    detector_plans: &crate::detector_plan::CompiledDetectorPlans,
) -> Result<Vec<RawMatch>, String> {
    try_resolve_matches_with_policy(&mut matches, ResolutionPolicy::Active(detector_plans))?;
    Ok(matches)
}

#[derive(Clone, Copy)]
enum ResolutionPolicy<'a> {
    Embedded {
        resolution: &'a crate::detector_plan::DetectorResolutionIndex,
        private_key_block_detectors: Option<&'a HashSet<String>>,
    },
    Active(&'a crate::detector_plan::CompiledDetectorPlans),
}

static EMBEDDED_RESOLUTION_INDEX: LazyLock<
    Result<crate::detector_plan::DetectorResolutionIndex, String>,
> = LazyLock::new(|| {
    let detectors = keyhog_core::load_embedded_detectors_or_fail()
        .map_err(|error| format!("failed to load embedded detector resolution policy: {error}"))?;
    crate::detector_plan::DetectorResolutionIndex::compile(&detectors)
});

fn embedded_resolution_index(
) -> Result<&'static crate::detector_plan::DetectorResolutionIndex, String> {
    EMBEDDED_RESOLUTION_INDEX
        .as_ref()
        .map_err(std::clone::Clone::clone)
}

impl ResolutionPolicy<'_> {
    fn validate(self, matches: &[RawMatch]) -> Result<(), String> {
        let Self::Active(plans) = self else {
            return Ok(());
        };
        for matched in matches {
            let detector_id = crate::detector_ids::policy_detector_id(matched.detector_id.as_ref());
            if plans.resolution_class(detector_id).is_none() {
                return Err(format!(
                    "finding references detector id {:?}, which is absent from the active compiled detector plan",
                    matched.detector_id
                ));
            }
        }
        Ok(())
    }
}

fn source_intervals_comparable(policy: ResolutionPolicy<'_>, source: &str) -> bool {
    #[cfg(feature = "decode")]
    if let ResolutionPolicy::Active(plans) = policy {
        return plans.decoded_source_parent(source).is_none();
    }
    let _ = (policy, source); // LAW10: no runtime effect; decode-disabled builds cannot compare decoded source views
    true
}

fn try_resolve_matches_with_policy(
    matches: &mut Vec<RawMatch>,
    policy: ResolutionPolicy<'_>,
) -> Result<(), String> {
    policy.validate(matches)?;
    if matches.len() <= SINGLE_MATCH_COUNT {
        return Ok(());
    }
    let source_families = SourceFamilyIndex::new(matches, policy);
    suppress_matches_nested_in_private_key_blocks(matches, policy, &source_families);
    suppress_entropy_duplicates_near_named_detectors(matches, policy, &source_families);
    *matches = resolve_match_groups(std::mem::take(matches), policy, &source_families);
    Ok(())
}

fn suppress_matches_nested_in_private_key_blocks(
    matches: &mut Vec<RawMatch>,
    policy: ResolutionPolicy<'_>,
    source_families: &SourceFamilyIndex,
) {
    let private_key_spans: Vec<(MatchOrigin, usize, usize)> = matches
        .iter()
        .filter(|m| is_private_key_block_detector(m.detector_id.as_ref(), policy))
        .filter_map(|matched| match_span(matched, source_families))
        .collect();
    if private_key_spans.is_empty() {
        return;
    }

    // Index spans per source, path, and revision with a running prefix-maximum.
    // A match [start,end] is nested in SOME private-key span of its origin iff,
    // among the spans whose `block_start <= start`, the maximum `block_end` is
    // `>= end` (that max-end span has start <= start, so it contains the match).
    // A `partition_point` on the sorted starts answers each query in O(log P),
    // turning the previous O(matches x spans) containment scan into
    // O((matches + spans) log spans). Without this, a crafted file packed with
    // thousands of tiny PEM blocks (each a private-key-block match) drives a
    // quadratic blow-up in this suppression pass (algorithmic-DoS, Law 7).
    let by_origin = index_spans_by_origin(private_key_spans);

    let mut retain = Vec::with_capacity(matches.len());
    for m in matches.iter() {
        if is_private_key_block_detector(m.detector_id.as_ref(), policy) {
            retain.push(true);
            continue;
        }
        let Some((origin, start, end)) = match_span(m, source_families) else {
            retain.push(true);
            continue;
        };
        retain.push(!span_contains(&by_origin, &origin, start, end));
    }
    let mut retained = Vec::with_capacity(matches.len());
    for (m, keep) in matches.drain(..).zip(retain) {
        if keep {
            retained.push(m);
        }
    }
    *matches = retained;
}

fn match_span(
    m: &RawMatch,
    source_families: &SourceFamilyIndex,
) -> Option<(MatchOrigin, usize, usize)> {
    m.location.file_path.as_ref()?;
    let start = m.location.offset;
    let end = start.saturating_add(m.credential.len());
    Some((MatchOrigin::from_match(m, source_families), start, end))
}

struct SourceFamilyIndex {
    sources: HashSet<Arc<str>>,
    decoded_parents: HashMap<Arc<str>, Arc<str>>,
}

impl SourceFamilyIndex {
    fn new(matches: &[RawMatch], policy: ResolutionPolicy<'_>) -> Self {
        let sources: HashSet<Arc<str>> = matches
            .iter()
            .map(|matched| matched.location.source.clone())
            .collect();
        let mut decoded_parents = HashMap::new();
        if let ResolutionPolicy::Active(plans) = policy {
            for source in &sources {
                let mut family = source.as_ref();
                while let Some(parent) = plans.decoded_source_parent(family) {
                    family = parent;
                }
                if family != source.as_ref() {
                    decoded_parents.insert(Arc::clone(source), Arc::from(family));
                }
            }
        }
        Self {
            sources,
            decoded_parents,
        }
    }

    fn family_for(&self, source: &Arc<str>) -> Arc<str> {
        if let Some(parent) = self.decoded_parents.get(source) {
            return Arc::clone(parent);
        }
        // Decoder and extraction views append `/...` to their parent source.
        // Collapse only to an ancestor that is present in this match batch.
        // Opaque sibling namespaces such as `git/tag` and `git/unreachable`
        // therefore remain distinct.
        let mut family = source.clone();
        let mut candidate = source.as_ref();
        while let Some((parent, _)) = candidate.rsplit_once('/') {
            if let Some(existing) = self.sources.get(parent) {
                family = Arc::clone(existing);
            }
            candidate = parent;
        }
        family
    }
}

#[derive(Debug, Clone, PartialEq, Eq, PartialOrd, Ord, Hash)]
struct MatchOrigin {
    source_family: Arc<str>,
    file_path: Option<Arc<str>>,
    commit: Option<Arc<str>>,
}

impl MatchOrigin {
    fn from_match(matched: &RawMatch, source_families: &SourceFamilyIndex) -> Self {
        Self {
            source_family: source_families.family_for(&matched.location.source),
            file_path: matched.location.file_path.clone(),
            commit: matched.location.commit.clone(),
        }
    }
}

/// Match spans for one origin, sorted by start with a running prefix-maximum
/// of `end`. This is the index `span_contains` binary-searches to answer interval
/// containment in O(log P) rather than scanning all P spans per match.
struct SpanIndex {
    /// Span start offsets in nondecreasing order.
    starts: Vec<usize>,
    /// `prefix_max_end[i]` is the maximum `end` over `starts[0..=i]`.
    prefix_max_end: Vec<usize>,
    /// `suffix_min_end[i]` is the minimum `end` over `starts[i..]`.
    suffix_min_end: Vec<usize>,
}

impl SpanIndex {
    fn from_unsorted(mut spans: Vec<(usize, usize)>) -> Self {
        spans.retain(|&(start, end)| start < end);
        spans.sort_unstable_by_key(|&(start, _)| start);
        let starts: Vec<usize> = spans.iter().map(|&(start, _)| start).collect();
        let mut prefix_max_end = Vec::with_capacity(spans.len());
        let mut running = 0usize;
        for &(_, end) in &spans {
            running = running.max(end);
            prefix_max_end.push(running);
        }
        let mut suffix_min_end = vec![usize::MAX; spans.len()];
        let mut running = usize::MAX;
        for (index, &(_, end)) in spans.iter().enumerate().rev() {
            running = running.min(end);
            suffix_min_end[index] = running;
        }
        Self {
            starts,
            prefix_max_end,
            suffix_min_end,
        }
    }

    fn contains(&self, start: usize, end: usize) -> bool {
        if start >= end {
            return false;
        }
        let count = self
            .starts
            .partition_point(|&span_start| span_start <= start);
        count > 0 && self.prefix_max_end[count - 1] >= end
    }

    fn overlaps(&self, start: usize, end: usize) -> bool {
        if start >= end {
            return false;
        }
        let count = self.starts.partition_point(|&span_start| span_start < end);
        count > 0 && self.prefix_max_end[count - 1] > start
    }

    /// Whether `[start,end)` contains any indexed interval.
    fn is_contained_by(&self, start: usize, end: usize) -> bool {
        if start >= end {
            return false;
        }
        let first = self
            .starts
            .partition_point(|&span_start| span_start < start);
        first < self.starts.len() && self.suffix_min_end[first] <= end
    }
}

/// Group private-key spans by source, path, and revision, then sort by `start`
/// and precompute the prefix-maximum of `end`. The prefix-max lets a
/// single binary search decide containment for arbitrary (even overlapping)
/// spans: among the spans whose `start <= q_start`, if the largest `end` reaches
/// `q_end`, then that very span (its `start` is in the prefix, its `end` is the
/// max) fully contains `[q_start, q_end]`.
fn index_spans_by_origin(
    spans: Vec<(MatchOrigin, usize, usize)>,
) -> HashMap<MatchOrigin, SpanIndex> {
    let mut grouped: HashMap<MatchOrigin, Vec<(usize, usize)>> = HashMap::new();
    for (origin, start, end) in spans {
        grouped.entry(origin).or_default().push((start, end));
    }
    grouped
        .into_iter()
        .map(|(origin, spans)| (origin, SpanIndex::from_unsorted(spans)))
        .collect()
}

/// Whether `[start, end]` is fully nested in a private-key span of `origin`.
/// `partition_point` finds how many spans begin at or before `start` (a prefix of
/// the sorted starts); if the prefix's maximum `end` reaches `end`, a containing
/// span exists. O(log P).
fn span_contains(
    by_origin: &HashMap<MatchOrigin, SpanIndex>,
    origin: &MatchOrigin,
    start: usize,
    end: usize,
) -> bool {
    let Some(spans) = by_origin.get(origin) else {
        return false;
    };
    spans.contains(start, end)
}

fn suppress_entropy_duplicates_near_named_detectors(
    matches: &mut Vec<RawMatch>,
    policy: ResolutionPolicy<'_>,
    source_families: &SourceFamilyIndex,
) {
    #[derive(Default)]
    struct PendingNamedEvidence {
        spans: Vec<(usize, usize)>,
        by_credential: HashMap<keyhog_core::SensitiveString, Vec<(usize, usize)>>,
    }

    struct NamedEvidence {
        spans: SpanIndex,
        by_credential: HashMap<keyhog_core::SensitiveString, SpanIndex>,
    }

    let mut named_lines: HashMap<MatchOrigin, HashMap<usize, PendingNamedEvidence>> =
        HashMap::new();
    for m in matches.iter() {
        if !match_is_service_specific(m, policy) {
            continue;
        }
        if let Some(line) = m.location.line {
            let evidence = named_lines
                .entry(MatchOrigin::from_match(m, source_families))
                .or_default();
            let evidence = evidence.entry(line).or_default();
            let start = m.location.offset;
            let span = (start, start.saturating_add(m.credential.len()));
            evidence.spans.push(span);
            evidence
                .by_credential
                .entry(m.credential.clone())
                .or_default()
                .push(span);
        }
    }
    let named_lines: HashMap<MatchOrigin, HashMap<usize, NamedEvidence>> = named_lines
        .into_iter()
        .map(|(origin, lines)| {
            let lines = lines
                .into_iter()
                .map(|(line, evidence)| {
                    let by_credential = evidence
                        .by_credential
                        .into_iter()
                        .map(|(credential, spans)| (credential, SpanIndex::from_unsorted(spans)))
                        .collect();
                    (
                        line,
                        NamedEvidence {
                            spans: SpanIndex::from_unsorted(evidence.spans),
                            by_credential,
                        },
                    )
                })
                .collect();
            (origin, lines)
        })
        .collect();
    matches.retain(|m| {
        if !is_entropy_detector(m.detector_id.as_ref(), policy) {
            return true;
        }
        let Some(line) = m.location.line else {
            return true;
        };
        let origin = MatchOrigin::from_match(m, source_families);
        let Some(lines) = named_lines.get(&origin) else {
            return true;
        };
        let start = m.location.offset;
        let end = start.saturating_add(m.credential.len());
        for offset in 0..=NAMED_DUPLICATE_LINE_DISTANCE {
            for candidate_line in [line.saturating_sub(offset), line.saturating_add(offset)] {
                let Some(named_evidence) = lines.get(&candidate_line) else {
                    continue;
                };
                let contained = named_evidence.spans.contains(start, end)
                    || named_evidence.spans.is_contained_by(start, end);
                let equivalent_overlap = named_evidence
                    .by_credential
                    .get(&m.credential)
                    .is_some_and(|spans| spans.overlaps(start, end));
                if contained || equivalent_overlap {
                    return false;
                }
            }
        }
        true
    });
}

fn is_private_key_block_detector(detector_id: &str, policy: ResolutionPolicy<'_>) -> bool {
    let detector_id = crate::detector_ids::policy_detector_id(detector_id);
    match policy {
        ResolutionPolicy::Active(plans) => matches!(
            plans.resolution_class(detector_id),
            Some(crate::detector_plan::DetectorResolutionClass::PrivateKeyBlock)
        ),
        ResolutionPolicy::Embedded {
            resolution,
            private_key_block_detectors,
        } => private_key_block_detectors.map_or_else(
            || {
                matches!(
                    resolution.get(detector_id),
                    Some(crate::detector_plan::DetectorResolutionClass::PrivateKeyBlock)
                )
            },
            |detectors| detectors.contains(detector_id),
        ),
    }
}

fn is_entropy_detector(detector_id: &str, policy: ResolutionPolicy<'_>) -> bool {
    let detector_id = crate::detector_ids::policy_detector_id(detector_id);
    match policy {
        ResolutionPolicy::Active(plans) => plans.is_entropy(detector_id),
        ResolutionPolicy::Embedded { resolution, .. } => resolution.get(detector_id).map_or_else(
            || crate::detector_ids::is_entropy_detector(detector_id),
            |class| {
                matches!(
                    class,
                    crate::detector_plan::DetectorResolutionClass::Entropy
                )
            },
        ),
    }
}

fn detector_resolution_priority(detector_id: &str, policy: ResolutionPolicy<'_>) -> i16 {
    let detector_id = crate::detector_ids::policy_detector_id(detector_id);
    match policy {
        ResolutionPolicy::Active(plans) => {
            let Some(priority) = plans.resolution_priority(detector_id) else {
                panic!(
                    "active raw match detector `{detector_id}` is absent from the compiled resolution plan"
                );
            };
            priority
        }
        // LAW10: canonical default; embedded test-only resolution admits
        // synthetic detector IDs, whose neutral priority changes no finding.
        ResolutionPolicy::Embedded { resolution, .. } => {
            // LAW10: absent explicit priority is the detector schema's canonical zero value; embedded policy lookup itself succeeded.
            resolution.priority(detector_id).unwrap_or(0)
        }
    }
}

fn decoded_evidence_priority(source: &str, policy: ResolutionPolicy<'_>) -> f64 {
    let depth = match policy {
        ResolutionPolicy::Active(plans) => plans.decoded_source_depth(source),
        ResolutionPolicy::Embedded { .. } => 0,
    };
    if depth == 0 {
        0.0
    } else {
        DECODED_EVIDENCE_PRIORITY / depth as f64
    }
}

fn match_is_service_specific(matched: &RawMatch, policy: ResolutionPolicy<'_>) -> bool {
    let detector_id = crate::detector_ids::policy_detector_id(matched.detector_id.as_ref());
    match policy {
        ResolutionPolicy::Active(plans) => matches!(
            plans.resolution_class(detector_id),
            Some(crate::detector_plan::DetectorResolutionClass::Named)
        ),
        ResolutionPolicy::Embedded { resolution, .. } => resolution.get(detector_id).map_or_else(
            || {
                matched.service.as_ref() != "generic"
                    && !crate::detector_ids::is_generic_detector(detector_id)
                    && !crate::detector_ids::is_entropy_detector(detector_id)
            },
            |class| matches!(class, crate::detector_plan::DetectorResolutionClass::Named),
        ),
    }
}

/// Compatibility probe retained for the public testing seam. Production
/// resolution uses `match_is_service_specific` and never calls this ID-family
/// predicate.
pub(crate) fn is_service_specific_detector(detector_id: &str) -> bool {
    crate::detector_ids::is_service_anchored_detector(detector_id)
}

fn resolve_match_groups(
    mut matches: Vec<RawMatch>,
    policy: ResolutionPolicy<'_>,
    source_families: &SourceFamilyIndex,
) -> Vec<RawMatch> {
    // A line is only an attribution boundary. Within it, direct containment or
    // equivalent overlapping evidence competes. Partial overlap does not.
    #[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash)]
    enum GroupLocation {
        Line(usize),
        NoLine,
    }

    let mut groups: BTreeMap<(MatchOrigin, GroupLocation), Vec<RawMatch>> = BTreeMap::new();
    for m in matches.drain(..) {
        let origin = MatchOrigin::from_match(&m, source_families);
        let location = m
            .location
            .line
            .map_or(GroupLocation::NoLine, GroupLocation::Line);
        groups.entry((origin, location)).or_default().push(m);
    }

    let mut resolved = Vec::new();
    for (_key, mut group) in groups {
        // Establish a stable index before the interval queries. Input order must
        // not affect either equal-priority selection or final output order.
        group.sort_by(|a, b| {
            match_offsets(a)
                .cmp(&match_offsets(b))
                .then_with(|| a.cmp(b))
        });
        resolved.extend(resolve_direct_conflicts(group, policy));
    }
    resolved
}

fn match_offsets(matched: &RawMatch) -> (usize, usize) {
    let start = matched.location.offset;
    (
        start,
        start.saturating_add(matched.credential.as_ref().len()),
    )
}

#[derive(Debug, Clone, Copy)]
struct MatchInterval {
    start: usize,
    end: usize,
}

impl MatchInterval {
    fn from_match(matched: &RawMatch) -> Self {
        let (start, end) = match_offsets(matched);
        Self { start, end }
    }

    fn is_empty(self) -> bool {
        self.start >= self.end
    }
}

/// Dynamic interval index over already-retained, strictly higher-priority
/// matches. A prefix maximum answers "does a kept span contain this one?" and
/// a suffix minimum answers "does this span contain a kept one?" in O(log n).
/// The segment-tree leaves are compressed start offsets.
struct KeptIntervalIndex {
    starts: Vec<usize>,
    leaf_count: usize,
    max_end: Vec<usize>,
    min_end: Vec<usize>,
}

impl KeptIntervalIndex {
    fn new(intervals: &[MatchInterval]) -> Self {
        let mut starts: Vec<usize> = intervals
            .iter()
            .filter(|interval| !interval.is_empty())
            .map(|interval| interval.start)
            .collect();
        starts.sort_unstable();
        starts.dedup();
        let leaf_count = starts.len().next_power_of_two().max(1);
        Self {
            starts,
            leaf_count,
            max_end: vec![0; leaf_count * 2],
            min_end: vec![usize::MAX; leaf_count * 2],
        }
    }

    fn insert(&mut self, interval: MatchInterval) {
        if interval.is_empty() {
            return;
        }
        let rank = self.starts.partition_point(|&start| start < interval.start);
        debug_assert_eq!(self.starts.get(rank), Some(&interval.start));
        let mut position = self.leaf_count + rank;
        self.max_end[position] = self.max_end[position].max(interval.end);
        self.min_end[position] = self.min_end[position].min(interval.end);
        position /= 2;
        while position > 0 {
            self.max_end[position] = self.max_end[position * 2].max(self.max_end[position * 2 + 1]);
            self.min_end[position] = self.min_end[position * 2].min(self.min_end[position * 2 + 1]);
            position /= 2;
        }
    }

    fn range_max_end(&self, mut left: usize, mut right: usize) -> usize {
        left += self.leaf_count;
        right += self.leaf_count;
        let mut maximum = 0;
        while left < right {
            if left % 2 == 1 {
                maximum = maximum.max(self.max_end[left]);
                left += 1;
            }
            if right % 2 == 1 {
                right -= 1;
                maximum = maximum.max(self.max_end[right]);
            }
            left /= 2;
            right /= 2;
        }
        maximum
    }

    fn range_min_end(&self, mut left: usize, mut right: usize) -> usize {
        left += self.leaf_count;
        right += self.leaf_count;
        let mut minimum = usize::MAX;
        while left < right {
            if left % 2 == 1 {
                minimum = minimum.min(self.min_end[left]);
                left += 1;
            }
            if right % 2 == 1 {
                right -= 1;
                minimum = minimum.min(self.min_end[right]);
            }
            left /= 2;
            right /= 2;
        }
        minimum
    }

    fn has_containment_conflict(&self, interval: MatchInterval) -> bool {
        if interval.is_empty() {
            return false;
        }
        let starts_at_or_before = self
            .starts
            .partition_point(|&start| start <= interval.start);
        if self.range_max_end(0, starts_at_or_before) >= interval.end {
            return true;
        }
        let first_start_at_or_after = self.starts.partition_point(|&start| start < interval.start);
        self.range_min_end(first_start_at_or_after, self.starts.len()) <= interval.end
    }
}

#[derive(Default)]
struct KeptEquivalentEvidence {
    starts: HashMap<
        keyhog_core::CredentialHash,
        HashMap<keyhog_core::SensitiveString, BTreeMap<usize, usize>>,
    >,
}

impl KeptEquivalentEvidence {
    fn overlaps(&self, matched: &RawMatch, interval: MatchInterval) -> bool {
        if interval.is_empty() {
            return false;
        }
        let Some(starts) = self
            .starts
            .get(&matched.credential_hash)
            .and_then(|by_value| by_value.get(&matched.credential))
        else {
            return false;
        };
        let previous_overlaps = starts
            .range(..interval.start)
            .next_back()
            .is_some_and(|(_, &end)| end > interval.start);
        let next_overlaps = starts
            .range(interval.start..)
            .next()
            .is_some_and(|(&start, _)| start < interval.end);
        previous_overlaps || next_overlaps
    }

    fn insert(&mut self, matched: &RawMatch, interval: MatchInterval) {
        if interval.is_empty() {
            return;
        }
        self.starts
            .entry(matched.credential_hash)
            .or_default()
            .entry(matched.credential.clone())
            .or_default()
            .entry(interval.start)
            .and_modify(|end| *end = (*end).max(interval.end))
            .or_insert(interval.end);
    }
}

fn priorities_tie(left: f64, right: f64) -> bool {
    left.total_cmp(&right).is_eq() || (left - right).abs() < PRIORITY_EPSILON
}

fn resolve_direct_conflicts(group: Vec<RawMatch>, policy: ResolutionPolicy<'_>) -> Vec<RawMatch> {
    if group.len() <= SINGLE_MATCH_COUNT {
        return group;
    }
    let intervals: Vec<MatchInterval> = group.iter().map(MatchInterval::from_match).collect();
    let priorities: Vec<f64> = group
        .iter()
        .map(|matched| match_priority_with_policy(matched, policy))
        .collect();
    let mut prioritized: Vec<(f64, usize)> =
        priorities.iter().copied().zip(0..group.len()).collect();
    prioritized.sort_by(|left, right| {
        right
            .0
            .total_cmp(&left.0)
            .then_with(|| group[left.1].cmp(&group[right.1]))
    });

    let mut intervals_by_source: HashMap<Arc<str>, Vec<MatchInterval>> = HashMap::new();
    for (matched, &interval) in group.iter().zip(&intervals) {
        intervals_by_source
            .entry(Arc::clone(&matched.location.source))
            .or_default()
            .push(interval);
    }
    let mut dominant_containment: HashMap<Arc<str>, KeptIntervalIndex> = intervals_by_source
        .into_iter()
        .map(|(source, intervals)| (source, KeptIntervalIndex::new(&intervals)))
        .collect();
    let mut dominant_equivalent = KeptEquivalentEvidence::default();
    let mut retained = vec![false; group.len()];
    let mut pending_retained: Vec<(f64, usize)> = Vec::new();
    let mut dominant_cursor = 0usize;
    for &(priority, index) in &prioritized {
        // Epsilon ties are pairwise, not transitive. Promote each retained
        // match into the suppressing index only when it is independently more
        // than epsilon above the current candidate. An unrelated higher match
        // therefore cannot split two directly conflicting tied candidates.
        while let Some(&(retained_priority, retained_index)) = pending_retained.get(dominant_cursor)
        {
            if priorities_tie(retained_priority, priority) {
                break;
            }
            dominant_containment
                .entry(Arc::clone(&group[retained_index].location.source))
                .or_insert_with(|| KeptIntervalIndex::new(&[intervals[retained_index]]))
                .insert(intervals[retained_index]);
            dominant_equivalent.insert(&group[retained_index], intervals[retained_index]);
            dominant_cursor += 1;
        }

        let interval = intervals[index];
        let source = &group[index].location.source;
        let skip_same_decoded_view = !source_intervals_comparable(policy, source);
        let containment_conflict = dominant_containment
            .iter()
            .any(|(candidate_source, spans)| {
                !(skip_same_decoded_view && candidate_source == source)
                    && spans.has_containment_conflict(interval)
            });
        retained[index] =
            !containment_conflict && !dominant_equivalent.overlaps(&group[index], interval);
        if retained[index] {
            pending_retained.push((priority, index));
        }
    }

    // Selection changes membership only. Retained findings keep the group's
    // canonical coordinate then RawMatch order.
    group
        .into_iter()
        .enumerate()
        .filter_map(|(index, matched)| retained[index].then_some(matched))
        .collect()
}

/// Compute the resolver priority used to break ties between overlapping matches.
pub(crate) fn match_priority(m: &RawMatch) -> f64 {
    // LAW10: fail-closed; embedded policy corruption aborts resolution with its exact error, and no alternate overlap ordering is used.
    let resolution = embedded_resolution_index().unwrap_or_else(|error| {
        panic!(
            "embedded detector resolution policy is invalid while computing match priority: {error}"
        )
    });
    match_priority_with_policy(
        m,
        ResolutionPolicy::Embedded {
            resolution,
            private_key_block_detectors: None,
        },
    )
}

fn match_priority_with_policy(m: &RawMatch, policy: ResolutionPolicy<'_>) -> f64 {
    let mut priority = ENTROPY_MATCH_PRIORITY;
    priority += f64::from(detector_resolution_priority(m.detector_id.as_ref(), policy));

    priority += decoded_evidence_priority(m.location.source.as_ref(), policy);
    // Service-specific detectors beat generic/entropy fallbacks. A
    // high-confidence generic password that captures only the URL password
    // must not outrank a lower-confidence database-URL detector on the same
    // line; the URL detector carries the service contract and fuller
    // credential boundary.
    let service_specific = match_is_service_specific(m, policy);
    if service_specific {
        priority += NAMED_DETECTOR_PRIORITY;
    }

    // Report confidence contributes directly to resolver priority.
    if let Some(conf) = m.confidence {
        priority += conf * CONFIDENCE_WEIGHT;
    }

    // Credential length matters: longer credentials are more specific matches.
    priority +=
        (m.credential.len().min(MAX_CREDENTIAL_PRIORITY_LENGTH) as f64) * CREDENTIAL_LENGTH_WEIGHT;

    // Prefer specific detectors over generic ones for credentials with known prefixes.
    if crate::confidence::known_prefix_body(&m.credential).is_some() && service_specific {
        priority += KNOWN_PREFIX_SERVICE_BONUS;
    }

    priority
}