Mercurial > hg4j
comparison src/com/tmate/hgkit/ll/Revlog.java @ 24:d4fdd1845b3f
Nodeid with array of exactly 20 bytes
author | Artem Tikhomirov <tikhomirov.artem@gmail.com> |
---|---|
date | Thu, 06 Jan 2011 04:42:15 +0100 |
parents | 603806cd2dc6 |
children | 6cce719bbb62 |
comparison
equal
deleted
inserted
replaced
23:6f9aca1a97be | 24:d4fdd1845b3f |
---|---|
30 | 30 |
31 // FIXME byte[] data might be too expensive, for few usecases it may be better to have intermediate Access object (when we don't need full data | 31 // FIXME byte[] data might be too expensive, for few usecases it may be better to have intermediate Access object (when we don't need full data |
32 // instantly - e.g. calculate hash, or comparing two revisions | 32 // instantly - e.g. calculate hash, or comparing two revisions |
33 public interface Inspector { | 33 public interface Inspector { |
34 // XXX boolean retVal to indicate whether to continue? | 34 // XXX boolean retVal to indicate whether to continue? |
35 void next(int revisionNumber, int actualLen, int baseRevision, int linkRevision, int parent1Revision, int parent2Revision, byte[/*32*/] nodeid, byte[] data); | 35 // TODO specify nodeid and data length, and reuse policy (i.e. if revlog stream doesn't reuse nodeid[] for each call) |
36 void next(int revisionNumber, int actualLen, int baseRevision, int linkRevision, int parent1Revision, int parent2Revision, byte[/*20*/] nodeid, byte[] data); | |
36 } | 37 } |
37 } | 38 } |