On 25.08.2013 15:03, Daniel Shahaf wrote:
> 'svn mergeinfo' walks the tree upwards. As to listing branches by
> walking the tree downwards, if you consider 'svn pg -R svn:branch
> ^/branches', and let N = number of branches and M = number of files per
> branch, it would do O(NM) work to compute an O(N)-sized answer.
That's assuming the server doesn't know about the property. But it has
to know in order to implement the branching restrictions I mentioned.
Why don't you do a similar cost analysis on the original proposal,
taking into account the problems I pointed out?
-- Brane
--
Branko Čibej | Director of Subversion
WANdisco // Non-Stop Data
e. brane@wandisco.com
|