- 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,_ = t.Transition.node 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 f_kind,first = `ANY, Tree.first_child tree
- and n_kind,next = `ANY, Tree.next_sibling_below tree
- in *)
- let empty_res = null_result in
- let cont =
- match f_kind,n_kind with
- | `NIL,`NIL ->
- (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
- RS.mk_quick_tag_loop default llist 1 tree tag'
- else default
- else default *)
- | _ ->
- (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 loop
- else
- (fun t ctx -> eval_fold2_slist fl_list t (Tree.tag tree t)
- (loop_tag tag' (next t ctx) rlist ctx ) empty_res)
-
- | _ ->
- (fun t ctx -> eval_fold2_slist fl_list t (Tree.tag tree t)
- (loop (next t ctx) rlist ctx ) empty_res)
- )
+ let rec loop t ctx _ slist =
+ if t == Tree.nil then null_result else
+ let tag = Tree.tag tree t in (TransCache.find td_trans tag slist) t ctx tag slist false
+
+ and loop_tag t ctx tag slist =
+ if t == Tree.nil then null_result else (TransCache.find td_trans tag slist) t ctx tag slist false
+
+ and loop_no_right t ctx _ slist =
+ if t == Tree.nil then null_result else
+ let tag = Tree.tag tree t in (TransCache.find td_trans tag slist) t ctx tag slist true
+
+ and mk_trans t ctx tag slist noright =
+ 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,_ = t.Transition.node 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;[]
+ )