Mercurial > hg4j
diff src/org/tmatesoft/hg/repo/Revlog.java @ 431:12f668401613
FIXMEs: awkward API refactored, what need to be internal got hidden; public aspects got captured in slim interfaces
| author | Artem Tikhomirov <tikhomirov.artem@gmail.com> |
|---|---|
| date | Thu, 29 Mar 2012 20:54:04 +0200 |
| parents | 48f993aa2f41 |
| children | 1fc0da631200 |
line wrap: on
line diff
--- a/src/org/tmatesoft/hg/repo/Revlog.java Thu Mar 29 18:48:23 2012 +0200 +++ b/src/org/tmatesoft/hg/repo/Revlog.java Thu Mar 29 20:54:04 2012 +0200 @@ -290,7 +290,7 @@ * @throws HgRuntimeException subclass thereof to indicate issues with the library. <em>Runtime exception</em> */ @Experimental - public void walk(int start, int end, final Revlog.Inspector inspector) throws HgRuntimeException { + public void indexWalk(int start, int end, final Revlog.Inspector inspector) throws HgRuntimeException { int lastRev = getLastRevision(); if (start == TIP) { start = lastRev; @@ -387,7 +387,7 @@ // sequential = new Nodeid[revisionCount]; sorted = new Nodeid[revisionCount]; - Revlog.this.walk(0, TIP, this); + Revlog.this.indexWalk(0, TIP, this); Arrays.sort(sorted); sorted2natural = new int[revisionCount]; for (int i = 0; i < revisionCount; i++) { @@ -572,7 +572,7 @@ final int revisionCount = Revlog.this.getRevisionCount(); sequential = new Nodeid[revisionCount]; sorted = new Nodeid[revisionCount]; - Revlog.this.walk(0, TIP, this); + Revlog.this.indexWalk(0, TIP, this); // next is alternative to Arrays.sort(sorted), and build sorted2natural looking up each element of sequential in sorted. // the way sorted2natural was build is O(n*log n). final ArrayHelper ah = new ArrayHelper();