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
