Struct typed_html::types::SpacedSet

pub struct SpacedSet<A: Ord>(_);

A space separated set of unique values.

This type represents a set of unique values represented as a string of values separated by spaces in HTML attributes.

Examples

use typed_html::types::{Class, SpacedSet};

let classList: SpacedSet<Class> = "foo bar baz".into();
let classList: SpacedSet<Class> = ["foo", "bar", "baz"].into();
let classList: SpacedSet<Class> = ("foo", "bar", "baz").into();

let classList1: SpacedSet<Class> = "foo bar foo".into();
let classList2: SpacedSet<Class> = "bar foo bar".into();
assert_eq!(classList1, classList2);

Implementations

impl<A: Ord> SpacedSet<A>

pub fn new() -> Self

Construct an empty SpacedSet.

Methods from Deref<Target = BTreeSet<A>>

pub fn range<K, R>(&self, range: R) -> Range<'_, T>where
    K: Ord + ?Sized,
    T: Borrow<K> + Ord,
    R: RangeBounds<K>,

Constructs a double-ended iterator over a sub-range of elements in the set. The simplest way is to use the range syntax min..max, thus range(min..max) will yield elements from min (inclusive) to max (exclusive). The range may also be entered as (Bound<T>, Bound<T>), so for example range((Excluded(4), Included(10))) will yield a left-exclusive, right-inclusive range from 4 to 10.

Panics

Panics if range start > end. Panics if range start == end and both bounds are Excluded.

Examples

use std::collections::BTreeSet;
use std::ops::Bound::Included;

let mut set = BTreeSet::new();
set.insert(3);
set.insert(5);
set.insert(8);
for &elem in set.range((Included(&4), Included(&8))) {
    println!("{elem}");
}
assert_eq!(Some(&5), set.range(4..).next());

pub fn difference<'a>(
    &'a self,
    other: &'a BTreeSet<T, A>
) -> Difference<'a, T, A>where
    T: Ord,

Visits the elements representing the difference, i.e., the elements that are in self but not in other, in ascending order.

Examples

use std::collections::BTreeSet;

let mut a = BTreeSet::new();
a.insert(1);
a.insert(2);

let mut b = BTreeSet::new();
b.insert(2);
b.insert(3);

let diff: Vec<_> = a.difference(&b).cloned().collect();
assert_eq!(diff, [1]);

pub fn symmetric_difference<'a>(
    &'a self,
    other: &'a BTreeSet<T, A>
) -> SymmetricDifference<'a, T>where
    T: Ord,

Visits the elements representing the symmetric difference, i.e., the elements that are in self or in other but not in both, in ascending order.

Examples

use std::collections::BTreeSet;

let mut a = BTreeSet::new();
a.insert(1);
a.insert(2);

let mut b = BTreeSet::new();
b.insert(2);
b.insert(3);

let sym_diff: Vec<_> = a.symmetric_difference(&b).cloned().collect();
assert_eq!(sym_diff, [1, 3]);

pub fn intersection<'a>(
    &'a self,
    other: &'a BTreeSet<T, A>
) -> Intersection<'a, T, A>where
    T: Ord,

Visits the elements representing the intersection, i.e., the elements that are both in self and other, in ascending order.

Examples

use std::collections::BTreeSet;

let mut a = BTreeSet::new();
a.insert(1);
a.insert(2);

let mut b = BTreeSet::new();
b.insert(2);
b.insert(3);

let intersection: Vec<_> = a.intersection(&b).cloned().collect();
assert_eq!(intersection, [2]);

pub fn union<'a>(&'a self, other: &'a BTreeSet<T, A>) -> Union<'a, T>where
    T: Ord,

Visits the elements representing the union, i.e., all the elements in self or other, without duplicates, in ascending order.

Examples

use std::collections::BTreeSet;

let mut a = BTreeSet::new();
a.insert(1);

let mut b = BTreeSet::new();
b.insert(2);

let union: Vec<_> = a.union(&b).cloned().collect();
assert_eq!(union, [1, 2]);

pub fn clear(&mut self)where
    A: Clone,

Clears the set, removing all elements.

Examples

use std::collections::BTreeSet;

let mut v = BTreeSet::new();
v.insert(1);
v.clear();
assert!(v.is_empty());

pub fn contains<Q>(&self, value: &Q) -> boolwhere
    T: Borrow<Q> + Ord,
    Q: Ord + ?Sized,

Returns true if the set contains an element equal to the value.

