Package org.tmatesoft.hg.core

Examples of org.tmatesoft.hg.core.Nodeid

183
184
185
186
187
188
189
190
191
192
193
            }
            currRange = rangeItr.next();
            currRangeList = new LinkedList<Nodeid>();
            rv.put(currRange, currRangeList);
          }
          Nodeid nid = Nodeid.fromAscii(st.sval);
          currRangeList.addLast(nid);
        }
      }
      is.close();
      return rv;
View Full Code Here
306
307
308
309
310
311
312
313
314
315
316
    for (Pair<String, String> l : values) {
      if (l.second().length() != Nodeid.SIZE_ASCII) {
        sessionContext.getLog().dump(getClass(), Severity.Warn, "%s: bad nodeid '%s', ignored", actionName, l.second());
        continue;
      }
      Nodeid n = Nodeid.fromAscii(l.second());
      String bm = new String(l.first());
      rv.add(new Pair<String, Nodeid>(bm, n));
    }
    return new Bookmarks(rv);
  }
View Full Code Here
338
339
340
341
342
343
344
345
346
347
348
    for (Pair<String, String> l : values) {
      if ("publishing".equalsIgnoreCase(l.first())) {
        publishing = Boolean.parseBoolean(l.second());
        continue;
      }
      Nodeid root = Nodeid.fromAscii(l.first());
      int ph = Integer.parseInt(l.second());
      if (ph == HgPhase.Draft.mercurialOrdinal()) {
        draftRoots.add(root);
      } else {
        assert false;
View Full Code Here
304
305
306
307
308
309
310
311
312
313
314
315
    for (Path r2fname : r2.files()) {
      if (!scope.accept(r2fname)) {
        continue;
      }
      if (r1Files.remove(r2fname)) {
        Nodeid nidR1 = r1.nodeid(r2fname);
        Nodeid nidR2 = r2.nodeid(r2fname);
        HgManifest.Flags flagsR1 = r1.flags(r2fname);
        HgManifest.Flags flagsR2 = r2.flags(r2fname);
        if (nidR1.equals(nidR2) && flagsR2 == flagsR1) {
          inspector.clean(r2fname);
        } else {
View Full Code Here
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
   */
  public RevisionSet roots(HgParentChildMap<HgChangelog> ph) {
    HashSet<Nodeid> copy = new HashSet<Nodeid>(elements);
    for (Nodeid n : elements) {
      assert ph.knownNode(n);
      Nodeid p1 = ph.firstParent(n);
      if (p1 != null && elements.contains(p1)) {
        copy.remove(n);
        continue;
      }
      Nodeid p2 = ph.secondParent(n);
      if (p2 != null && elements.contains(p2)) {
        copy.remove(n);
        continue;
      }
    }
View Full Code Here
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
    byte[] parent1 = new byte[Nodeid.SIZE], parent2 = new byte[Nodeid.SIZE];
    int[] parentRevs = new int[2];
    for (Nodeid n : elements) {
      assert clog.isKnown(n);
      clog.parents(clog.getRevisionIndex(n), parentRevs, parent1, parent2);
      if (parentRevs[0] != NO_REVISION && elements.contains(new Nodeid(parent1, false))) {
        copy.remove(n);
        continue;
      }
      if (parentRevs[1] != NO_REVISION && elements.contains(new Nodeid(parent2, false))) {
        copy.remove(n);
        continue;
      }
    }
    return copy.size() == elements.size() ? this : new RevisionSet(copy);
View Full Code Here
110
111
112
113
114
115
116
117
118
119
120
121
  public RevisionSet heads(HgParentChildMap<HgChangelog> ph) {
    HashSet<Nodeid> copy = new HashSet<Nodeid>(elements);
    // can't do copy.removeAll(ph.childrenOf(asList())); as actual heads are indeed children of some other node
    for (Nodeid n : elements) {
      assert ph.knownNode(n);
      Nodeid p1 = ph.firstParent(n);
      Nodeid p2 = ph.secondParent(n);
      if (p1 != null && elements.contains(p1)) {
        copy.remove(p1);
      }
      if (p2 != null && elements.contains(p2)) {
        copy.remove(p2);
View Full Code Here
139
140
141
142
143
144
145
146
147
148
149
150
    HashSet<Nodeid> ancestors = new HashSet<Nodeid>();
    Set<Nodeid> childrenToCheck = chRoots.elements;
    while (!childrenToCheck.isEmpty()) {
      HashSet<Nodeid> nextRound = new HashSet<Nodeid>();
      for (Nodeid n : childrenToCheck) {
        Nodeid p1 = parentHelper.firstParent(n);
        Nodeid p2 = parentHelper.secondParent(n);
        if (p1 != null && elements.contains(p1)) {
          nextRound.add(p1);
        }
        if (p2 != null && elements.contains(p2)) {
          nextRound.add(p2);
View Full Code Here
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
        // head is immediate child
        resultCommon.add(rb.root);
      } else {
        // between gives result from head to root, I'd like to go in reverse direction
        Collections.reverse(remoteRevisions);
        Nodeid root = rb.root;
        while(!remoteRevisions.isEmpty()) {
          Nodeid n = remoteRevisions.remove(0);
          if (localRepo.knownNode(n)) {
            if (remoteRevisions.isEmpty()) {
              // this is the last known node before an unknown
              resultCommon.add(n);
              break;
            }
            if (remoteRevisions.size() == 1) {
              // there's only one left between known n and unknown head
              // this check is to save extra between query, not really essential
              Nodeid last = remoteRevisions.remove(0);
              resultCommon.add(localRepo.knownNode(last) ? last : n);
              break;
            }
            // might get handy for next between query, to narrow search down
            root = n;
View Full Code Here
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
          }
        }
      }
    }
    for (RemoteBranch rb : checkUp2Head) {
      Nodeid h = rb.head;
      Nodeid r = rb.root;
      int watchdog = 1000;
      assert head2chain.containsKey(h);
      BranchChain bc = head2chain.get(h);
      assert bc != null : h.toString();
      // if we know branch root locally, there could be no parent branch chain elements.
      assert bc.p1 == null;
      assert bc.p2 == null;
      do {
        List<Nodeid> between = remoteRepo.between(h, r);
        if (between.isEmpty()) {
          bc.branchRoot = r;
          break;
        } else {
          Collections.reverse(between);
          for (Nodeid n : between) {
            if (localRepo.knownNode(n)) {
              r = n;
            } else {
              h = n;
              break;
            }
          }
          Nodeid lastInBetween = between.get(between.size() - 1);
          if (r.equals(lastInBetween)) {
            bc.branchRoot = r;
            break;
          } else if (h.equals(lastInBetween)) { // the only chance for current head pointer to point to the sequence tail
            // is when r is second from the between list end (iow, head,1,[2],4,8...,root)
View Full Code Here
TOP

Related Classes of org.tmatesoft.hg.core.Nodeid

  • org.tmatesoft.hg.console.ChangesetDumpHandler
  • org.tmatesoft.hg.console.Main
  • org.tmatesoft.hg.internal.ChangelogMonitor
  • org.tmatesoft.hg.internal.ChangesetParser
  • org.tmatesoft.hg.internal.CommitFacility
  • org.tmatesoft.hg.internal.diff.BlameHelper
  • org.tmatesoft.hg.internal.DirstateReader
  • org.tmatesoft.hg.internal.FileHistory
  • org.tmatesoft.hg.internal.PhasesHelper
  • org.tmatesoft.hg.internal.RepositoryComparator
    • Copyright © 2018 www.massapicom. All rights reserved.
    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.