package nel
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page
A very simple implementation of a non-empty list
Install
dune-project
Dependency
Authors
Maintainers
Sources
nel-1.0.1.tbz
sha256=b730154eb04e68143caa076239cb23e9441616a7984756b8e0c096d2ac19d60b
sha512=6a26051cb9859dd4b7ca3a4d77d323761ff5bca2de1eb771c72a072e53775edfcaef9e202f7172cc9734de6bb0ca8936a75c3ba5ca542470bdba6ccbea85eafb
doc/README.html
Nel
Until non-empty lists are included in the standard library, this rather naive implementation should do the trick. Currently the goal of the API is not to be complete but to follow our current usages.
Why not using ocaml-non-empty-list? Although the implementation is more than reasonable, it relies on Base, which we feel is too much to expect for small projects.
Goal
Non-empty lists are often used to characterize the result of a validation, where the error case, in which the list is empty, does not make sense. The purpose of this portable library is therefore to serve this purpose.
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page