package m_tree

You can search for identifiers within the package.

in-package search v0.2.0

Legend:
Library
Module
Module type
Parameter
Class
Class type

type 'a obj = {

}

and 'a node = {

}

type 'a t = {

}

include T with type 'a t := 'a t

val create : 
  ?branching_factor:int ->
  ?eq:('a -> 'a -> bool) ->
  ('a -> 'a -> float) ->
  'a t

Create an M-tree.

parameter eq
An optional equality function for tree elements. If none is provided, then the distance function will be used.

val iter : 'a t -> 'a Iter.t

Iterate over the contents of the tree.

val insert : 'a t -> 'a -> unit

Insert a new point into the tree.

val range : 'a t -> 'a -> radius:float -> 'a Iter.t

Find all points that are within some radius of a query point.

val invariant : 'a t -> unit

val mk_obj : 
  ?parent_dist:float ->
  ?radius:float ->
  ?tree:'a node option ->
  'a ->
  'a obj

val promote : 'a obj list -> 'a obj * 'a obj

val partition : ('a -> 'a -> float) -> 'a obj -> 'a obj -> 'a obj list -> unit

val split : 'a t -> 'a node -> 'a obj -> unit

val iter_obj : 'a obj -> 'a Iter.t

val iter_node : 'a node -> 'a Iter.t