The value may be any borrowed form of the set’s element type, but the ordering on the borrowed form must match the ordering on the element type.

Examples

use std::collections::BTreeSet;

let set = BTreeSet::from([1, 2, 3]);
assert_eq!(set.contains(&1), true);
assert_eq!(set.contains(&4), false);

pub fn get<Q>(&self, value: &Q) -> Option<&T>where
    T: Borrow<Q> + Ord,
    Q: Ord + ?Sized,

Returns a reference to the element in the set, if any, that is equal to the value.

The value may be any borrowed form of the set’s element type, but the ordering on the borrowed form must match the ordering on the element type.

Examples

use std::collections::BTreeSet;

let set = BTreeSet::from([1, 2, 3]);
assert_eq!(set.get(&2), Some(&2));
assert_eq!(set.get(&4), None);

pub fn is_disjoint(&self, other: &BTreeSet<T, A>) -> boolwhere
    T: Ord,

Returns true if self has no elements in common with other. This is equivalent to checking for an empty intersection.

Examples

use std::collections::BTreeSet;

let a = BTreeSet::from([1, 2, 3]);
let mut b = BTreeSet::new();

assert_eq!(a.is_disjoint(&b), true);
b.insert(4);
assert_eq!(a.is_disjoint(&b), true);
b.insert(1);
assert_eq!(a.is_disjoint(&b), false);

pub fn is_subset(&self, other: &BTreeSet<T, A>) -> boolwhere
    T: Ord,

Returns true if the set is a subset of another, i.e., other contains at least all the elements in self.

Examples

use std::collections::BTreeSet;

let sup = BTreeSet::from([1, 2, 3]);
let mut set = BTreeSet::new();

assert_eq!(set.is_subset(&sup), true);
set.insert(2);
assert_eq!(set.is_subset(&sup), true);
set.insert(4);
assert_eq!(set.is_subset(&sup), false);

pub fn is_superset(&self, other: &BTreeSet<T, A>) -> boolwhere
    T: Ord,

Returns true if the set is a superset of another, i.e., self contains at least all the elements in other.

Examples

use std::collections::BTreeSet;

let sub = BTreeSet::from([1, 2]);
let mut set = BTreeSet::new();

assert_eq!(set.is_superset(&sub), false);

set.insert(0);
set.insert(1);
assert_eq!(set.is_superset(&sub), false);

set.insert(2);
assert_eq!(set.is_superset(&sub), true);

pub fn first(&self) -> Option<&T>where
    T: Ord,

Returns a reference to the first element in the set, if any. This element is always the minimum of all elements in the set.

Examples

Basic usage:

use std::collections::BTreeSet;

let mut set = BTreeSet::new();
assert_eq!(set.first(), None);
set.insert(1);
assert_eq!(set.first(), Some(&1));
set.insert(2);
assert_eq!(set.first(), Some(&1));

pub fn last(&self) -> Option<&T>where
    T: Ord,

Returns a reference to the last element in the set, if any. This element is always the maximum of all elements in the set.

Examples

Basic usage:

use std::collections::BTreeSet;

let mut set = BTreeSet::new();
assert_eq!(set.last(), None);
set.insert(1);
assert_eq!(set.last(), Some(&1));
set.insert(2);
assert_eq!(set.last(), Some(&2));

pub fn pop_first(&mut self) -> Option<T>where
    T: Ord,

Removes the first element from the set and returns it, if any. The first element is always the minimum element in the set.

Examples

use std::collections::BTreeSet;

let mut set = BTreeSet::new();

set.insert(1);
while let Some(n) = set.pop_first() {
    assert_eq!(n, 1);
}
assert!(set.is_empty());

pub fn pop_last(&mut self) -> Option<T>where
    T: Ord,

Removes the last element from the set and returns it, if any. The last element is always the maximum element in the set.

Examples

use std::collections::BTreeSet;

let mut set = BTreeSet::new();

set.insert(1);
while let Some(n) = set.pop_last() {
    assert_eq!(n, 1);
}
assert!(set.is_empty());

pub fn insert(&mut self, value: T) -> boolwhere
    T: Ord,

Adds a value to the set.

Returns whether the value was newly inserted. That is:

• If the set did not previously contain an equal value, true is returned.
• If the set already contained an equal value, false is returned, and the entry is not updated.

See the module-level documentation for more.

Examples

use std::collections::BTreeSet;

let mut set = BTreeSet::new();

assert_eq!(set.insert(2), true);
assert_eq!(set.insert(2), false);
assert_eq!(set.len(), 1);

