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

Re: [PATCH] new feature: takeover

From: Ben Collins-Sussman <sussman_at_collab.net>
Date: 2005-07-06 00:20:02 CEST

On Jul 5, 2005, at 8:36 PM, Jonathan Gilbert wrote:

> Anyway, I have tested the change with a simple test case on my
> local repository, and it appears to work, so I submit it here for
> your perusal. I was not originally planning to submit it,
> suspecting that the depth of the changes and the moderate hackery
> involved would make it unlikely to be accepted, but sussman
> encouraged me to submit it nonetheless, just to see what the
> response will be. So, here it is :-)

Several folks have asked for this feature before, but the motivation
has always been, "please convert this tree into a working-copy,
because I don't want to re-download 17 gigs of data."

Your patch doesn't avoid downloading at all; it just prevents the
downloaded text-base from being copied on top of the pre-existing
working file.

In IRC, you told me that the problem you're trying to solve is: "how
does my pre-existing tree compare with the one I just checked out
from the repository?" I'm skeptical that others share that itch...
and even if they did, there are a zillion tools that can already just
compare two trees recursively to answer the question. Just checkout
a working copy, and compare the trees. I don't see the point in
adding all this code just so that the question can be answered by
running 'svn diff'. (Heck, you could even do an 'svn checkout', copy
your pre-existing tree into the working copy, and *then* run 'svn

Sorry, don't mean to sound so harsh. I'm glad it works for you. :-)

To unsubscribe, e-mail: dev-unsubscribe@subversion.tigris.org
For additional commands, e-mail: dev-help@subversion.tigris.org
Received on Wed Jul 6 01:27:48 2005

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

This site is subject to the Apache Privacy Policy and the Apache Public Forum Archive Policy.