+let rec compare_node_list tree l1 l2 =
+ match l1,l2 with
+ [],[] -> 0
+ | _,[] -> 1
+ | [],_ -> -1
+ | n1::ll1,n2::ll2 -> let b = compare_node tree n1 n2 in
+ if b=0 then compare_node_list tree ll1 ll2
+ else b
+
+
+
+let bitvector_of_nodes tree l =
+ let v = Bitvector.create (Naive_tree.size tree) in
+ List.iter(fun n -> let j = Naive_tree.preorder tree n in
+ Bitvector.set v j true ) l;
+ v
+
+let decode_bit tree v =
+ let l = ref [] in
+ for i = 0 to (Bitvector.length v) - 1 do
+ if Bitvector.get v i then
+ let n = Naive_tree.by_preorder tree i in
+ l := n::!l
+ done;
+ List.rev !l
+
+let get_list_ordred tree ll =
+ let l1 = List.fold_left (fun acc l -> merge_list tree acc l) [] ll in
+ List.rev l1
+
+let get_descendant tree c v =
+ let rec aux n acc =
+ if n == Naive_tree.nil then acc
+ else let n1 = Naive_tree.first_child tree n in
+ let j = Naive_tree.preorder tree n in
+ Bitvector.set acc j true;
+ incr node_compteur;
+ let acc1 = aux n1 acc in
+ let n2 = Naive_tree.next_sibling tree n in
+ aux n2 acc1
+ in
+ let v0 = Bitvector.create (Naive_tree.size tree) in
+ if c then begin
+ for i = 0 to (Bitvector.length v)-1 do
+ if Bitvector.get v i then
+ let n = Naive_tree.by_preorder tree i in
+ let n1 = Naive_tree.first_child tree n in
+ let _ = aux n1 v0 in
+ Bitvector.set v0 i true;
+ incr node_compteur
+ done; end
+ else
+ for i = 0 to (Bitvector.length v)-1 do
+ if Bitvector.get v i then
+ let n = Naive_tree.by_preorder tree i in
+ let n1 = Naive_tree.first_child tree n in
+ let _ = aux n1 v0 in ()
+ done;
+ v0
+
+let get_child tree v =
+ let rec aux n acc =
+ if n == Naive_tree.nil then acc
+ else
+ let n1 = Naive_tree.next_sibling tree n in
+ Bitvector.set acc (Naive_tree.preorder tree n) true;
+ incr node_compteur;
+ aux n1 acc
+ in
+ let v0 = Bitvector.create (Naive_tree.size tree) in
+ for i = 0 to (Bitvector.length v)-1 do
+ if Bitvector.get v i then
+ let n = Naive_tree.by_preorder tree i in
+ let n1 = Naive_tree.first_child tree n in
+ let _ = aux n1 v0 in ();
+ done;
+ v0