pub fn replace(&mut self, value: T) -> Option<T>where
    T: Ord,

Adds a value to the set, replacing the existing element, if any, that is equal to the value. Returns the replaced element.

Examples

use std::collections::BTreeSet;

let mut set = BTreeSet::new();
set.insert(Vec::<i32>::new());

assert_eq!(set.get(&[][..]).unwrap().capacity(), 0);
set.replace(Vec::with_capacity(10));
assert_eq!(set.get(&[][..]).unwrap().capacity(), 10);

pub fn remove<Q>(&mut self, value: &Q) -> boolwhere
    T: Borrow<Q> + Ord,
    Q: Ord + ?Sized,

If the set contains an element equal to the value, removes it from the set and drops it. Returns whether such an element was present.

The value may be any borrowed form of the set’s element type, but the ordering on the borrowed form must match the ordering on the element type.

Examples

use std::collections::BTreeSet;

let mut set = BTreeSet::new();

set.insert(2);
assert_eq!(set.remove(&2), true);
assert_eq!(set.remove(&2), false);

pub fn take<Q>(&mut self, value: &Q) -> Option<T>where
    T: Borrow<Q> + Ord,
    Q: Ord + ?Sized,

Removes and returns the element in the set, if any, that is equal to the value.

The value may be any borrowed form of the set’s element type, but the ordering on the borrowed form must match the ordering on the element type.

Examples

use std::collections::BTreeSet;

let mut set = BTreeSet::from([1, 2, 3]);
assert_eq!(set.take(&2), Some(2));
assert_eq!(set.take(&2), None);

pub fn retain<F>(&mut self, f: F)where
    T: Ord,
    F: FnMut(&T) -> bool,

Retains only the elements specified by the predicate.

In other words, remove all elements e for which f(&e) returns false. The elements are visited in ascending order.

Examples

use std::collections::BTreeSet;

let mut set = BTreeSet::from([1, 2, 3, 4, 5, 6]);
// Keep only the even numbers.
set.retain(|&k| k % 2 == 0);
assert!(set.iter().eq([2, 4, 6].iter()));

pub fn append(&mut self, other: &mut BTreeSet<T, A>)where
    T: Ord,
    A: Clone,

Moves all elements from other into self, leaving other empty.

Examples

use std::collections::BTreeSet;

let mut a = BTreeSet::new();
a.insert(1);
a.insert(2);
a.insert(3);

let mut b = BTreeSet::new();
b.insert(3);
b.insert(4);
b.insert(5);

a.append(&mut b);

assert_eq!(a.len(), 5);
assert_eq!(b.len(), 0);

assert!(a.contains(&1));
assert!(a.contains(&2));
assert!(a.contains(&3));
assert!(a.contains(&4));
assert!(a.contains(&5));

pub fn split_off<Q>(&mut self, value: &Q) -> BTreeSet<T, A>where
    Q: Ord + ?Sized,
    T: Borrow<Q> + Ord,
    A: Clone,

Splits the collection into two at the value. Returns a new collection with all elements greater than or equal to the value.

Examples

Basic usage:

use std::collections::BTreeSet;

let mut a = BTreeSet::new();
a.insert(1);
a.insert(2);
a.insert(3);
a.insert(17);
a.insert(41);

let b = a.split_off(&3);

assert_eq!(a.len(), 2);
assert_eq!(b.len(), 3);

assert!(a.contains(&1));
assert!(a.contains(&2));

assert!(b.contains(&3));
assert!(b.contains(&17));
assert!(b.contains(&41));

pub fn drain_filter<'a, F>(&'a mut self, pred: F) -> DrainFilter<'a, T, F, A>where
    T: Ord,
    F: 'a + FnMut(&T) -> bool,

🔬This is a nightly-only experimental API. (btree_drain_filter)

Creates an iterator that visits all elements in ascending order and uses a closure to determine if an element should be removed.

If the closure returns true, the element is removed from the set and yielded. If the closure returns false, or panics, the element remains in the set and will not be yielded.

If the iterator is only partially consumed or not consumed at all, each of the remaining elements is still subjected to the closure and removed and dropped if it returns true.

It is unspecified how many more elements will be subjected to the closure if a panic occurs in the closure, or if a panic occurs while dropping an element, or if the DrainFilter itself is leaked.

Examples

Splitting a set into even and odd values, reusing the original set:

#![feature(btree_drain_filter)]
use std::collections::BTreeSet;

