44 static void test_return_bool(isl::ctx ctx)  in test_return_bool()
46 	isl::set empty(ctx, "{ : false }");  in test_return_bool()
47 	isl::set univ(ctx, "{ : }");  in test_return_bool()
48 	isl::set null;  in test_return_bool()
56 	} catch (const isl::exception_invalid &e) {  in test_return_bool()
70 static void test_return(isl::ctx ctx)  in test_return()
85 static void test_foreach(isl::ctx ctx)  in test_foreach()
87 	isl::set s(ctx, "{ [0]; [1]; [2] }");  in test_foreach()
89 	std::vector<isl::basic_set> basic_sets;  in test_foreach()
91 	auto add_to_vector = [&] (isl::basic_set bs) {  in test_foreach()
98 	assert(isl::set(basic_sets[0]).is_subset(s));  in test_foreach()
99 	assert(isl::set(basic_sets[1]).is_subset(s));  in test_foreach()
100 	assert(isl::set(basic_sets[2]).is_subset(s));  in test_foreach()
103 	auto fail = [&] (isl::basic_set bs) {  in test_foreach()
122 static void test_every(isl::ctx ctx)  in test_every()
124 	isl::union_set us(ctx, "{ A[i]; B[j] }");  in test_every()
128 	auto fail = [] (isl::set s) -> bool {  in test_every()
146 static void test_exception(isl::ctx ctx)  in test_exception()
148 	isl::multi_union_pw_aff mupa(ctx, "[]");  in test_exception()
149 	isl::exception copy;  in test_exception()
151 	static_assert(std::is_nothrow_copy_constructible<isl::exception>::value,  in test_exception()
153 	static_assert(std::is_nothrow_assignable<isl::exception,  in test_exception()
154 						isl::exception>::value,  in test_exception()
158 		auto umap = isl::union_map::from(mupa);  in test_exception()
159 	} catch (const isl::exception_unsupported &error) {  in test_exception()
161 	} catch (const isl::exception &error) {  in test_exception()
176 static void test_schedule_tree(isl::ctx ctx)  in test_schedule_tree()
180 	auto fail_map = [](isl::schedule_node node) {  in test_schedule_tree()
194 	auto inc_count = [&count](isl::schedule_node node) {  in test_schedule_tree()
202 	auto inc_count_once = [&count](isl::schedule_node node) {  in test_schedule_tree()
209 	auto is_not_domain = [](isl::schedule_node node) {  in test_schedule_tree()
210 		return !node.isa<isl::schedule_node_domain>();  in test_schedule_tree()
215 	auto fail = [](isl::schedule_node node) {  in test_schedule_tree()
228 	auto domain = root.as<isl::schedule_node_domain>().domain();  in test_schedule_tree()
229 	auto filters = isl::union_set(ctx, "{}");  in test_schedule_tree()
230 	auto collect_filters = [&filters](isl::schedule_node node) {  in test_schedule_tree()
231 		if (node.isa<isl::schedule_node_filter>()) {  in test_schedule_tree()
232 			auto filter = node.as<isl::schedule_node_filter>();  in test_schedule_tree()
247 static void test_ast_build(isl::ctx ctx)  in test_ast_build()
254 	    [&count_ast_fail, &do_fail](isl::ast_node node,  in test_ast_build()
255 					isl::ast_build build) {  in test_ast_build()
261 	auto build = isl::ast_build(ctx);  in test_ast_build()
274 	    [&count_ast](isl::ast_node node, isl::ast_build build) {  in test_ast_build()
294 static void test_typed(isl::ctx ctx)  in test_typed()
298 	isl::typed::map<ST, AR> access(ctx, "{ S[i, j] -> A[i] }");  in test_typed()
299 	isl::typed::set<ST> instances(ctx, "{ S[i, j] : 0 <= i, j < 10 }");  in test_typed()