in
let cont = D_IF_( (fun t ctx ->
let a,b = cont t ctx in
- register_trace t (slist,a,fl_list,first,next,ctx);
+ register_trace tree t (slist,a,fl_list,first,next,ctx);
(a,b)
) ,cont)
in
let _,res = top_down a tree Tree.root init Tree.root 1
in
D_IGNORE_(
- output_trace a tree root "trace.html"
- (RS.fold (fun t a -> IntSet.add (Tree.id t) a) res.(0) IntSet.empty),
+ output_trace a tree "trace.html"
+ (RS.fold (fun t a -> IntSet.add (Tree.id tree t) a) res.(0) IntSet.empty),
res.(0))
;;
end
let top_down_count a t = let module RI = Run(Integer) in Integer.length (RI.run_top_down a t)
- let top_down a t = let module RI = Run(GResult) in (RI.run_top_down a t)
+ let top_down a t = let module RI = Run(IdSet) in (RI.run_top_down a t)
let bottom_up_count a t k = let module RI = Run(Integer) in Integer.length (RI.run_bottom_up a t k)