File: levenshtein-1-2-3.c

package info (click to toggle)
llvm-toolchain-7 1%3A7.0.1-8
  • links: PTS, VCS
  • area: main
  • in suites: buster
  • size: 733,456 kB
  • sloc: cpp: 3,776,651; ansic: 633,271; asm: 350,301; python: 142,716; objc: 107,612; sh: 22,626; lisp: 11,056; perl: 7,999; pascal: 6,742; ml: 5,537; awk: 3,536; makefile: 2,557; cs: 2,027; xml: 841; ruby: 156
file content (32 lines) | stat: -rw-r--r-- 764 bytes parent folder | download | duplicates (9) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
 
{
  S1(0, 0);
  for (int c0 = 1; c0 <= N; c0 += 1) {
    S2(c0, 0);
    for (int c1 = 1; c1 < c0; c1 += 1)
      S6(c0, c1);
    S3(c0, c0);
  }
  S7(N + 1, 0);
  for (int c1 = 1; c1 <= N; c1 += 1) {
    S6(N + 1, c1);
    S8(N + 1, c1);
  }
  for (int c0 = N + 2; c0 < 2 * M - N - 1; c0 += 1) {
    S7(c0, -N + (N + c0 + 1) / 2 - 1);
    if ((N + c0) % 2 == 0) {
      S5(c0, (-N + c0) / 2);
      S8(c0, (-N + c0) / 2);
    }
    for (int c1 = -N + (N + c0) / 2 + 1; c1 < (N + c0 + 1) / 2; c1 += 1) {
      S6(c0, c1);
      S8(c0, c1);
    }
    if ((N + c0) % 2 == 0) {
      S4(c0, (N + c0) / 2);
      S8(c0, (N + c0) / 2);
    }
  }
  for (int c0 = 2 * M - N - 1; c0 < 2 * M - 1; c0 += 1)
    for (int c1 = -M + c0 + 1; c1 < M; c1 += 1)
      S6(c0, c1);
}