package grenier

  1. Overview
  2. Docs
A collection of various algorithms in OCaml

Install 

dune-project
 Dependency

github.com Readme Changelog Edit opam file Versions (7)

Authors

  1. F
    Frederic Bour <frederic.bour@lakaban.net>

Maintainers

  1. F
    Frederic Bour <frederic.bour@lakaban.net>

Sources

grenier-0.17.tbz
sha256=adce547fae9b5648d902d91173bb787466a197f81610b76757424ab33980e625
sha512=dccce42254660831fbd45129718ce01d2a4fcf10d05fa40f10eb3be4e5c94300af7235cc88c76b2e5aff7a02b8a1e8e6150d2d3376d8b630911d1dc6247b7df6

doc/grenier.baltree/Bt1/index.html

Module Bt1Source

Sourcetype +'a t = private
  1. | Leaf
  2. | Node of int * 'a t * 'a * 'a t
    (*

    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 with one custom value

Sourceval leaf : 'a t

Leaf constructor, the empty tree

Sourceval node : 'a t -> 'a -> '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 (max size l size r / min 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

Sourceval size : 'a t -> int

Accessor to the size

Sourceval join : 'a t -> 'a t -> 'a t

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

Sourceval rank : int -> 'a t -> 'a

Return the n'th node in tree order