How to use
contains
method
in
org.eclipse.jgit.dircache.DirCacheTree

Best Java code snippets using org.eclipse.jgit.dircache.DirCacheTree.contains (Showing top 9 results out of 315)

Common ways to obtain DirCacheTree

private void myMethod () {
 DirCacheTree d =new DirCacheTree()
DirCache dirCache;dirCache.getCacheTree(true)
new DirCacheTree(in, new MutableInteger(), null)
Smart code suggestions by Codota
}

if (nextSubtreePos > 0) {
  final DirCacheTree p = tree.getChild(nextSubtreePos - 1);
  if (p.contains(cep, pathOffset, cep.length)) {
    nextSubtreePos--;
    currentSubtree = p;
if (s.contains(cep, pathOffset, cep.length)) {

private int computeSize(final DirCacheEntry[] cache, int cIdx,
    final int pathOffset, final ObjectInserter ow)
    throws UnmergedPathException, IOException {
  final int endIdx = cIdx + entrySpan;
  int childIdx = 0;
  int entryIdx = cIdx;
  int size = 0;
  while (entryIdx < endIdx) {
    final DirCacheEntry e = cache[entryIdx];
    if (e.getStage() != 0)
      throw new UnmergedPathException(e);
    final byte[] ep = e.path;
    if (childIdx < childCnt) {
      final DirCacheTree st = children[childIdx];
      if (st.contains(ep, pathOffset, ep.length)) {
        final int stOffset = pathOffset + st.nameLength() + 1;
        st.writeTree(cache, entryIdx, stOffset, ow);
        size += entrySize(TREE, st.nameLength());
        entryIdx += st.entrySpan;
        childIdx++;
        continue;
      }
    }
    size += entrySize(e.getFileMode(), ep.length - pathOffset);
    entryIdx++;
  }
  return size;
}

if (childIdx < childCnt) {
  final DirCacheTree st = children[childIdx];
  if (st.contains(ep, pathOffset, ep.length)) {
    fmt.append(st.encodedName, TREE, st.id);
    entryIdx += st.entrySpan;

if (nextSubtreePos > 0) {
  final DirCacheTree p = tree.getChild(nextSubtreePos - 1);
  if (p.contains(cep, pathOffset, cep.length)) {
    nextSubtreePos--;
    currentSubtree = p;
if (s.contains(cep, pathOffset, cep.length)) {

if (nextSubtreePos > 0) {
  final DirCacheTree p = tree.getChild(nextSubtreePos - 1);
  if (p.contains(cep, pathOffset, cep.length)) {
    nextSubtreePos--;
    currentSubtree = p;
if (s.contains(cep, pathOffset, cep.length)) {

private int computeSize(final DirCacheEntry[] cache, int cIdx,
    final int pathOffset, final ObjectInserter ow)
    throws UnmergedPathException, IOException {
  final int endIdx = cIdx + entrySpan;
  int childIdx = 0;
  int entryIdx = cIdx;
  int size = 0;
  while (entryIdx < endIdx) {
    final DirCacheEntry e = cache[entryIdx];
    if (e.getStage() != 0)
      throw new UnmergedPathException(e);
    final byte[] ep = e.path;
    if (childIdx < childCnt) {
      final DirCacheTree st = children[childIdx];
      if (st.contains(ep, pathOffset, ep.length)) {
        final int stOffset = pathOffset + st.nameLength() + 1;
        st.writeTree(cache, entryIdx, stOffset, ow);
        size += entrySize(TREE, st.nameLength());
        entryIdx += st.entrySpan;
        childIdx++;
        continue;
      }
    }
    size += entrySize(e.getFileMode(), ep.length - pathOffset);
    entryIdx++;
  }
  return size;
}

private int computeSize(final DirCacheEntry[] cache, int cIdx,
    final int pathOffset, final ObjectInserter ow)
    throws UnmergedPathException, IOException {
  final int endIdx = cIdx + entrySpan;
  int childIdx = 0;
  int entryIdx = cIdx;
  int size = 0;
  while (entryIdx < endIdx) {
    final DirCacheEntry e = cache[entryIdx];
    if (e.getStage() != 0)
      throw new UnmergedPathException(e);
    final byte[] ep = e.path;
    if (childIdx < childCnt) {
      final DirCacheTree st = children[childIdx];
      if (st.contains(ep, pathOffset, ep.length)) {
        final int stOffset = pathOffset + st.nameLength() + 1;
        st.writeTree(cache, entryIdx, stOffset, ow);
        size += entrySize(TREE, st.nameLength());
        entryIdx += st.entrySpan;
        childIdx++;
        continue;
      }
    }
    size += entrySize(e.getFileMode(), ep.length - pathOffset);
    entryIdx++;
  }
  return size;
}

if (childIdx < childCnt) {
  final DirCacheTree st = children[childIdx];
  if (st.contains(ep, pathOffset, ep.length)) {
    fmt.append(st.encodedName, TREE, st.id);
    entryIdx += st.entrySpan;

if (childIdx < childCnt) {
  final DirCacheTree st = children[childIdx];
  if (st.contains(ep, pathOffset, ep.length)) {
    fmt.append(st.encodedName, TREE, st.id);
    entryIdx += st.entrySpan;

Popular methods of DirCacheTree

getChild
Get the i-th child cache tree.
getChildCount
Get the number of cached subtrees contained within this tree.
getEntrySpan
Get the number of entries this tree spans within the DirCache. If this tree is not valid (see #isVal
<init>
appendName
computeSize
getNameString
Get the tree's name within its parent. This method is not very efficient and is primarily meant for
getObjectId
Get the tree's ObjectId. If #isValid() returns false this method will return null.
insertChild
isValid
Determine if this cache is currently valid. A valid cache tree knows how many org.eclipse.jgit.dirca
nameLength
namecmp

Popular in Java

Running tasks concurrently on multiple threads
scheduleAtFixedRate (Timer)
runOnUiThread (Activity)
getSystemService (Context)
HttpServer (com.sun.net.httpserver)
This class implements a simple HTTP server. A HttpServer is bound to an IP address and port number a
InetAddress (java.net)
This class represents an Internet Protocol (IP) address. An IP address is either a 32-bit or 128-bit
Comparator (java.util)
A Comparator is used to compare two objects to determine their ordering with respect to each other.
Scanner (java.util)
A parser that parses a text string of primitive types and strings with the help of regular expressio
Pattern (java.util.regex)
A compiled representation of a regular expression. A regular expression, specified as a string, must
Project (org.apache.tools.ant)
Central representation of an Ant project. This class defines an Ant project with all of its targets,

How to use containsmethodin org.eclipse.jgit.dircache.DirCacheTree

Best Java code snippets using org.eclipse.jgit.dircache.DirCacheTree.contains (Showing top 9 results out of 315)

How to use
contains
method
in
org.eclipse.jgit.dircache.DirCacheTree