Sun, 08 Apr 2012 12:38:24 -0500 cmdutil: use context instead of lookup
Matt Mackall <mpm@selenic.com> [Sun, 08 Apr 2012 12:38:24 -0500] rev 16380
cmdutil: use context instead of lookup
Sun, 08 Apr 2012 12:38:23 -0500 scmutil: use context instead of lookup
Matt Mackall <mpm@selenic.com> [Sun, 08 Apr 2012 12:38:23 -0500] rev 16379
scmutil: use context instead of lookup
Sun, 08 Apr 2012 12:38:10 -0500 localrepo: lookup now goes through context
Matt Mackall <mpm@selenic.com> [Sun, 08 Apr 2012 12:38:10 -0500] rev 16378
localrepo: lookup now goes through context
Sun, 08 Apr 2012 12:38:08 -0500 context: use rev for changelog lookup
Matt Mackall <mpm@selenic.com> [Sun, 08 Apr 2012 12:38:08 -0500] rev 16377
context: use rev for changelog lookup Faster when we're doing numeric scanning
Sun, 08 Apr 2012 12:38:07 -0500 context: internalize lookup logic
Matt Mackall <mpm@selenic.com> [Sun, 08 Apr 2012 12:38:07 -0500] rev 16376
context: internalize lookup logic This allows us to avoid doing rev->node->rev lookups on silly instances like "0", which end up caching the whole nodemap.
Sun, 08 Apr 2012 12:38:02 -0500 revlog: allow retrieving contents by revision number
Matt Mackall <mpm@selenic.com> [Sun, 08 Apr 2012 12:38:02 -0500] rev 16375
revlog: allow retrieving contents by revision number
Sat, 07 Apr 2012 15:43:18 -0500 revlog: add hasnode helper method
Matt Mackall <mpm@selenic.com> [Sat, 07 Apr 2012 15:43:18 -0500] rev 16374
revlog: add hasnode helper method
Fri, 06 Apr 2012 15:18:14 -0500 merge with stable
Matt Mackall <mpm@selenic.com> [Fri, 06 Apr 2012 15:18:14 -0500] rev 16373
merge with stable
Fri, 06 Apr 2012 15:17:50 -0500 merge with crew stable
Matt Mackall <mpm@selenic.com> [Fri, 06 Apr 2012 15:17:50 -0500] rev 16372
merge with crew
Fri, 06 Apr 2012 15:16:30 -0500 tags: defer tag validation until repo.tags() is called
Matt Mackall <mpm@selenic.com> [Fri, 06 Apr 2012 15:16:30 -0500] rev 16371
tags: defer tag validation until repo.tags() is called Before, we were validating all tags for any tag operation, which meant building a (nearly) full node->tag lookup tree for most operations.
(0) -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip