Debian Codegraph @

test/util2.scm

raw
1 ;; testing util.* that depend on extension modules
2
3 (use gauche.test)
4 (test-start "util.* modules extra")
5
6 ;;;========================================================================
7 (test-section "util.levenshtein")
8 (use util.levenshtein)
9 (test-module 'util.levenshtein)
10
11 (let1 datasets
12 '((""
13 ("" 0 0 0)
14 ("a" 1 1 1) ;1i
15 ("abc" 3 3 3)) ;3i
16 ("abc"
17 ("" 3 3 3)
18 ("ab" 1 1 1) ;1d
19 ("ac" 1 1 1) ;1d
20 ("bc" 1 1 1) ;1d
21 ("acb" 2 1 1) ;1t
22 ("ca" 3 3 2) ;1d, 1t
23 ("bdac" 3 3 2))
24 ("ca"
25 ("abc" 3 3 2))
26 ("rcik"
27 ("rick" 2 1 1)
28 ("irkc" 4 4 3))
29 ("string-filter"
30 ("stirng-filter" 2 1 1)
31 ("stirng-filtre" 4 2 2)
32 ("string-filtrze" 3 3 2))
33 ("a cat"
34 ("a cat" 0 0 0)
35 ("an act" 3 2 2)
36 ("a abct" 3 3 2))
37 )
38 (define (test-algo name distances result-selector)
39 (dolist [set datasets]
40 (test* #"~|name| distance with \"~(car set)\""
41 (map result-selector (cdr set))
42 (distances (car set) (map car (cdr set)))))
43 (dolist [c '(0 1 2 3)]
44 (dolist [set datasets]
45 (test* #"~|name| distance with \"~(car set)\", cutoff ~c"
46 (map (^x (let1 r (result-selector x)
47 (and (<= r c) r)))
48 (cdr set))
49 (distances (car set) (map car (cdr set)) :cutoff c)))))
50
51 (test-algo "Levenshtein" l-distances cadr)
52 (test-algo "Restricted edit" re-distances caddr)
53 (test-algo "Damerau-Levenshtein" dl-distances cadddr))
54
55
56 (test-end)