this repo has no description
1opam-version: "2.0"
2maintainer: "Simon Grondin"
3authors: [
4 "Simon Grondin"
5]
6synopsis: "Fastest bounded Levenshtein comparator over generic structures"
7description: """
8This library does not calculate the edit distance.
9
10Rather, 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
12Once generated, an automaton can be reused to compare any 2 values in around 2-8 µs.
13"""
14license: "MIT"
15homepage: "https://github.com/SGrondin/fuzzy_compare"
16dev-repo: "git+https://github.com/SGrondin/fuzzy_compare"
17doc: "https://github.com/SGrondin/fuzzy_compare"
18bug-reports: "https://github.com/SGrondin/fuzzy_compare/issues"
19depends: [
20 "ocaml" { >= "4.10.0" }
21 "dune" { >= "1.9.0" }
22
23 "core" { >= "v0.15.0" & < "v0.16.0" }
24 # "ocamlformat" { = "0.21.0" } # Development
25 # "ocaml-lsp-server" # Development
26
27 "uuseg" { with-test }
28 "uunf" { with-test }
29]
30build: ["dune" "build" "-p" name "-j" jobs]
31url {
32 src: "https://github.com/SGrondin/fuzzy_compare/archive/2.0.0.tar.gz"
33 checksum: [
34 "md5=3e82d5ab12f1cdb93e0fbae1f386f5bf"
35 "sha512=9c43989323872380b60cb593715214e37190efa6b663fbed9264aaafc0dceed5419cfd858c6e6cafdfa60a1c4ee2ccea6a408bb6f3cd7500dbea081725ba9c25"
36 ]
37}