@Override public boolean include(TreeWalk walker) { final int n = walker.getTreeCount(); if (n == 1) // Assume they meant difference to empty tree. return true; final int m = walker.getRawMode(baseTree); for (int i = 1; i < n; i++) if (walker.getRawMode(i) != m || !walker.idEqual(i, baseTree)) return true; return false; }
/** {@inheritDoc} */ @Override public boolean include(TreeWalk walker) { final int n = walker.getTreeCount(); if (n == 1) // Assume they meant difference to empty tree. return true; final int m = walker.getRawMode(baseTree); for (int i = 1; i < n; i++) { DirCacheIterator baseDirCache = walker.getTree(baseTree, DirCacheIterator.class); DirCacheIterator newDirCache = walker.getTree(i, DirCacheIterator.class); if (baseDirCache != null && newDirCache != null) { DirCacheEntry baseDci = baseDirCache.getDirCacheEntry(); DirCacheEntry newDci = newDirCache.getDirCacheEntry(); if (baseDci != null && newDci != null) { if (baseDci.isAssumeValid() != newDci.isAssumeValid()) return true; if (baseDci.isAssumeValid()) // && newDci.isAssumeValid() return false; } } if (walker.getRawMode(i) != m || !walker.idEqual(i, baseTree)) return true; } return false; }
if (i == dirCache || i == workingTree) continue; if (tw.getRawMode(i) != dm || !tw.idEqual(i, dirCache)) return true;
@Override public boolean include(TreeWalk walker) throws MissingObjectException, IncorrectObjectTypeException, IOException { int m0 = walker.getRawMode(0); // only include the path if the file is modified in head commit // compared to base commit and that modification is not introduced // by commit from target branch return (walker.getRawMode(1) != m0 || !walker.idEqual(1, 0)) && (walker.getRawMode(2) != m0 || !walker.idEqual(2, 0)); }
for (int i = 0; i < nParents; i++) { final int pMode = tw.getRawMode(i); if (myMode == pMode && tw.idEqual(i, nParents)) continue;
private static boolean matchAnyParent(final TreeWalk walk, final int myTree) { final int m = walk.getRawMode(myTree); for (int i = 0; i < myTree; i++) if (walk.getRawMode(i) == m && walk.idEqual(i, myTree)) return true; return false; }
@Override public boolean include(TreeWalk walker) { final int n = walker.getTreeCount(); if (n == 1) // Assume they meant difference to empty tree. return true; final int m = walker.getRawMode(baseTree); for (int i = 1; i < n; i++) if (walker.getRawMode(i) != m || !walker.idEqual(i, baseTree)) return true; return false; }
@Override public boolean include(final TreeWalk walker) { final int n = walker.getTreeCount(); if (n == 1) // Assume they meant difference to empty tree. return true; final int m = walker.getRawMode(baseTree); for (int i = 1; i < n; i++) if (walker.getRawMode(i) != m || !walker.idEqual(i, baseTree)) return true; return false; }
else if (m0 != 0 && m1 == 0) d.change = ChangeType.DELETE; else if (m0 != m1 && walk.idEqual(0, myTree))
@Override public boolean include(final TreeWalk walker) { final int n = walker.getTreeCount(); if (n == 1) // Assume they meant difference to empty tree. return true; final int m = walker.getRawMode(baseTree); for (int i = 1; i < n; i++) { DirCacheIterator baseDirCache = walker.getTree(baseTree, DirCacheIterator.class); DirCacheIterator newDirCache = walker.getTree(i, DirCacheIterator.class); if (baseDirCache != null && newDirCache != null) { DirCacheEntry baseDci = baseDirCache.getDirCacheEntry(); DirCacheEntry newDci = newDirCache.getDirCacheEntry(); if (baseDci != null && newDci != null) { if (baseDci.isAssumeValid() != newDci.isAssumeValid()) return true; if (baseDci.isAssumeValid()) // && newDci.isAssumeValid() return false; } } if (walker.getRawMode(i) != m || !walker.idEqual(i, baseTree)) return true; } return false; }
/** {@inheritDoc} */ @Override public boolean include(TreeWalk walker) { final int n = walker.getTreeCount(); if (n == 1) // Assume they meant difference to empty tree. return true; final int m = walker.getRawMode(baseTree); for (int i = 1; i < n; i++) { DirCacheIterator baseDirCache = walker.getTree(baseTree, DirCacheIterator.class); DirCacheIterator newDirCache = walker.getTree(i, DirCacheIterator.class); if (baseDirCache != null && newDirCache != null) { DirCacheEntry baseDci = baseDirCache.getDirCacheEntry(); DirCacheEntry newDci = newDirCache.getDirCacheEntry(); if (baseDci != null && newDci != null) { if (baseDci.isAssumeValid() != newDci.isAssumeValid()) return true; if (baseDci.isAssumeValid()) // && newDci.isAssumeValid() return false; } } if (walker.getRawMode(i) != m || !walker.idEqual(i, baseTree)) return true; } return false; }
while (treeWalk.next()) { if ((treeWalk.getRawMode(0) & FileMode.TYPE_MASK) == FileMode.TYPE_FILE && (treeWalk.getTreeCount() == 1 || !treeWalk.idEqual(0, 1))) { ObjectId blobId = treeWalk.getObjectId(0); String blobPath = treeWalk.getPathString();
for (int i = 0; i < currentTree; i++) { final int mode = walk.getRawMode(i); same = mode == currentMode && walk.idEqual(currentTree, i); if (same) break;
if (i == dirCache || i == workingTree) continue; if (tw.getRawMode(i) != dm || !tw.idEqual(i, dirCache)) return true;
if (i == dirCache || i == workingTree) continue; if (tw.getRawMode(i) != dm || !tw.idEqual(i, dirCache)) return true;
else if (m0 != 0 && m1 == 0) chg = 'D'; else if (m0 != m1 && walk.idEqual(0, 1)) chg = 'T';
for (int i = 0; i < nParents; i++) { final int pMode = tw.getRawMode(i); if (myMode == pMode && tw.idEqual(i, nParents)) continue;
for (int i = 0; i < nParents; i++) { final int pMode = tw.getRawMode(i); if (myMode == pMode && tw.idEqual(i, nParents)) continue;
for (int i = 0; i < nParents; i++) { final int pMode = tw.getRawMode(i); if (myMode == pMode && tw.idEqual(i, nParents)) continue;