let mut set: BTreeSet<i32> = (0..8).collect();
let evens: BTreeSet<_> = set.drain_filter(|v| v % 2 == 0).collect();
let odds = set;
assert_eq!(evens.into_iter().collect::<Vec<_>>(), vec![0, 2, 4, 6]);
assert_eq!(odds.into_iter().collect::<Vec<_>>(), vec![1, 3, 5, 7]);

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

Gets an iterator that visits the elements in the BTreeSet in ascending order.

Examples

use std::collections::BTreeSet;

let set = BTreeSet::from([1, 2, 3]);
let mut set_iter = set.iter();
assert_eq!(set_iter.next(), Some(&1));
assert_eq!(set_iter.next(), Some(&2));
assert_eq!(set_iter.next(), Some(&3));
assert_eq!(set_iter.next(), None);

Values returned by the iterator are returned in ascending order:

use std::collections::BTreeSet;

let set = BTreeSet::from([3, 1, 2]);
let mut set_iter = set.iter();
assert_eq!(set_iter.next(), Some(&1));
assert_eq!(set_iter.next(), Some(&2));
assert_eq!(set_iter.next(), Some(&3));
assert_eq!(set_iter.next(), None);

pub fn len(&self) -> usize

Returns the number of elements in the set.

Examples

use std::collections::BTreeSet;

let mut v = BTreeSet::new();
assert_eq!(v.len(), 0);
v.insert(1);
assert_eq!(v.len(), 1);

pub fn is_empty(&self) -> bool

Returns true if the set contains no elements.

Examples

use std::collections::BTreeSet;

let mut v = BTreeSet::new();
assert!(v.is_empty());
v.insert(1);
assert!(!v.is_empty());

Trait Implementations

impl<A: Clone + Ord> Clone for SpacedSet<A>

fn clone(&self) -> SpacedSet<A>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<A: Ord + Debug> Debug for SpacedSet<A>

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

Formats the value using the given formatter.

impl<A: Ord> Default for SpacedSet<A>

fn default() -> Self

Returns the “default value” for a type.

impl<A: Ord> Deref for SpacedSet<A>

type Target = BTreeSet<A, Global>

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<A: Ord> DerefMut for SpacedSet<A>

fn deref_mut(&mut self) -> &mut Self::Target

Mutably dereferences the value.

impl<A: Ord + Display> Display for SpacedSet<A>

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

Formats the value using the given formatter.

impl<'a, A: Ord + FromStr> From<&'a str> for SpacedSet<A>where
    <A as FromStr>::Err: Debug,

fn from(s: &'a str) -> Self

Converts to this type from the input type.

impl<'a, A: Ord + FromStr> From<[&'a str; 1]> for SpacedSet<A>where
    <A as FromStr>::Err: Debug,

fn from(s: [&str; 1]) -> Self

Converts to this type from the input type.

impl<'a, A: Ord + FromStr> From<[&'a str; 10]> for SpacedSet<A>where
    <A as FromStr>::Err: Debug,

fn from(s: [&str; 10]) -> Self

Converts to this type from the input type.

impl<'a, A: Ord + FromStr> From<[&'a str; 11]> for SpacedSet<A>where
    <A as FromStr>::Err: Debug,

fn from(s: [&str; 11]) -> Self

Converts to this type from the input type.

impl<'a, A: Ord + FromStr> From<[&'a str; 12]> for SpacedSet<A>where
    <A as FromStr>::Err: Debug,

fn from(s: [&str; 12]) -> Self

Converts to this type from the input type.

impl<'a, A: Ord + FromStr> From<[&'a str; 13]> for SpacedSet<A>where
    <A as FromStr>::Err: Debug,

fn from(s: [&str; 13]) -> Self

Converts to this type from the input type.

impl<'a, A: Ord + FromStr> From<[&'a str; 14]> for SpacedSet<A>where
    <A as FromStr>::Err: Debug,

fn from(s: [&str; 14]) -> Self

Converts to this type from the input type.

impl<'a, A: Ord + FromStr> From<[&'a str; 15]> for SpacedSet<A>where
    <A as FromStr>::Err: Debug,

fn from(s: [&str; 15]) -> Self

Converts to this type from the input type.

impl<'a, A: Ord + FromStr> From<[&'a str; 16]> for SpacedSet<A>where
    <A as FromStr>::Err: Debug,

fn from(s: [&str; 16]) -> Self

Converts to this type from the input type.

impl<'a, A: Ord + FromStr> From<[&'a str; 17]> for SpacedSet<A>where
    <A as FromStr>::Err: Debug,

