std/algorithm/setops.d

7 $(LREF setIntersection), $(LREF setSymmetricDifference) expect a range of sorted
30 $(T2 setIntersection,
1271 SetIntersection!(less, Rs) setIntersection(alias less = "a < b", Rs...)(Rs ranges)
1287     assert(equal(setIntersection(a, a), a));
1288     assert(equal(setIntersection(a, b), [1, 2, 4, 7]));
1289     assert(equal(setIntersection(a, b, c), [1, 4, 7]));
1294     assert(equal(setIntersection(a, d), [1, 2, 7]));
1295     assert(equal(setIntersection(d, e), [1, 1, 7]));
1309     assert(equal(setIntersection(a, a), a));
1310     assert(equal(setIntersection(a, a, a), a));
1311     assert(equal(setIntersection(a, b), [1, 2, 4, 7]));
1312     assert(equal(setIntersection(a, b, c), [1, 4, 7]));
1313     assert(equal(setIntersection(a, b, c, d), [1, 4]));
1314     assert(equal(setIntersection(a, b, c, d, e), [4]));
1318     assert(equal(setIntersection(inpA, inpB, inpC, inpD), [1, 4]));
1320     assert(equal(setIntersection(a, b, b, a), [1, 2, 4, 7]));
1321     assert(equal(setIntersection(a, c, b), [1, 4, 7]));
1322     assert(equal(setIntersection(b, a, c), [1, 4, 7]));
1323     assert(equal(setIntersection(b, c, a), [1, 4, 7]));
1324     assert(equal(setIntersection(c, a, b), [1, 4, 7]));
1325     assert(equal(setIntersection(c, b, a), [1, 4, 7]));