package batteries

Overview
No Docs

You can search for identifiers within the package.

in-package search v0.2.0

A community-maintained standard library extension

Install

dune-project

Dependency

github.com Edit opam file Versions (15)

Authors

O

OCaml batteries-included team

Maintainers

Sources

v3.5.1.tar.gz

md5=d3d16ffc960e832a1c0e21b7123194e9

sha512=36c8561079aa9fefc864c2f03bd8ae20aa05987bb67e7a9beac3ab4f440dbf7d44f141c172b05fddb1a5b618fc55a27962bb45fc39bd7b3a15d56e0ed3ff3870

doc/batteries.unthreaded/BatAvlTree/index.html

Module `BatAvlTree`

Internals of ISet and IMap, usable as generic tree library

type +'a tree

val empty : 'a tree

val is_empty : 'a tree -> bool

val make_tree : 'a tree -> 'a -> 'a tree -> 'a tree

val create : 'a tree -> 'a -> 'a tree -> 'a tree

create l v r is similar to make_tree l v r but performs no rebalancing; in other words, you should use this only when you know that l and r are already balanced.

val height : 'a tree -> int

val left_branch : 'a tree -> 'a tree

raises Not_found
if the tree is empty

val right_branch : 'a tree -> 'a tree

raises Not_found
if the tree is empty

val root : 'a tree -> 'a

raises Not_found
if the tree is empty

val singleton_tree : 'a -> 'a tree

val split_leftmost : 'a tree -> 'a * 'a tree

val split_rightmost : 'a tree -> 'a * 'a tree

val concat : 'a tree -> 'a tree -> 'a tree

val iter : ('a -> unit) -> 'a tree -> unit

val fold : ('a -> 'b -> 'b) -> 'a tree -> 'b -> 'b

val enum : 'a tree -> 'a BatEnum.t

val check : 'a tree -> bool

Check that the tree is balanced according to the AVL tree rules. An AVL tree is balanced when for every node the height of the subnodes differs by at most 1.

since 2.3.0