Struct OxiHashSet 

pub struct OxiHashSet<T>
where
    T: Eq + Hash + Clone,
{ /* private fields */ }

A wrapper around std::collections::HashSet with an extended API.

OxiHashSet<T> provides functional-style operations (map, filter, fold) alongside the standard set operations (union, intersection, difference).

Implementations

impl OxiHashSet<String>

pub fn insert_str(&mut self, s: &str) -> bool

Insert a &str directly.

pub fn contains_str(&self, s: &str) -> bool

Check whether the set contains the given &str.

pub fn remove_str(&mut self, s: &str) -> bool

Remove by &str.

impl OxiHashSet<u64>

pub fn min_elem(&self) -> Option<u64>

Return the minimum element if non-empty.

pub fn max_elem(&self) -> Option<u64>

Return the maximum element if non-empty.

pub fn sum(&self) -> u64

Return the sum of all elements.

pub fn covers_range(&self, lo: u64, hi: u64) -> bool

Check whether the range lo..=hi is completely covered.

impl OxiHashSet<usize>

pub fn covers_indices(&self, n: usize) -> bool

Check whether the indices 0..n are all present.

pub fn sorted(&self) -> Vec<usize>

Return elements as a sorted vector.

impl<T: Eq + Hash + Clone> OxiHashSet<T>

pub fn set_eq(&self, other: &Self) -> bool

Check structural equality with another set.

impl<T: Eq + Hash + Clone> OxiHashSet<T>

pub fn all<F: Fn(&T) -> bool>(&self, predicate: F) -> bool

Check whether all elements satisfy predicate.

impl<T: Eq + Hash + Clone> OxiHashSet<T>

pub fn any<F: Fn(&T) -> bool>(&self, predicate: F) -> bool

Check whether any element satisfies predicate.

impl<T: Eq + Hash + Clone> OxiHashSet<T>

pub fn with_capacity(capacity: usize) -> Self

Create a set with the given capacity pre-allocated.

impl<T: Eq + Hash + Clone> OxiHashSet<T>

pub fn clear(&mut self)

Clear all elements.

impl<T: Eq + Hash + Clone> OxiHashSet<T>

pub fn contains(&self, elem: &T) -> bool

Check whether the set contains an element.

pub fn intersect_with(&mut self, other: &Self)

Keep only elements that also appear in other (intersection in place).

impl<T: Eq + Hash + Clone> OxiHashSet<T>

pub fn difference(&self, other: &Self) -> Self

Return a new set that is the difference self ∖ other.

impl<T: Eq + Hash + Clone> OxiHashSet<T>

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

Extend with elements from an iterator.

impl<T: Eq + Hash + Clone> OxiHashSet<T>

pub fn filter<F: Fn(&T) -> bool>(&self) -> OxiHashSet<T>

Retain only elements satisfying the predicate.

pub fn retain_clone<F: Fn(&T) -> bool>(&self, predicate: F) -> Self

Return a new set containing only elements for which predicate returns true.

pub fn count_where<F: Fn(&T) -> bool>(&self, predicate: F) -> usize

Count elements satisfying predicate.

impl<T: Eq + Hash + Clone> OxiHashSet<T>

pub fn fold<B, F: Fn(B, &T) -> B>(&self, init: B, f: F) -> B

Fold over all elements with a given initial value.

impl<T: Eq + Hash + Clone> OxiHashSet<T>

pub fn from_iter<I: IntoIterator<Item = T>>(iter: I) -> Self

Create a set from an iterator.

impl<T: Eq + Hash + Clone> OxiHashSet<T>

pub fn insert(&mut self, elem: T) -> bool

Insert an element. Returns true if the element was not already present.

pub fn union_with(&mut self, other: &Self)

Extend with elements from another set (union in place).

impl<T: Eq + Hash + Clone> OxiHashSet<T>

pub fn intersection(&self, other: &Self) -> Self

Return a new set that is the intersection of self and other.

impl<T: Eq + Hash + Clone> OxiHashSet<T>

pub fn len(&self) -> usize

Return the number of elements.

pub fn exclusive_count(&self, other: &Self) -> usize

Number of elements not shared with other.

pub fn union_size(&self, other: &Self) -> usize

Total elements in union minus shared elements (Jaccard denominator).

pub fn jaccard(&self, other: &Self) -> f64

Jaccard similarity coefficient (0.0–1.0).

impl<T: Eq + Hash + Clone> OxiHashSet<T>

pub fn map<U, F>(&self, f: F) -> OxiHashSet<U>

where U: Eq + Hash + Clone, F: Fn(&T) -> U,

