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".try_into()?;
let classList: SpacedSet<Class> = ["foo", "bar", "baz"].try_into()?;
let classList: SpacedSet<Class> = ("foo", "bar", "baz").try_into()?;

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

Methods

impl<A: Ord> SpacedSet<A>

pub fn new() -> Self

Construct an empty SpacedSet.

pub fn add<T: TryInto<A>>(&mut self, value: T) -> bool where
    <T as TryInto<A>>::Error: Debug, 

Add a value to the SpacedSet, converting it as necessary.

Panics if the conversion fails.

pub fn try_add<T: TryInto<A>>(
    &mut self,
    value: T
) -> Result<bool, <T as TryInto<A>>::Error>

Add a value to the SpacedSet, converting it as necessary.

Returns an error if the conversion fails.

Methods from Deref<Target = BTreeSet<A>>

pub fn range<K, R>(&self, range: R) -> Range<T> where
    K: Ord + ?Sized,
    R: RangeBounds<K>,
    T: Borrow<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.

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 self, other: &'a BTreeSet<T>) -> Difference<'a, T>

Visits the values representing the difference, i.e., the values 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 self,
    other: &'a BTreeSet<T>
) -> SymmetricDifference<'a, T>

Visits the values representing the symmetric difference, i.e., the values 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 self, other: &'a BTreeSet<T>) -> Intersection<'a, T>

Visits the values representing the intersection, i.e., the values 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 self, other: &'a BTreeSet<T>) -> Union<'a, T>

Visits the values representing the union, i.e., all the values 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)

Clears the set, removing all values.

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) -> bool where
    Q: Ord + ?Sized,
    T: Borrow<Q>, 

Returns true if the set contains a value.

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

Examples

use std::collections::BTreeSet;

let set: BTreeSet<_> = [1, 2, 3].iter().cloned().collect();
assert_eq!(set.contains(&1), true);
assert_eq!(set.contains(&4), false);

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

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

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

Examples

use std::collections::BTreeSet;

let set: BTreeSet<_> = [1, 2, 3].iter().cloned().collect();
assert_eq!(set.get(&2), Some(&2));
assert_eq!(set.get(&4), None);

pub fn is_disjoint(&self, other: &BTreeSet<T>) -> bool

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<_> = [1, 2, 3].iter().cloned().collect();
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>) -> bool

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

Examples

use std::collections::BTreeSet;

let sup: BTreeSet<_> = [1, 2, 3].iter().cloned().collect();
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>) -> bool

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

Examples

use std::collections::BTreeSet;

let sub: BTreeSet<_> = [1, 2].iter().cloned().collect();
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>

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

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

Examples

Basic usage:

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

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

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

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

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

Examples

Basic usage:

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

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

pub fn pop_first(&mut self) -> Option<T>

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

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

Examples

#![feature(map_first_last)]
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>

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

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

Examples

#![feature(map_first_last)]
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) -> bool

Adds a value to the set.

If the set did not have this value present, true is returned.

If the set did have this value present, 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>

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

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) -> bool where
    Q: Ord + ?Sized,
    T: Borrow<Q>, 

Removes a value from the set. Returns whether the value was present in the set.

The value may be any borrowed form of the set's value type, but the ordering on the borrowed form must match the ordering on the value 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
    Q: Ord + ?Sized,
    T: Borrow<Q>, 

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

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

Examples

use std::collections::BTreeSet;

let mut set: BTreeSet<_> = [1, 2, 3].iter().cloned().collect();
assert_eq!(set.take(&2), Some(2));
assert_eq!(set.take(&2), None);

pub fn append(&mut self, other: &mut BTreeSet<T>)

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, key: &Q) -> BTreeSet<T> where
    Q: Ord + ?Sized,
    T: Borrow<Q>, 

Splits the collection into two at the given key. Returns everything after the given key, including the key.

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 iter(&self) -> Iter<T>

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

Examples

use std::collections::BTreeSet;

