package grenier
 sectionYPositions = computeSectionYPositions($el), 10)"
  x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
  >
  
  
  A collection of various algorithms in OCaml
Install
    
    dune-project
 Dependency
Authors
Maintainers
Sources
  
    
      grenier-v0.8.tbz
    
    
        
    
  
  
  
    
  
  
    
  
        sha256=622a34f91f2787096f15786901b8d8cff528cada805b018fdbd522c00c6f13e8
    
    
  sha512=e687e7c9e7b61d876c70570a9b6e4f3a497c8deb334e28532d8c2f9a2a06bff1330431b64ec3e8c4bcfcf2cc9495723339196608c6c4ac5a0699020d0af93e26
    
    
  doc/grenier.valmari/Valmari/Minimize/argument-1-DFA/Label/index.html
Module DFA.Label
A total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys 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)"
  >