fn from(s: [&str; 17]) -> Self

Converts to this type from the input type.

impl<'a, A: Ord + FromStr> From<[&'a str; 18]> for SpacedSet<A>where
    <A as FromStr>::Err: Debug,

fn from(s: [&str; 18]) -> Self

Converts to this type from the input type.

impl<'a, A: Ord + FromStr> From<[&'a str; 19]> for SpacedSet<A>where
    <A as FromStr>::Err: Debug,

fn from(s: [&str; 19]) -> Self

Converts to this type from the input type.

impl<'a, A: Ord + FromStr> From<[&'a str; 2]> for SpacedSet<A>where
    <A as FromStr>::Err: Debug,

fn from(s: [&str; 2]) -> Self

Converts to this type from the input type.

impl<'a, A: Ord + FromStr> From<[&'a str; 20]> for SpacedSet<A>where
    <A as FromStr>::Err: Debug,

fn from(s: [&str; 20]) -> Self

Converts to this type from the input type.

impl<'a, A: Ord + FromStr> From<[&'a str; 21]> for SpacedSet<A>where
    <A as FromStr>::Err: Debug,

fn from(s: [&str; 21]) -> Self

Converts to this type from the input type.

impl<'a, A: Ord + FromStr> From<[&'a str; 22]> for SpacedSet<A>where
    <A as FromStr>::Err: Debug,

fn from(s: [&str; 22]) -> Self

Converts to this type from the input type.

impl<'a, A: Ord + FromStr> From<[&'a str; 23]> for SpacedSet<A>where
    <A as FromStr>::Err: Debug,

fn from(s: [&str; 23]) -> Self

Converts to this type from the input type.

impl<'a, A: Ord + FromStr> From<[&'a str; 24]> for SpacedSet<A>where
    <A as FromStr>::Err: Debug,

fn from(s: [&str; 24]) -> Self

Converts to this type from the input type.

impl<'a, A: Ord + FromStr> From<[&'a str; 25]> for SpacedSet<A>where
    <A as FromStr>::Err: Debug,

fn from(s: [&str; 25]) -> Self

Converts to this type from the input type.

impl<'a, A: Ord + FromStr> From<[&'a str; 26]> for SpacedSet<A>where
    <A as FromStr>::Err: Debug,

fn from(s: [&str; 26]) -> Self

Converts to this type from the input type.

impl<'a, A: Ord + FromStr> From<[&'a str; 27]> for SpacedSet<A>where
    <A as FromStr>::Err: Debug,

fn from(s: [&str; 27]) -> Self

Converts to this type from the input type.

impl<'a, A: Ord + FromStr> From<[&'a str; 28]> for SpacedSet<A>where
    <A as FromStr>::Err: Debug,

fn from(s: [&str; 28]) -> Self

Converts to this type from the input type.

impl<'a, A: Ord + FromStr> From<[&'a str; 29]> for SpacedSet<A>where
    <A as FromStr>::Err: Debug,

fn from(s: [&str; 29]) -> Self

Converts to this type from the input type.

impl<'a, A: Ord + FromStr> From<[&'a str; 3]> for SpacedSet<A>where
    <A as FromStr>::Err: Debug,

fn from(s: [&str; 3]) -> Self

Converts to this type from the input type.

impl<'a, A: Ord + FromStr> From<[&'a str; 30]> for SpacedSet<A>where
    <A as FromStr>::Err: Debug,

fn from(s: [&str; 30]) -> Self

Converts to this type from the input type.

impl<'a, A: Ord + FromStr> From<[&'a str; 31]> for SpacedSet<A>where
    <A as FromStr>::Err: Debug,

fn from(s: [&str; 31]) -> Self

Converts to this type from the input type.

impl<'a, A: Ord + FromStr> From<[&'a str; 32]> for SpacedSet<A>where
    <A as FromStr>::Err: Debug,

fn from(s: [&str; 32]) -> Self

Converts to this type from the input type.

impl<'a, A: Ord + FromStr> From<[&'a str; 4]> for SpacedSet<A>where
    <A as FromStr>::Err: Debug,

fn from(s: [&str; 4]) -> Self

Converts to this type from the input type.

impl<'a, A: Ord + FromStr> From<[&'a str; 5]> for SpacedSet<A>where
    <A as FromStr>::Err: Debug,

fn from(s: [&str; 5]) -> Self

Converts to this type from the input type.

