# Provenance for recursive queries (WITH RECURSIVE).
#
# PG15+ only: the planner-hook lowering uses pg_get_querydef (exported from
# ruleutils.h only since PG15) and pg_analyze_and_rewrite_fixedparams (PG15).
# On earlier majors recursive CTEs over tracked relations keep raising
# "Recursive CTEs not supported", so this test is gated to PG15+.
test: recursive

# Bounded-treewidth reachability through the rewriter: the recursive
# reachability shape compiled along a tree decomposition of the data
# (provenance class 'absorptive' or 'boolean'), with fallback coverage
test: btw_recursive

# Bounded-hop reachability: the hop-counting CTE shape, walk-length-set
# states, certified within-bound deduplication gates
test: btw_hops

# Case Study 7 (peer-review / knowledge compilation): its recursive
# reachability section is PG15+, so the whole case study is gated here.
test: casestudy7

# Absorptive provenance class: cyclic recursion truncated at the value
# fixpoint, tokens tagged 'assumed'/'absorptive'; min-plus and probability
# proceed, counting and unrestricted tropical refuse
test: absorptive_recursion

# Cross-vertex reachability aggregations: GROUP BY over a join with a
# reachability CTE gets certified any-member gates planted per group
test: btw_anyreach

# Min-cost reachability: tropical (and any absorptive-semiring)
# evaluation of the route's certified circuits -- plain, hop-bounded
# and per-region, cost-0 edges included
test: btw_tropical

# K-terminal coverage: reachability self-join conjunctions get a
# certified all-members circuit planted at the times-canonical address
# (k-terminal reliability, Steiner cost via min-plus)
test: btw_cover