private ObjectId resultTree;
- private List<String> unmergedPathes = new ArrayList<String>();
+ private List<String> unmergedPaths = new ArrayList<String>();
private List<String> modifiedFiles = new LinkedList<String>();
private Map<String, MergeResult<? extends Sequence>> mergeResults = new HashMap<String, MergeResult<? extends Sequence>>();
- private Map<String, MergeFailureReason> failingPathes = new HashMap<String, MergeFailureReason>();
+ private Map<String, MergeFailureReason> failingPaths = new HashMap<String, MergeFailureReason>();
private ObjectInserter oi;
builder = null;
}
- if (getUnmergedPathes().isEmpty()) {
+ if (getUnmergedPaths().isEmpty()) {
resultTree = dircache.writeTree(oi);
return true;
} else {
entry.getValue());
} else {
if (!f.delete())
- failingPathes.put(entry.getKey(),
+ failingPaths.put(entry.getKey(),
MergeFailureReason.COULD_NOT_DELETE);
}
modifiedFiles.add(entry.getKey());
// Each index entry has to match ours, means: it has to be clean
if (nonTree(modeI)
&& !(tw.idEqual(T_INDEX, T_OURS) && modeO == modeI)) {
- failingPathes.put(tw.getPathString(), MergeFailureReason.DIRTY_INDEX);
+ failingPaths.put(tw.getPathString(), MergeFailureReason.DIRTY_INDEX);
return false;
}
if (nonTree(modeB))
add(tw.getRawPath(), base, DirCacheEntry.STAGE_1);
add(tw.getRawPath(), ours, DirCacheEntry.STAGE_2);
- unmergedPathes.add(tw.getPathString());
+ unmergedPaths.add(tw.getPathString());
enterSubtree = false;
return true;
}
if (nonTree(modeB))
add(tw.getRawPath(), base, DirCacheEntry.STAGE_1);
add(tw.getRawPath(), theirs, DirCacheEntry.STAGE_3);
- unmergedPathes.add(tw.getPathString());
+ unmergedPaths.add(tw.getPathString());
enterSubtree = false;
return true;
}
if (work != null
&& (!nonTree(work.getEntryRawMode()) || work
.isModified(index.getDirCacheEntry(), true))) {
- failingPathes.put(tw.getPathString(),
+ failingPaths.put(tw.getPathString(),
MergeFailureReason.DIRTY_WORKTREE);
return false;
}
}
if (!contentMerge(base, ours, theirs)) {
- unmergedPathes.add(tw.getPathString());
+ unmergedPaths.add(tw.getPathString());
}
modifiedFiles.add(tw.getPathString());
}
* @return the paths with conflicts. This is a subset of the files listed
* by {@link #getModifiedFiles()}
*/
- public List<String> getUnmergedPathes() {
- return unmergedPathes;
+ public List<String> getUnmergedPaths() {
+ return unmergedPaths;
}
/**
* @return the paths of files which have been modified by this merge. A
* file will be modified if a content-merge works on this path or if
* the merge algorithm decides to take the theirs-version. This is a
- * superset of the files listed by {@link #getUnmergedPathes()}.
+ * superset of the files listed by {@link #getUnmergedPaths()}.
*/
public List<String> getModifiedFiles() {
return modifiedFiles;
* a conflict). <code>null</code> is returned if this merge didn't
* fail abnormally.
*/
- public Map<String, MergeFailureReason> getFailingPathes() {
- return (failingPathes.size() == 0) ? null : failingPathes;
+ public Map<String, MergeFailureReason> getFailingPaths() {
+ return (failingPaths.size() == 0) ? null : failingPaths;
}
/**