impl<'a, A: Ord + FromStr> From<[&'a str; 6]> for SpacedSet<A>where
    <A as FromStr>::Err: Debug,

fn from(s: [&str; 6]) -> Self

Converts to this type from the input type.

impl<'a, A: Ord + FromStr> From<[&'a str; 7]> for SpacedSet<A>where
    <A as FromStr>::Err: Debug,

fn from(s: [&str; 7]) -> Self

Converts to this type from the input type.

impl<'a, A: Ord + FromStr> From<[&'a str; 8]> for SpacedSet<A>where
    <A as FromStr>::Err: Debug,

fn from(s: [&str; 8]) -> Self

Converts to this type from the input type.

impl<'a, A: Ord + FromStr> From<[&'a str; 9]> for SpacedSet<A>where
    <A as FromStr>::Err: Debug,

fn from(s: [&str; 9]) -> Self

Converts to this type from the input type.

impl<'a, 'b, 'c, 'd, 'e, 'f, 'g, 'h, A: Ord + FromStr> From<(&'a str, &'b str, &'c str, &'d str, &'e str, &'f str, &'g str, &'h str)> for SpacedSet<A>where
    <A as FromStr>::Err: Debug,

fn from(s: (&str, &str, &str, &str, &str, &str, &str, &str)) -> Self

Converts to this type from the input type.

impl<'a, 'b, 'c, 'd, 'e, 'f, 'g, A: Ord + FromStr> From<(&'a str, &'b str, &'c str, &'d str, &'e str, &'f str, &'g str)> for SpacedSet<A>where
    <A as FromStr>::Err: Debug,

fn from(s: (&str, &str, &str, &str, &str, &str, &str)) -> Self

Converts to this type from the input type.

impl<'a, 'b, 'c, 'd, 'e, 'f, A: Ord + FromStr> From<(&'a str, &'b str, &'c str, &'d str, &'e str, &'f str)> for SpacedSet<A>where
    <A as FromStr>::Err: Debug,

fn from(s: (&str, &str, &str, &str, &str, &str)) -> Self

Converts to this type from the input type.

impl<'a, 'b, 'c, 'd, 'e, A: Ord + FromStr> From<(&'a str, &'b str, &'c str, &'d str, &'e str)> for SpacedSet<A>where
    <A as FromStr>::Err: Debug,

fn from(s: (&str, &str, &str, &str, &str)) -> Self

Converts to this type from the input type.

impl<'a, 'b, 'c, 'd, A: Ord + FromStr> From<(&'a str, &'b str, &'c str, &'d str)> for SpacedSet<A>where
    <A as FromStr>::Err: Debug,

fn from(s: (&str, &str, &str, &str)) -> Self

Converts to this type from the input type.

impl<'a, 'b, 'c, A: Ord + FromStr> From<(&'a str, &'b str, &'c str)> for SpacedSet<A>where
    <A as FromStr>::Err: Debug,

fn from(s: (&str, &str, &str)) -> Self

Converts to this type from the input type.

impl<'a, 'b, A: Ord + FromStr> From<(&'a str, &'b str)> for SpacedSet<A>where
    <A as FromStr>::Err: Debug,

fn from(s: (&str, &str)) -> Self

Converts to this type from the input type.

impl<'a, A: 'a + Ord + Clone> FromIterator<&'a A> for SpacedSet<A>

fn from_iter<I>(iter: I) -> Selfwhere
    I: IntoIterator<Item = &'a A>,

Creates a value from an iterator.

impl<A: Ord> FromIterator<A> for SpacedSet<A>

fn from_iter<I>(iter: I) -> Selfwhere
    I: IntoIterator<Item = A>,

Creates a value from an iterator.

impl<'a, A: Ord + FromStr> FromStr for SpacedSet<A>where
    <A as FromStr>::Err: Debug,

type Err = <A as FromStr>::Err

The associated error which can be returned from parsing.

fn from_str(s: &str) -> Result<Self, Self::Err>

Parses a string s to return a value of this type.

impl<A: Hash + Ord> Hash for SpacedSet<A>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)where
    H: Hasher,
    Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<A: PartialEq + Ord> PartialEq<SpacedSet<A>> for SpacedSet<A>

fn eq(&self, other: &SpacedSet<A>) -> bool

This method tests for self and other values to be equal, and is used by ==.

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

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

impl<A: Eq + Ord> Eq for SpacedSet<A>

impl<A: Ord> StructuralEq for SpacedSet<A>

impl<A: Ord> StructuralPartialEq for SpacedSet<A>