File: CHANGELOG

package info (click to toggle)
ruby-levenshtein 0.2.2-3
  • links: PTS, VCS
  • area: main
  • in suites: bookworm, forky, sid, trixie
  • size: 104 kB
  • sloc: ruby: 231; ansic: 71; makefile: 2
file content (34 lines) | stat: -rw-r--r-- 670 bytes parent folder | download | duplicates (2)
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
33
34
0.2.2 (16-03-2012)

* Simplified code.

0.2.1 (11-03-2012)

* Better memory handling.

* Little speed improvements.

* Ruby 1.9 compatible?

0.2.0 (11-07-2009)

* Return 0 instead of 0.0 in case of empty strings.

* Added specific support for arrays.

* Added specific support for arrays of strings.

* Added generic support for all (?) kind of sequences.

* Moved a lot of code to the C world.

0.1.1 (06-10-2008)

* If one of the strings was both the begin and the end of the
  other string, it would be stripped from both ends. Example:
  Levenshtein.distance("abracadabra", "abra") resulted in 3
  instead of 7. It's fixed now.

0.1.0 (24-05-2008)

* First release.