package pfff

You can search for identifiers within the package.

in-package search v0.2.0

Tools and APIs for program analysis, code visualization, refactoring

Install

Dune Dependency

github.com Edit opam file Versions (8)

Authors

Y

Yoann Padioleau <yoann.padioleau@gmail.com>

Maintainers

Y

yoann.padioleau@gmail.com

Sources

0.39.5.tar.gz

md5=e23dbd320a8681b74315162a02bf97a7

sha512=2998432bcd6d9a459331d733c4446d35459d42787fcf2fd332d3ec5131a4d358bb8f060b45d38696bcd584e1eaa8c1b21b82d7d3005e83c1ecefd22fec842ee7

doc/commons_ocollection/SetPt/index.html

Module `SetPt`

type elt = int

type t =

| Empty
| Leaf of int
| Branch of int * int * t * t

val empty : t

val is_empty : t -> bool

val singleton : int -> t

val zero_bit : int -> int -> bool

val mem : int -> t -> bool

val lowest_bit : int -> int

val branching_bit : int -> int -> int

val mask : int -> int -> int

val join : (int * t * int * t) -> t

val match_prefix : int -> int -> int -> bool

val add : int -> t -> t

val branch : (int * int * t * t) -> t

val remove : int -> t -> t

val merge : (t * t) -> t

val union : t -> t -> t

val subset : t -> t -> bool

val inter : t -> t -> t

val diff : t -> t -> t

val cardinal : t -> int

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

val fold : (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 choose : t -> int

val elements : t -> int list

val min_elt : t -> int

val max_elt : t -> int

val equal : 'a -> 'a -> bool

val compare : 'a -> 'a -> int

val make : int list -> t

val intersect : t -> t -> bool