Module set 

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.

Modules

difference_sorted_stream2 🔒

intersection 🔒

intersection_sorted 🔒

intersection_sorted_stream2 🔒

Functions

difference_sorted_stream2

Difference of sets

intersection

Intersection of sets

intersection_sorted

Intersection of sets

intersection_sorted_stream2

Intersection of sets

poll_head 🔒

Lazily fill the cached head of stream into peeked and return a borrow.