Re: Sorted output from Subversion commands

Branko ÄŒibej <brane@xbc.nu> writes:

> You can modify the sorted list in O(log N) time, but you can't cache
> the result. So every time some function reads the entries, it has to
> spend O(N*log N) time to sort the list before doing a traversal. This
> is not quadratic, but you have to multiply it by the number of times
> you have to repeat the sort.

I haven't looked at the code, but it's quite possible that something
like svn_client_diff only needs to sort each hash once, in which case
it doesn't need to be cached and O(N log N) might be acceptable.
Repository diffs like "diff -rN" and "diff -rN:M" are more of a
problem as they rely on unsorted data from svn_repos_dir_delta.

It's possible that svn_client_status could be sorted much like
svn_client_diff, and that "st -u" would have the same repository
problem as "diff -rN".

-- 
Philip Martin
---------------------------------------------------------------------
To unsubscribe, e-mail: dev-unsubscribe@subversion.tigris.org
For additional commands, e-mail: dev-help@subversion.tigris.org