| Mon, 15 Apr 2013 23:32:33 +0200 |
Mads Kiilerich |
largefiles: refactoring - create destination dir in lfutil.link
|
| Tue, 09 Apr 2013 23:40:11 +0900 |
FUJIWARA Katsunori |
summary: clear "commonincoming" also if branches are different
|
| Tue, 09 Apr 2013 23:40:11 +0900 |
FUJIWARA Katsunori |
summary: make "incoming" information sensitive to branch in URL (issue3830)
|
| Tue, 09 Apr 2013 23:40:10 +0900 |
FUJIWARA Katsunori |
histedit: make "hg histedit" sensitive to branch in URL
|
| Tue, 09 Apr 2013 23:40:10 +0900 |
FUJIWARA Katsunori |
summary: make "outgoing" information sensitive to branch in URL (issue3829)
|
| Fri, 29 Mar 2013 22:57:16 +0900 |
FUJIWARA Katsunori |
annotate: increase refcount of each revisions correctly (issue3841)
|
| Fri, 29 Mar 2013 22:57:15 +0900 |
FUJIWARA Katsunori |
annotate: reuse already calculated annotation
|
| Wed, 17 Apr 2013 00:29:54 +0400 |
Alexander Plavin |
log: fix behavior with empty repositories (issue3497)
|
| Tue, 16 Apr 2013 13:22:29 -0500 |
Matt Mackall |
merge with crew
|
| Tue, 16 Apr 2013 10:08:20 -0700 |
Bryan O'Sullivan |
revlog: don't cross-check ancestor result against Python version
|
| Tue, 16 Apr 2013 10:08:20 -0700 |
Bryan O'Sullivan |
parsers: a C implementation of the new ancestors algorithm
|
| Tue, 16 Apr 2013 10:08:19 -0700 |
Bryan O'Sullivan |
revlog: choose a consistent ancestor when there's a tie
|
| Tue, 16 Apr 2013 10:08:18 -0700 |
Bryan O'Sullivan |
ancestor: a new algorithm that is faster for nodes near tip
|
| Tue, 16 Apr 2013 15:33:18 +0200 |
Pierre-Yves David |
update: allow dirty update to foreground (successors)
|
| Tue, 16 Apr 2013 15:16:33 +0200 |
Pierre-Yves David |
obsolete: extract foreground computation from bookmark.validdest
|
