Expand description
Set operations on iterators and streams.
Sorted variants require their inputs to be ascending under a total order
and preserve multiplicity. The unsorted [intersection] runs in O(n*m)
and is provided for convenience when sorting is unavailable.
Re-exportsยง
use std::borrow::Borrow;๐use std::collections::BTreeSet;๐use std::pin::Pin;๐use std::task::ready;๐use futures::Stream;๐use futures::task::Context;๐use futures::task::Poll;๐pub use self::difference_sorted_stream2::difference_sorted_stream2;pub use self::intersection::intersection;pub use self::intersection_sorted::intersection_sorted;pub use self::intersection_sorted_stream2::intersection_sorted_stream2;
Modulesยง
- difference_
sorted_ ๐stream2 - intersection ๐
- intersection_
sorted ๐ - intersection_
sorted_ ๐stream2
Functionsยง
- is_
empty_ or_ contains - Reports whether
allowedis empty or containsitem. - poll_
head ๐ - Lazily fill the cached head of
streamintopeekedand return a borrow.