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

Re: Passing Targets into libsvn_client

From: Kevin Pilch-Bisson <kevin_at_pilch-bisson.net>
Date: 2001-02-06 17:05:12 CET

On Tue, Feb 06, 2001 at 09:31:32AM -0600, Ben Collins-Sussman wrote:
>
> The "targets" problem is stack is a bit more complicated; you're on
> the right track.
>
> A number of svn subcommands *should* take lists of targets. But they
> don't right now, as you noticed.
>
> What we need are some standardized routines which will:
>
> * given a list of targets, "condense" the list, i.e. remove any item
> from the list which is contained within another item
>
> * given a condensed list of targets, calculate the longest common
> ancestor path. This would be the path where we would start a
> replace_root() (or begin_edit(), whatever we call it now).
>
> If you'd like to implement these things, it would be great! We've put
> them off until the filesystem is working.

Will do, but a couple of points. I was thinking of using
svn_path_get_longest_ancestor for getting the longest common ancestor
path in a list of condensed targets. The problem with this is that
svn_path_get_longest_ancestor will not handle if one path is given
relatively, and one is given absolutely. Perhaps we should change
svn_path_canonicalize to convert paths to absolute? Second, what
happens if the longest common ancestor path is not part of the WC.
(I.e) two targets in two different W.C's?

Also, just in case you missed it, did you have any feedback on the
only committing directories(i.e. not files)?

> snip my stuff

-- 
>~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Kevin Pilch-Bisson
kevin@pilch-bisson.net
http://www.pilch-bisson.net
PGP Public Key At http://pgp.pilch-bisson.net

  • application/pgp-signature attachment: stored
Received on Sat Oct 21 14:36:21 2006

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.