X-Git-Url: http://git.nguyen.vg/gitweb/?a=blobdiff_plain;f=ata.ml;h=eed81bc3d6d368a919e91841a449ea0a884a3115;hb=329088598ab63bc2d67ff0dfc4f54e90f5d4f283;hp=45f3761f5b33ef0b46a9bd730d19959052bba561;hpb=82361b41bedcd7726f2601111a9591318079a120;p=SXSI%2Fxpathcomp.git diff --git a/ata.ml b/ata.ml index 45f3761..eed81bc 100644 --- a/ata.ml +++ b/ata.ml @@ -1,428 +1,402 @@ INCLUDE "debug.ml" INCLUDE "utils.ml" +open Camlp4.Struct type jump_kind = [ `TAG of Tag.t | `CONTAINS of string | `NOTHING ] -let cpt_trans = ref 0 -let miss_trans = ref 0 -let cpt_eval = ref 0 -let miss_eval = ref 0 - -let gen_id = - let id = ref (-1) in - fun () -> incr id;!id - -let h_union = Hashtbl.create 4097 - -let pt_cup s1 s2 = - (* special case, since this is a union we want hash(s1,s2) = hash(s2,s1) *) - let x = Ptset.hash s1 - and y = Ptset.hash s2 in - let h = if x < y then HASHINT2(x,y) else HASHINT2(y,x) in - try - Hashtbl.find h_union h - with - | Not_found -> let s = Ptset.union s1 s2 - in - Hashtbl.add h_union h s;s -module State = struct +(* Todo : move elsewhere *) +external vb : bool -> int = "%identity" +module State : +sig + include Sigs.T with type t = int + val make : unit -> t +end = +struct type t = int - let mk = gen_id - + let make = + let id = ref (-1) in + fun () -> incr id;!id + let compare = (-) + let equal = (==) + external hash : t -> int = "%identity" + let print fmt x = Format.fprintf fmt "%i" x + let dump fmt x = print fmt x + let check x = + if x < 0 then failwith (Printf.sprintf "State: Assertion %i < 0 failed" x) end -let mk_state = State.mk - -type state = State.t - - - -type formula_expr = - | False | True - | Or of formula * formula - | And of formula * formula - | Atom of ([ `Left | `Right | `LLeft | `RRight ]*bool*state) -and formula = { fid: int; - fkey : int; - pos : formula_expr; - neg : formula; - st : (Ptset.t*Ptset.t*Ptset.t)*(Ptset.t*Ptset.t*Ptset.t); - size: int; - } - -external hash_const_variant : [> ] -> int = "%identity" -external vb : bool -> int = "%identity" - -let hash_node_form t = match t with - | False -> 0 - | True -> 1 - | And(f1,f2) -> (2+17*f1.fkey + 37*f2.fkey) (*land max_int *) - | Or(f1,f2) -> (3+101*f1.fkey + 253*f2.fkey) (*land max_int *) - | Atom(v,b,s) -> HASHINT3(hash_const_variant v,(3846*(vb b) +257),s) +module StateSet = Ptset.Int + +module Formula = +struct + type 'hcons expr = + | False | True + | Or of 'hcons * 'hcons + | And of 'hcons * 'hcons + | Atom of ([ `Left | `Right | `LLeft | `RRight ]*bool*State.t) + + type 'hcons node = { + pos : 'hcons expr; + mutable neg : 'hcons; + st : (StateSet.t*StateSet.t*StateSet.t)*(StateSet.t*StateSet.t*StateSet.t); + size: int; (* Todo check if this is needed *) + } + external hash_const_variant : [> ] -> int = "%identity" + module rec Node : Hcons.S with type data = Data.t = Hcons.Make (Data) + and Data : Hashtbl.HashedType with type t = Node.t node = + struct + type t = Node.t node + let equal x y = x.size == y.size && + match x.pos,y.pos with + | a,b when a == b -> true + | Or(xf1,xf2),Or(yf1,yf2) + | And(xf1,xf2),And(yf1,yf2) -> (xf1 == yf1) && (xf2 == yf2) + | Atom(d1,p1,s1), Atom(d2,p2,s2) -> d1 == d2 && (p1==p2) && s1 == s2 + | _ -> false + let hash f = + match f.pos with + | False -> 0 + | True -> 1 + | Or (f1,f2) -> HASHINT3(PRIME2,f1.Node.id, f2.Node.id) + | And (f1,f2) -> HASHINT3(PRIME3,f1.Node.id,f2.Node.id) + | Atom(d,p,s) -> HASHINT4(PRIME4,hash_const_variant d,vb p,s) + end -module FormNode = -struct - type t = formula + type t = Node.t + let hash x = x.Node.key + let uid x = x.Node.id + let equal = Node.equal + let expr f = f.Node.node.pos + let st f = f.Node.node.st + let size f = f.Node.node.size - let hash t = t.fkey - let equal f1 f2 = - if f1.fid == f2.fid || f1.fkey == f2.fkey || f1.pos == f2.pos then true - else - match f1.pos,f2.pos with - | False,False | True,True -> true - | Atom(d1,b1,s1), Atom(d2,b2,s2) when (b1==b2) && (s1==s2) && (d1 = d2) -> true - | Or(g1,g2),Or(h1,h2) - | And(g1,g2),And(h1,h2) -> g1.fid == h1.fid && g2.fid == h2.fid - | _ -> false + let prio f = + match expr f with + | True | False -> 10 + | Atom _ -> 8 + | And _ -> 6 + | Or _ -> 1 + + let rec print ?(parent=false) ppf f = + if parent then Format.fprintf ppf "("; + let _ = match expr f with + | True -> Format.fprintf ppf "T" + | False -> Format.fprintf ppf "F" + | And(f1,f2) -> + print ~parent:(prio f > prio f1) ppf f1; + Format.fprintf ppf " ∧ "; + print ~parent:(prio f > prio f2) ppf f2; + | Or(f1,f2) -> + (print ppf f1); + Format.fprintf ppf " ∨ "; + (print ppf f2); + | Atom(dir,b,s) -> Format.fprintf ppf "%s%s[%i]" + (if b then "" else "¬") + (match dir with + | `Left -> "↓₁" + | `Right -> "↓₂" + | `LLeft -> "⇓₁" + | `RRight -> "⇓₂") s + in + if parent then Format.fprintf ppf ")" + + let print ppf f = print ~parent:false ppf f + + let is_true f = (expr f) == True + let is_false f = (expr f) == False + + + let cons pos neg s1 s2 size1 size2 = + let nnode = Node.make { pos = neg; neg = (Obj.magic 0); st = s2; size = size2 } in + let pnode = Node.make { pos = pos; neg = nnode ; st = s1; size = size1 } + in + (Node.node nnode).neg <- pnode; (* works because the neg field isn't taken into + account for hashing ! *) + pnode,nnode + + let empty_triple = StateSet.empty,StateSet.empty,StateSet.empty + let empty_hex = empty_triple,empty_triple + let true_,false_ = cons True False empty_hex empty_hex 0 0 + let atom_ d p s = + let si = StateSet.singleton s in + let ss = match d with + | `Left -> (si,StateSet.empty,si),empty_triple + | `Right -> empty_triple,(si,StateSet.empty,si) + | `LLeft -> (StateSet.empty,si,si),empty_triple + | `RRight -> empty_triple,(StateSet.empty,si,si) + in fst (cons (Atom(d,p,s)) (Atom(d,not p,s)) ss ss 1 1) + + let not_ f = f.Node.node.neg + let union_hex ((l1,ll1,lll1),(r1,rr1,rrr1)) ((l2,ll2,lll2),(r2,rr2,rrr2)) = + (StateSet.mem_union l1 l2 ,StateSet.mem_union ll1 ll2,StateSet.mem_union lll1 lll2), + (StateSet.mem_union r1 r2 ,StateSet.mem_union rr1 rr2,StateSet.mem_union rrr1 rrr2) + + let merge_states f1 f2 = + let sp = + union_hex (st f1) (st f2) + and sn = + union_hex (st (not_ f1)) (st (not_ f2)) + in + sp,sn -end -module WH = Weak.Make(FormNode) + let order f1 f2 = if uid f1 < uid f2 then f2,f1 else f1,f2 -let f_pool = WH.create 107 + let or_ f1 f2 = + (* Tautologies: x|x, x|not(x) *) -let empty_triple = Ptset.empty,Ptset.empty,Ptset.empty -let empty_hex = empty_triple,empty_triple + if equal f1 f2 then f1 else + if equal f1 (not_ f2) then true_ else -let true_,false_ = - let rec t = { fid = 1; pos = True; fkey=1; neg = f ; st = empty_hex; size =1; } - and f = { fid = 0; pos = False; fkey=0; neg = t; st = empty_hex; size = 1; } - in - WH.add f_pool f; - WH.add f_pool t; - t,f - -let is_true f = f.fid == 1 -let is_false f = f.fid == 0 - - -let cons pos neg s1 s2 size1 size2 = - let rec pnode = - { fid = gen_id (); - fkey = hash_node_form pos; - pos = pos; - neg = nnode; - st = s1; - size = size1;} - and nnode = { - fid = gen_id (); - pos = neg; - fkey = hash_node_form neg; - neg = pnode; - st = s2; - size = size2; - } - in - (WH.merge f_pool pnode),(WH.merge f_pool nnode) - -let atom_ d p s = - let si = Ptset.singleton s in - let ss = match d with - | `Left -> (si,Ptset.empty,si),empty_triple - | `Right -> empty_triple,(si,Ptset.empty,si) - | `LLeft -> (Ptset.empty,si,si),empty_triple - | `RRight -> empty_triple,(Ptset.empty,si,si) - in fst (cons (Atom(d,p,s)) (Atom(d,not p,s)) ss ss 1 1) - -let union_hex ((l1,ll1,lll1),(r1,rr1,rrr1)) ((l2,ll2,lll2),(r2,rr2,rrr2)) = - (pt_cup l1 l2 ,pt_cup ll1 ll2,pt_cup lll1 lll2), - (pt_cup r1 r2 ,pt_cup rr1 rr2,pt_cup rrr1 rrr2) - -let merge_states f1 f2 = - let sp = - union_hex f1.st f2.st - and sn = - union_hex f1.neg.st f2.neg.st - in - sp,sn + (* simplification *) + if is_true f1 || is_true f2 then true_ else + if is_false f1 && is_false f2 then false_ else + if is_false f1 then f2 else + if is_false f2 then f1 else + + (* commutativity of | *) -let full_or_ f1 f2 = - let f1,f2 = if f1.fid < f2.fid then f2,f1 else f1,f2 in - let sp,sn = merge_states f1 f2 in - let psize = f1.size + f2.size in - let nsize = f1.neg.size + f2.neg.size in - fst (cons (Or(f1,f2)) (And(f1.neg,f2.neg)) sp sn psize nsize ) - -let or_ f1 f2 = - let f1,f2 = if f1.fid < f2.fid then f2,f1 else f1,f2 in - if is_true f1 || is_true f2 then true_ - else if is_false f1 && is_false f2 then false_ - else if is_false f1 then f2 - else if is_false f2 then f1 - else - let psize = f1.size + f2.size in - let nsize = f1.neg.size + f2.neg.size in - let sp,sn = merge_states f1 f2 in - fst (cons (Or(f1,f2)) (And(f1.neg,f2.neg)) sp sn psize nsize) - - - -let and_ f1 f2 = - let f1,f2 = if f1.fid < f2.fid then f2,f1 else f1,f2 in - if is_true f1 && is_true f2 then true_ - else if is_false f1 || is_false f2 then false_ - else if is_true f1 then f2 - else if is_true f2 then f1 - else - let psize = f1.size + f2.size in - let nsize = f1.neg.size + f2.neg.size in - let sp,sn = merge_states f1 f2 in - fst (cons (And(f1,f2)) (Or(f1.neg,f2.neg)) sp sn psize nsize) - + let f1,f2 = order f1 f2 in + let psize = (size f1) + (size f2) in + let nsize = (size (not_ f1)) + (size (not_ f2)) in + let sp,sn = merge_states f1 f2 in + fst (cons (Or(f1,f2)) (And(not_ f1,not_ f2)) sp sn psize nsize) + + + let and_ f1 f2 = -let not_ f = f.neg + (* Tautologies: x&x, x¬(x) *) -let k_hash (s,t) = HASHINT2(Ptset.hash s,Tag.hash t) + if equal f1 f2 then f1 else + if equal f1 (not_ f2) then false_ else -module HTagSetKey = -struct - type t = Ptset.t*Tag.t - let equal (s1,s2) (t1,t2) = (s2 == t2) && Ptset.equal s1 t1 - let hash = k_hash -end + (* simplifications *) -module HTagSet = Hashtbl.Make(HTagSetKey) + if is_true f1 && is_true f2 then true_ else + if is_false f1 || is_false f2 then false_ else + if is_true f1 then f2 else + if is_true f2 then f1 else + + (* commutativity of & *) + + let f1,f2 = order f1 f2 in + let psize = (size f1) + (size f2) in + let nsize = (size (not_ f1)) + (size (not_ f2)) in + let sp,sn = merge_states f1 f2 in + fst (cons (And(f1,f2)) (Or(not_ f1,not_ f2)) sp sn psize nsize) + module Infix = struct + let ( +| ) f1 f2 = or_ f1 f2 + let ( *& ) f1 f2 = and_ f1 f2 + let ( *+ ) d s = atom_ d true s + let ( *- ) d s = atom_ d false s + end +end + +module Transition = struct + + type node = State.t*TagSet.t*bool*Formula.t*bool + include Hcons.Make(struct + type t = node + let hash (s,ts,m,f,b) = HASHINT5(s,TagSet.uid ts,Formula.uid f,vb m,vb b) + let equal (s,ts,b,f,m) (s',ts',b',f',m') = + s == s' && ts == ts' && b==b' && m==m' && f == f' + end) + + let print ppf f = let (st,ts,mark,form,b) = node f in + Format.fprintf ppf "(%i, " st; + TagSet.print ppf ts; + Format.fprintf ppf ") %s" (if mark then "⇒" else "→"); + Formula.print ppf form; + Format.fprintf ppf "%s%!" (if b then " (b)" else "") + + + module Infix = struct + let ( ?< ) x = x + let ( >< ) state (l,mark) = state,(l,mark,false) + let ( ><@ ) state (l,mark) = state,(l,mark,true) + let ( >=> ) (state,(label,mark,bur)) form = (state,label,(make (state,label,mark,form,bur))) + end -type skiplist = Nothing | All - | Zero of skiplist - | One of skiplist | Two of skiplist | Three of skiplist - | Four of skiplist | Five of skiplist | Six of skiplist - | Seven of skiplist | Eight of skiplist | Nine of skiplist +end +module TransTable = Hashtbl -type formlist = Nil | Cons of state*formula*int*bool*formlist +module Formlist = struct + include Hlist.Make(Transition) + let print ppf fl = + iter (fun t -> Transition.print ppf t; Format.pp_print_newline ppf ()) fl +end +module Formlistlist = +struct + include Hlist.Make(Formlist) + let print ppf fll = + iter (fun fl -> Formlist.print ppf fl; Format.pp_print_newline ppf ())fll +end + type 'a t = { id : int; - mutable states : Ptset.t; - init : Ptset.t; - mutable final : Ptset.t; - universal : Ptset.t; - starstate : Ptset.t option; + mutable states : Ptset.Int.t; + init : Ptset.Int.t; + starstate : Ptset.Int.t option; (* Transitions of the Alternating automaton *) - phi : (state,(TagSet.t*(bool*formula*bool)) list) Hashtbl.t; - sigma : (int,('a t -> Tree.t -> Tree.t -> Ptset.t*'a)) Hashtbl.t; -} - - module Pair (X : Set.OrderedType) (Y : Set.OrderedType) = - struct - type t = X.t*Y.t - let compare (x1,y1) (x2,y2) = - let r = X.compare x1 x2 in - if r == 0 then Y.compare y1 y2 - else r - end + trans : (State.t,(TagSet.t*Transition.t) list) Hashtbl.t; + query_string: string; + } - module PL = Set.Make (Pair (Ptset) (Ptset)) - - - let pr_st ppf l = Format.fprintf ppf "{"; - begin - match l with - | [] -> () - | [s] -> Format.fprintf ppf " %i" s - | p::r -> Format.fprintf ppf " %i" p; - List.iter (fun i -> Format.fprintf ppf "; %i" i) r - end; - Format.fprintf ppf " }" - let rec pr_frm ppf f = match f.pos with - | True -> Format.fprintf ppf "⊤" - | False -> Format.fprintf ppf "⊥" - | And(f1,f2) -> - Format.fprintf ppf "("; - (pr_frm ppf f1); - Format.fprintf ppf ") ∧ ("; - (pr_frm ppf f2); - Format.fprintf ppf ")" - | Or(f1,f2) -> - (pr_frm ppf f1); - Format.fprintf ppf " ∨ "; - (pr_frm ppf f2); - | Atom(dir,b,s) -> Format.fprintf ppf "%s%s[%i]" - (if b then "" else "¬") - (match dir with - | `Left -> "↓₁" - | `Right -> "↓₂" - | `LLeft -> "⇓₁" - | `RRight -> "⇓₂") s - - let dump ppf a = - Format.fprintf ppf "Automaton (%i) :\n" a.id; - Format.fprintf ppf "States : "; pr_st ppf (Ptset.elements a.states); - Format.fprintf ppf "\nInitial states : "; pr_st ppf (Ptset.elements a.init); - Format.fprintf ppf "\nFinal states : "; pr_st ppf (Ptset.elements a.final); - Format.fprintf ppf "\nUniversal states : "; pr_st ppf (Ptset.elements a.universal); - Format.fprintf ppf "\nAlternating transitions :\n------------------------------\n"; - let l = Hashtbl.fold (fun k t acc -> - (List.map (fun (t,(m,f,p)) -> (t,k),(m,f,p)) t)@ acc) a.phi [] in - let l = List.sort (fun ((tsx,x),_) ((tsy,y),_) -> if x-y == 0 then TagSet.compare tsx tsy else x-y) l in - List.iter (fun ((ts,q),(b,f,_)) -> - - let s = - if TagSet.is_finite ts - then "{" ^ (TagSet.fold (fun t a -> a ^ " '" ^ (Tag.to_string t)^"'") ts "") ^" }" - else let cts = TagSet.neg ts in - if TagSet.is_empty cts then "*" else - (TagSet.fold (fun t a -> a ^ " " ^ (Tag.to_string t)) cts "*\\{" - )^ "}" - in - Format.fprintf ppf "(%s,%i) %s " s q (if b then "=>" else "->"); - pr_frm ppf f; - Format.fprintf ppf "\n")l; - - Format.fprintf ppf "NFA transitions :\n------------------------------\n"; -(* HTagSet.iter (fun (qs,t) (disp,b,_,flist,_,_) -> - let (ls,lls,_),(rs,rrs,_) = - List.fold_left (fun ((a1,b1,c1),(a2,b2,c2)) (_,f) -> - let (x1,y1,z1),(x2,y2,z2) = f.st in - ((Ptset.union x1 a1),(Ptset.union y1 b1),(Ptset.union c1 z1)), - ((Ptset.union x2 a2),(Ptset.union y2 b2),(Ptset.union c2 z2))) - ((Ptset.empty,Ptset.empty,Ptset.empty), - (Ptset.empty,Ptset.empty,Ptset.empty)) - flist - in - pr_st ppf (Ptset.elements qs); - Format.fprintf ppf ",%s %s " (Tag.to_string t) (if b then "=>" else "->"); - List.iter (fun (q,f) -> - Format.fprintf ppf "\n%i," q; - pr_frm ppf f) flist; - Format.fprintf ppf "\nleft="; - pr_st ppf (Ptset.elements ls); - Format.fprintf ppf " , "; - pr_st ppf (Ptset.elements lls); - Format.fprintf ppf ", right="; - pr_st ppf (Ptset.elements rs); - Format.fprintf ppf ", "; - pr_st ppf (Ptset.elements rrs); - Format.fprintf ppf ", first=%s, next=%s\n\n" disp.flabel disp.nlabel; - ) a.sigma; *) - Format.fprintf ppf "=======================================\n%!" + +let dump ppf a = + Format.fprintf ppf "Automaton (%i) :\n" a.id; + Format.fprintf ppf "States : "; StateSet.print ppf a.states; + Format.fprintf ppf "\nInitial states : "; StateSet.print ppf a.init; + Format.fprintf ppf "\nAlternating transitions :\n"; + let l = Hashtbl.fold (fun k t acc -> + (List.map (fun (ts,tr) -> (ts,k),Transition.node tr) t) @ acc) a.trans [] in + let l = List.sort (fun ((tsx,x),_) ((tsy,y),_) -> + if y-x == 0 then TagSet.compare tsy tsx else y-x) l in + let maxh,maxt,l_print = + List.fold_left ( + fun (maxh,maxt,l) ((ts,q),(_,_,b,f,_)) -> + let s = + if TagSet.is_finite ts + then "{" ^ (TagSet.fold (fun t a -> a ^ " '" ^ (Tag.to_string t)^"'") ts "") ^" }" + else let cts = TagSet.neg ts in + if TagSet.is_empty cts then "*" else + (TagSet.fold (fun t a -> a ^ " " ^ (Tag.to_string t)) cts "*\\{" + )^ "}" + in + let s = Printf.sprintf "(%s,%i)" s q in + let s_frm = + Formula.print Format.str_formatter f; + Format.flush_str_formatter() + in + (max (String.length s) maxh, max (String.length s_frm) maxt, + (s,(if b then "⇒" else "→"),s_frm)::l)) (0,0,[]) l + in + Format.fprintf ppf "%s\n%!" (String.make (maxt+maxh+3) '_'); + List.iter (fun (s,m,f) -> let s = s ^ (String.make (maxh-(String.length s)) ' ') in + Format.fprintf ppf "%s %s %s\n" s m f) l_print; + Format.fprintf ppf "%s\n%!" (String.make (maxt+maxh+3) '_') - module Transitions = struct - type t = state*TagSet.t*bool*formula*bool - let ( ?< ) x = x - let ( >< ) state (l,b) = state,(l,b,false) - let ( ><@ ) state (l,b) = state,(l,b,true) - let ( >=> ) (state,(label,mark,pred)) form = (state,label,mark,form,pred) - let ( +| ) f1 f2 = or_ f1 f2 - let ( *& ) f1 f2 = and_ f1 f2 - let ( ** ) d s = atom_ d true s +module FormTable = Hashtbl.Make(struct + type t = Formula.t*StateSet.t*StateSet.t + let equal (f1,s1,t1) (f2,s2,t2) = + f1 == f2 && s1 == s2 && t1 == t2 + let hash (f,s,t) = + HASHINT3(Formula.uid f ,StateSet.uid s,StateSet.uid t) + end) +module F = Formula + +let eval_form_bool = + let h_f = FormTable.create BIG_H_SIZE in + fun f s1 s2 -> + let rec loop f = + match F.expr f with + | F.True -> true,true,true + | F.False -> false,false,false + | F.Atom((`Left|`LLeft),b,q) -> + if b == (StateSet.mem q s1) + then (true,true,false) + else false,false,false + | F.Atom(_,b,q) -> + if b == (StateSet.mem q s2) + then (true,false,true) + else false,false,false + | f' -> + try FormTable.find h_f (f,s1,s2) + with Not_found -> let r = + match f' with + | F.Or(f1,f2) -> + let b1,rl1,rr1 = loop f1 + in + if b1 && rl1 && rr1 then (true,true,true) else + let b2,rl2,rr2 = loop f2 in + let rl1,rr1 = if b1 then rl1,rr1 else false,false + and rl2,rr2 = if b2 then rl2,rr2 else false,false + in (b1 || b2, rl1||rl2,rr1||rr2) + + | F.And(f1,f2) -> + let b1,rl1,rr1 = loop f1 in + if b1 && rl1 && rr1 then (true,true,true) else + if b1 then + let b2,rl2,rr2 = loop f2 in + if b2 then (true,rl1||rl2,rr1||rr2) else (false,false,false) + else (false,false,false) + | _ -> assert false + in FormTable.add h_f (f,s1,s2) r;r + in loop f - end - type transition = Transitions.t - - let equal_trans (q1,t1,m1,f1,_) (q2,t2,m2,f2,_) = - (q1 == q2) && (TagSet.equal t1 t2) && (m1 == m2) (*&& (equal_form f1 f2) *) + +module FTable = Hashtbl.Make(struct + type t = Tag.t*Formlist.t*StateSet.t*StateSet.t + let equal (tg1,f1,s1,t1) (tg2,f2,s2,t2) = + tg1 == tg2 && f1 == f2 && s1 == s2 && t1 == t2;; + let hash (tg,f,s,t) = HASHINT4(tg,Formlist.uid f ,StateSet.uid s,StateSet.uid t);; + end) + + +let h_f = FTable.create BIG_H_SIZE +type merge_conf = NO | MARK | ONLY1 | ONLY2 | ONLY12 | MARK1 | MARK2 | MARK12 + +let eval_formlist tag s1 s2 fl = + let rec loop fl = + try + FTable.find h_f (tag,fl,s1,s2) + with + | Not_found -> + match Formlist.node fl with + | Formlist.Cons(f,fll) -> + let q,ts,mark,f,_ = Transition.node f in + let b,b1,b2 = + if TagSet.mem tag ts then eval_form_bool f s1 s2 else (false,false,false) + in + let (s,(b',b1',b2',amark)) as res = loop fll in + let r = if b then (StateSet.add q s, (b, b1'||b1,b2'||b2,mark||amark)) + else res + in FTable.add h_f (tag,fl,s1,s2) r;r + | Formlist.Nil -> StateSet.empty,(false,false,false,false) + in + let r,conf = loop fl + in + r,(match conf with + | (false,_,_,_) -> NO + | (_,false,false,false) -> NO + | (_,true,false,false) -> ONLY1 + | (_,false,true,false) -> ONLY2 + | (_,true,true,false) -> ONLY12 + | (_,false,false,true) -> MARK + | (_,true,false,true) -> MARK1 + | (_,false,true,true) -> MARK2 + | _ -> MARK12) + +let bool_of_merge conf = + match conf with + | NO -> false,false,false,false + | ONLY1 -> true,true,false,false + | ONLY2 -> true,false,true,false + | ONLY12 -> true,true,true,false + | MARK -> true,false,false,true + | MARK1 -> true,true,false,true + | MARK2 -> true,false,true,true + | MARK12 -> true,true,true,true + + +let tags_of_state a q = + Hashtbl.fold + (fun p l acc -> + if p == q then List.fold_left + (fun acc (ts,t) -> + let _,_,_,_,aux = Transition.node t in + if aux then acc else + TagSet.cup ts acc) acc l + + else acc) a.trans TagSet.empty - - module HFEval = Hashtbl.Make( - struct - type t = int*Ptset.t*Ptset.t - let equal (a,b,c) (d,e,f) = - a==d && (Ptset.equal b e) && (Ptset.equal c f) - let hash (a,b,c) = - HASHINT3(a,Ptset.hash b,Ptset.hash c) - end) - - - - - let hfeval = HFEval.create 4097 - let eval_form_bool f s1 s2 = - let rec eval f = match f.pos with - (* test some inlining *) - | True -> true,true,true - | False -> false,false,false - | _ -> - try - HFEval.find hfeval (f.fid,s1,s2) - with - | Not_found -> let r = - match f.pos with - | Atom((`Left|`LLeft),b,q) -> - if b == (Ptset.mem q s1) - then (true,true,false) - else false,false,false - | Atom(_,b,q) -> - if b == (Ptset.mem q s2) - then (true,false,true) - else false,false,false - | Or(f1,f2) -> - let b1,rl1,rr1 = eval f1 - in - if b1 && rl1 && rr1 then (true,true,true) - else - let b2,rl2,rr2 = eval f2 - in - let rl1,rr1 = if b1 then rl1,rr1 else false,false - and rl2,rr2 = if b2 then rl2,rr2 else false,false - in (b1 || b2, rl1||rl2,rr1||rr2) - | And(f1,f2) -> - let b1,rl1,rr1 = eval f1 in - if b1 && rl1 && rr1 then (true,true,true) - else if b1 - then let b2,rl2,rr2 = eval f2 in - if b2 then (true,rl1||rl2,rr1||rr2) - else (false,false,false) - else (false,false,false) - | _ -> assert false - in - HFEval.add hfeval (f.fid,s1,s2) r; - r - in eval f - - - let form_list_fold_left f acc fl = - let rec loop acc fl = - match fl with - | Nil -> acc - | Cons(s,frm,h,m,fll) -> loop (f acc s frm h m) fll - in - loop acc fl - - let h_formlist = Hashtbl.create 4096 - let rec eval_formlist ?(memo=true) s1 s2 fl = - match fl with - | Nil -> Ptset.empty,false,false,false,false - | Cons(q,f,h,mark,fll) -> - let k = (h,Ptset.hash s1,Ptset.hash s2,mark) - in - - try - if memo then Hashtbl.find h_formlist k - else (raise Not_found) - with - Not_found -> - let s,b',b1',b2',amark = eval_formlist (~memo:memo) s1 s2 fll in - let b,b1,b2 = eval_form_bool f s1 s2 in - let r = if b then (Ptset.add q s, b, b1'||b1,b2'||b2,mark||amark) - else s,b',b1',b2',amark - in(* - Format.fprintf Format.err_formatter "\nEvaluating formula (%i) %i %s" h q (if mark then "=>" else "->"); - pr_frm (Format.err_formatter) f; - Format.fprintf Format.err_formatter " in context "; - pr_st Format.err_formatter (Ptset.elements s1); - Format.fprintf Format.err_formatter ", "; - pr_st Format.err_formatter (Ptset.elements s2); - Format.fprintf Format.err_formatter " result is %b\n%!" b; *) - (Hashtbl.add h_formlist k r;r) - - - - let tags_of_state a q = Hashtbl.fold - (fun p l acc -> - if p == q then - List.fold_left - (fun acc (ts,(_,_,aux)) -> - if aux then acc else - TagSet.cup ts acc) acc l - else acc) a.phi TagSet.empty - let tags a qs = - let ts = Ptset.fold (fun q acc -> TagSet.cup acc (tags_of_state a q)) qs TagSet.empty + let ts = Ptset.Int.fold (fun q acc -> TagSet.cup acc (tags_of_state a q)) qs TagSet.empty in if TagSet.is_finite ts then `Positive(TagSet.positive ts) @@ -430,490 +404,31 @@ type 'a t = { let inter_text a b = match b with - | `Positive s -> let r = Ptset.inter a s in (r,Ptset.mem Tag.pcdata r, true) - | `Negative s -> let r = Ptset.diff a s in (r, Ptset.mem Tag.pcdata r, false) - - let mk_nil_ctx x _ = Tree.mk_nil x - let next_sibling_ctx x _ = Tree.next_sibling x - let r_ignore _ x = x - - let set_get_tag r t = r := (fun _ -> t) - (* - - let merge_trans t a tag q acc = - List.fold_left (fun (accf,acchash,idx) (ts,(m,f,pred)) -> - if TagSet.mem tag ts - then - let acchash = HASHINT3(acchash,f.fid,q) in - (Cons(q,f,acchash,idx,m,accf),acchash,idx+1) - else (accf,acchash,idx) - ) acc (try Hashtbl.find a.phi q with Not_found -> []) - - - - let cast_cont :'b -> ('a t -> Tree.t -> Tree.t -> Ptset.t*'a) = - Obj.magic - - let get_trans conti t a tag r = - try - Hashtbl.find a.sigma (HASHINT2(Ptset.hash r,Tag.hash tag)) - with - Not_found -> - let fl,_,accq,_ = - Ptset.fold (fun q (accf,acchash,accq,aidx) -> - let naccf,acchash,naidx = - merge_trans t a tag q (accf,acchash,aidx ) - in - (naccf,acchash,Ptset.add q accq,naidx) - ) - r (Nil,17,Ptset.empty,0) - in - let (ls,lls,llls),(rs,rrs,rrrs) = - form_list_fold_left (fun ((a1,b1,c1),(a2,b2,c2)) _ f _ _ _ -> - let (x1,y1,z1),(x2,y2,z2) = f.st in - ((Ptset.union x1 a1),(Ptset.union y1 b1),(Ptset.union c1 z1)), - ((Ptset.union x2 a2),(Ptset.union y2 b2),(Ptset.union c2 z2))) - ((Ptset.empty,Ptset.empty,Ptset.empty), - (Ptset.empty,Ptset.empty,Ptset.empty)) - fl - in - let tb,ta = - Tree.tags t tag - in - let tl,htlt,lfin = inter_text tb (tags a ls) - and tll,htllt,llfin = inter_text tb (tags a lls) - and tr,htrt,rfin = inter_text ta (tags a rs) - and trr,htrrt,rrfin = inter_text ta (tags a rrs) - in - let get_tag = ref Tree.tag in - let first,flabel = - if (llfin && lfin) then (* no stars *) - (if htlt || htllt then (Tree.text_below, "#text_below") - else - let etl = Ptset.is_empty tl - and etll = Ptset.is_empty tll - in - if (etl && etll) - then (Tree.mk_nil, "#mk_nil") - else - if etl then - if Ptset.is_singleton tll - then begin - set_get_tag get_tag (Ptset.choose tll); - (Tree.tagged_desc (Ptset.choose tll), "#tagged_desc") - end - else (Tree.select_desc_only tll, "#select_desc_only") - else if etll then (Tree.node_child,"#node_child") - else (Tree.select_below tl tll,"#select_below")) - else (* stars or node() *) - if htlt||htllt then (Tree.first_child,"#first_child") - else (Tree.node_child,"#node_child") - and next,nlabel = - if (rrfin && rfin) then (* no stars *) - ( if htrt || htrrt - then (Tree.text_next, "#text_next") - else - let etr = Ptset.is_empty tr - and etrr = Ptset.is_empty trr - in - if etr && etrr - then (mk_nil_ctx, "#mk_nil_ctx") - else - if etr then - if Ptset.is_singleton trr - then begin - set_get_tag get_tag (Ptset.choose trr); - (Tree.tagged_foll_below (Ptset.choose trr),"#tagged_foll_below") - end - else (Tree.select_foll_only trr,"#select_foll_only") - else if etrr then (Tree.node_sibling_ctx,"#node_sibling_ctx") - else - (Tree.select_next tr trr,"#select_next") ) - - else if htrt || htrrt then (Tree.next_sibling_ctx,"#next_sibling_ctx") - else (Tree.node_sibling_ctx,"#node_sibling_ctx") - in - let cont = let flist = fl in - fun a t res ctx -> - let s1,res1 = conti a (first t) llls res t - and s2,res2 = conti a (next t ctx) rrrs res ctx in - let r',rb,rb1,rb2,mark,idxl = eval_formlist s1 s2 flist - in - r',(vb rb)*((vb mark) + (vb rb1)*res1 + (vb rb2)*res2) - in - Hashtbl.add a.sigma (HASHINT2(Ptset.hash r,Tag.hash tag)) (cast_cont cont); - (cast_cont cont) - - -(* - let rec accepting_among a t r ctx = - if Tree.is_nil t || Ptset.is_empty r then Ptset.empty,0,TS.Nil else - let dispatch,mark,flist,llls,rrrs = - get_trans (fun _ _ _ _ -> failwith "toto") t a (Tree.tag t) r - in - let s1,n1,res1 = accepting_among a (dispatch.first t) llls t in - let s2,n2,res2 = accepting_among a (dispatch.next t ctx) rrrs ctx in - let r',rb,rb1,rb2 = eval_formlist s1 s2 flist in - r',(vb rb)*((vb mark) + (vb rb1)* n1 + (vb rb2)*n2),if rb then - dispatch.consres t res1 res2 rb1 rb2 - else TS.Nil *) - - let run a t = assert false (* - let st,n,res = accepting_among a t a.init t in - if Ptset.is_empty (st) then TS.empty,0 else res,n *) - - let rec accepting_among_count_no_star a t r ctx = - if Tree.is_nil t then Ptset.empty,0 else - (get_trans (accepting_among_count_no_star) t a (Tree.tag t) r) - a t ctx - -(* - let rec accepting_among_count_star a t n = - if Tree.is_nil t then n else - if (Tree.tag t == Tag.attribute) - then accepting_among_count_star a (Tree.node_sibling t) n - else accepting_among_count_star a (Tree.node_sibling t) - (accepting_among_count_star a (Tree.node_child t) (1+n)) - - let rec accepting_among_count_may_star starstate a t r ctx = - if r == starstate then starstate,(accepting_among_count_star a t 0) - else - if Tree.is_nil t||Ptset.is_empty r then Ptset.empty,0 else - let dispatch,mark,flist,llls,rrrs = - get_trans (fun _ _ _ _ -> failwith "toto") t a (Tree.tag t) r - in - let s1,res1 = accepting_among_count_may_star starstate a (dispatch.first t) llls t - and s2,res2 = accepting_among_count_may_star starstate a (dispatch.next t ctx) rrrs ctx - in - let r',rb,rb1,rb2 = eval_formlist s1 s2 flist - in - r',(vb rb)*((vb mark) + (vb rb1)*res1 + (vb rb2)*res2) - -*) - let run_count a t = + | `Positive s -> let r = Ptset.Int.inter a s in (r,Ptset.Int.mem Tag.pcdata r, true) + | `Negative s -> let r = Ptset.Int.diff a s in (r, Ptset.Int.mem Tag.pcdata r, false) - let st,res = match a.starstate with - | None -> accepting_among_count_no_star a t a.init t - | Some s -> assert false (*accepting_among_count_may_star s a t a.init t *) - in - if Ptset.is_empty (st) then 0 else res - - - let run_time _ _ = failwith "blah" - - - module RealBottomUp = struct - - (* decrease number of arguments *) - let ton t = if Tree.is_nil t then "##" - else Tag.to_string (Tree.tag t) - ;; - let ion t = Tree.dump_node t - let memo = Hashtbl.create 4097 - let rlist = ref [] - - let cpt = ref 0;; - let rec run a t res r root rinit next targettag r0 first tomark = - incr cpt; - let res = (vb tomark) + res in - let newr,newres = if first then - accepting_among_count_no_star a t r t - else r, res - in - let r,res = if Ptset.is_empty newr then r,0 else newr,newres in - if Tree.equal t root then - if Ptset.intersect r rinit then (r,res,next) - else (Ptset.empty,0,next) - else - let tag = Tree.tag t in - let parent = Tree.binary_parent t in - let parent_tag = Tree.tag parent in - let left = Tree.is_left t in - let r',mark = - try Hashtbl.find memo (r,parent_tag,left) with - | Not_found -> - let pair = - Hashtbl.fold - (fun q l acc -> - List.fold_left - (fun (aq,am) (ts,(mark,form,_)) -> - if TagSet.mem parent_tag ts then - let (value,_,_) = if left then - eval_form_bool form r Ptset.empty - else - eval_form_bool form Ptset.empty r - in -(* let _ = if value then begin - Format.fprintf Format.err_formatter "Can take transition (%i,%s)%s%!" - q (Tag.to_string parent_tag) - (if mark then "=>" else "->"); - pr_frm Format.err_formatter form; - Format.fprintf Format.err_formatter "%! %s(" (if left then "left" else "right"); - pr_st Format.err_formatter (Ptset.elements r); - Format.fprintf Format.err_formatter ")\n%!" end; - in *) - if value then (Ptset.add q aq, mark||am) - else (aq,am) - else (aq,am)) - acc l - ) a.phi (Ptset.empty,false) - in Hashtbl.add memo (r,parent_tag,left) pair;pair - in - if Ptset.is_empty r' then Ptset.empty,0,next - else - if Tree.is_below_right t next then - let rn,resn,nextofnext = run a next 0 r0 t r (Tree.tagged_next next targettag) targettag r0 true false - in - let rn,resn = if Ptset.is_empty rn then Ptset.empty,0 else rn,resn in - run a (parent) (resn+res) r' root rinit nextofnext targettag r0 false false - else - run a (parent) (res) r' root rinit next targettag r0 false (mark&&left) - - - - let accept_count a t tag initset = - let tree1 = Tree.tagged_lowest t tag in - let tree2 = Tree.tagged_next tree1 tag in - let c,b,_ =run a tree1 0 initset t a.init tree2 tag initset true false - in Printf.eprintf "%i\n%!" !cpt; - if Ptset.is_empty c then 0 else b - - end *) -(* - module RealBottomUp2 = struct - module Formlist = - struct - type t = formlist - let nil : t = Nil - let cons q f i m l = Cons(q,f,i,m,l) - let hash = function Nil -> 0 | Cons(_,_,i,_,_) -> max_int land i - let pr fmt l = - let rec loop = function - | Nil -> () - | Cons(q,f,_,m,l) -> - Format.fprintf fmt "%i %s" q (if m then "=>" else "->"); - pr_frm fmt f; - Format.fprintf fmt "\n%!"; - loop l - in - loop l - end - - type ptset_list = Nil | Cons of Ptset.t*int*ptset_list - let hpl l = match l with - | Nil -> 0 - | Cons (_,i,_) -> i - - let cons s l = Cons (s,(Ptset.hash s) + 65599 * (hpl l), l) - - let rec empty_size n = - if n == 0 then Nil - else cons Ptset.empty (empty_size (n-1)) - - let fold_pl f l acc = - let rec loop l acc = match l with - Nil -> acc - | Cons(s,h,pl) -> loop pl (f s h acc) - in - loop l acc - let map_pl f l = - let rec loop = - function Nil -> Nil - | Cons(s,h,ll) -> cons (f s) (loop ll) - in loop l - - let rev_pl l = - let rec loop acc l = match l with - | Nil -> acc - | Cons(s,_,ll) -> loop (cons s acc) ll - in - loop Nil l - - let rev_map_pl f l = - let rec loop acc l = - match l with - | Nil -> acc - | Cons(s,_,ll) -> loop (cons (f s) acc) ll - in - loop Nil l - - let merge_int _ rb rb1 rb2 mark _ res1 res2 = - if rb then (vb mark) + ((vb rb1)*res1) + ((vb rb2)*res2) - else 0 - - let td_trans = Hashtbl.create 4096 - - let choose_jump tagset qtags1 qtagsn a f_nil f_text f_t1 f_s1 f_tn f_sn f_notext = - let tags1,hastext1,fin1 = inter_text tagset (tags a qtags1) in - let tagsn,hastextn,finn = inter_text tagset (tags a qtagsn) in -(* Format.fprintf Format.err_formatter "Tags below states "; - pr_st Format.err_formatter (Ptset.elements qtags1); - Format.fprintf Format.err_formatter " are { "; - Ptset.iter (fun t -> Format.fprintf Format.err_formatter "%s " (Tag.to_string t)) tags1; - Format.fprintf Format.err_formatter "}, %b,%b\n%!" hastext1 fin1; - - Format.fprintf Format.err_formatter "Tags below states "; - pr_st Format.err_formatter (Ptset.elements qtagsn); - Format.fprintf Format.err_formatter " are { "; - Ptset.iter (fun t -> Format.fprintf Format.err_formatter "%s " (Tag.to_string t)) tagsn; - Format.fprintf Format.err_formatter "}, %b,%b\n%!" hastextn finn; -*) - if (hastext1||hastextn) then f_text (* jumping to text nodes doesn't work really well *) - else if (Ptset.is_empty tags1) && (Ptset.is_empty tagsn) then f_nil - else if (Ptset.is_empty tagsn) then - if (Ptset.is_singleton tags1) then f_t1 (Ptset.choose tags1) (* TaggedChild/Sibling *) - else f_s1 tags1 (* SelectChild/Sibling *) - else if (Ptset.is_empty tags1) then - if (Ptset.is_singleton tagsn) then f_tn (Ptset.choose tagsn) (* TaggedDesc/Following *) - else f_sn tagsn (* SelectDesc/Following *) - else f_notext - - let choose_jump_down a b c d = - choose_jump a b c d - (Tree.mk_nil) - (Tree.text_below ) - (fun _ -> Tree.node_child ) (* !! no tagged_child in Tree.ml *) - (fun _ -> Tree.node_child ) (* !! no select_child in Tree.ml *) - (Tree.tagged_desc) - (fun _ -> Tree.node_child ) (* !! no select_desc *) - (Tree.node_child) - - let choose_jump_next a b c d = - choose_jump a b c d - (fun t _ -> Tree.mk_nil t) - (Tree.text_next) - (fun _ -> Tree.node_sibling_ctx) (* !! no tagged_sibling in Tree.ml *) - (fun _ -> Tree.node_sibling_ctx) (* !! no select_child in Tree.ml *) - (Tree.tagged_foll_below) - (fun _ -> Tree.node_sibling_ctx) (* !! no select_foll *) - (Tree.node_sibling_ctx) - - module type RS = sig - type t - type elt - val empty : t - val cons : elt -> t -> t - val concat : t -> t -> t - end - - - let get_trans slist tag a t = - try - Hashtbl.find td_trans (tag,hpl slist) - with - | Not_found -> - let fl_list,llist,rlist,ca,da,sa,fa = - fold_pl - (fun set _ (fll_acc,lllacc,rllacc,ca,da,sa,fa) -> (* For each set *) - let fl,ll,rr,ca,da,sa,fa = - Ptset.fold - (fun q acc -> - fst ( - List.fold_left - (fun (((fl_acc,ll_acc,rl_acc,c_acc,d_acc,s_acc,f_acc),h_acc) as acc) - (ts,(m,f,_)) -> - if (TagSet.mem tag ts) - then - let (child,desc,below),(sibl,foll,after) = f.st in - ((Formlist.cons q f h_acc m fl_acc, - Ptset.union ll_acc below, - Ptset.union rl_acc after, - Ptset.union child c_acc, - Ptset.union desc d_acc, - Ptset.union sibl s_acc, - Ptset.union foll f_acc), - HASHINT3(h_acc,f.fid,HASHINT2(q,vb m))) - else acc ) (acc,0) ( - try Hashtbl.find a.phi q - with - Not_found -> Printf.eprintf "Looking for state %i, doesn't exist!!!\n%!" - q;[] - )) - - ) set (Formlist.nil,Ptset.empty,Ptset.empty,ca,da,sa,fa) - in fl::fll_acc, cons ll lllacc, cons rr rllacc,ca,da,sa,fa) - slist ([],Nil,Nil,Ptset.empty,Ptset.empty,Ptset.empty,Ptset.empty) - in - (* Logic to chose the first and next function *) - let tags_below,tags_after = Tree.tags t tag in - let first = choose_jump_down tags_below ca da a - and next = choose_jump_next tags_after sa fa a in - let v = (fl_list,llist,rlist,first,next) in - Hashtbl.add td_trans (tag, hpl slist) v; v - - - let top_down ?(noright=false) a merge null t slist ctx slot_size = - let pempty = empty_size slot_size in - - let eval_fold2_slist fll sl1 sl2 res1 res2 t = - let res = Array.copy res1 in - let rec fold l1 l2 fll i aq = match l1,l2,fll with - | Cons(s1,_,ll1), Cons(s2, _ ,ll2),fl::fll -> - let r',rb,rb1,rb2,mark = eval_formlist s1 s2 fl in - let _ = res.(i) <- merge null rb rb1 rb2 mark t res1.(i) res2.(i) - in -(* let _ = Format.fprintf Format.err_formatter "(%b,%b,%b,%b) Result was %i %i, now %i\n%!" - rb rb1 rb2 mark (Obj.magic res1.(i)) (Obj.magic res2.(i)) (Obj.magic res.(i)); - in *) - - fold ll1 ll2 fll (i+1) (cons r' aq) - | Nil, Nil,[] -> aq,res - | _ -> assert false - in - fold sl1 sl2 fll 0 Nil - in - let rec loop t slist ctx = - if Tree.is_nil t then (pempty,Array.make slot_size null) - else - let tag = Tree.tag t in - let fl_list,llist,rlist,first,next = get_trans slist tag a t in - let sl1,res1 = loop (first t) llist t in - let sl2,res2 = if noright then (pempty,Array.make slot_size null) - else loop (next t ctx) rlist ctx in - eval_fold2_slist fl_list sl1 sl2 res1 res2 t - in - loop t slist ctx - - let run_top_down_count a t = - let init = cons a.init Nil in - let _,res = top_down a (fun _ rb rb1 rb2 mark t res1 res2 -> - (vb rb)*( (vb mark) + (vb rb1)*res1 + (vb rb2)*res2)) - 0 t init t 1 - in res.(0) - ;; - - let run_top_down a t = - let init = cons a.init Nil in - let _,res = - top_down a (fun null rb rb1 rb2 mark t res1 res2 -> - if rb then - TS.concat - (TS.concat (if mark then TS.Sing(t) else null) - (if rb1 then res1 else null)) - (if rb2 then res2 else null) - else null) - TS.Nil t init t 1 - in res.(0) - ;; - - end -*) module type ResultSet = sig type t + type elt = [` Tree ] Tree.node val empty : t - val cons : Tree.t -> t -> t + val cons : elt -> t -> t val concat : t -> t -> t - val iter : (Tree.t -> unit) -> t -> unit - val fold : (Tree.t -> 'a -> 'a) -> t -> 'a -> 'a - val map : (Tree.t -> Tree.t) -> t -> t + val iter : ( elt -> unit) -> t -> unit + val fold : ( elt -> 'a -> 'a) -> t -> 'a -> 'a + val map : ( elt -> elt) -> t -> t val length : t -> int + val merge : merge_conf -> elt -> t -> t -> t + val mk_quick_tag_loop : (elt -> elt -> 'a*t array) -> 'a -> int -> Tree.t -> Tag.t -> (elt -> elt -> 'a*t array) + val mk_quick_star_loop : (elt -> elt -> 'a*t array) -> 'a -> int -> Tree.t -> (elt -> elt -> 'a*t array) end module Integer : ResultSet = struct type t = int + type elt = [`Tree] Tree.node + let empty = 0 let cons _ x = x+1 let concat x y = x + y @@ -921,12 +436,40 @@ type 'a t = { let fold _ _ _ = failwith "fold not implemented" let map _ _ = failwith "map not implemented" let length x = x + let merge2 conf t res1 res2 = + let rb,rb1,rb2,mark = conf in + if rb then + let res1 = if rb1 then res1 else 0 + and res2 = if rb2 then res2 else 0 + in + if mark then 1+res1+res2 + else res1+res2 + else 0 + let merge conf t res1 res2 = + match conf with + NO -> 0 + | MARK -> 1 + | ONLY12 -> res1+res2 + | ONLY1 -> res1 + | ONLY2 -> res2 + | MARK12 -> res1+res2+1 + | MARK1 -> res1+1 + | MARK2 -> res2+1 + + let mk_quick_tag_loop _ sl ss tree tag = (); + fun t ctx -> + (sl, Array.make ss (Tree.subtree_tags tree tag t)) + let mk_quick_star_loop _ sl ss tree = (); + fun t ctx -> + (sl, Array.make ss (Tree.subtree_elements tree t)) + end - module IdSet : ResultSet = + module IdSet : ResultSet= struct + type elt = [`Tree] Tree.node type node = Nil - | Cons of Tree.t * node + | Cons of elt * node | Concat of node*node and t = { node : node; @@ -938,7 +481,6 @@ type 'a t = { let concat t1 t2 = { node = Concat(t1.node,t2.node); length = t1.length+t2.length } let append e t = { node = Concat(t.node,Cons(e,Nil)); length = t.length+1 } - let fold f l acc = let rec loop acc t = match t with | Nil -> acc @@ -964,255 +506,694 @@ type 'a t = { | Concat(t1,t2) -> Concat(loop t1,loop t2) in { l with node = loop l.node } - - + + let merge conf t res1 res2 = + match conf with + NO -> empty + | MARK -> cons t empty + | ONLY1 -> res1 + | ONLY2 -> res2 + | ONLY12 -> { node = (Concat(res1.node,res2.node)); + length = res1.length + res2.length ;} + | MARK12 -> { node = Cons(t,(Concat(res1.node,res2.node))); + length = res1.length + res2.length + 1;} + | MARK1 -> { node = Cons(t,res1.node); + length = res1.length + 1;} + | MARK2 -> { node = Cons(t,res2.node); + length = res2.length + 1;} + + let mk_quick_tag_loop f _ _ _ _ = f + let mk_quick_star_loop f _ _ _ = f end + module GResult(Doc : sig val doc : Tree.t end) = struct + type bits + type elt = [` Tree] Tree.node + external create_empty : int -> bits = "caml_result_set_create" + external set : bits -> int -> unit = "caml_result_set_set" + external next : bits -> int -> int = "caml_result_set_next" + external clear : bits -> elt -> elt -> unit = "caml_result_set_clear" + external set_tag_bits : bits -> Tag.t -> Tree.t -> elt -> elt = "caml_set_tag_bits" + type t = + { segments : elt list; + bits : bits; + } + + let ebits = + let size = (Tree.subtree_size Doc.doc Tree.root) in + create_empty (size*2+1) + + let empty = { segments = []; + bits = ebits } + + let cons e t = + let rec loop l = match l with + | [] -> { bits = (set t.bits (Obj.magic e);t.bits); + segments = [ e ] } + | p::r -> + if Tree.is_binary_ancestor Doc.doc e p then + loop r + else + { bits = (set t.bits (Obj.magic e);t.bits); + segments = e::l } + in + loop t.segments + + let concat t1 t2 = + if t2.segments == [] then t1 + else + if t1.segments == [] then t2 + else + let h2 = List.hd t2.segments in + let rec loop l = match l with + | [] -> t2.segments + | p::r -> + if Tree.is_binary_ancestor Doc.doc p h2 then + l + else + p::(loop r) + in + { bits = t1.bits; + segments = loop t1.segments + } + + let iter f t = + let rec loop i = + if i == -1 then () + else (f ((Obj.magic i):elt);loop (next t.bits i)) + in loop (next t.bits 0) + + let fold f t acc = + let rec loop i acc = + if i == -1 then acc + else loop (next t.bits i) (f ((Obj.magic i):elt) acc) + in loop (next t.bits 0) acc + + let map _ _ = failwith "noop" + let length t = let cpt = ref 0 in + iter (fun _ -> incr cpt) t; !cpt + + let clear_bits t = + let rec loop l = match l with + [] -> () + | idx::ll -> + clear t.bits idx (Tree.closing Doc.doc idx); loop ll + in + loop t.segments;empty + + let merge (rb,rb1,rb2,mark) elt t1 t2 = + if rb then +(* let _ = Printf.eprintf "Lenght before merging is %i %i\n" + (List.length t1.segments) (List.length t2.segments) + in *) + match t1.segments,t2.segments with + [],[] -> if mark then cons elt empty else empty + | [_],[] when rb1 -> if mark then cons elt t1 else t1 + | [], [_] when rb2 -> if mark then cons elt t2 else t2 + | [_],[_] when rb1 && rb2 -> if mark then cons elt empty else + concat t1 t2 + | _ -> + let t1 = if rb1 then t1 else clear_bits t1 + and t2 = if rb2 then t2 else clear_bits t2 + in + (if mark then cons elt (concat t1 t2) + else concat t1 t2) + else + let _ = clear_bits t1 in + clear_bits t2 + + let merge conf t t1 t2 = + match t1.segments,t2.segments,conf with + | _,_,NO -> let _ = clear_bits t1 in clear_bits t2 + | [],[],(MARK1|MARK2|MARK12|MARK) -> cons t empty + | [],[],_ -> empty + | [_],[],(ONLY1|ONLY12) -> t1 + | [_],[],(MARK1|MARK12) -> cons t t1 + | [],[_],(ONLY2|ONLY12) -> t2 + | [],[_],(MARK2|MARK12) -> cons t t2 + | [_],[_],ONLY12 -> concat t1 t2 + | [_],[_],MARK12 -> cons t empty + | _,_,MARK -> let _ = clear_bits t2 in cons t (clear_bits t1) + | _,_,ONLY1 -> let _ = clear_bits t2 in t1 + | _,_,ONLY2 -> let _ = clear_bits t1 in t2 + | _,_,ONLY12 -> concat t1 t2 + | _,_,MARK1 -> let _ = clear_bits t2 in cons t t1 + | _,_,MARK2 -> let _ = clear_bits t1 in cons t t2 + | _,_,MARK12 -> cons t (concat t1 t2) + + let mk_quick_tag_loop _ sl ss tree tag = (); + fun t _ -> + let res = empty in + let first = set_tag_bits empty.bits tag tree t in + let res = + if first == Tree.nil then res else + cons first res + in + (sl, Array.make ss res) + let mk_quick_star_loop f _ _ _ = f + end module Run (RS : ResultSet) = struct - let fmt = Format.err_formatter - let pr x = Format.fprintf fmt x - module Formlist = + + module SList = Hlist.Make (StateSet) + + + +IFDEF DEBUG +THEN + module IntSet = Set.Make(struct type t = int let compare = (-) end) +INCLUDE "html_trace.ml" + +END + let mk_fun f s = D_IGNORE_(register_funname f s,f) + let mk_app_fun f arg s = let g = f arg in + D_IGNORE_(register_funname g ((get_funname f) ^ " " ^ s), g) + let mk_app_fun2 f arg1 arg2 s = let g = f arg1 arg2 in + D_IGNORE_(register_funname g ((get_funname f) ^ " " ^ s), g) + + let string_of_ts tags = (Ptset.Int.fold (fun t a -> a ^ " " ^ (Tag.to_string t) ) tags "{")^ " }" + + + module Algebra = + struct + type jump = [ `NIL | `ANY |`ANYNOTEXT | `JUMP ] + type t = jump*Ptset.Int.t*Ptset.Int.t + let jts = function + | `JUMP -> "JUMP" + | `NIL -> "NIL" + | `ANY -> "ANY" + | `ANYNOTEXT -> "ANYNOTEXT" + let merge_jump (j1,c1,l1) (j2,c2,l2) = + match j1,j2 with + | _,`NIL -> (j1,c1,l1) + | `NIL,_ -> (j2,c2,l2) + | `ANY,_ -> (`ANY,Ptset.Int.empty,Ptset.Int.empty) + | _,`ANY -> (`ANY,Ptset.Int.empty,Ptset.Int.empty) + | `ANYNOTEXT,_ -> + if Ptset.Int.mem Tag.pcdata (Ptset.Int.union c2 l2) then + (`ANY,Ptset.Int.empty,Ptset.Int.empty) + else + (`ANYNOTEXT,Ptset.Int.empty,Ptset.Int.empty) + | _,`ANYNOTEXT -> + if Ptset.Int.mem Tag.pcdata (Ptset.Int.union c1 l1) then + (`ANY,Ptset.Int.empty,Ptset.Int.empty) + else + (`ANYNOTEXT,Ptset.Int.empty,Ptset.Int.empty) + | `JUMP,`JUMP -> (`JUMP, Ptset.Int.union c1 c2,Ptset.Int.union l1 l2) + + let merge_jump_list = function + | [] -> `NIL,Ptset.Int.empty,Ptset.Int.empty + | p::r -> + List.fold_left (merge_jump) p r + + let labels a s = + Hashtbl.fold + ( + fun q l acc -> + if (q == s) + then + + (List.fold_left + (fun acc (ts,f) -> + let _,_,_,_,bur = Transition.node f in + if bur then acc else TagSet.cup acc ts) + acc l) + else acc ) a.trans TagSet.empty + exception Found + + let is_rec a s access = + List.exists + (fun (_,t) -> let _,_,_,f,_ = Transition.node t in + StateSet.mem s ((fun (_,_,x) -> x) (access (Formula.st f)))) (Hashtbl.find a.trans s) + + let is_final_marking a s = + List.exists (fun (_,t) -> let _,_,m,f,_ = Transition.node t in m&& (Formula.is_true f)) + (Hashtbl.find a.trans s) + + + let decide a c_label l_label dir_states dir = + + let l = StateSet.fold + (fun s l -> + let s_rec = is_rec a s (if dir then fst else snd) in + let s_rec = if dir then s_rec else + (* right move *) + is_rec a s fst + in + let s_lab = labels a s in + let jmp,cc,ll = + if (not (TagSet.is_finite s_lab)) then + if TagSet.mem Tag.pcdata s_lab then (`ANY,Ptset.Int.empty,Ptset.Int.empty) + else (`ANYNOTEXT,Ptset.Int.empty,Ptset.Int.empty) + else + if s_rec + then (`JUMP,Ptset.Int.empty, TagSet.positive + (TagSet.cap (TagSet.inj_positive l_label) s_lab)) + else (`JUMP,TagSet.positive + (TagSet.cap (TagSet.inj_positive c_label) s_lab), + Ptset.Int.empty ) + in + (if jmp != `ANY + && jmp != `ANYNOTEXT + && Ptset.Int.is_empty cc + && Ptset.Int.is_empty ll + then (`NIL,Ptset.Int.empty,Ptset.Int.empty) + else (jmp,cc,ll))::l) dir_states [] + in merge_jump_list l + + + end + + + + let choose_jump (d,cl,ll) f_nil f_t1 f_s1 f_tn f_sn f_s1n f_notext f_maytext = + match d with + | `NIL -> (`NIL,f_nil) + | `ANYNOTEXT -> `ANY,f_notext + | `ANY -> `ANY,f_maytext + | `JUMP -> + if Ptset.Int.is_empty cl then + if Ptset.Int.is_singleton ll then + let tag = Ptset.Int.choose ll in + (`TAG(tag),mk_app_fun f_tn tag (Tag.to_string tag)) + else + (`MANY(ll),mk_app_fun f_sn ll (string_of_ts ll)) + else if Ptset.Int.is_empty ll then + if Ptset.Int.is_singleton cl then + let tag = Ptset.Int.choose cl in + (`TAG(tag),mk_app_fun f_t1 tag (Tag.to_string tag)) + else + (`MANY(cl),mk_app_fun f_s1 cl (string_of_ts cl)) + else + (`ANY,mk_app_fun2 f_s1n cl ll ((string_of_ts cl) ^ " " ^ (string_of_ts ll))) + + | _ -> assert false + + let choose_jump_down tree d = + choose_jump d + (mk_fun (fun _ -> Tree.nil) "Tree.mk_nil") + (mk_fun (Tree.tagged_child tree) "Tree.tagged_child") + (mk_fun (Tree.select_child tree) "Tree.select_child") + (mk_fun (Tree.tagged_desc tree) "Tree.tagged_desc") + (mk_fun (Tree.select_desc tree) "Tree.select_desc") + (mk_fun (fun _ _ -> Tree.first_child tree) "[FIRSTCHILD]Tree.select_child_desc") + (mk_fun (Tree.first_element tree) "Tree.first_element") + (mk_fun (Tree.first_child tree) "Tree.first_child") + + let choose_jump_next tree d = + choose_jump d + (mk_fun (fun _ _ -> Tree.nil) "Tree.mk_nil2") + (mk_fun (Tree.tagged_sibling_ctx tree) "Tree.tagged_sibling_ctx") + (mk_fun (Tree.select_sibling_ctx tree) "Tree.select_sibling_ctx") + (mk_fun (Tree.tagged_foll_ctx tree) "Tree.tagged_foll_ctx") + (mk_fun (Tree.select_foll_ctx tree) "Tree.select_foll_ctx") + (mk_fun (fun _ _ -> Tree.next_sibling_ctx tree) "[NEXTSIBLING]Tree.select_sibling_foll_ctx") + (mk_fun (Tree.next_element_ctx tree) "Tree.next_element_ctx") + (mk_fun (Tree.next_sibling_ctx tree) "Tree.node_sibling_ctx") + + + module SListTable = Hashtbl.Make(struct type t = SList.t + let equal = (==) + let hash t = t.SList.Node.id + end) + + + module TransCacheOld = struct - type t = formlist - let nil : t = Nil - let cons q f i m l = Cons(q,f,i,m,l) - let hash = function Nil -> 0 | Cons(_,_,i,_,_) -> max_int land i - let pr fmt l = - let rec loop = function - | Nil -> () - | Cons(q,f,_,m,l) -> - Format.fprintf fmt "%i %s" q (if m then "=>" else "->"); - pr_frm fmt f; - Format.fprintf fmt "\n%!"; - loop l + type 'a t = Obj.t array SListTable.t + let create n = SListTable.create n + let dummy = Obj.repr (fun _ -> assert false) + let find (h :'a t) tag slist : 'a = + let tab = + try + SListTable.find h slist + with + Not_found -> + SListTable.add h slist (Array.create 10000 dummy); + raise Not_found in - loop l - end - - type ptset_list = Nil | Cons of Ptset.t*int*ptset_list - let hpl l = match l with - | Nil -> 0 - | Cons (_,i,_) -> i + let res = tab.(tag) in + if res == dummy then raise Not_found else (Obj.magic res) - let cons s l = Cons (s,(Ptset.hash s) + 65599 * (hpl l), l) + let add (h : 'a t) tag slist (data : 'a) = + let tab = + try + SListTable.find h slist + with + Not_found -> + let arr = Array.create 10000 dummy in + SListTable.add h slist arr; + arr + in + tab.(tag) <- (Obj.repr data) - let rec empty_size n = - if n == 0 then Nil - else cons Ptset.empty (empty_size (n-1)) - - let fold_pl f l acc = - let rec loop l acc = match l with - Nil -> acc - | Cons(s,h,pl) -> loop pl (f s h acc) - in - loop l acc - let map_pl f l = - let rec loop = - function Nil -> Nil - | Cons(s,h,ll) -> cons (f s) (loop ll) - in loop l - let iter_pl f l = - let rec loop = - function Nil -> () - | Cons(s,h,ll) -> (f s);(loop ll) - in loop l - - let rev_pl l = - let rec loop acc l = match l with - | Nil -> acc - | Cons(s,_,ll) -> loop (cons s acc) ll - in - loop Nil l - let rev_map_pl f l = - let rec loop acc l = - match l with - | Nil -> acc - | Cons(s,_,ll) -> loop (cons (f s) acc) ll - in - loop Nil l + end - let td_trans = Hashtbl.create 4096 + module TransCache = + struct + external get : 'a array -> int ->'a = "%array_unsafe_get" + external set : 'a array -> int -> 'a -> unit = "%array_unsafe_set" + type fun_tree = [`Tree] Tree.node -> [`Tree] Tree.node -> SList.t*RS.t array + type t = fun_tree array array + let dummy_cell = [||] + let create n = Array.create n dummy_cell + let dummy = fun _ _-> assert false + let find h tag slist = + let tab = get h slist.SList.Node.id in + if tab == dummy_cell then raise Not_found + else + let res = get tab tag in + if res == dummy then raise Not_found else res + + let add (h : t) tag slist (data : fun_tree) = + let tab = get h slist.SList.Node.id in + let tab = if tab == dummy_cell then + let x = Array.create 10000 dummy in + (set h slist.SList.Node.id x;x) + else tab + in + set tab tag data + end + let td_trans = TransCache.create 10000 (* should be number of tags *number of states^2 + in the document *) + + let empty_size n = + let rec loop acc = function 0 -> acc + | n -> loop (SList.cons StateSet.empty acc) (n-1) + in loop SList.nil n + + module FllTable = Hashtbl.Make (struct type t = Formlistlist.t + let equal = (==) + let hash t = t.Formlistlist.Node.id + end) - let choose_jump tagset qtags1 qtagsn a f_nil f_text f_t1 f_s1 f_tn f_sn f_notext = - let tags1,hastext1,fin1 = inter_text tagset (tags a qtags1) in - let tagsn,hastextn,finn = inter_text tagset (tags a qtagsn) in -(* Format.fprintf Format.err_formatter "Tags below states "; - pr_st Format.err_formatter (Ptset.elements qtags1); - Format.fprintf Format.err_formatter " are { "; - Ptset.iter (fun t -> Format.fprintf Format.err_formatter "%s " (Tag.to_string t)) tags1; - Format.fprintf Format.err_formatter "}, %b,%b\n%!" hastext1 fin1; - - Format.fprintf Format.err_formatter "Tags below states "; - pr_st Format.err_formatter (Ptset.elements qtagsn); - Format.fprintf Format.err_formatter " are { "; - Ptset.iter (fun t -> Format.fprintf Format.err_formatter "%s " (Tag.to_string t)) tagsn; - Format.fprintf Format.err_formatter "}, %b,%b\n%!" hastextn finn; -*) - if (hastext1||hastextn) then f_text (* jumping to text nodes doesn't work really well *) - else if (Ptset.is_empty tags1) && (Ptset.is_empty tagsn) then f_nil - else if (Ptset.is_empty tagsn) then - if (Ptset.is_singleton tags1) then f_t1 (Ptset.choose tags1) (* TaggedChild/Sibling *) - else f_s1 tags1 (* SelectChild/Sibling *) - else if (Ptset.is_empty tags1) then - if (Ptset.is_singleton tagsn) then f_tn (Ptset.choose tagsn) (* TaggedDesc/Following *) - else f_sn tagsn (* SelectDesc/Following *) - else f_notext - - let choose_jump_down a b c d = - choose_jump a b c d - (Tree.mk_nil) - (Tree.text_below) - (*fun x -> let i,j = Tree.doc_ids x in - let res = Tree.text_below x in - Printf.printf "Calling text_below %s (tag=%s), docids= (%i,%i), res=%s\n" - (Tree.dump_node x) (Tag.to_string (Tree.tag x)) i j (Tree.dump_node res); - res*) - (fun _ -> Tree.node_child ) (* !! no tagged_child in Tree.ml *) - (fun _ -> Tree.node_child ) (* !! no select_child in Tree.ml *) - (Tree.tagged_desc) - (fun _ -> Tree.node_child ) (* !! no select_desc *) - (Tree.node_child) - - let choose_jump_next a b c d = - choose_jump a b c d - (fun t _ -> Tree.mk_nil t) - (Tree.text_next) - (*fun x y -> let i,j = Tree.doc_ids x in - let res = Tree.text_next x y in - Printf.printf "Calling text_next %s (tag=%s) ctx=%s, docids= (%i,%i), res=%s\n" - (Tree.dump_node x) (Tag.to_string (Tree.tag x)) (Tree.dump_node y) i j (Tree.dump_node res); - res*) - - (fun _ -> Tree.node_sibling_ctx) (* !! no tagged_sibling in Tree.ml *) - (fun _ -> Tree.node_sibling_ctx) (* !! no select_child in Tree.ml *) - (Tree.tagged_foll_below) - (fun _ -> Tree.node_sibling_ctx) (* !! no select_foll *) - (Tree.node_sibling_ctx) + module Fold2ResOld = + struct + type 'a t = 'a SListTable.t SListTable.t FllTable.t + let create n = Array.init 10000 (fun _ -> FllTable.create n) + + let find h tag fl s1 s2 = + let hf = h.(tag) in + let hs1 = FllTable.find hf fl in + let hs2 = SListTable.find hs1 s1 in + SListTable.find hs2 s2 - - let get_trans slist tag a t = - try - Hashtbl.find td_trans (tag,hpl slist) - with - | Not_found -> - let fl_list,llist,rlist,ca,da,sa,fa = - fold_pl - (fun set _ (fll_acc,lllacc,rllacc,ca,da,sa,fa) -> (* For each set *) - let fl,ll,rr,ca,da,sa,fa = - Ptset.fold - (fun q acc -> - fst ( - List.fold_left - (fun (((fl_acc,ll_acc,rl_acc,c_acc,d_acc,s_acc,f_acc),h_acc) as acc) - (ts,(m,f,_)) -> - if (TagSet.mem tag ts) - then - let (child,desc,below),(sibl,foll,after) = f.st in - let h_acc = HASHINT3(h_acc,f.fid,HASHINT2(q,vb m)) in - ((Formlist.cons q f h_acc m fl_acc, - Ptset.union ll_acc below, - Ptset.union rl_acc after, - Ptset.union child c_acc, - Ptset.union desc d_acc, - Ptset.union sibl s_acc, - Ptset.union foll f_acc), - h_acc) - else acc ) (acc,0) ( - try Hashtbl.find a.phi q - with - Not_found -> Printf.eprintf "Looking for state %i, doesn't exist!!!\n%!" - q;[] - )) - - ) set (Formlist.nil,Ptset.empty,Ptset.empty,ca,da,sa,fa) - in fl::fll_acc, cons ll lllacc, cons rr rllacc,ca,da,sa,fa) - slist ([],Nil,Nil,Ptset.empty,Ptset.empty,Ptset.empty,Ptset.empty) - in - (* Logic to chose the first and next function *) - let tags_below,tags_after = Tree.tags t tag in - let first = choose_jump_down tags_below ca da a - and next = choose_jump_next tags_after sa fa a in - let v = (fl_list,llist,rlist,first,next) in - Hashtbl.add td_trans (tag, hpl slist) v; v - - let merge rb rb1 rb2 mark t res1 res2 = - if rb - then - let res1 = if rb1 then res1 else RS.empty - and res2 = if rb2 then res2 else RS.empty + let add h tag fl s1 s2 data = + let hf = h.(tag) in + let hs1 = + try FllTable.find hf fl with + | Not_found -> + let hs1 = SListTable.create SMALL_H_SIZE + in FllTable.add hf fl hs1;hs1 in - if mark then RS.cons t (RS.concat res1 res2) - else RS.concat res1 res2 - else RS.empty - - let top_down ?(noright=false) a t slist ctx slot_size = - let pempty = empty_size slot_size in - let eval_fold2_slist fll sl1 sl2 res1 res2 t = - let res = Array.copy res1 in - let rec fold l1 l2 fll i aq = match l1,l2,fll with - | Cons(s1,_,ll1), Cons(s2, _ ,ll2),fl::fll -> - let r',rb,rb1,rb2,mark = eval_formlist s1 s2 fl in -(* let _ = pr "Evaluation context : "; pr_st fmt (Ptset.elements s1); - pr_st fmt (Ptset.elements s2); - pr "Formlist (%i) : " (Formlist.hash fl); - Formlist.pr fmt fl; - pr "Results : "; pr_st fmt (Ptset.elements r'); - pr ", %b %b %b %b\n%!" rb rb1 rb2 mark - in *) - let _ = res.(i) <- merge rb rb1 rb2 mark t res1.(i) res2.(i) - in - fold ll1 ll2 fll (i+1) (cons r' aq) - | Nil, Nil,[] -> aq,res - | _ -> assert false + let hs2 = + try SListTable.find hs1 s1 + with + | Not_found -> + let hs2 = SListTable.create SMALL_H_SIZE + in SListTable.add hs1 s1 hs2;hs2 in - fold sl1 sl2 fll 0 Nil - in - let null_result() = (pempty,Array.make slot_size RS.empty) in - let rec loop t slist ctx = - let (a,b) = - if Tree.is_nil t then null_result() - else - let tag = Tree.tag t in - let fl_list,llist,rlist,first,next = get_trans slist tag a t in -(* let _ = pr "For tag %s,node %s, returning formulae list: \n%!" - (Tag.to_string tag) (Tree.dump_node t); - List.iter (fun f -> Formlist.pr fmt f;pr "\n%!") fl_list - in*) - let sl1,res1 = loop (first t) llist t in - let sl2,res2 = loop (next t ctx) rlist ctx in - eval_fold2_slist fl_list sl1 sl2 res1 res2 t - in -(* let _ = pr "Inside topdown call: tree was %s, tag = %s" (Tree.dump_node t) (if Tree.is_nil t then "###" - else Tag.to_string (Tree.tag t)); - iter_pl (fun s -> (pr_st fmt (Ptset.elements s))) a; - Array.iter (fun i -> pr "%i" (RS.length i)) b; - pr "\n%!"; in*) (a,b) - - in - let loop_no_right t slist ctx = - if Tree.is_nil t then null_result() - else - let tag = Tree.tag t in - let fl_list,llist,rlist,first,next = get_trans slist tag a t in - let sl1,res1 = loop (first t) llist t in - let sl2,res2 = null_result() in - eval_fold2_slist fl_list sl1 sl2 res1 res2 t + SListTable.add hs2 s2 data + end + + module Fold2Res = struct + external get : 'a array -> int ->'a = "%array_unsafe_get" + external set : 'a array -> int -> 'a -> unit = "%array_unsafe_set" + external field1 : 'a -> 'b = "%field1" + type 'a t = 'a array array array array + let dummy = [||] + let dummy_val : 'a = + let v = Obj.repr ((),2,()) in + Obj.magic v + + let create n = Array.create n dummy + + let find h tag fl s1 s2 = + let af = get h tag in + if af == dummy then raise Not_found + else + let as1 = get af fl.Formlistlist.Node.id in + if as1 == dummy then raise Not_found + else + let as2 = get as1 s1.SList.Node.id in + if as2 == dummy then raise Not_found + else let v = get as2 s2.SList.Node.id in + if field1 v == 2 then raise Not_found + else v + + let add h tag fl s1 s2 data = + let af = + let x = get h tag in + if x == dummy then + begin + let y = Array.make 10000 dummy in + set h tag y;y + end + else x + in + let as1 = + let x = get af fl.Formlistlist.Node.id in + if x == dummy then + begin + let y = Array.make 10000 dummy in + set af fl.Formlistlist.Node.id y;y + end + else x + in + let as2 = + let x = get as1 s1.SList.Node.id in + if x == dummy then + begin + let y = Array.make 10000 dummy_val in + set as1 s1.SList.Node.id y;y + end + else x + in + set as2 s2.SList.Node.id data + end + + + let h_fold2 = Fold2Res.create 10000 + + let top_down ?(noright=false) a tree t slist ctx slot_size = + let pempty = empty_size slot_size in + let rempty = Array.make slot_size RS.empty in + (* evaluation starts from the right so we put sl1,res1 at the end *) + let eval_fold2_slist fll t tag (sl2,res2) (sl1,res1) = + let res = Array.copy rempty in + try + let r,b,btab = Fold2Res.find h_fold2 tag fll sl1 sl2 in + if b then for i=0 to slot_size - 1 do + res.(i) <- RS.merge btab.(i) t res1.(i) res2.(i); + done; + r,res + with + Not_found -> + let btab = Array.make slot_size NO in + let rec fold l1 l2 fll i aq ab = + match fll.Formlistlist.Node.node, + l1.SList.Node.node, + l2.SList.Node.node + with + | Formlistlist.Cons(fl,fll), + SList.Cons(s1,ll1), + SList.Cons(s2,ll2) -> + let r',conf = eval_formlist tag s1 s2 fl in + let _ = btab.(i) <- conf + in + fold ll1 ll2 fll (i+1) (SList.cons r' aq) ((conf!=NO)||ab) + | _ -> aq,ab + in + let r,b = fold sl1 sl2 fll 0 SList.nil false in + Fold2Res.add h_fold2 tag fll sl1 sl2 (r,b,btab); + if b then for i=0 to slot_size - 1 do + res.(i) <- RS.merge btab.(i) t res1.(i) res2.(i); + done; + r,res in + + let null_result = (pempty,Array.copy rempty) in + let rec loop t slist ctx = + if t == Tree.nil then null_result else get_trans t slist (Tree.tag tree t) ctx + and loop_tag tag t slist ctx = + if t == Tree.nil then null_result else get_trans t slist tag ctx + and loop_no_right t slist ctx = + if t == Tree.nil then null_result else get_trans ~noright:true t slist (Tree.tag tree t) ctx + and get_trans ?(noright=false) t slist tag ctx = + let cont = + try + TransCache.find td_trans tag slist + with + | Not_found -> + let fl_list,llist,rlist,ca,da,sa,fa = + SList.fold + (fun set (fll_acc,lllacc,rllacc,ca,da,sa,fa) -> (* For each set *) + let fl,ll,rr,ca,da,sa,fa = + StateSet.fold + (fun q acc -> + List.fold_left + (fun ((fl_acc,ll_acc,rl_acc,c_acc,d_acc,s_acc,f_acc) as acc) + (ts,t) -> + if (TagSet.mem tag ts) + then + let _,_,_,f,_ = Transition.node t in + let (child,desc,below),(sibl,foll,after) = Formula.st f in + (Formlist.cons t fl_acc, + StateSet.union ll_acc below, + StateSet.union rl_acc after, + StateSet.union child c_acc, + StateSet.union desc d_acc, + StateSet.union sibl s_acc, + StateSet.union foll f_acc) + else acc ) acc ( + try Hashtbl.find a.trans q + with + Not_found -> Printf.eprintf "Looking for state %i, doesn't exist!!!\n%!" + q;[] + ) + + ) set (Formlist.nil,StateSet.empty,StateSet.empty,ca,da,sa,fa) + in (Formlistlist.cons fl fll_acc), (SList.cons ll lllacc), (SList.cons rr rllacc),ca,da,sa,fa) + slist (Formlistlist.nil,SList.nil,SList.nil,StateSet.empty,StateSet.empty,StateSet.empty,StateSet.empty) + in + (* Logic to chose the first and next function *) + let tags_child,tags_below,tags_siblings,tags_after = Tree.tags tree tag in + let d_f = Algebra.decide a tags_child tags_below (StateSet.union ca da) true in + let d_n = Algebra.decide a tags_siblings tags_after (StateSet.union sa fa) false in + let f_kind,first = choose_jump_down tree d_f + and n_kind,next = if noright then (`NIL, fun _ _ -> Tree.nil ) + else choose_jump_next tree d_n in + let empty_res = null_result in + let cont = + match f_kind,n_kind with + | `NIL,`NIL -> + Printf.eprintf "Using %i\n" (Loc.start_line __LOCATION__); + (fun t _ -> eval_fold2_slist fl_list t (Tree.tag tree t) empty_res empty_res) + | _,`NIL -> ( + match f_kind with + |`TAG(tag') -> + let default = fun t _ -> eval_fold2_slist fl_list t (Tree.tag tree t) empty_res + (loop_tag tag' (first t) llist t ) + in + let cf = SList.hd llist in + if (slot_size == 1) && StateSet.is_singleton cf + then + let s = StateSet.choose cf in + if (Algebra.is_rec a s fst) && (Algebra.is_rec a s snd) + && (Algebra.is_final_marking a s) + then + let _ = Printf.eprintf "Using %i\n" (Loc.start_line __LOCATION__) in + RS.mk_quick_tag_loop default llist 1 tree tag' + else + let _ = Printf.eprintf "Using %i\n" (Loc.start_line __LOCATION__) in + default + else + let _ = Printf.eprintf "Using %i\n" (Loc.start_line __LOCATION__) in + default + | _ -> + let _ = Printf.eprintf "Using %i\n" (Loc.start_line __LOCATION__) in + (fun t _ -> eval_fold2_slist fl_list t (Tree.tag tree t) empty_res + (loop (first t) llist t )) + ) + | `NIL,_ -> ( + match n_kind with + |`TAG(tag') -> + if SList.equal rlist slist && tag == tag' then + let rec loop t ctx = + if t == Tree.nil then empty_res else + let res2 = loop (next t ctx) ctx in + eval_fold2_slist fl_list t tag res2 empty_res + in Printf.eprintf "Using %i\n" (Loc.start_line __LOCATION__);loop + else + let _ = Printf.eprintf "Using %i\n" (Loc.start_line __LOCATION__) in + (fun t ctx -> eval_fold2_slist fl_list t (Tree.tag tree t) + (loop_tag tag' (next t ctx) rlist ctx ) empty_res) + + | _ -> + let _ = Printf.eprintf "Using %i\n" (Loc.start_line __LOCATION__) in + (fun t ctx -> eval_fold2_slist fl_list t (Tree.tag tree t) + (loop (next t ctx) rlist ctx ) empty_res) + ) + + | `TAG(tag1),`TAG(tag2) -> + let _ = Printf.eprintf "Using %i %s %s\n" (Loc.start_line __LOCATION__) + (Tag.to_string tag1) + (Tag.to_string tag2) + in + (fun t ctx -> + eval_fold2_slist fl_list t (Tree.tag tree t) + (loop_tag tag2 (next t ctx) rlist ctx ) + (loop_tag tag1 (first t) llist t )) + + | `TAG(tag'),`ANY -> + let _ = Printf.eprintf "Using %i\n" (Loc.start_line __LOCATION__) in + (fun t ctx -> + eval_fold2_slist fl_list t (Tree.tag tree t) + (loop (next t ctx) rlist ctx ) + (loop_tag tag' (first t) llist t )) + + | `ANY,`TAG(tag') -> + let _ = Printf.eprintf "Using %i\n" (Loc.start_line __LOCATION__) in + (fun t ctx -> + eval_fold2_slist fl_list t (Tree.tag tree t) + (loop_tag tag' (next t ctx) rlist ctx ) + (loop (first t) llist t )) + + | `ANY,`ANY -> + let _ = Printf.eprintf "Using %i\n" (Loc.start_line __LOCATION__) in + if SList.equal slist rlist && SList.equal slist llist + then + let rec loop t ctx = + if t == Tree.nil then empty_res else + let r1 = loop (first t) t + and r2 = loop (next t ctx) ctx + in + eval_fold2_slist fl_list t (Tree.tag tree t) r2 r1 + in + let _ = Printf.eprintf "Using %i\n" (Loc.start_line __LOCATION__) in + loop + else + let _ = Printf.eprintf "Using %i\n" (Loc.start_line __LOCATION__) in + (fun t ctx -> + eval_fold2_slist fl_list t (Tree.tag tree t) + (loop (next t ctx) rlist ctx ) + (loop (first t) llist t )) + | _,_ -> + let _ = Printf.eprintf "Using %i\n" (Loc.start_line __LOCATION__) in + (fun t ctx -> + eval_fold2_slist fl_list t (Tree.tag tree t) + (loop (next t ctx) rlist ctx ) + (loop (first t) llist t )) + + in + let cont = D_IF_( (fun t ctx -> + let a,b = cont t ctx in + register_trace tree t (slist,a,fl_list,first,next,ctx); + (a,b) + ) ,cont) + in + (TransCache.add td_trans tag slist cont ;cont) + in cont t ctx + + in (if noright then loop_no_right else loop) t slist ctx - - let run_top_down a t = - let init = cons a.init Nil in - let _,res = top_down a t init t 1 - in res.(0) + + let run_top_down a tree = + let init = SList.cons a.init SList.nil in + let _,res = top_down a tree Tree.root init Tree.root 1 + in + D_IGNORE_( + output_trace a tree "trace.html" + (RS.fold (fun t a -> IntSet.add (Tree.id tree t) a) res.(0) IntSet.empty), + res.(0)) ;; module Configuration = struct - module Ptss = Set.Make(Ptset) - module IMap = Map.Make(Ptset) + module Ptss = Set.Make(StateSet) + module IMap = Map.Make(StateSet) type t = { hash : int; sets : Ptss.t; results : RS.t IMap.t } @@ -1225,39 +1206,41 @@ type 'a t = { if Ptss.mem s c.sets then { c with results = IMap.add s (RS.concat r (IMap.find s c.results)) c.results} else - { hash = HASHINT2(c.hash,Ptset.hash s); + { hash = HASHINT2(c.hash,Ptset.Int.uid s); sets = Ptss.add s c.sets; results = IMap.add s r c.results } let pr fmt c = Format.fprintf fmt "{"; - Ptss.iter (fun s -> pr_st fmt (Ptset.elements s); + Ptss.iter (fun s -> StateSet.print fmt s; Format.fprintf fmt " ") c.sets; Format.fprintf fmt "}\n%!"; IMap.iter (fun k d -> - pr_st fmt (Ptset.elements k); + StateSet.print fmt k; Format.fprintf fmt "-> %i\n" (RS.length d)) c.results; Format.fprintf fmt "\n%!" - + let merge c1 c2 = - let acc1 = IMap.fold (fun s r acc -> - IMap.add s - (try - RS.concat r (IMap.find s acc) - with - | Not_found -> r) acc) c1.results IMap.empty + let acc1 = + IMap.fold + ( fun s r acc -> + IMap.add s + (try + RS.concat r (IMap.find s acc) + with + | Not_found -> r) acc) c1.results IMap.empty in let imap = - IMap.fold (fun s r acc -> - IMap.add s - (try - RS.concat r (IMap.find s acc) - with - | Not_found -> r) acc) c2.results acc1 + IMap.fold (fun s r acc -> + IMap.add s + (try + RS.concat r (IMap.find s acc) + with + | Not_found -> r) acc) c2.results acc1 in let h,s = Ptss.fold - (fun s (ah,ass) -> (HASHINT2(ah,Ptset.hash s), + (fun s (ah,ass) -> (HASHINT2(ah,Ptset.Int.uid s), Ptss.add s ass)) (Ptss.union c1.sets c2.sets) (0,Ptss.empty) in @@ -1269,42 +1252,34 @@ type 'a t = { let h_fold = Hashtbl.create 511 - let fold_f_conf t slist fl_list conf dir= + let fold_f_conf tree t slist fl_list conf dir= + let tag = Tree.tag tree t in let rec loop sl fl acc = - match sl,fl with - |Nil,[] -> acc - | Cons(s,hs,sll), formlist::fll -> - let r',rb,rb1,rb2,mark = - try - Hashtbl.find h_fold (hs,Formlist.hash formlist,dir) - with - Not_found -> let res = - if dir then eval_formlist ~memo:false s Ptset.empty formlist - else eval_formlist ~memo:false Ptset.empty s formlist - in (Hashtbl.add h_fold (hs,Formlist.hash formlist,dir) res;res) - in(* - let _ = pr "Evaluating on set (%s) with tree %s=%s" - (if dir then "left" else "right") - (Tag.to_string (Tree.tag t)) - (Tree.dump_node t) ; - pr_st fmt (Ptset.elements s); - pr ", formualae (with hash %i): \n" (Formlist.hash formlist); - Formlist.pr fmt formlist; - pr "result is "; - pr_st fmt (Ptset.elements r'); - pr " %b %b %b %b \n%!" rb rb1 rb2 mark ; - in *) - if rb && ((dir&&rb1)|| ((not dir) && rb2)) - then - let acc = - let old_r = - try Configuration.IMap.find s conf.Configuration.results - with Not_found -> RS.empty - in - Configuration.add acc r' (if mark then RS.cons t old_r else old_r) - in - loop sll fll acc - else loop sll fll acc + match SList.node sl,fl with + |SList.Nil,[] -> acc + |SList.Cons(s,sll), formlist::fll -> + let r',mcnf = + let key = SList.hash sl,Formlist.hash formlist,dir in + try + Hashtbl.find h_fold key + with + Not_found -> let res = + if dir then eval_formlist tag s Ptset.Int.empty formlist + else eval_formlist tag Ptset.Int.empty s formlist + in (Hashtbl.add h_fold key res;res) + in + let (rb,rb1,rb2,mark) = bool_of_merge mcnf in + if rb && ((dir&&rb1)|| ((not dir) && rb2)) + then + let acc = + let old_r = + try Configuration.IMap.find s conf.Configuration.results + with Not_found -> RS.empty + in + Configuration.add acc r' (if mark then RS.cons t old_r else old_r) + in + loop sll fll acc + else loop sll fll acc | _ -> assert false in loop slist fl_list Configuration.empty @@ -1312,102 +1287,67 @@ type 'a t = { let h_trans = Hashtbl.create 4096 let get_up_trans slist ptag a tree = - let key = (HASHINT2(hpl slist,Tag.hash ptag)) in + let key = (HASHINT2(SList.uid slist,ptag)) in try Hashtbl.find h_trans key with | Not_found -> - let f_list,_ = - Hashtbl.fold (fun q l acc -> - List.fold_left (fun (fl_acc,h_acc) (ts,(m,f,_)) -> - if TagSet.mem ptag ts - then - let h_acc = HASHINT3(h_acc,f.fid,HASHINT2(q,vb m)) in - (Formlist.cons q f h_acc m fl_acc, - h_acc) - else (fl_acc,h_acc)) - acc l) - a.phi (Formlist.nil,0) - in - let res = fold_pl (fun _ _ acc -> f_list::acc) slist [] - in - (Hashtbl.add h_trans key res;res) - + let f_list = + Hashtbl.fold (fun q l acc -> + List.fold_left (fun fl_acc (ts,t) -> + if TagSet.mem ptag ts then Formlist.cons t fl_acc + else fl_acc) + + acc l) + a.trans Formlist.nil + in + let res = SList.fold (fun _ acc -> f_list::acc) slist [] + in + (Hashtbl.add h_trans key res;res) + + let h_tdconf = Hashtbl.create 511 - let rec bottom_up a tree conf next jump_fun root dotd init accu = + let rec bottom_up a tree t conf next jump_fun root dotd init accu = if (not dotd) && (Configuration.is_empty conf ) then -(* let _ = pr "Returning early from %s, with accu %i, next is %s\n%!" - (Tree.dump_node tree) (Obj.magic accu) (Tree.dump_node next) - in *) - accu,conf,next + accu,conf,next else -(* let _ = - pr "Going bottom up for tree with tag %s configuration is" - (if Tree.is_nil tree then "###" else Tag.to_string (Tree.tag tree)); - Configuration.pr fmt conf - in *) - let below_right = Tree.is_below_right tree next in - (* let _ = Format.fprintf Format.err_formatter "below_right %s %s = %b\n%!" - (Tree.dump_node tree) (Tree.dump_node next) below_right - in *) - let accu,rightconf,next_of_next = + + let below_right = Tree.is_below_right tree t next in + + let accu,rightconf,next_of_next = if below_right then (* jump to the next *) -(* let _ = pr "Jumping to %s tag %s\n%!" (Tree.dump_node next) (Tag.to_string (Tree.tag next)) in *) - bottom_up a next conf (jump_fun next) jump_fun (Tree.next_sibling tree) true init accu + bottom_up a tree next conf (jump_fun next) jump_fun (Tree.next_sibling tree t) true init accu else accu,Configuration.empty,next in -(* let _ = if below_right then pr "Returning from jump to next = %s\n" (Tree.dump_node next)in *) let sub = if dotd then - if below_right then (* only recurse on the left subtree *) -(* let _ = pr "Topdown on left subtree\n%!" in *) - prepare_topdown a tree true - else -(* let _ = pr "Topdown on whole tree\n%!" in *) - prepare_topdown a tree false + if below_right then prepare_topdown a tree t true + else prepare_topdown a tree t false else conf in let conf,next = (Configuration.merge rightconf sub, next_of_next) in - if Tree.equal tree root then -(* let _ = pr "Stopping at root, configuration after topdown is:" ; - Configuration.pr fmt conf; - pr "\n%!" - in *) accu,conf,next - else - let parent = Tree.binary_parent tree in - let ptag = Tree.tag parent in - let dir = Tree.is_left tree in - let slist = Configuration.Ptss.fold (fun e a -> cons e a) conf.Configuration.sets Nil in + if t == root then accu,conf,next else + let parent = Tree.binary_parent tree t in + let ptag = Tree.tag tree parent in + let dir = Tree.is_left tree t in + let slist = Configuration.Ptss.fold (fun e a -> SList.cons e a) conf.Configuration.sets SList.nil in let fl_list = get_up_trans slist ptag a parent in - let slist = rev_pl (slist) in -(* let _ = pr "Current conf is : %s " (Tree.dump_node tree); - Configuration.pr fmt conf; - pr "\n" - in *) - let newconf = fold_f_conf parent slist fl_list conf dir in -(* let _ = pr "New conf before pruning is (dir=%b):" dir; - Configuration.pr fmt newconf ; - pr "accu is %i\n" (RS.length accu); - in *) + let slist = SList.rev (slist) in + let newconf = fold_f_conf tree parent slist fl_list conf dir in let accu,newconf = Configuration.IMap.fold (fun s res (ar,nc) -> - if Ptset.intersect s init then + if Ptset.Int.intersect s init then ( RS.concat res ar ,nc) else (ar,Configuration.add nc s res)) (newconf.Configuration.results) (accu,Configuration.empty) in -(* let _ = pr "New conf after pruning is (dir=%b):" dir; - Configuration.pr fmt newconf ; - pr "accu is %i\n" (RS.length accu); - in *) - bottom_up a parent newconf next jump_fun root false init accu - - and prepare_topdown a t noright = - let tag = Tree.tag t in -(* pr "Going top down on tree with tag %s = %s " - (if Tree.is_nil t then "###" else (Tag.to_string(Tree.tag t))) (Tree.dump_node t); *) + + bottom_up a tree parent newconf next jump_fun root false init accu + + and prepare_topdown a tree t noright = + let tag = Tree.tag tree t in let r = try Hashtbl.find h_tdconf tag @@ -1415,55 +1355,52 @@ type 'a t = { | Not_found -> let res = Hashtbl.fold (fun q l acc -> if List.exists (fun (ts,_) -> TagSet.mem tag ts) l - then Ptset.add q acc - else acc) a.phi Ptset.empty + then Ptset.Int.add q acc + else acc) a.trans Ptset.Int.empty in Hashtbl.add h_tdconf tag res;res in (* let _ = pr ", among "; - pr_st fmt (Ptset.elements r); + StateSet.print fmt (Ptset.Int.elements r); pr "\n%!"; in *) - let r = cons r Nil in - let set,res = top_down (~noright:noright) a t r t 1 in - let set = match set with - | Cons(x,_,Nil) ->x + let r = SList.cons r SList.nil in + let set,res = top_down (~noright:noright) a tree t r t 1 in + let set = match SList.node set with + | SList.Cons(x,_) ->x | _ -> assert false - in -(* pr "Result of topdown run is %!"; - pr_st fmt (Ptset.elements set); - pr ", number is %i\n%!" (RS.length res.(0)); *) - Configuration.add Configuration.empty set res.(0) + in + Configuration.add Configuration.empty set res.(0) - let run_bottom_up a t k = - let trlist = Hashtbl.find a.phi (Ptset.choose a.init) + let run_bottom_up a tree k = + let t = Tree.root in + let trlist = Hashtbl.find a.trans (StateSet.choose a.init) in let init = List.fold_left - (fun acc (_,(_,f,_)) -> - Ptset.union acc (let (_,_,l) = fst (f.st) in l)) - Ptset.empty trlist + (fun acc (_,t) -> + let _,_,_,f,_ = Transition.node t in + let _,_,l = fst ( Formula.st f ) in + StateSet.union acc l) + StateSet.empty trlist in let tree1,jump_fun = match k with | `TAG (tag) -> (*Tree.tagged_lowest t tag, fun tree -> Tree.tagged_next tree tag*) - (Tree.tagged_desc tag t, fun tree -> Tree.tagged_foll_below tag tree t) - | `CONTAINS(_) -> (Tree.text_below t,fun tree -> Tree.text_next tree t) + (Tree.tagged_desc tree tag t, let jump = Tree.tagged_foll_ctx tree tag + in fun n -> jump n t ) + | `CONTAINS(_) -> (Tree.text_below tree t,let jump = Tree.text_next tree + in fun n -> jump n t) | _ -> assert false in let tree2 = jump_fun tree1 in - let rec loop tree next acc = -(* let _ = pr "\n_________________________\nNew iteration\n" in - let _ = pr "Jumping to %s\n%!" (Tree.dump_node tree) in *) - let acc,conf,next_of_next = bottom_up a tree - Configuration.empty next jump_fun (Tree.root tree) true init acc + let rec loop t next acc = + let acc,conf,next_of_next = bottom_up a tree t + Configuration.empty next jump_fun (Tree.root) true init acc in - (* let _ = pr "End of first iteration, conf is:\n%!"; - Configuration.pr fmt conf - in *) let acc = Configuration.IMap.fold - ( fun s res acc -> if Ptset.intersect init s + ( fun s res acc -> if StateSet.intersect init s then RS.concat res acc else acc) conf.Configuration.results acc in if Tree.is_nil next_of_next (*|| Tree.equal next next_of_next *)then @@ -1480,3 +1417,9 @@ type 'a t = { let bottom_up_count a t k = let module RI = Run(Integer) in Integer.length (RI.run_bottom_up a t k) + module Test (Doc : sig val doc : Tree.t end) = + struct + module Results = GResult(Doc) + let top_down a t = let module R = Run(Results) in (R.run_top_down a t) + end +