Struct google_geocoding::ApiSet [−][src]
An API set that deseriaizes as a JSON array and serializes with pipe spaces
Methods
impl<T> ApiSet<T> where
T: Eq + Hash + Serialize,
[src]
impl<T> ApiSet<T> where
T: Eq + Hash + Serialize,
pub fn map<__SHRINKWRAP_T, __SHRINKWRAP_F: FnMut(HashSet<T>) -> __SHRINKWRAP_T>(
self,
f: __SHRINKWRAP_F
) -> __SHRINKWRAP_T
[src]
pub fn map<__SHRINKWRAP_T, __SHRINKWRAP_F: FnMut(HashSet<T>) -> __SHRINKWRAP_T>(
self,
f: __SHRINKWRAP_F
) -> __SHRINKWRAP_T
Map a function over the wrapped value, consuming it in the process.
pub fn map_ref<__SHRINKWRAP_T, __SHRINKWRAP_F: FnMut(&HashSet<T>) -> __SHRINKWRAP_T>(
&self,
f: __SHRINKWRAP_F
) -> __SHRINKWRAP_T
[src]
pub fn map_ref<__SHRINKWRAP_T, __SHRINKWRAP_F: FnMut(&HashSet<T>) -> __SHRINKWRAP_T>(
&self,
f: __SHRINKWRAP_F
) -> __SHRINKWRAP_T
Map a function over the wrapped value without consuming it.
Methods from Deref<Target = HashSet<T>>
ⓘImportant traits for &'a mut Rpub fn hasher(&self) -> &S
1.9.0[src]
pub fn hasher(&self) -> &S
Returns a reference to the set's BuildHasher
.
Examples
use std::collections::HashSet; use std::collections::hash_map::RandomState; let hasher = RandomState::new(); let set: HashSet<i32> = HashSet::with_hasher(hasher); let hasher: &RandomState = set.hasher();
pub fn capacity(&self) -> usize
1.0.0[src]
pub fn capacity(&self) -> usize
Returns the number of elements the set can hold without reallocating.
Examples
use std::collections::HashSet; let set: HashSet<i32> = HashSet::with_capacity(100); assert!(set.capacity() >= 100);
ⓘImportant traits for Iter<'a, K>pub fn iter(&self) -> Iter<T>
1.0.0[src]
pub fn iter(&self) -> Iter<T>
An iterator visiting all elements in arbitrary order.
The iterator element type is &'a T
.
Examples
use std::collections::HashSet; let mut set = HashSet::new(); set.insert("a"); set.insert("b"); // Will print in an arbitrary order. for x in set.iter() { println!("{}", x); }
ⓘImportant traits for Difference<'a, T, S>pub fn difference(&'a self, other: &'a HashSet<T, S>) -> Difference<'a, T, S>
1.0.0[src]
pub fn difference(&'a self, other: &'a HashSet<T, S>) -> Difference<'a, T, S>
Visits the values representing the difference,
i.e. the values that are in self
but not in other
.
Examples
use std::collections::HashSet; let a: HashSet<_> = [1, 2, 3].iter().cloned().collect(); let b: HashSet<_> = [4, 2, 3, 4].iter().cloned().collect(); // Can be seen as `a - b`. for x in a.difference(&b) { println!("{}", x); // Print 1 } let diff: HashSet<_> = a.difference(&b).collect(); assert_eq!(diff, [1].iter().collect()); // Note that difference is not symmetric, // and `b - a` means something else: let diff: HashSet<_> = b.difference(&a).collect(); assert_eq!(diff, [4].iter().collect());
ⓘImportant traits for SymmetricDifference<'a, T, S>pub fn symmetric_difference(
&'a self,
other: &'a HashSet<T, S>
) -> SymmetricDifference<'a, T, S>
1.0.0[src]
pub fn symmetric_difference(
&'a self,
other: &'a HashSet<T, S>
) -> SymmetricDifference<'a, T, S>
Visits the values representing the symmetric difference,
i.e. the values that are in self
or in other
but not in both.
Examples
use std::collections::HashSet; let a: HashSet<_> = [1, 2, 3].iter().cloned().collect(); let b: HashSet<_> = [4, 2, 3, 4].iter().cloned().collect(); // Print 1, 4 in arbitrary order. for x in a.symmetric_difference(&b) { println!("{}", x); } let diff1: HashSet<_> = a.symmetric_difference(&b).collect(); let diff2: HashSet<_> = b.symmetric_difference(&a).collect(); assert_eq!(diff1, diff2); assert_eq!(diff1, [1, 4].iter().collect());
ⓘImportant traits for Intersection<'a, T, S>pub fn intersection(
&'a self,
other: &'a HashSet<T, S>
) -> Intersection<'a, T, S>
1.0.0[src]
pub fn intersection(
&'a self,
other: &'a HashSet<T, S>
) -> Intersection<'a, T, S>
Visits the values representing the intersection,
i.e. the values that are both in self
and other
.
Examples
use std::collections::HashSet; let a: HashSet<_> = [1, 2, 3].iter().cloned().collect(); let b: HashSet<_> = [4, 2, 3, 4].iter().cloned().collect(); // Print 2, 3 in arbitrary order. for x in a.intersection(&b) { println!("{}", x); } let intersection: HashSet<_> = a.intersection(&b).collect(); assert_eq!(intersection, [2, 3].iter().collect());
ⓘImportant traits for Union<'a, T, S>pub fn union(&'a self, other: &'a HashSet<T, S>) -> Union<'a, T, S>
1.0.0[src]
pub fn union(&'a self, other: &'a HashSet<T, S>) -> Union<'a, T, S>
Visits the values representing the union,
i.e. all the values in self
or other
, without duplicates.
Examples
use std::collections::HashSet; let a: HashSet<_> = [1, 2, 3].iter().cloned().collect(); let b: HashSet<_> = [4, 2, 3, 4].iter().cloned().collect(); // Print 1, 2, 3, 4 in arbitrary order. for x in a.union(&b) { println!("{}", x); } let union: HashSet<_> = a.union(&b).collect(); assert_eq!(union, [1, 2, 3, 4].iter().collect());
pub fn len(&self) -> usize
1.0.0[src]
pub fn len(&self) -> usize
Returns the number of elements in the set.
Examples
use std::collections::HashSet; let mut v = HashSet::new(); assert_eq!(v.len(), 0); v.insert(1); assert_eq!(v.len(), 1);
pub fn is_empty(&self) -> bool
1.0.0[src]
pub fn is_empty(&self) -> bool
Returns true if the set contains no elements.
Examples
use std::collections::HashSet; let mut v = HashSet::new(); assert!(v.is_empty()); v.insert(1); assert!(!v.is_empty());
pub fn contains<Q>(&self, value: &Q) -> bool where
Q: Hash + Eq + ?Sized,
T: Borrow<Q>,
1.0.0[src]
pub fn contains<Q>(&self, value: &Q) -> bool where
Q: Hash + Eq + ?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
Hash
and Eq
on the borrowed form must match those for
the value type.
Examples
use std::collections::HashSet; let set: HashSet<_> = [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: Hash + Eq + ?Sized,
T: Borrow<Q>,
1.9.0[src]
pub fn get<Q>(&self, value: &Q) -> Option<&T> where
Q: Hash + Eq + ?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
Hash
and Eq
on the borrowed form must match those for
the value type.
Examples
use std::collections::HashSet; let set: HashSet<_> = [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: &HashSet<T, S>) -> bool
1.0.0[src]
pub fn is_disjoint(&self, other: &HashSet<T, S>) -> 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::HashSet; let a: HashSet<_> = [1, 2, 3].iter().cloned().collect(); let mut b = HashSet::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: &HashSet<T, S>) -> bool
1.0.0[src]
pub fn is_subset(&self, other: &HashSet<T, S>) -> 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::HashSet; let sup: HashSet<_> = [1, 2, 3].iter().cloned().collect(); let mut set = HashSet::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: &HashSet<T, S>) -> bool
1.0.0[src]
pub fn is_superset(&self, other: &HashSet<T, S>) -> 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::HashSet; let sub: HashSet<_> = [1, 2].iter().cloned().collect(); let mut set = HashSet::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);
Trait Implementations
impl<T: Clone> Clone for ApiSet<T> where
T: Eq + Hash + Serialize,
[src]
impl<T: Clone> Clone for ApiSet<T> where
T: Eq + Hash + Serialize,
fn clone(&self) -> ApiSet<T>
[src]
fn clone(&self) -> ApiSet<T>
Returns a copy of the value. Read more
fn clone_from(&mut self, source: &Self)
1.0.0[src]
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source
. Read more
impl<T: Debug> Debug for ApiSet<T> where
T: Eq + Hash + Serialize,
[src]
impl<T: Debug> Debug for ApiSet<T> where
T: Eq + Hash + Serialize,
fn fmt(&self, f: &mut Formatter) -> Result
[src]
fn fmt(&self, f: &mut Formatter) -> Result
Formats the value using the given formatter. Read more
impl<T> Deref for ApiSet<T> where
T: Eq + Hash + Serialize,
[src]
impl<T> Deref for ApiSet<T> where
T: Eq + Hash + Serialize,
type Target = HashSet<T>
The resulting type after dereferencing.
fn deref(&self) -> &Self::Target
[src]
fn deref(&self) -> &Self::Target
Dereferences the value.
impl<T> Borrow<HashSet<T>> for ApiSet<T> where
T: Eq + Hash + Serialize,
[src]
impl<T> Borrow<HashSet<T>> for ApiSet<T> where
T: Eq + Hash + Serialize,
impl<T> AsRef<HashSet<T>> for ApiSet<T> where
T: Eq + Hash + Serialize,
[src]
impl<T> AsRef<HashSet<T>> for ApiSet<T> where
T: Eq + Hash + Serialize,
impl<'de, T> Deserialize<'de> for ApiSet<T> where
T: Eq + Hash + Deserialize<'de> + Serialize,
[src]
impl<'de, T> Deserialize<'de> for ApiSet<T> where
T: Eq + Hash + Deserialize<'de> + Serialize,
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error> where
D: Deserializer<'de>,
[src]
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error> where
D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
impl<T> Serialize for ApiSet<T> where
T: Eq + Hash + Serialize,
[src]
impl<T> Serialize for ApiSet<T> where
T: Eq + Hash + Serialize,