Hi everyone,

I was wondering if anyone could point me towards the best way to get the intersection of two unordered sets in JUCE? Should I use the cpp code below, or is there something built into JUCE?

The example code uses sorted sets, and a call from #include :

set_intersection ( InputIterator1 first1, InputIterator1 last1,

InputIterator2 first2, InputIterator2 last2,

OutputIterator result )

See http://www.cplusplus.com/reference/algorithm/set_intersection/

Cheers,

Owen