Search OCaml packages
max) { row = max } }" @keyup.up="if (row !== null) { row -=1; if (row < 0) { row = null } }" @keyup.right="if (col < 1) col++" @keyup.left="if (col >= 1) col--" :aria-activedescendant="row !== null ? 'package-autocomplete-'+row+'-'+col : null" hx-get="/packages/autocomplete" hx-params="q" hx-trigger="keyup changed, search" hx-target="#header-search-results" hx-indicator="#header-search-indicator" autocomplete="off" >
Standard Library API
Learn
Tools
Packages
Community
News
Play
Search OCaml packages
Learn
Tools
Packages
Community
News
Play
Standard Library API
Get started
package
levenshtein
latest (1.1.3)
1.1.3
search
Overview
Docs
You can search for identifiers within the package.
in-package search v0.2.0
sectionYPositions = computeSectionYPositions($el), 10)" x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)" >
On This Page
API
Library levenshtein
Package index
levenshtein
levenshtein
API
Library levenshtein
Levenshtein
Levenshtein distance algorithm for general array.
sectionYPositions = computeSectionYPositions($el), 10)" x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)" >
On This Page
API
Library levenshtein