Package org.eclipse.jgit.lib

Examples of org.eclipse.jgit.lib.MutableObjectId


      }

      tw.setRecursive(true);
      headCommit = null;

      MutableObjectId idBuf = new MutableObjectId();
      Map<String, Change> result = new HashMap<String, Change>();
      while(tw.next()) {
        if (!shouldIncludeEntry(tw))
          continue;
View Full Code Here


    final Map<String, Change> result = new HashMap<String, GitCommitsModelCache.Change>();
    final AbbreviatedObjectId commitId = getAbbreviatedObjectId(commit);
    final AbbreviatedObjectId parentCommitId = getAbbreviatedObjectId(parentCommit);

    MutableObjectId idBuf = new MutableObjectId();
    while (tw.next()) {
      Change change = new Change();
      change.commitId = commitId;
      change.remoteCommitId = parentCommitId;
      change.name = tw.getNameString();
View Full Code Here

    if (includeTrees && walk.isRecursive())
      throw new IllegalArgumentException(
          JGitText.get().cannotBeRecursiveWhenTreesAreIncluded);

    List<DiffEntry> r = new ArrayList<DiffEntry>();
    MutableObjectId idBuf = new MutableObjectId();
    while (walk.next()) {
      DiffEntry entry = new DiffEntry();

      walk.getObjectId(idBuf, 0);
      entry.oldId = AbbreviatedObjectId.fromObjectId(idBuf);
View Full Code Here

  void parseCanonical(final RevWalk walk, final byte[] raw)
      throws IOException {
    if (!walk.shallowCommitsInitialized)
      walk.initializeShallowCommits();

    final MutableObjectId idBuffer = walk.idBuffer;
    idBuffer.fromString(raw, 5);
    tree = walk.lookupTree(idBuffer);

    int ptr = 46;
    if (parents == null) {
      RevCommit[] pList = new RevCommit[1];
      int nParents = 0;
      for (;;) {
        if (raw[ptr] != 'p')
          break;
        idBuffer.fromString(raw, ptr + 7);
        final RevCommit p = walk.lookupCommit(idBuffer);
        if (nParents == 0)
          pList[nParents++] = p;
        else if (nParents == 1) {
          pList = new RevCommit[] { pList[0], p };
View Full Code Here

  }

  private RevWalk(final Repository repo, final ObjectReader or) {
    repository = repo;
    reader = or;
    idBuffer = new MutableObjectId();
    objects = new ObjectIdOwnerMap<RevObject>();
    roots = new ArrayList<RevCommit>();
    queue = new DateRevQueue();
    pending = new StartGenerator(this);
    sorting = EnumSet.of(RevSort.NONE);
View Full Code Here

      treeFilterMarker = new TreeFilterMarker(markTreeFilters);
    else
      treeFilterMarker = null;

    List<DiffEntry> r = new ArrayList<DiffEntry>();
    MutableObjectId idBuf = new MutableObjectId();
    while (walk.next()) {
      DiffEntry entry = new DiffEntry();

      walk.getObjectId(idBuf, 0);
      entry.oldId = AbbreviatedObjectId.fromObjectId(idBuf);
View Full Code Here

    return line.toString();
  }

  private void negotiate(final ProgressMonitor monitor) throws IOException,
      CancelledException {
    final MutableObjectId ackId = new MutableObjectId();
    int resultsPending = 0;
    int havesSent = 0;
    int havesSinceLastContinue = 0;
    boolean receivedContinue = false;
    boolean receivedAck = false;
View Full Code Here

        // Return null if no local changes to stash
        if (!treeWalk.next())
          return null;

        MutableObjectId id = new MutableObjectId();
        List<PathEdit> wtEdits = new ArrayList<PathEdit>();
        List<String> wtDeletes = new ArrayList<String>();
        do {
          AbstractTreeIterator headIter = treeWalk.getTree(0,
              AbstractTreeIterator.class);
View Full Code Here

    readCurs = objectDatabase.newReader();
    buf = new byte[BUFFER_SIZE];
    tempBuffer = new byte[BUFFER_SIZE];
    hdrBuf = new byte[64];
    objectDigest = Constants.newMessageDigest();
    tempObjectId = new MutableObjectId();
    packDigest = Constants.newMessageDigest();
  }
View Full Code Here

   *            be released by the caller when the walker is no longer
   *            required.
   */
  public RevWalk(ObjectReader or) {
    reader = or;
    idBuffer = new MutableObjectId();
    objects = new ObjectIdOwnerMap<RevObject>();
    roots = new ArrayList<RevCommit>();
    queue = new DateRevQueue();
    pending = new StartGenerator(this);
    sorting = EnumSet.of(RevSort.NONE);
View Full Code Here

TOP

Related Classes of org.eclipse.jgit.lib.MutableObjectId

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.