Struct MatchSet 

pub struct MatchSet { /* private fields */ }

Re-export of the sorted, deduplicated match collection. Sorted, deduplicated collection of matches with efficient insertion.

Ensures elements are consistently ordered and handles operations like duplicate removal and overlapping match merges.

Example

use matchkit::{Match, MatchSet};

let mut set = MatchSet::new();
set.insert(Match::from_parts(1, 0, 10));
set.insert(Match::from_parts(1, 5, 15));
set.merge_overlapping();

assert_eq!(set.len(), 1);
assert_eq!(set.as_slice()[0].end, 15);

Implementations

impl MatchSet

pub fn new() -> Self

Create an empty match set.

pub fn try_with_capacity(cap: usize) -> Result<Self>

Create a match set with pre-allocated capacity.

pub fn with_capacity(cap: usize) -> Self

Create a match set with pre-allocated capacity (legacy interface, may panic on OOM).

pub fn try_insert(&mut self, m: Match) -> Result<()>

Insert a match, maintaining sorted order. O(log n) search + O(n) shift.

pub fn insert(&mut self, m: Match)

Insert a match, maintaining sorted order (legacy interface, may panic on OOM).

pub fn try_extend( &mut self, iter: impl IntoIterator<Item = Match>, ) -> Result<()>

Extend with multiple matches, then sort and dedup.

pub fn extend(&mut self, iter: impl IntoIterator<Item = Match>)

Extend with multiple matches, then sort and dedup (legacy interface, may panic on OOM).

pub fn try_merge_overlapping(&mut self) -> Result<()>

Merge overlapping matches into a minimal covering set.

After merging, no two matches in the set overlap. Pattern ID is taken from the first match in each merged group.

pub fn merge_overlapping(&mut self)

Merge overlapping matches into a minimal covering set (legacy interface, may panic on OOM).

pub fn len(&self) -> usize

Number of matches in the set.

pub fn is_empty(&self) -> bool

Whether the set is empty.

pub fn as_slice(&self) -> &[Match]

Get matches as a slice.

pub fn iter(&self) -> Iter<'_, Match>

Returns an iterator over the matches.

pub fn into_vec(self) -> Vec<Match>

Consume the set into a Vec.

pub fn filter_by_pattern(&self, pattern_id: u32) -> Self

Filter matches to only those with the given pattern ID.

pub fn try_filter_by_pattern(&self, pattern_id: u32) -> Result<Self>

Filter matches to only those with the given pattern ID, returning an error on OOM.

pub fn pattern_counts(&self) -> HashMap<u32, usize>

Count matches for each pattern ID.

pub fn try_pattern_counts(&self) -> Result<HashMap<u32, usize>>

Count matches for each pattern ID, returning an error on OOM.

pub fn pattern_ids(&self) -> Vec<u32>

Distinct pattern IDs in the set.

pub fn try_pattern_ids(&self) -> Result<Vec<u32>>

Distinct pattern IDs in the set, returning an error on OOM.

Trait Implementations

impl Clone for MatchSet

fn clone(&self) -> MatchSet

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for MatchSet

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for MatchSet

fn default() -> MatchSet

Returns the “default value” for a type.

impl<'a> IntoIterator for &'a MatchSet

type Item = &'a Match

The type of the elements being iterated over.

type IntoIter = Iter<'a, Match>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl IntoIterator for MatchSet

type Item = Match

The type of the elements being iterated over.

type IntoIter = IntoIter<Match>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.