1 (* Copyright (C) 2005, HELM Team.
3 * This file is part of HELM, an Hypertextual, Electronic
4 * Library of Mathematics, developed at the Computer Science
5 * Department, University of Bologna, Italy.
7 * HELM is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU General Public License
9 * as published by the Free Software Foundation; either version 2
10 * of the License, or (at your option) any later version.
12 * HELM is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details.
17 * You should have received a copy of the GNU General Public License
18 * along with HELM; if not, write to the Free Software
19 * Foundation, Inc., 59 Temple Place - Suite 330, Boston,
22 * For details, see the HELM World-Wide-Web page,
23 * http://cs.unibo.it/helm/.
28 module type EqualityIndex =
30 module PosEqSet : Set.S with type elt = Utils.pos * Equality.equality
32 Discrimination_tree.DiscriminationTreeIndexing(Discrimination_tree.CicIndexable)(PosEqSet).t
34 val retrieve_generalizations : t -> Cic.term -> PosEqSet.t
35 val retrieve_unifiables : t -> Cic.term -> PosEqSet.t
36 val init_index : unit -> unit
37 val remove_index : t -> Equality.equality -> t
38 val index : t -> Equality.equality -> t
39 val in_index : t -> Equality.equality -> bool
40 val iter : t -> (Discrimination_tree.CicIndexable.constant_name Discrimination_tree.path -> PosEqSet.t -> unit) -> unit
45 module OrderedPosEquality = struct
46 type t = Utils.pos * Equality.equality
47 let compare (p1,e1) (p2,e2) =
48 let rc = Pervasives.compare p1 p2 in
49 if rc = 0 then Equality.compare e1 e2 else rc
52 module PosEqSet = Set.Make(OrderedPosEquality);;
55 Discrimination_tree.DiscriminationTreeIndexing(Discrimination_tree.CicIndexable)(PosEqSet)
58 (* DISCRIMINATION TREES *)
59 let init_index () = () ;;
61 let remove_index tree equality =
62 let _, _, (_, l, r, ordering), _,_ = Equality.open_equality equality in
64 | Utils.Gt -> remove_index tree l (Utils.Left, equality)
65 | Utils.Lt -> remove_index tree r (Utils.Right, equality)
67 let tree = remove_index tree r (Utils.Right, equality) in
68 remove_index tree l (Utils.Left, equality)
70 let index tree equality =
71 let _, _, (_, l, r, ordering), _,_ = Equality.open_equality equality in
73 | Utils.Gt -> index tree l (Utils.Left, equality)
74 | Utils.Lt -> index tree r (Utils.Right, equality)
76 let tree = index tree r (Utils.Right, equality) in
77 index tree l (Utils.Left, equality)
80 let in_index tree equality =
81 let _, _, (_, l, r, ordering), _,_ = Equality.open_equality equality in
82 let meta_convertibility (pos,equality') =
83 Equality.meta_convertibility_eq equality equality'
85 in_index tree l meta_convertibility || in_index tree r meta_convertibility
91 module OrderedPosEquality = struct
92 type t = Utils.pos * Equality.equality
93 let compare (p1,e1) (p2,e2) =
94 let rc = Pervasives.compare p1 p2 in
95 if rc = 0 then Equality.compare e1 e2 else rc
98 module PosEqSet = Set.Make(OrderedPosEquality);;
101 Discrimination_tree.DiscriminationTreeIndexing(Discrimination_tree.CicIndexable)(PosEqSet)
104 (* DISCRIMINATION TREES *)
105 let init_index () = () ;;
107 let remove_index tree equality =
108 let _, _, (_, l, r, ordering), _,_ = Equality.open_equality equality in
110 | Utils.Gt -> remove_index tree l (Utils.Left, equality)
111 | Utils.Lt -> remove_index tree r (Utils.Right, equality)
113 let tree = remove_index tree r (Utils.Right, equality) in
114 remove_index tree l (Utils.Left, equality)
116 let index tree equality =
117 let _, _, (_, l, r, ordering), _,_ = Equality.open_equality equality in
119 | Utils.Gt -> index tree l (Utils.Left, equality)
120 | Utils.Lt -> index tree r (Utils.Right, equality)
122 let tree = index tree r (Utils.Right, equality) in
123 index tree l (Utils.Left, equality)
126 let in_index tree equality =
127 let _, _, (_, l, r, ordering), _,_ = Equality.open_equality equality in
128 let meta_convertibility (pos,equality') =
129 Equality.meta_convertibility_eq equality equality'
131 in_index tree l meta_convertibility || in_index tree r meta_convertibility