package grenier

  1. Overview
  2. Docs
type +'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

val leaf : 'a t

Leaf constructor, the empty tree

val 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 |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

Return the n'th node in tree order

OCaml

Innovation. Community. Security.

GitHub Discord Twitter Peertube RSS
About
Changelog Releases Industrial Users Academic Users Why OCaml
Ecosystem
Packages Community Events OCaml Planet Jobs
Resources
Install OCaml Get Started Platform Tools Language Manual Standard Library API Books Exercises Papers OCaml Playground Logo
Policies
Carbon Footprint Governance Privacy Code of Conduct