[−][src]Struct alchemy_styles::SpacedSet
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.
Methods
impl<A: Ord> SpacedSet<A>
[src]
pub fn new() -> Self
[src]
Construct an empty SpacedSet
.
pub fn add<T: Into<A>>(&mut self, value: T) -> bool
[src]
Add a value to the SpacedSet
.
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>,
1.17.0[src]
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>
1.0.0[src]
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>
1.0.0[src]
&'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>
1.0.0[src]
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>
1.0.0[src]
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)
1.0.0[src]
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>,
1.0.0[src]
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>,
1.9.0[src]
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
1.0.0[src]
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
1.0.0[src]
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
1.0.0[src]
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 insert(&mut self, value: T) -> bool
1.0.0[src]
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>
1.9.0[src]
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>,
1.0.0[src]
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>,
1.9.0[src]
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>)
1.11.0[src]
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>,
1.11.0[src]
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>
1.0.0[src]
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
1.0.0[src]
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
1.0.0[src]
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: Eq + Ord> Eq for SpacedSet<A>
[src]
impl<A: PartialEq + Ord> PartialEq<SpacedSet<A>> for SpacedSet<A>
[src]
impl<A: Clone + Ord> Clone for SpacedSet<A>
[src]
fn clone(&self) -> SpacedSet<A>
[src]
fn clone_from(&mut self, source: &Self)
1.0.0[src]
Performs copy-assignment from source
. Read more
impl<'a, A: Ord + FromStr> From<&'a str> for SpacedSet<A> where
<A as FromStr>::Err: Debug,
[src]
<A as FromStr>::Err: Debug,
impl<'a, A: Ord + FromStr> From<Vec<&'a str>> for SpacedSet<A> where
<A as FromStr>::Err: Debug,
[src]
<A as FromStr>::Err: Debug,
impl<'a, A: Ord + FromStr, '_> From<&'_ Vec<&'a str>> for SpacedSet<A> where
<A as FromStr>::Err: Debug,
[src]
<A as FromStr>::Err: Debug,
impl<'a, 'b, A: Ord + FromStr> From<(&'a str, &'b str)> for SpacedSet<A> where
<A as FromStr>::Err: Debug,
[src]
<A as FromStr>::Err: Debug,
impl<'a, 'b, 'c, A: Ord + FromStr> From<(&'a str, &'b str, &'c str)> for SpacedSet<A> where
<A as FromStr>::Err: Debug,
[src]
<A as FromStr>::Err: Debug,
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,
[src]
<A as FromStr>::Err: Debug,
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,
[src]
<A as FromStr>::Err: Debug,
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,
[src]
<A as FromStr>::Err: Debug,
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,
[src]
<A as FromStr>::Err: Debug,
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,
[src]
<A as FromStr>::Err: Debug,
impl<'a, A: Ord + FromStr> From<[&'a str; 1]> for SpacedSet<A> where
<A as FromStr>::Err: Debug,
[src]
<A as FromStr>::Err: Debug,
impl<'a, A: Ord + FromStr> From<[&'a str; 2]> for SpacedSet<A> where
<A as FromStr>::Err: Debug,
[src]
<A as FromStr>::Err: Debug,
impl<'a, A: Ord + FromStr> From<[&'a str; 3]> for SpacedSet<A> where
<A as FromStr>::Err: Debug,
[src]
<A as FromStr>::Err: Debug,
impl<'a, A: Ord + FromStr> From<[&'a str; 4]> for SpacedSet<A> where
<A as FromStr>::Err: Debug,
[src]
<A as FromStr>::Err: Debug,
impl<'a, A: Ord + FromStr> From<[&'a str; 5]> for SpacedSet<A> where
<A as FromStr>::Err: Debug,
[src]
<A as FromStr>::Err: Debug,
impl<'a, A: Ord + FromStr> From<[&'a str; 6]> for SpacedSet<A> where
<A as FromStr>::Err: Debug,
[src]
<A as FromStr>::Err: Debug,
impl<'a, A: Ord + FromStr> From<[&'a str; 7]> for SpacedSet<A> where
<A as FromStr>::Err: Debug,
[src]
<A as FromStr>::Err: Debug,
impl<'a, A: Ord + FromStr> From<[&'a str; 8]> for SpacedSet<A> where
<A as FromStr>::Err: Debug,
[src]
<A as FromStr>::Err: Debug,
impl<'a, A: Ord + FromStr> From<[&'a str; 9]> for SpacedSet<A> where
<A as FromStr>::Err: Debug,
[src]
<A as FromStr>::Err: Debug,
impl<'a, A: Ord + FromStr> From<[&'a str; 10]> for SpacedSet<A> where
<A as FromStr>::Err: Debug,
[src]
<A as FromStr>::Err: Debug,
impl<'a, A: Ord + FromStr> From<[&'a str; 11]> for SpacedSet<A> where
<A as FromStr>::Err: Debug,
[src]
<A as FromStr>::Err: Debug,
impl<'a, A: Ord + FromStr> From<[&'a str; 12]> for SpacedSet<A> where
<A as FromStr>::Err: Debug,
[src]
<A as FromStr>::Err: Debug,
impl<'a, A: Ord + FromStr> From<[&'a str; 13]> for SpacedSet<A> where
<A as FromStr>::Err: Debug,
[src]
<A as FromStr>::Err: Debug,
impl<'a, A: Ord + FromStr> From<[&'a str; 14]> for SpacedSet<A> where
<A as FromStr>::Err: Debug,
[src]
<A as FromStr>::Err: Debug,
impl<'a, A: Ord + FromStr> From<[&'a str; 15]> for SpacedSet<A> where
<A as FromStr>::Err: Debug,
[src]
<A as FromStr>::Err: Debug,
impl<'a, A: Ord + FromStr> From<[&'a str; 16]> for SpacedSet<A> where
<A as FromStr>::Err: Debug,
[src]
<A as FromStr>::Err: Debug,
impl<'a, A: Ord + FromStr> From<[&'a str; 17]> for SpacedSet<A> where
<A as FromStr>::Err: Debug,
[src]
<A as FromStr>::Err: Debug,
impl<'a, A: Ord + FromStr> From<[&'a str; 18]> for SpacedSet<A> where
<A as FromStr>::Err: Debug,
[src]
<A as FromStr>::Err: Debug,
impl<'a, A: Ord + FromStr> From<[&'a str; 19]> for SpacedSet<A> where
<A as FromStr>::Err: Debug,
[src]
<A as FromStr>::Err: Debug,
impl<'a, A: Ord + FromStr> From<[&'a str; 20]> for SpacedSet<A> where
<A as FromStr>::Err: Debug,
[src]
<A as FromStr>::Err: Debug,
impl<'a, A: Ord + FromStr> From<[&'a str; 21]> for SpacedSet<A> where
<A as FromStr>::Err: Debug,
[src]
<A as FromStr>::Err: Debug,
impl<'a, A: Ord + FromStr> From<[&'a str; 22]> for SpacedSet<A> where
<A as FromStr>::Err: Debug,
[src]
<A as FromStr>::Err: Debug,
impl<'a, A: Ord + FromStr> From<[&'a str; 23]> for SpacedSet<A> where
<A as FromStr>::Err: Debug,
[src]
<A as FromStr>::Err: Debug,
impl<'a, A: Ord + FromStr> From<[&'a str; 24]> for SpacedSet<A> where
<A as FromStr>::Err: Debug,
[src]
<A as FromStr>::Err: Debug,
impl<'a, A: Ord + FromStr> From<[&'a str; 25]> for SpacedSet<A> where
<A as FromStr>::Err: Debug,
[src]
<A as FromStr>::Err: Debug,
impl<'a, A: Ord + FromStr> From<[&'a str; 26]> for SpacedSet<A> where
<A as FromStr>::Err: Debug,
[src]
<A as FromStr>::Err: Debug,
impl<'a, A: Ord + FromStr> From<[&'a str; 27]> for SpacedSet<A> where
<A as FromStr>::Err: Debug,
[src]
<A as FromStr>::Err: Debug,
impl<'a, A: Ord + FromStr> From<[&'a str; 28]> for SpacedSet<A> where
<A as FromStr>::Err: Debug,
[src]
<A as FromStr>::Err: Debug,
impl<'a, A: Ord + FromStr> From<[&'a str; 29]> for SpacedSet<A> where
<A as FromStr>::Err: Debug,
[src]
<A as FromStr>::Err: Debug,
impl<'a, A: Ord + FromStr> From<[&'a str; 30]> for SpacedSet<A> where
<A as FromStr>::Err: Debug,
[src]
<A as FromStr>::Err: Debug,
impl<'a, A: Ord + FromStr> From<[&'a str; 31]> for SpacedSet<A> where
<A as FromStr>::Err: Debug,
[src]
<A as FromStr>::Err: Debug,
impl<'a, A: Ord + FromStr> From<[&'a str; 32]> for SpacedSet<A> where
<A as FromStr>::Err: Debug,
[src]
<A as FromStr>::Err: Debug,
impl<A: Ord> Default for SpacedSet<A>
[src]
impl<A: Ord> DerefMut for SpacedSet<A>
[src]
impl<A: Ord> Deref for SpacedSet<A>
[src]
type Target = BTreeSet<A>
The resulting type after dereferencing.
fn deref(&self) -> &Self::Target
[src]
impl<A: Ord + Debug> Debug for SpacedSet<A>
[src]
impl<A: Ord + Display> Display for SpacedSet<A>
[src]
impl<A: Hash + Ord> Hash for SpacedSet<A>
[src]
fn hash<__HA: Hasher>(&self, state: &mut __HA)
[src]
fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
1.3.0[src]
H: Hasher,
Feeds a slice of this type into the given [Hasher
]. Read more
impl<A: Ord> FromIterator<A> for SpacedSet<A>
[src]
fn from_iter<I>(iter: I) -> Self where
I: IntoIterator<Item = A>,
[src]
I: IntoIterator<Item = A>,
impl<'a, A: 'a + Ord + Clone> FromIterator<&'a A> for SpacedSet<A>
[src]
fn from_iter<I>(iter: I) -> Self where
I: IntoIterator<Item = &'a A>,
[src]
I: IntoIterator<Item = &'a A>,
impl<'a, A: Ord + FromStr> FromStr for SpacedSet<A> where
<A as FromStr>::Err: Debug,
[src]
<A as FromStr>::Err: Debug,
Auto Trait Implementations
Blanket Implementations
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
fn to_owned(&self) -> T
[src]
fn clone_into(&self, target: &mut T)
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T> ToString for T where
T: Display + ?Sized,
[src]
T: Display + ?Sized,
impl<T> From<T> for T
[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
[src]
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,