package grenier

You can search for identifiers within the package.

in-package search v0.2.0

A collection of various algorithms in OCaml

Install

dune-project

Dependency

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

Authors

F

Frederic Bour <frederic.bour@lakaban.net>

Maintainers

F

Frederic Bour <frederic.bour@lakaban.net>

Sources

grenier-0.13.tbz

sha256=04831d5c2ea783d4e32b356a8495e5481ce8919aa70f5eecee29baebbf6fa483

sha512=1199122ab70701ecd33bf9c6339a743d163a1ba3ef5d0db189cab6c6712386739031b66002bf48d4740112430a93780f82dc37f56688ee33f99da928186b8205

doc/grenier.baltree/Bt1/index.html

Module `Bt1`Source

Sourcetype +'a t = private

| Leaf
| 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 |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 (min size l size r)). NOT PROVEN

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

Return the n'th node in tree order

On This Page

Convenience functions