package forester

  1. Overview
  2. Docs
val query_cost : query -> int

A heuristic for computing an intersection of queries.

val sort_by_ascending_cost : query list -> query list
val sort_by_descending_cost : query list -> query list
val isect : query list -> query
val union : query list -> query
val complement : query -> query
val tree_under : Base.addr -> query
val isect_fam_rel : query -> Query.mode -> Query.polarity -> Query.Rel.t -> query
val union_fam_rel : query -> Query.mode -> Query.polarity -> Query.Rel.t -> query
val has_taxon : string -> query
val hereditary_contributors : Base.addr -> query
val references : Base.addr -> query
val context : Base.addr -> query
val contributions : Base.addr -> query
OCaml

Innovation. Community. Security.