[svn.haxx.se] · SVN Dev · SVN Users · SVN Org · TSVN Dev · TSVN Users · Subclipse Dev · Subclipse Users · this month's index

Re: svn commit: r996581 - in /subversion/trunk/subversion: libsvn_diff/parse-diff.c tests/cmdline/patch_tests.py

From: Daniel Shahaf <d.s_at_daniel.shahaf.name>
Date: Sat, 18 Sep 2010 07:40:01 +0100

Stefan Sperling wrote on Fri, Sep 17, 2010 at 11:53:16 +0200:
> On Fri, Sep 17, 2010 at 01:42:09AM +0200, Daniel Shahaf wrote:
> > Which of the two methods described in step 1 do you have in mind?
>
> Non-POSIX, for context diffs.
>
> Rephrased to apply to svn patch:
>
> svn patch will examine the ``old'' and ``new'' file names,
> and choose the file name with the fewest path components, the shortest
> basename, and the shortest total file name length (in that order).
>
> > Whatever we do, the algorithm should be predictable, i.e., a user should
> > be able to know (from reading a patch) what path it would be applied to.
>
> The above is predictable.
>

"Fewest path components, shortest basename, total filename length".

It's predictable, but it seems a bit arbitrary?

Daniel

> Stefan
Received on 2010-09-18 08:40:45 CEST

This is an archived mail posted to the Subversion Dev mailing list.