2 ||M|| This file is part of HELM, an Hypertextual, Electronic
3 ||A|| Library of Mathematics, developed at the Computer Science
4 ||T|| Department, University of Bologna, Italy.
6 ||T|| HELM is free software; you can redistribute it and/or
7 ||A|| modify it under the terms of the GNU General Public License
8 \ / version 2 or (at your option) any later version.
9 \ / This software is distributed as is, NO WARRANTY.
10 V_______________________________________________________________ *)
14 module Index (B : Orderings.Blob) :
16 module ClauseSet : Set.S with
17 type elt = Terms.direction * B.t Terms.unit_clause
19 module FotermIndexable : Discrimination_tree.Indexable with
20 type constant_name = B.t and
21 type input = B.t Terms.foterm
23 module DT : Discrimination_tree.DiscriminationTree with
24 type constant_name = B.t and
25 type input = B.t Terms.foterm and
26 type data = ClauseSet.elt and
27 type dataset = ClauseSet.t
29 val index_unit_clause :
30 DT.t -> B.t Terms.unit_clause -> DT.t
32 val remove_unit_clause :
33 DT.t -> B.t Terms.unit_clause -> DT.t
37 (B.t Discrimination_tree.path -> ClauseSet.t -> 'a -> 'a)
40 val elems : DT.t -> ClauseSet.t
42 type active_set = B.t Terms.unit_clause list * DT.t