Re: Design query: Ev2 and multiple moves

2011-11-10 Thread Bill Tutt
On Tue, Nov 8, 2011 at 6:22 AM, Julian Foad wrote: > Hi Bill. > > Let me see if I understand. > > You describe a procedure for converting a set of parallel renames into an > equivalent incremental sequence of renames.  That is, the input is a list of > N independent renames, where each "rename[i

Re: Design query: Ev2 and multiple moves

2011-11-08 Thread Julian Foad
Hi Bill. Let me see if I understand. You describe a procedure for converting a set of parallel renames into an equivalent incremental sequence of renames. That is, the input is a list of N independent renames, where each "rename[i]" (for 0 <= i < N) describes a move from a path in the initial

Re: Design query: Ev2 and multiple moves

2011-11-06 Thread Greg Stein
While this may not apply to Ev2, I think Stefan will want to read/internalize the various cases you describe. He's working on renames in the client. Thanks! -g On Nov 6, 2011 12:17 AM, "Bill Tutt" wrote: > I just know folks are going to hate me for mentioning this, but. > > Tom Lord came up

Re: Design query: Ev2 and multiple moves

2011-11-05 Thread Daniel Shahaf
On Saturday, November 05, 2011 8:21 PM, "Greg Stein" wrote: > [ how to move A1->A2->A3->...->An->A1 circularly in a single txn ] ... > I'm not a master of topography or graphs, but I suspect that any given > permutation of N nodes can be reduced to a set of rotations of subsets > of those N nodes.

Re: Design query: Ev2 and multiple moves

2011-11-05 Thread Bill Tutt
I just know folks are going to hate me for mentioning this, but. Tom Lord came up with a way to store/apply arbitrary rename applications against trees. Apparently my google-fu failed me tonight because I couldn't find the original reference/explanation. So bear with me as I recall the details

Re: Design query: Ev2 and multiple moves

2011-11-05 Thread Hyrum K Wright
On Sat, Nov 5, 2011 at 7:21 PM, Greg Stein wrote: > Julian raised a question when I saw him in September: how does Ev2 > deal with a node swap? ie. swap the contents of A and B, retaining > metadata that they were moves [rather than copies from history]. > > In Ev2, we attempt to disallow "mv A B

Design query: Ev2 and multiple moves

2011-11-05 Thread Greg Stein
Julian raised a question when I saw him in September: how does Ev2 deal with a node swap? ie. swap the contents of A and B, retaining metadata that they were moves [rather than copies from history]. In Ev2, we attempt to disallow "mv A B ; mv B C". The semantics around the interface say you should