46 static void test_return_bool(isl::ctx ctx)  in test_return_bool()
48 	isl::set empty(ctx, "{ : false }");  in test_return_bool()
49 	isl::set univ(ctx, "{ : }");  in test_return_bool()
50 	isl::set null;  in test_return_bool()
58 	} catch (const isl::exception_invalid &e) {  in test_return_bool()
72 static void test_return(isl::ctx ctx)  in test_return()
87 static void test_foreach(isl::ctx ctx)  in test_foreach()
89 	isl::set s(ctx, "{ [0]; [1]; [2] }");  in test_foreach()
91 	std::vector<isl::basic_set> basic_sets;  in test_foreach()
93 	auto add_to_vector = [&] (isl::basic_set bs) {  in test_foreach()
100 	assert(isl::set(basic_sets[0]).is_subset(s));  in test_foreach()
101 	assert(isl::set(basic_sets[1]).is_subset(s));  in test_foreach()
102 	assert(isl::set(basic_sets[2]).is_subset(s));  in test_foreach()
105 	auto fail = [&] (isl::basic_set bs) {  in test_foreach()
124 static void test_foreach_scc(isl::ctx ctx)  in test_foreach_scc()
126 	isl::multi_pw_aff id;  in test_foreach_scc()
127 	isl::id_list list(ctx, 3);  in test_foreach_scc()
128 	isl::id_list sorted(ctx, 3);  in test_foreach_scc()
129 	std::map<std::string, isl::map> data = {  in test_foreach_scc()
130 		{ "a", isl::map(ctx, "{ [0] -> [1] }") },  in test_foreach_scc()
131 		{ "b", isl::map(ctx, "{ [1] -> [0] }") },  in test_foreach_scc()
132 		{ "c", isl::map(ctx, "{ [i = 0:1] -> [i] }") },  in test_foreach_scc()
138 	list.foreach_scc([&data, &id] (isl::id a, isl::id b) {  in test_foreach_scc()
141 	}, [&sorted] (isl::id_list scc) {  in test_foreach_scc()
156 static void test_every(isl::ctx ctx)  in test_every()
158 	isl::union_set us(ctx, "{ A[i]; B[j] }");  in test_every()
162 	auto fail = [] (isl::set s) -> bool {  in test_every()
180 static void test_exception(isl::ctx ctx)  in test_exception()
182 	isl::multi_union_pw_aff mupa(ctx, "[]");  in test_exception()
183 	isl::exception copy;  in test_exception()
185 	static_assert(std::is_nothrow_copy_constructible<isl::exception>::value,  in test_exception()
187 	static_assert(std::is_nothrow_assignable<isl::exception,  in test_exception()
188 						isl::exception>::value,  in test_exception()
192 		auto umap = isl::union_map::from(mupa);  in test_exception()
193 	} catch (const isl::exception_unsupported &error) {  in test_exception()
195 	} catch (const isl::exception &error) {  in test_exception()
210 static void test_schedule_tree(isl::ctx ctx)  in test_schedule_tree()
214 	auto fail_map = [](isl::schedule_node node) {  in test_schedule_tree()
228 	auto inc_count = [&count](isl::schedule_node node) {  in test_schedule_tree()
236 	auto inc_count_once = [&count](isl::schedule_node node) {  in test_schedule_tree()
243 	auto is_not_domain = [](isl::schedule_node node) {  in test_schedule_tree()
244 		return !node.isa<isl::schedule_node_domain>();  in test_schedule_tree()
249 	auto fail = [](isl::schedule_node node) {  in test_schedule_tree()
262 	auto domain = root.as<isl::schedule_node_domain>().domain();  in test_schedule_tree()
263 	auto filters = isl::union_set(ctx, "{}");  in test_schedule_tree()
264 	auto collect_filters = [&filters](isl::schedule_node node) {  in test_schedule_tree()
265 		if (node.isa<isl::schedule_node_filter>()) {  in test_schedule_tree()
266 			auto filter = node.as<isl::schedule_node_filter>();  in test_schedule_tree()
281 static void test_ast_build(isl::ctx ctx)  in test_ast_build()
288 	    [&count_ast_fail, &do_fail](isl::ast_node node,  in test_ast_build()
289 					isl::ast_build build) {  in test_ast_build()
295 	auto build = isl::ast_build(ctx);  in test_ast_build()
308 	    [&count_ast](isl::ast_node node, isl::ast_build build) {  in test_ast_build()
328 static void test_typed(isl::ctx ctx)  in test_typed()
332 	isl::typed::map<ST, AR> access(ctx, "{ S[i, j] -> A[i] }");  in test_typed()
333 	isl::typed::set<ST> instances(ctx, "{ S[i, j] : 0 <= i, j < 10 }");  in test_typed()