To focus the search input from anywhere on the page, press the 'S' key.
in-package search v0.1.0
Levenshtein distance algorithm for general array
Install
Authors
Maintainers
Sources
ocaml_levenshtein-1.1.3.tar.bz2
md5=6f9b85c87402ef3fd36e466e5b11cbe3
Description
Levenshtein distance algorithm for general array.
The library provides functors to compute Levenshtein editing distances over array like structures.
Published: 17 Jan 2018
Dependencies (4)
-
ocaml-migrate-parsetree
< "2.0.0"
-
ppx_test
>= "1.6.0"
-
jbuilder
>= "1.0+beta7"
-
ocaml
>= "4.02.1"
Dev Dependencies
Used by
Conflicts
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page