You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
If you have two sorted iterators (e.g. from BTreeMap::keys) there are various set operations you might want to perform, including union, intersection, difference and symmetric_difference.
If you have two sorted iterators (e.g. from
BTreeMap::keys
) there are various set operations you might want to perform, includingunion
,intersection
,difference
andsymmetric_difference
.union
is implemented viaitertools::merge
.The others can be implemented with
itertools::merge_join_by
+filter_map
and probablyitertools::diff_with
. But perhaps there should be more direct implementations?Here's a direct implementation of intersection, for example:
The text was updated successfully, but these errors were encountered: