Template Function ADS::bloomIntersection

Function Documentation

template<class T, class H = std::hash<T>>
std::pair<std::vector<T>, std::vector<T>> ADS::bloomIntersection(const std::vector<T> &A, const std::vector<T> &B, std::size_t mA)

the intersection of A and B by a filter of A of mA bits: the keys Q of B that the filter accepts, and the keys of A in Q, in the order of B

Pre:

mA >= 1 and A not empty

Post:

the second is the exact intersection, within the first