+let dummy2 = TransList.cons
+ (Transition.make (State.dummy,QNameSet.empty, SFormula.false_))
+ TransList.nil
+
+let dummy6 = (dummy2, StateSet.empty)
+
+
+let create s ss =
+ let auto = { id = next ();
+ states = s;
+ selection_states = ss;
+ transitions = Hashtbl.create 17;
+ cache2 = Cache.N2.create dummy2;
+ cache6 = Cache.N6.create dummy6;
+ }
+ in
+ at_exit (fun () ->
+ let n6 = ref 0 in
+ let n2 = ref 0 in
+ Cache.N2.iteri (fun _ _ _ b -> if b then incr n2) auto.cache2;
+ Cache.N6.iteri (fun _ _ _ _ _ _ _ b -> if b then incr n6) auto.cache6;
+ Format.eprintf "INFO: automaton %i, cache2: %i entries, cache6: %i entries\n%!"
+ (auto.id :> int) !n2 !n6
+ );
+ auto
+
+let reset a =
+ a.cache2 <- Cache.N2.create dummy2;
+ a.cache6 <- Cache.N6.create dummy6
+
+
+let get_trans_aux a tag states =
+ StateSet.fold (fun q acc0 ->
+ try
+ let trs = Hashtbl.find a.transitions q in
+ List.fold_left (fun acc1 (labs, phi) ->
+ if QNameSet.mem tag labs then TransList.cons (Transition.make (q, labs, phi)) acc1 else acc1) acc0 trs
+ with Not_found -> acc0
+ ) states TransList.nil
+
+
+let get_trans a tag states =
+ let trs =
+ Cache.N2.find a.cache2
+ (tag.QName.id :> int) (states.StateSet.id :> int)
+ in
+ if trs == dummy2 then
+ let trs = get_trans_aux a tag states in
+ (Cache.N2.add
+ a.cache2
+ (tag.QName.id :> int)
+ (states.StateSet.id :> int) trs; trs)
+ else trs
+
+
+
+let eval_form phi fcs nss ps ss is_left is_right has_left has_right kind =
+ let rec loop phi =
+ begin match SFormula.expr phi with
+ Formula.True | Formula.False -> phi
+ | Formula.Atom a ->
+ let p, b, q = Atom.node a in begin
+ match p with
+ | First_child ->
+ if b == StateSet.mem q fcs then SFormula.true_ else phi
+ | Next_sibling ->
+ if b == StateSet.mem q nss then SFormula.true_ else phi
+ | Parent | Previous_sibling ->
+ if b == StateSet.mem q ps then SFormula.true_ else phi
+ | Stay ->
+ if b == StateSet.mem q ss then SFormula.true_ else phi
+ | Is_first_child -> SFormula.of_bool (b == is_left)
+ | Is_next_sibling -> SFormula.of_bool (b == is_right)
+ | Is k -> SFormula.of_bool (b == (k == kind))
+ | Has_first_child -> SFormula.of_bool (b == has_left)
+ | Has_next_sibling -> SFormula.of_bool (b == has_right)
+ end
+ | Formula.And(phi1, phi2) -> SFormula.and_ (loop phi1) (loop phi2)
+ | Formula.Or (phi1, phi2) -> SFormula.or_ (loop phi1) (loop phi2)
+ end
+ in
+ loop phi
+
+let int_of_conf is_left is_right has_left has_right kind =
+ ((Obj.magic kind) lsl 4) lor
+ ((Obj.magic is_left) lsl 3) lor
+ ((Obj.magic is_right) lsl 2) lor
+ ((Obj.magic has_left) lsl 1) lor
+ (Obj.magic has_right)
+
+let eval_trans auto ltrs fcs nss ps ss is_left is_right has_left has_right kind =
+ let n = int_of_conf is_left is_right has_left has_right kind
+ and k = (fcs.StateSet.id :> int)
+ and l = (nss.StateSet.id :> int)
+ and m = (ps.StateSet.id :> int) in
+ let rec loop ltrs ss =
+ let i = (ltrs.TransList.id :> int)
+ and j = (ss.StateSet.id :> int) in
+ let (new_ltrs, new_ss) as res =
+ let res = Cache.N6.find auto.cache6 i j k l m n in
+ if res == dummy6 then
+ let res =
+ TransList.fold (fun trs (acct, accs) ->
+ let q, lab, phi = Transition.node trs in
+ if StateSet.mem q accs then (acct, accs) else
+ let new_phi =
+ eval_form
+ phi fcs nss ps accs
+ is_left is_right has_left has_right kind
+ in
+ if SFormula.is_true new_phi then
+ (acct, StateSet.add q accs)
+ else if SFormula.is_false new_phi then
+ (acct, accs)
+ else
+ let new_tr = Transition.make (q, lab, new_phi) in
+ (TransList.cons new_tr acct, accs)
+ ) ltrs (TransList.nil, ss)
+ in
+ Cache.N6.add auto.cache6 i j k l m n res; res
+ else
+ res
+ in
+ if new_ss == ss then res else
+ loop new_ltrs new_ss
+ in
+ loop ltrs ss
+
+
+