Mercurial > hg4j
view src/com/tmate/hgkit/ll/Changelog.java @ 11:d46773d89a19
Boundary error in dirstate entry, explicit encoding to face troubles (if any) asap.
author | Artem Tikhomirov <tikhomirov.artem@gmail.com> |
---|---|
date | Sat, 25 Dec 2010 22:19:31 +0100 |
parents | 24bb4f365164 |
children | e929cecae4e1 |
line wrap: on
line source
/** * Copyright (c) 2010 Artem Tikhomirov */ package com.tmate.hgkit.ll; import java.util.ArrayList; import java.util.Arrays; import java.util.List; /** * Representation of the Mercurial changelog file (list of ChangeSets) * @author artem */ public class Changelog extends Revlog { private final RevlogStream content; /*package-local*/ Changelog(HgRepository hgRepo, RevlogStream content) { super(hgRepo); this.content = content; } public void all(final Changeset.Inspector inspector) { Revlog.Inspector i = new Revlog.Inspector() { public void next(int revisionNumber, int actualLen, int baseRevision, int linkRevision, int parent1Revision, int parent2Revision, byte[] nodeid, byte[] data) { Changeset cset = Changeset.parse(data, 0, data.length); // XXX there's no guarantee for Changeset.Callback that distinct instance comes each time, consider instance reuse inspector.next(cset); } }; content.iterate(0, content.revisionCount() - 1, true, i); } public List<Changeset> range(int start, int end) { final ArrayList<Changeset> rv = new ArrayList<Changeset>(end - start + 1); Revlog.Inspector i = new Revlog.Inspector() { public void next(int revisionNumber, int actualLen, int baseRevision, int linkRevision, int parent1Revision, int parent2Revision, byte[] nodeid, byte[] data) { Changeset cset = Changeset.parse(data, 0, data.length); rv.add(cset); } }; content.iterate(start, end, true, i); return rv; } public void range(final Changeset.Inspector inspector, final int... revisions) { if (revisions == null || revisions.length == 0) { return; } Revlog.Inspector i = new Revlog.Inspector() { public void next(int revisionNumber, int actualLen, int baseRevision, int linkRevision, int parent1Revision, int parent2Revision, byte[] nodeid, byte[] data) { if (Arrays.binarySearch(revisions, revisionNumber) >= 0) { Changeset cset = Changeset.parse(data, 0, data.length); inspector.next(cset); } } }; Arrays.sort(revisions); content.iterate(revisions[0], revisions[revisions.length - 1], true, i); } }