First commit : 0.14.0 version (with roadmap in doc instead of
[cloog/uuh.git] / test / levenshtein-1-2-3.c
blob0d3286e4585f74f23d41d2f5fb88d5b5649b2d80
1 /* Generated by CLooG v0.10.7 */
2 S1(i = 0,j = 0) ;
3 S2(i = 1,j = 0) ;
4 S3(i = 1,j = 1) ;
5 for (i=2;i<=N;i++) {
6 S2(j = 0) ;
7 for (j=1;j<=i-1;j++) {
8 S6 ;
10 S3(j = i) ;
12 i = N+1 ;
13 S7(j = 0) ;
14 for (j=1;j<=N;j++) {
15 S6 ;
16 S8 ;
18 for (i=N+2;i<=2*M-N-2;i++) {
19 for (j=ceild(i-N-2,2);j<=floord(i-N-1,2);j++) {
20 S7 ;
22 if ((i-N)%2 == 0) {
23 j = (i-N)/2 ;
24 S5 ;
25 S8 ;
27 for (j=ceild(i-N+1,2);j<=floord(i+N-1,2);j++) {
28 S6 ;
29 S8 ;
31 if ((i+N)%2 == 0) {
32 j = (i+N)/2 ;
33 S4 ;
34 S8 ;
37 for (i=2*M-N-1;i<=2*M-2;i++) {
38 for (j=i-M+1;j<=M-1;j++) {
39 S6 ;