Lines Matching defs:union
23734 /// [zeroed]: ../../std/mem/union.MaybeUninit.html#method.zeroed
23932 /// [zeroed]: ../../std/mem/union.MaybeUninit.html#method.zeroed
23959 /// [`MaybeUninit::assume_init`]: ../../std/mem/union.MaybeUninit.html#method.assume_init
23998 /// [`MaybeUninit::assume_init`]: ../../std/mem/union.MaybeUninit.html#method.assume_init
29192 /// Appends all key-value pairs from the union of two ascending iterators,
32368 /// A lazy iterator producing elements in the union of `BTreeSet`s.
32370 /// This `struct` is created by the [`union`] method on [`BTreeSet`].
32373 /// [`union`]: BTreeSet::union
32588 /// Visits the values representing the union,
32603 /// let union: Vec<_> = a.union(&b).cloned().collect();
32604 /// assert_eq!(union, [1, 2]);
32607 pub fn union<'a>(&'a self, other: &'a BTreeSet<T>) -> Union<'a, T>
33418 /// Returns the union of `self` and `rhs` as a new `BTreeSet<T>`.
33433 self.union(rhs).cloned().collect()
34325 assert_eq!(a.union(&a).min(), None);
34326 assert_eq!(a.union(&a).max(), None);
34339 assert_eq!(a.union(&a).min(), Some(&1));
34340 assert_eq!(a.union(&a).max(), Some(&2));
34543 check(a, b, expected, |x, y, f| x.union(y).all(f))
34560 let mut iter = x.union(&y);
34859 fn union<T: Sync + Ord>(v: &BTreeSet<T>) -> impl Sync + '_ {
34860 v.union(&v)
34898 fn union<T: Send + Sync + Ord>(v: &BTreeSet<T>) -> impl Send + '_ {
34899 v.union(&v)
37829 /// for instance a union or a symmetric difference.