Sun, 07 Mar 2010 23:59:28 +0100 addremove: atomically update the dirstate
Benoit Boissinot <benoit.boissinot@ens-lyon.org> [Sun, 07 Mar 2010 23:59:28 +0100] rev 10606
addremove: atomically update the dirstate In case someone hits ^C during the similarity search, properly rollback
Sun, 07 Mar 2010 13:10:23 -0500 inotify: expose the same dirstate.status() interface as dirstate.
Greg Ward <greg-hg@gerg.ca> [Sun, 07 Mar 2010 13:10:23 -0500] rev 10605
inotify: expose the same dirstate.status() interface as dirstate. The real dirstate.status() does not have any keyword args. For consistency, wrappers or subclasses should not have them either.
Sun, 07 Mar 2010 13:03:03 +0100 keyword: remove spurious locks, improve handling of wlock
Christian Ebert <blacktrash@gmx.net> [Sun, 07 Mar 2010 13:03:03 +0100] rev 10604
keyword: remove spurious locks, improve handling of wlock - kwcommitctx is inside the wlock of repo.commit: no lock - _kwfwrite only needs wlock wlock outside try block, so we don't need to import lock.release _kwfwrite should even be safer that way, as we moved the status call inside the try-except block. Thanks to Benoit Boissinot for help.
Sun, 07 Mar 2010 13:03:03 +0100 keyword: use status' names instead of index
Christian Ebert <blacktrash@gmx.net> [Sun, 07 Mar 2010 13:03:03 +0100] rev 10603
keyword: use status' names instead of index
Sun, 07 Mar 2010 17:44:43 +0100 hgweb/graph: edge should be same color as the destination
Benoit Boissinot <benoit.boissinot@ens-lyon.org> [Sun, 07 Mar 2010 17:44:43 +0100] rev 10602
hgweb/graph: edge should be same color as the destination
Sat, 06 Mar 2010 13:29:54 +0100 templatefilters: store the agescales in reverseorder directly
Benoit Boissinot <benoit.boissinot@ens-lyon.org> [Sat, 06 Mar 2010 13:29:54 +0100] rev 10601
templatefilters: store the agescales in reverseorder directly
Sat, 06 Mar 2010 12:45:14 +0100 hgweb: separate generation of entries and sorting (cleanup)
Benoit Boissinot <benoit.boissinot@ens-lyon.org> [Sat, 06 Mar 2010 12:45:14 +0100] rev 10600
hgweb: separate generation of entries and sorting (cleanup)
(0) -10000 -3000 -1000 -300 -100 -30 -10 -7 +7 +10 +30 +100 +300 +1000 +3000 +10000 +30000 tip