Mon, 16 Aug 2010 16:35:20 -0300 mq: save qrefresh message for easy recovery in case it fails (issue2062)
Renato Cunha <renatoc@gmail.com> [Mon, 16 Aug 2010 16:35:20 -0300] rev 11947
mq: save qrefresh message for easy recovery in case it fails (issue2062) Currently, if you start editing a commit message from qrefresh -e and, for any reason: forget you were editing it, leave the editor open and start qpopping and qpushing, when you decide to save your commit message, it is going to fail. This patch copies the commit behavior of saving the message contents in $HGROOT/.hg/last-message.txt before continuing.
Tue, 17 Aug 2010 17:38:19 -0500 util: avoid using hashlib on Python < 2.5 (issue2278)
Sol Jerome <sol.jerome@gmail.com> [Tue, 17 Aug 2010 17:38:19 -0500] rev 11946
util: avoid using hashlib on Python < 2.5 (issue2278) The following patch allows the use of python2.4 with a standalone hashlib rather than assuming that python2.5 is in use when hashlib is imported successfully.
Wed, 11 Aug 2010 20:28:39 +0800 ui: differentiate empty configlist from None
Alecs King <alecsk@gmail.com> [Wed, 11 Aug 2010 20:28:39 +0800] rev 11945
ui: differentiate empty configlist from None
Fri, 13 Aug 2010 13:11:41 -0300 revset: predicate to avoid lookup errors
Wagner Bruna <wbruna@softwareexpress.com.br> [Fri, 13 Aug 2010 13:11:41 -0300] rev 11944
revset: predicate to avoid lookup errors A query like head() and (descendants("bad") and not descendants("fix")) (testing if repo heads are affected by a bug) will abort with a RepoLookupError if either badrev or fixrev aren't found inside the repository, which is not very informative. The new predicate returns an empty set for lookup errors, so head() and (descendants(present("bad")) and not descendants(present("fix"))) will behave as wanted even if those revisions are not found.
Fri, 13 Aug 2010 13:16:34 -0400 inotify: show the exact command used to start the server
Greg Ward <greg-hg@gerg.ca> [Fri, 13 Aug 2010 13:16:34 -0400] rev 11943
inotify: show the exact command used to start the server
Tue, 17 Aug 2010 17:46:10 +0200 demandimport: store level argument on _demandmod instances
Dan Villiom Podlaski Christiansen <danchr@gmail.com> [Tue, 17 Aug 2010 17:46:10 +0200] rev 11942
demandimport: store level argument on _demandmod instances The 'level' argument to __import__ was added in Python 2.6, and is specified for either relative or absolute imports. The fix introduced in e160f2312815 allowed such imports to proceed without failure, but effectively disabled demandimport for them. This is particularly unfortunate in Python 3.x, where *all* imports are either relative or absolute. The solution introduced here is to store the level argument on the demandimport instance, and propagate it to _origimport() when its value isn't None. Please note that this patch hasn't been tested in Python 3.x, and thus may not be complete. I'm worried about how sub-imports are handled; I don't know what they are, or whether the level argument should be modified for them. I've added 'TODO' notes to these cases; hopefully, someone more knowledgable of these issues will deal with them.
Fri, 13 Aug 2010 13:59:26 -0400 revert: use opts.get
Xavier Snelgrove <xs@wxs.ca> [Fri, 13 Aug 2010 13:59:26 -0400] rev 11941
revert: use opts.get If you want to programatically perform a revert right now you need to include a date=False parameter due to the use of opt["date"] instead of opt.get("date").
Tue, 17 Aug 2010 08:38:31 +0530 tests: unify test-copy2
Pradeepkumar Gayam <in3xes@gmail.com> [Tue, 17 Aug 2010 08:38:31 +0530] rev 11940
tests: unify test-copy2
Sun, 15 Aug 2010 13:29:46 +0200 mq/qqueue: enable renaming of active queue
"Yann E. MORIN" <yann.morin.1998@anciens.enib.fr> [Sun, 15 Aug 2010 13:29:46 +0200] rev 11939
mq/qqueue: enable renaming of active queue
Sun, 15 Aug 2010 16:48:08 +0200 mq/qqueue: split _setactive
"Yann E. MORIN" <yann.morin.1998@anciens.enib.fr> [Sun, 15 Aug 2010 16:48:08 +0200] rev 11938
mq/qqueue: split _setactive Prepare _setactive to be called without checking for applied patches.
(0) -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip