Examples of org.tmatesoft.hg.internal.IntVector

org.tmatesoft.hg.internal.IntVector
Vector of primitive values @author Artem Tikhomirov @author TMate Software Ltd.

      if (changelog2manifest == null) {
        // direct, 1-1 mapping of changeset indexes to manifest
        return;
      }
      // I assume there'd be not too many revisions we don't know manifest of
      IntVector undefinedChangelogRevision = new IntVector();
      for (int i = 0; i < changelog2manifest.length; i++) {
        if (changelog2manifest[i] == BAD_REVISION) {
          undefinedChangelogRevision.add(i);
        }
      }
      if (undefinedChangelogRevision.size() > 0) {
        final IntMap<Nodeid> missingCsetToManifest = new IntMap<Nodeid>(undefinedChangelogRevision.size());
        int[] undefinedClogRevs = undefinedChangelogRevision.toArray();
        // undefinedChangelogRevision is sorted by the nature it's created
        HgManifest.this.getRepo().getChangelog().rangeInternal(new HgChangelog.Inspector() {
          
          public void next(int revisionIndex, Nodeid nodeid, RawChangeset cset) {
            missingCsetToManifest.put(revisionIndex, cset.manifest());
          }
        }, undefinedClogRevs);
        assert missingCsetToManifest.size() == undefinedChangelogRevision.size();
        for (int u : undefinedClogRevs) {
          Nodeid manifest = missingCsetToManifest.get(u);
          if (manifest == null || manifest.isNull()) {
            HgManifest.this.getRepo().getSessionContext().getLog().dump(getClass(), Severity.Warn, "Changeset %d has no associated manifest entry", u);
            // keep BAD_REVISION in the changelog2manifest map.

View Full Code Here

    errorCollector.assertEquals(Unrelated, p3.compareWith(p2));
  }
  
  @Test
  public void testIntVector() {
    IntVector v = new IntVector();
    v.add(10, 9, 8);
    v.add(7);
    errorCollector.assertEquals(4, v.size());
    v.clear();
    errorCollector.assertEquals(0, v.size());
    
    // vector that doesn't grow
    v = new IntVector(3, 0);
    v.add(1,2,3);
    try {
      v.add(4);
      errorCollector.fail("This vector instance is not supposed to grow on demand");
    } catch (UnsupportedOperationException ex) {
    }
    v = new IntVector(5, 2);
    v.add(10,9,8);
    v.add(7,6);
    v.add(5,4,3,2,1);
    errorCollector.assertEquals(10, v.size());
    // so far so good - grow() works
    // now, check reverse() 
    v.reverse();
    for (int i = 0; i < v.size(); i++) {
      errorCollector.assertEquals(i+1, v.get(i));
    }
  }

View Full Code Here

    EqualBlocksCollector bc = new EqualBlocksCollector();
    bc.match(-1, 5, 3);
    bc.match(-1, 10, 2);
    bc.match(-1, 15, 3);
    bc.match(-1, 20, 3);
    IntVector r = new IntVector();
    bc.intersectWithTarget(7, 10, r);
    for (int i = 0; i < r.size(); i+=2) {
      System.out.printf("[%d..%d) ", r.get(i), r.get(i) + r.get(i+1));
    }
    System.out.println();
    MergeStrategy1 ms = new MergeStrategy1(bc.matches);
    IntSliceSeq mr = ms.doCombine(0, 16, 508, 514);
    for (IntTuple t : mr) {

View Full Code Here


  private void prepare(T s2) {
    chunk2UseIndex = new HashMap<Object, IntVector>();
    for (int i = 0, len = s2.chunkCount(); i < len; i++) {
      Object bc = s2.chunk(i);
      IntVector loc = chunk2UseIndex.get(bc);
      if (loc == null) {
        chunk2UseIndex.put(bc, loc = new IntVector());
      }
      loc.add(i);
      // bc.registerUseIn(i) - BEWARE, use of bc here is incorrect
      // in this case need to find the only ByteChain to keep indexes
      // i.e. when there are few equal ByteChain instances, notion of "usedIn" shall be either shared (reference same vector)
      // or kept within only one of them
    }

View Full Code Here

    matchStartS1 = matchStartS2 = 0;
    int maxLength = 0;
    IntMap<Integer> chunkIndex2MatchCount = new IntMap<Integer>(8);
    for (int i = startS1; i < endS1; i++) {
      Object bc = seq1.chunk(i);
      IntVector occurencesInS2 = chunk2UseIndex.get(bc);
      if (occurencesInS2 == null) {
        chunkIndex2MatchCount.clear();
        continue;
      }
      IntMap<Integer> newChunkIndex2MatchCount = new IntMap<Integer>(8);
      for (int j : occurencesInS2.toArray()) {
        // s1[i] == s2[j]
        if (j < startS2) {
          continue;
        }
        if (j >= endS2) {

View Full Code Here

      cachedChangesets.put(cs.getRevisionIndex(), cs);
    }
    
    private HgChangeset[] get(int... changelogRevisionIndex) throws HgRuntimeException {
      HgChangeset[] rv = new HgChangeset[changelogRevisionIndex.length];
      IntVector misses = new IntVector(changelogRevisionIndex.length, -1);
      for (int i = 0; i < changelogRevisionIndex.length; i++) {
        if (changelogRevisionIndex[i] == -1) {
          rv[i] = null;
          continue;
        }
        HgChangeset cached = cachedChangesets.get(changelogRevisionIndex[i]);
        if (cached != null) {
          rv[i] = cached;
        } else {
          misses.add(changelogRevisionIndex[i]);
        }
      }
      if (misses.size() > 0) {
        final int[] changesets2read = misses.toArray();
        initTransform();
        repo.getChangelog().range(this, changesets2read);
        for (int changeset2read : changesets2read) {
          HgChangeset cs = cachedChangesets.get(changeset2read);
          if (cs == null) {

View Full Code Here

  
  static class DeltaCollector extends DiffHelper.DeltaInspector<LineSequence> {
    private IntVector added, deleted, same;
    public DeltaCollector() {
      final int x = 10 * 3, y = 5 * 3;
      added = new IntVector(x, y);
      deleted = new IntVector(x, y);
      same = new IntVector(x, y);
    }

View Full Code Here

TOP

Related Classes of org.tmatesoft.hg.internal.IntVector

org.tmatesoft.hg.core.HgLogCommand$ElementImpl

org.tmatesoft.hg.internal.diff.BlameHelper

org.tmatesoft.hg.internal.diff.DiffHelper

org.tmatesoft.hg.repo.HgManifest$RevisionMapper

org.tmatesoft.hg.test.TestAuxUtilities

org.tmatesoft.hg.test.TestDiffHelper$DeltaCollector

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.