Struct SortedFilter 

pub struct SortedFilter { /* private fields */ }

Uniq filter implementation to only remove consecutive duplicates.

This is the fastest filter (although not by much), and the best in terms of memory efficiency as it only requires a single value stored in the filter memory at once. It operates in the same was as the Unix uniq utility, and thus requires your data be sorted prior to any execution.

Remember that repeatedly running Runiq on the same input would be a good candidate for sorting your data initially and then making use of this filter to optimize memory usage going forward.

Trait Implementations

impl Clone for SortedFilter

fn clone(&self) -> SortedFilter

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SortedFilter

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

Formats the value using the given formatter.

impl Filter for SortedFilter

Implement all trait methods.

fn new() -> SortedFilter

Creates a new SortedFilter.

fn detect(&mut self, input: &[u8]) -> bool

Detects a unique value.