File: disjuncts2.st

package info (click to toggle)
llvm-toolchain-6.0 1%3A6.0.1-10
  • links: PTS, VCS
  • area: main
  • in suites: buster
  • size: 598,080 kB
  • sloc: cpp: 3,046,253; ansic: 595,057; asm: 271,965; python: 128,926; objc: 106,554; sh: 21,906; lisp: 10,191; pascal: 6,094; ml: 5,544; perl: 5,265; makefile: 2,227; cs: 2,027; xml: 686; php: 212; csh: 117
file content (4 lines) | stat: -rw-r--r-- 205 bytes parent folder | download | duplicates (36) 
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)] }]"