Re: svn completely looses file modifications due to FAT 2s time resolution (data loss!!?)

Andy Whitcroft <apw@shadowen.org> writes:
> > This sounds interesting. The only issue is that if there are very
> > many committed files, then the amount of time to inspect them could be
> > large. In other words, right now we have an O(1) algorithm with a
> > high constant factor. This change would take us to an O(N) algorithm,
> > but with a low constant factor.
>
> Have we not had to just stat them all already to check whether they need to
> be committed in the first place? Ie should we not be in a position to know
> the highest time already with no additional work? Code simplicity and
> containment not withstanding?

I think breser is talking about something like this in IRC
(irc.freenode.net, #svn) right now, in fact...

---------------------------------------------------------------------
To unsubscribe, e-mail: dev-unsubscribe@subversion.tigris.org
For additional commands, e-mail: dev-help@subversion.tigris.org
Received on Mon Jul 12 19:32:51 2004