package camomile

You can search for identifiers within the package.

in-package search v0.2.0

A Unicode library

Install

Dune Dependency

github.com Readme Changelog LGPL-2.0-or-later WITH OCaml-LGPL-linking-exception License Edit opam file Versions (6)

Authors

Y

Yoriyuki Yamagata

Maintainers

R

romain.beauxis@gmail.com

Sources

v2.0.0.tar.gz

md5=41e02d124c3fa29ea511110d2c6532de

sha512=b0ae3d921f65390e8ec88a04901dd097b568db9f9ae70fb328e9d3ddb2dd8922b9a8e8da9ace91ad9cb5f6a1310ae5b6ba502e287d6c828f4d60622289316ac8

doc/camomile.lib/CamomileLib/ISet/index.html

Module `CamomileLib.ISet`

Set of integers

type t = (int * int) AvlTree.tree

type elt = int

val empty : t

val is_empty : t -> bool

val mem : int -> t -> bool

val add : int -> t -> t

val add_range : int -> int -> t -> t

val singleton : int -> t

val remove : int -> t -> t

val remove_range : int -> int -> t -> t

val union : t -> t -> t

val inter : t -> t -> t

val diff : t -> t -> t

val compl : t -> t

val compare : t -> t -> int

val equal : t -> t -> bool

val subset : t -> t -> bool

val from : int -> t -> t

val after : int -> t -> t

val until : int -> t -> t

val before : int -> t -> t

val iter : (int -> unit) -> t -> unit

val iter_range : (int -> int -> unit) -> t -> unit

val fold : (int -> 'a -> 'a) -> t -> 'a -> 'a

val fold_range : (int -> int -> 'a -> 'a) -> t -> 'a -> 'a

val for_all : (int -> bool) -> t -> bool

val exists : (int -> bool) -> t -> bool

val filter : (int -> bool) -> t -> t

val partition : (int -> bool) -> t -> t * t

val cardinal : t -> int

val elements : t -> int list

val ranges : t -> (int * int) list

val min_elt : t -> int

val max_elt : t -> int

val choose : t -> int