Template Function ADS::intersectBinarySearch

• Defined in File SortedIntersection.h

Function Documentation

template<class T, class C = std::less<>>
std::vector<T> ADS::intersectBinarySearch(const std::vector<T> &A, const std::vector<T> &B, C less = C())

the items common to A and B, by a binary search in the longer list of each item of the shorter one

Pre:

A and B strictly increasing (an audit)

Post:

the result of intersectMerge() (an audit)