Skip to content

Commit 3a6b119

Browse files
committed
Package fuzzy_compare.2.0.1
1 parent 0148702 commit 3a6b119

File tree

1 file changed

+38
-0
lines changed
  • packages/fuzzy_compare/fuzzy_compare.2.0.1

1 file changed

+38
-0
lines changed
Lines changed: 38 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,38 @@
1+
opam-version: "2.0"
2+
maintainer: "Simon Grondin"
3+
authors: [
4+
"Simon Grondin"
5+
]
6+
synopsis: "Fastest bounded Levenshtein comparator over generic structures"
7+
description: """
8+
This library does not calculate the edit distance.
9+
10+
Rather, it provides extremely efficient automata that answer whether 2 values are within a predetermined number of edits of one another. Edits are: additions, deletions, replacements.
11+
12+
Once generated, an automaton can be reused to compare any 2 values in around 2-8 µs.
13+
"""
14+
license: "MIT"
15+
homepage: "https://github.com/SGrondin/fuzzy_compare"
16+
dev-repo: "git://github.com/SGrondin/fuzzy_compare"
17+
doc: "https://github.com/SGrondin/fuzzy_compare"
18+
bug-reports: "https://github.com/SGrondin/fuzzy_compare/issues"
19+
depends: [
20+
"ocaml" { >= "4.10.0" }
21+
"dune" { >= "1.9.0" }
22+
23+
"core" { >= "v0.15.0" & < "v0.17.0" }
24+
# "ocamlformat" { = "0.25.1" } # Development
25+
# "ocaml-lsp-server" # Development
26+
27+
"uuseg" { with-test }
28+
"uunf" { with-test }
29+
]
30+
build: ["dune" "build" "-p" name "-j" jobs]
31+
url {
32+
src:
33+
"https://github.com/SGrondin/fuzzy_compare/archive/refs/tags/2.0.1.tar.gz"
34+
checksum: [
35+
"md5=90ba5dd28b12af0bb795f6bdbca34deb"
36+
"sha512=7550a654b200d82eac9ccdc58bb21627e29ff78bb9f0b06dd75b7aeb3960f58b42632b6836ce09103b29f254fb628bab5418e0e34f08a79833c7e01c3709b094"
37+
]
38+
}

0 commit comments

Comments
 (0)