On Tue, Feb 21, 2006 at 10:57:31PM -0800, Andy Tai wrote: > Hi, for the partial commit problem I am thinking of a simple method: > the user will have to commit the whole tree after a file renaming or > file deletion operation, which means the change to the directory > content. Are there any objection to this approach as a short-term > measure?
Short term, it is OK, but long term you want: - For every smallest set S of file names such that S is stable by the operation "f got moved to f'", the user has to commit either all files whose old or new name is in S. Implementing the graph walking algorithms to find the partition of files in S's in C is left as an exercise to the reader. Am I making sense or am I speaking too much like a mathematician? -- Lionel _______________________________________________ Gnu-arch-users mailing list [email protected] http://lists.gnu.org/mailman/listinfo/gnu-arch-users GNU arch home page: http://savannah.gnu.org/projects/gnu-arch/