Apply a function to every element, returning a new set.

pub fn iter(&self) -> impl Iterator<Item = &T>

Return an iterator over the elements.

impl<T: Eq + Hash + Clone> OxiHashSet<T>

pub fn new() -> Self

Create an empty set.

pub fn singleton(elem: T) -> Self

Create a singleton set containing exactly one element.

pub fn flat_map<U, F>(&self, f: F) -> OxiHashSet<U>

where U: Eq + Hash + Clone, F: Fn(&T) -> OxiHashSet<U>,

Flat-map: apply f to each element and union all results.

pub fn power_set(&self) -> Vec<Self>

Return the power set (set of all subsets) — only feasible for small sets.

impl<T: Eq + Hash + Clone> OxiHashSet<T>

pub fn partition<F: Fn(&T) -> bool>(&self, predicate: F) -> (Self, Self)

Partition into two sets by a predicate.

impl<T: Eq + Hash + Clone> OxiHashSet<T>

pub fn pick_any(&self) -> Option<&T>

Return an arbitrary element (useful for single-element sets).

impl<T: Eq + Hash + Clone> OxiHashSet<T>

pub fn is_empty(&self) -> bool

Return true if the set is empty.

impl<T: Eq + Hash + Clone> OxiHashSet<T>

pub fn is_subset(&self, other: &Self) -> bool

Check whether self is a subset of other.

impl<T: Eq + Hash + Clone> OxiHashSet<T>

pub fn is_superset(&self, other: &Self) -> bool

Check whether self is a superset of other.

impl<T: Eq + Hash + Clone> OxiHashSet<T>

pub fn is_disjoint(&self, other: &Self) -> bool

Check whether self and other are disjoint (share no elements).

impl<T: Eq + Hash + Clone> OxiHashSet<T>

pub fn find<F: Fn(&T) -> bool>(&self, predicate: F) -> Option<&T>

Find an element satisfying predicate.

impl<T: Eq + Hash + Clone> OxiHashSet<T>

pub fn remove(&mut self, elem: &T) -> bool

Remove an element. Returns true if it was present.

pub fn subtract(&mut self, other: &Self)

Remove all elements that appear in other (difference in place).

impl<T: Eq + Hash + Clone> OxiHashSet<T>

pub fn symmetric_difference(&self, other: &Self) -> Self

Return a new set that is the symmetric difference of self and other.

impl<T: Eq + Hash + Clone> OxiHashSet<T>

pub fn to_vec(&self) -> Vec<T>

Collect elements into a Vec.

impl<T: Eq + Hash + Clone + Ord> OxiHashSet<T>

pub fn sorted_vec(&self) -> Vec<T>

Return elements sorted in ascending order.

pub fn min(&self) -> Option<&T>

Return the minimum element (requires Ord).

pub fn max(&self) -> Option<&T>

Return the maximum element (requires Ord).

impl<T: Eq + Hash + Clone + Debug> OxiHashSet<T>

pub fn to_sorted_vec(&self) -> Vec<T>

where T: Ord,

Return a sorted vector of elements (requires Ord on T).

impl<T: Eq + Hash + Clone> OxiHashSet<T>

pub fn union(&self, other: &Self) -> Self

Return a new set that is the union of self and other.

Trait Implementations

impl<T> Clone for OxiHashSet<T>

where T: Eq + Hash + Clone + Clone,

fn clone(&self) -> OxiHashSet<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T> Debug for OxiHashSet<T>

where T: Eq + Hash + Clone + Debug,

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

Formats the value using the given formatter.

impl<T: Eq + Hash + Clone> Default for OxiHashSet<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T: Eq + Hash + Clone + Display> Display for OxiHashSet<T>

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

Formats the value using the given formatter.

impl<T: Eq + Hash + Clone> From<HashSet<T>> for OxiHashSet<T>

fn from(s: StdHashSet<T>) -> Self

Converts to this type from the input type.

impl<T: Eq + Hash + Clone> From<Vec<T>> for OxiHashSet<T>

fn from(v: Vec<T>) -> Self

Converts to this type from the input type.

impl<T: Eq + Hash + Clone> IntoIterator for OxiHashSet<T>

type Item = T

The type of the elements being iterated over.

type IntoIter = IntoIter<T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T> PartialEq for OxiHashSet<T>

where T: Eq + Hash + Clone + PartialEq,

fn eq(&self, other: &OxiHashSet<T>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T> Eq for OxiHashSet<T>

where T: Eq + Hash + Clone + Eq,

impl<T> StructuralPartialEq for OxiHashSet<T>

where T: Eq + Hash + Clone,