Struct SeqSet 

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

Insertion-order-preserving set: insert is a no-op when the value is already present (first insertion wins the position). Public because it appears in ImpactWalkResult’s public fields.

Implementations

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

pub fn new() -> Self

Creates an empty insertion-ordered set.

pub fn insert(&mut self, value: T)

Inserts value if it is not already present.

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

Returns whether value is present.

pub fn len(&self) -> usize

Returns the number of values.

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

Iterates over values in insertion order.

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

Consumes the set and returns its values in insertion order.

Trait Implementations

impl<T: Clone + Eq + Hash + Clone> Clone for SeqSet<T>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug + Eq + Hash + Clone> Debug for SeqSet<T>

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

Formats the value using the given formatter.

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

fn default() -> Self

Returns the “default value” for a type.