This is a Ruby library for approximate string matching and searching using a dynamic programming algorithm to compute the Levenstein distance between strings. Written in C for speed. Author: Florian Frank WWW: http://www.ruby-lang.org/raa/list.rhtml?name=amatch m/widgets/e-table-group.h?h=twodaysago' type='application/atom+xml'/>
aboutsummaryrefslogtreecommitdiffstats
path: root/widgets/e-table-group.h
blob: 62bc11093f4a3f56529a5b0970bb75f3cf84c117 (plain) (blame) 
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