mirror of
https://github.com/apple/swift.git
synced 2025-12-14 20:36:38 +01:00
We do this by doing a traversal of our sorted lists in a similar manner as one would when one is merging two such sets, i.e. one has two iterators and always advances the iterator that has a value that is less than the other. If we ever hit a situation where the two iterators equal, we must have a non-empty intersection. A unittest that exercises very basic functionality is provided as well.
4.2 KiB
4.2 KiB