Re: FSFS successor ID design draft

Hi Stefan!

On Mon, Aug 29, 2011 at 6:54 PM, Stefan Sperling <stsp_at_elego.de> wrote:
> Any ideas about how to solve this without using successors?
>
> [[[
>  deleted_nodes = nodes which appear in LEFT_PATH_at_LEFT_REV but not in
>                  RIGHT_PATH_at_RIGHT_REV
>  added_nodes = nodes which appear in RIGHT_PATH_at_RIGHT_REV but not in
>                LEFT_PATH_at_LEFT_REV
>  moved_nodes = []
>  # A 'node' in this context is a repos_relpath
>  for each node in deleted_nodes {
>    node_rev_id = get_node_node_rev_id(node_at_LEFT_REV)

Just a question, why wouldn't you like to iterate over added_nodes
(instead of deleted_nodes)? It seems that the whole algorithm can be
reverted and work without successors. Or do I misunderstand something?

Thanks!

-- 
With best regards,
Danil Shopyrin
VisualSVN Team