As it turns out, I already made a mistake
at the tree based algorithm.
The old, proposed, flawed version:
> ...
> array_of_nodes_with_wrong_x_node_hash=unique_by_node_ID(
> clone(
> ob_AVL_tree.array_of_nodes_that_had_changes_on_path_2_root
> ).concat(clone(
> ob_AVL_tree.array_of_nodes_that_have_changed_children
> // change within children means that any
> // of the children changed during the insertion
> // or removal of nodes to/from the ob_AVL_tree
> // after the AVL-tree got (automatically) rebalanced.
> // A change between null and an existing child is
> // also considered a change.
> ))
> ).sort_by_path_length_from_node_to_root_node
>
> ...
A newer version looks only the changes within
children:
array_of_nodes_with_wrong_x_node_hash=unique_by_node_ID(
clone(
ob_AVL_tree.array_of_nodes_that_have_changed_children
)).sort_by_path_length_from_node_to_root_node
Thank You.
_______________________________________________
fossil-users mailing list
fossil-users@lists.fossil-scm.org
http://lists.fossil-scm.org:8080/cgi-bin/mailman/listinfo/fossil-users
