Struct InMemoryDedup 

pub struct InMemoryDedup { /* private fields */ }

In-memory deduplication store with bounded capacity

Uses FIFO eviction when capacity is exceeded - oldest entries are removed first. This is appropriate because:

1. Older records are less likely to be seen again
2. Bounded memory usage
3. Fast O(1) lookup and insertion

Implementations

impl InMemoryDedup

pub fn new(capacity: usize) -> Self

Create a new in-memory dedup store with the given capacity

pub fn capacity(&self) -> usize

Get the current capacity

Trait Implementations

impl DeduplicationStore for InMemoryDedup

fn is_new(&self, id: &RecordId) -> bool

Check if a record ID is new (not seen before)

fn mark_seen(&mut self, id: RecordId)

Mark a record ID as seen

fn len(&self) -> usize

Get the number of tracked IDs

fn clear(&mut self)

Clear all tracked IDs

fn to_bytes(&self) -> Vec<u8>

Serialize the store for checkpointing

fn restore(&mut self, bytes: &[u8]) -> Result<(), String>

Restore from serialized bytes

fn mark_seen_batch(&mut self, ids: impl IntoIterator<Item = RecordId>)

Mark multiple record IDs as seen

fn filter_new<'a>( &self, ids: impl IntoIterator<Item = &'a RecordId>, ) -> Vec<&'a RecordId>

Filter a batch to only include new (unseen) IDs

fn is_empty(&self) -> bool

Check if the store is empty