package grenier

You can search for identifiers within the package.

in-package search v0.2.0

On This Page

Parameters
Signature
Convenience functions

package grenier

grenier.balmap
- Balmap
  - Map
    
    Make
    
    O
  - Set
    
    Make
    
    O
grenier.baltree
- Bt1
- Bt2
- Mbt
  - MEASURE
  - Make
    
    M
grenier.binpacking
- Maxrects
grenier.dbseq
- Dbseq
grenier.doubledouble
- Doubledouble
  - Infix
grenier.fastdom
- Fastdom
grenier.hll
- Hll
- Hll_consts
grenier.jmphash
- Jmphash
grenier.orderme
grenier.physh
- Physh
  - Map
  - Set
grenier.state_elimination
- State_elimination
  - Convert
    
    NFA
    
    Finals
    
    Initials
    
    States
    
    Transitions
    
    Regex
  - NFA
    
    Finals
    
    Initials
    
    States
    
    Transitions
  - Regex
grenier.strong
- Strong
  - Finite
    
    Array
    
    Of_array
    
    A
    
    T
    
    Elt
    
    Set
    
    Gensym
  - Natural
    
    Nth
    
    N
    
    T
  - Order
grenier.trope
- Trope
grenier.valmari
- Partition
- Valmari
  - DFA
  - INPUT
  - Minimize
    
    In
    
    Label

Legend:
Library
Module
Module type
Parameter
Class
Class type

Parameters

module M : MEASURE

Signature

type +'a t = private

| Leaf
| Node of int * 'a t * 'a M.measurable * 'a t * M.measure
(*
Node(size, l, x, r) where:
- size is the number of elements in the tree,
- l is the left sub-tree
- x is a user-defined value
- r is the right sub-tree.
Trees are guaranteed balanced by construction, the depth of all branches is O(log size).
*)

Type of balanced trees

val leaf : 'a t

Leaf constructor, the empty tree

val node : 'a t -> 'a M.measurable -> 'a t -> 'a t

Smart Node constructor, ensuring that the resulting tree is balanced and has the appropriate size.

Cost of node l x r is expected to be O(log |size l - size r|) amortized, i.e proportional to the logarithm of the disbalance. In particular, if l and r are similarly-sized, it operates in constant time on average. NOT PROVEN

User-values can be moved in different subtrees of the result, but the ordering is preserved (so data stay correct if the operation applied on values is associative or the relation expected between them is transitive).

Convenience functions

val size : 'a t -> int

Accessor to the size

val join : 'a t -> 'a t -> 'a t

Concatenate two trees. Cost of join l r is O(log (min size l size r)). NOT PROVEN

val rank : int -> 'a t -> 'a M.measurable

Return the n'th node in tree order

val measure : 'a t -> M.measure