-
- for i = (Bitvector.length v)-1 downto 0 do
- if Bitvector.get v i then
- let n = Naive_tree.by_preorder tree i in
- let n0 = ref n in
- while !n0 != Naive_tree.nil do
- let n1 = get_firstBling tree !n0 Naive_tree.nil in
- let n2 = Naive_tree.parent_of_first tree n1 in
- n0 := n2;
- if n2 != Naive_tree.nil then begin let j = Naive_tree.preorder tree n2 in
- Bitvector.set v0 j true;
- Bitvector.set v j true;
- end
+ if b then
+ begin
+ for i = (Bitvector.length v)-1 downto 0 do
+ if Bitvector.get v i then
+ begin
+ Bitvector.set v0 i true;
+ let n = Naive_tree.by_preorder tree i in
+ let n0 = ref n in
+ while !n0 != Naive_tree.nil do
+ let n1 = get_firstBling tree !n0 Naive_tree.nil in
+ let n2 = Naive_tree.parent_of_first tree n1 in
+ n0 := n2;
+ if n2 != Naive_tree.nil then begin let j = Naive_tree.preorder tree n2 in
+ Bitvector.set v0 j true;
+ Bitvector.set v j true;
+ end
+ done;
+ end