aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorMarc Strapetz2013-05-27 04:32:47 (EDT)
committerMarc Strapetz2014-02-24 12:29:27 (EST)
commit21498aec83d4f87563f7218fa100b8c0ecfc9c4a (patch)
tree1d5fd8eff13a5c65b517250fcab01b5994a6680c
parent8e0e78858c27b86cd0f04603e122fa69909c0299 (diff)
downloadjgit-21498aec83d4f87563f7218fa100b8c0ecfc9c4a.zip
jgit-21498aec83d4f87563f7218fa100b8c0ecfc9c4a.tar.gz
jgit-21498aec83d4f87563f7218fa100b8c0ecfc9c4a.tar.bz2
DirCache.findEntry(byte[], in) made publicrefs/changes/58/22458/1
Change-Id: Ice64e3b0e5d67a39690aa24e41c954b8ce312d49 Signed-off-by: Marc Strapetz <marc.strapetz@syntevo.com>‌
-rw-r--r--org.eclipse.jgit/src/org/eclipse/jgit/dircache/DirCache.java28
1 files changed, 20 insertions, 8 deletions
diff --git a/org.eclipse.jgit/src/org/eclipse/jgit/dircache/DirCache.java b/org.eclipse.jgit/src/org/eclipse/jgit/dircache/DirCache.java
index 275dfed..f7d6c17 100644
--- a/org.eclipse.jgit/src/org/eclipse/jgit/dircache/DirCache.java
+++ b/org.eclipse.jgit/src/org/eclipse/jgit/dircache/DirCache.java
@@ -731,13 +731,7 @@ public class DirCache {
/**
* Locate the position a path's entry is at in the index.
- * <p>
- * If there is at least one entry in the index for this path the position of
- * the lowest stage is returned. Subsequent stages can be identified by
- * testing consecutive entries until the path differs.
- * <p>
- * If no path matches the entry -(position+1) is returned, where position is
- * the location it would have gone within the index.
+ * For details refer to #findEntry(byte[], int).
*
* @param path
* the path to search for.
@@ -750,7 +744,25 @@ public class DirCache {
return findEntry(p, p.length);
}
- int findEntry(final byte[] p, final int pLen) {
+ /**
+ * Locate the position a path's entry is at in the index.
+ * <p>
+ * If there is at least one entry in the index for this path the position of
+ * the lowest stage is returned. Subsequent stages can be identified by
+ * testing consecutive entries until the path differs.
+ * <p>
+ * If no path matches the entry -(position+1) is returned, where position is
+ * the location it would have gone within the index.
+ *
+ * @param p
+ * the byte array starting with the path to search for.
+ * @param pLen
+ * the length of the path in bytes
+ * @return if >= 0 then the return value is the position of the entry in the
+ * index; pass to {@link #getEntry(int)} to obtain the entry
+ * information. If < 0 the entry does not exist in the index.
+ */
+ public int findEntry(final byte[] p, final int pLen) {
int low = 0;
int high = entryCnt;
while (low < high) {