* http://cs.unibo.it/helm/.
*)
-module DiscriminationTreeIndexing =
+(* $Id$ *)
+
+module DiscriminationTreeIndexing =
functor (A:Set.S) ->
struct
module DiscriminationTree = Trie.Make(PSMap);;
type t = A.t DiscriminationTree.t
- type elt = A.elt
let empty = DiscriminationTree.empty
(*
| pos -> List.fold_right (fun i r -> if r = [] then [i+1] else i::r) pos []
in
try
- let t = subterm_at_pos pos' term in pos'
+ ignore(subterm_at_pos pos' term ); pos'
with Not_found ->
let pos, _ =
List.fold_right