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.
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_kernel" { >= "v0.14.0" & < "v0.15.0" }
24 # "ocamlformat" { = "0.19.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/1.0.0.tar.gz"
33 checksum: [
34 "md5=455dc4fbe810bffb087b84ab638994fc"
35 "sha512=52d41e9686b77206dd3b9efdfef3c9511cb8a66927af7548ee5454258232a7f1e3aeb1106ae49f75bc3d04dada962a58ed8e2cfcd5d902f0d5465357dd3541dd"
36 ]
37}