package diet
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
Discrete Interval Encoding Trees
Install
dune-project
Dependency
Authors
Maintainers
Sources
diet-v0.3.tbz
sha256=c83dec2aef1f2846bc272de1d6535062e158b7655996ebd4d137f874b895d44b
md5=198de585f888bedc2b85f555250ce6d5
doc/diet/Diet/module-type-ELT/index.html
Module type Diet.ELTSource
The type of the set elements.
include Set.OrderedType with type t := t
A total ordering function over the set elements. This is a two-argument function f such that f e1 e2 is zero if the elements e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>