You can search for identifiers within the package.
in-package search v0.2.0
include sig ... end
type t
val create : ?progress_callback:(int -> int -> unit) -> int -> Bst__Bisec_tree.vp_heuristic -> FpMol.t array -> t
val sample_distances : int -> FpMol.t array -> float array
val nearest_neighbor : FpMol.t -> t -> FpMol.t * float
val neighbors : FpMol.t -> float -> t -> FpMol.t list
val any_neighbor : FpMol.t -> float -> t -> bool
val partition : FpMol.t -> float -> t -> FpMol.t list * FpMol.t list
val to_list : t -> FpMol.t list
val length : t -> int
val is_empty : t -> bool
val find : FpMol.t -> t -> FpMol.t
val mem : FpMol.t -> t -> bool
val root : t -> FpMol.t
val check : t -> bool
val inspect : t -> FpMol.t list
val vantage_points : t -> FpMol.t list
val dump : int -> t -> (Bst__Bisec_tree.direction list * FpMol.t list) list
val get_addr : FpMol.t -> t -> Bst__Bisec_tree.step list
val add : FpMol.t -> Bst__Bisec_tree.step list -> t -> t
val to_string : t -> string
val simplify : t -> FpMol.t list list
val of_molecules : FpMol.t list -> t