File: disjuncts2.st

package info (click to toggle)
llvm-toolchain-19 1%3A19.1.7-3
  • links: PTS, VCS
  • area: main
  • in suites: trixie
  • size: 1,998,520 kB
  • sloc: cpp: 6,951,680; ansic: 1,486,157; asm: 913,598; python: 232,024; f90: 80,126; objc: 75,281; lisp: 37,276; pascal: 16,990; sh: 10,009; ml: 5,058; perl: 4,724; awk: 3,523; makefile: 3,167; javascript: 2,504; xml: 892; fortran: 664; cs: 573
file content (4 lines) | stat: -rw-r--r-- 205 bytes parent folder | download | duplicates (42) 
1
2
3
4
 
# Check that the loop is generated only once with an outer disjunctive condition
domain: "[N, Q, P] -> { S[i0] : 0 <= i0 < N and (P > Q or P < Q) }"
child:
  schedule: "[N, Q, P] -> [{ S[i0] -> [(i0)] }]"