let set: BTreeSet<usize> = [1, 2, 3].iter().cloned().collect();
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<usize> = [3, 1, 2].iter().cloned().collect();
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>

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: Eq + Ord> Eq for SpacedSet<A>

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

fn from_iter<I>(iter: I) -> Self where
    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) -> Self where
    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, 

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: &SpacedSet<A>) -> bool

This method tests for !=.

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

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

impl<'a, A> TryFrom<&'a str> for SpacedSet<A> where
    A: Ord + FromStr, 

type Error = <A as FromStr>::Err

The type returned in the event of a conversion error.

fn try_from(s: &'a str) -> Result<Self, Self::Error>

Performs the conversion.

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

type Error = <A as FromStr>::Err

The type returned in the event of a conversion error.

fn try_from(s: [&str; 1]) -> Result<Self, Self::Error>

Performs the conversion.

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

type Error = <A as FromStr>::Err

The type returned in the event of a conversion error.

fn try_from(s: [&str; 10]) -> Result<Self, Self::Error>

Performs the conversion.

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

type Error = <A as FromStr>::Err

The type returned in the event of a conversion error.

fn try_from(s: [&str; 11]) -> Result<Self, Self::Error>

Performs the conversion.

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

type Error = <A as FromStr>::Err

The type returned in the event of a conversion error.

fn try_from(s: [&str; 12]) -> Result<Self, Self::Error>

Performs the conversion.

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

type Error = <A as FromStr>::Err

The type returned in the event of a conversion error.

fn try_from(s: [&str; 13]) -> Result<Self, Self::Error>

Performs the conversion.

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

type Error = <A as FromStr>::Err

The type returned in the event of a conversion error.

fn try_from(s: [&str; 14]) -> Result<Self, Self::Error>

Performs the conversion.

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

type Error = <A as FromStr>::Err

The type returned in the event of a conversion error.

fn try_from(s: [&str; 15]) -> Result<Self, Self::Error>

Performs the conversion.

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

type Error = <A as FromStr>::Err

The type returned in the event of a conversion error.

fn try_from(s: [&str; 16]) -> Result<Self, Self::Error>

Performs the conversion.

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

type Error = <A as FromStr>::Err

The type returned in the event of a conversion error.

fn try_from(s: [&str; 17]) -> Result<Self, Self::Error>

Performs the conversion.

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

type Error = <A as FromStr>::Err

The type returned in the event of a conversion error.

fn try_from(s: [&str; 18]) -> Result<Self, Self::Error>

Performs the conversion.

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

type Error = <A as FromStr>::Err

The type returned in the event of a conversion error.

fn try_from(s: [&str; 19]) -> Result<Self, Self::Error>

Performs the conversion.

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

type Error = <A as FromStr>::Err

The type returned in the event of a conversion error.

fn try_from(s: [&str; 2]) -> Result<Self, Self::Error>

Performs the conversion.

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

type Error = <A as FromStr>::Err

The type returned in the event of a conversion error.

fn try_from(s: [&str; 20]) -> Result<Self, Self::Error>

Performs the conversion.

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

type Error = <A as FromStr>::Err

The type returned in the event of a conversion error.

fn try_from(s: [&str; 21]) -> Result<Self, Self::Error>

Performs the conversion.

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

type Error = <A as FromStr>::Err

The type returned in the event of a conversion error.

fn try_from(s: [&str; 22]) -> Result<Self, Self::Error>

Performs the conversion.

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

type Error = <A as FromStr>::Err

The type returned in the event of a conversion error.

fn try_from(s: [&str; 23]) -> Result<Self, Self::Error>

Performs the conversion.

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

type Error = <A as FromStr>::Err

The type returned in the event of a conversion error.

fn try_from(s: [&str; 24]) -> Result<Self, Self::Error>

Performs the conversion.

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

type Error = <A as FromStr>::Err

The type returned in the event of a conversion error.

fn try_from(s: [&str; 25]) -> Result<Self, Self::Error>

Performs the conversion.

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

type Error = <A as FromStr>::Err

The type returned in the event of a conversion error.

fn try_from(s: [&str; 26]) -> Result<Self, Self::Error>

Performs the conversion.

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

type Error = <A as FromStr>::Err

The type returned in the event of a conversion error.

fn try_from(s: [&str; 27]) -> Result<Self, Self::Error>

Performs the conversion.

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

type Error = <A as FromStr>::Err

The type returned in the event of a conversion error.

fn try_from(s: [&str; 28]) -> Result<Self, Self::Error>

Performs the conversion.

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

type Error = <A as FromStr>::Err

The type returned in the event of a conversion error.

fn try_from(s: [&str; 29]) -> Result<Self, Self::Error>

Performs the conversion.

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

type Error = <A as FromStr>::Err

The type returned in the event of a conversion error.

fn try_from(s: [&str; 3]) -> Result<Self, Self::Error>

Performs the conversion.

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

type Error = <A as FromStr>::Err

The type returned in the event of a conversion error.

fn try_from(s: [&str; 30]) -> Result<Self, Self::Error>

Performs the conversion.

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

type Error = <A as FromStr>::Err

The type returned in the event of a conversion error.

fn try_from(s: [&str; 31]) -> Result<Self, Self::Error>

Performs the conversion.

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

type Error = <A as FromStr>::Err

The type returned in the event of a conversion error.

fn try_from(s: [&str; 32]) -> Result<Self, Self::Error>

Performs the conversion.

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

type Error = <A as FromStr>::Err

The type returned in the event of a conversion error.

fn try_from(s: [&str; 4]) -> Result<Self, Self::Error>

Performs the conversion.

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

type Error = <A as FromStr>::Err

The type returned in the event of a conversion error.

fn try_from(s: [&str; 5]) -> Result<Self, Self::Error>

Performs the conversion.

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

type Error = <A as FromStr>::Err

The type returned in the event of a conversion error.

fn try_from(s: [&str; 6]) -> Result<Self, Self::Error>

Performs the conversion.

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

type Error = <A as FromStr>::Err

The type returned in the event of a conversion error.

fn try_from(s: [&str; 7]) -> Result<Self, Self::Error>

Performs the conversion.

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

type Error = <A as FromStr>::Err

The type returned in the event of a conversion error.

fn try_from(s: [&str; 8]) -> Result<Self, Self::Error>

Performs the conversion.

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

type Error = <A as FromStr>::Err

The type returned in the event of a conversion error.

fn try_from(s: [&str; 9]) -> Result<Self, Self::Error>

Performs the conversion.

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

type Error = <A as FromStr>::Err

The type returned in the event of a conversion error.

fn try_from(
    s: (&str, &str, &str, &str, &str, &str, &str, &str)
) -> Result<Self, Self::Error>

Performs the conversion.

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

type Error = <A as FromStr>::Err

The type returned in the event of a conversion error.

fn try_from(
    s: (&str, &str, &str, &str, &str, &str, &str)
) -> Result<Self, Self::Error>

Performs the conversion.

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

type Error = <A as FromStr>::Err

The type returned in the event of a conversion error.

fn try_from(
    s: (&str, &str, &str, &str, &str, &str)
) -> Result<Self, Self::Error>

Performs the conversion.

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

type Error = <A as FromStr>::Err

The type returned in the event of a conversion error.

fn try_from(s: (&str, &str, &str, &str, &str)) -> Result<Self, Self::Error>

Performs the conversion.

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

type Error = <A as FromStr>::Err

The type returned in the event of a conversion error.

fn try_from(s: (&str, &str, &str, &str)) -> Result<Self, Self::Error>

Performs the conversion.

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

type Error = <A as FromStr>::Err

The type returned in the event of a conversion error.

fn try_from(s: (&str, &str, &str)) -> Result<Self, Self::Error>

Performs the conversion.

impl<'a, 'b, A> TryFrom<(&'a str, &'b str)> for SpacedSet<A> where
    A: Ord + FromStr, 

type Error = <A as FromStr>::Err

The type returned in the event of a conversion error.

fn try_from(s: (&str, &str)) -> Result<Self, Self::Error>

Performs the conversion.