reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
76 auto And = C.intersect(L1.iterator(), L0.iterator()); 81 And = C.intersect(L0.iterator(), L1.iterator()); 102 auto And = C.intersect(L0.iterator(), L1.iterator(), L2.iterator()); 116 auto Empty1 = C.intersect(L1.iterator(), L2.iterator()); 117 auto Empty2 = C.intersect(L1.iterator(), L2.iterator()); 119 auto And = C.intersect(std::move(Empty1), std::move(Empty2)); 219 auto Root = C.intersect( 221 C.intersect(L0.iterator(), C.boost(L1.iterator(), 2U)), 258 auto Tree = C.limit(C.intersect(move(I1), move(I2)), 10); 280 C.intersect(C.limit(C.all(), 343), C.limit(L0.iterator(), 2), 326 EXPECT_EQ(llvm::to_string(*C.intersect()), "true"); 330 EXPECT_EQ(llvm::to_string(*C.intersect(L1.iterator(), C.all())), "[1]"); 331 EXPECT_EQ(llvm::to_string(*C.intersect(L1.iterator(), C.none())), "false"); 338 EXPECT_EQ(llvm::to_string(*C.intersect( 339 L1.iterator(), C.intersect(L1.iterator(), L1.iterator()))), 346 EXPECT_EQ(llvm::to_string(*C.intersect( 347 C.intersect(L1.iterator(), C.intersect()), C.unionOf(C.all()))), 347 C.intersect(L1.iterator(), C.intersect()), C.unionOf(C.all()))),