Package org.eclipse.jgit.errors

Examples of org.eclipse.jgit.errors.EntryExistsException

288
289
290
291
292
293
294
295
296
297
298
    if (p >= 0 && slash < s.length && contents[p] instanceof Tree)
      return ((Tree) contents[p]).addFile(s, slash + 1);

    final byte[] newName = substring(s, offset, slash);
    if (p >= 0)
      throw new EntryExistsException(RawParseUtils.decode(newName));
    else if (slash < s.length) {
      final Tree t = new Tree(this, newName);
      insertEntry(p, t);
      return t.addFile(s, slash + 1);
    } else {
View Full Code Here
338
339
340
341
342
343
344
345
346
347
348
    if (p >= 0 && slash < s.length && contents[p] instanceof Tree)
      return ((Tree) contents[p]).addTree(s, slash + 1);

    final byte[] newName = substring(s, offset, slash);
    if (p >= 0)
      throw new EntryExistsException(RawParseUtils.decode(newName));

    final Tree t = new Tree(this, newName);
    insertEntry(p, t);
    return slash == s.length ? t : t.addTree(s, slash + 1);
  }
View Full Code Here
360
361
362
363
364
365
366
367
    p = binarySearch(contents, e.getNameUTF8(), TreeEntry.lastChar(e), 0, e.getNameUTF8().length);
    if (p < 0) {
      e.attachParent(this);
      insertEntry(p, e);
    } else {
      throw new EntryExistsException(e.getName());
    }
  }
View Full Code Here
296
297
298
299
300
301
302
303
304
305
306
    if (p >= 0 && slash < s.length && contents[p] instanceof Tree)
      return ((Tree) contents[p]).addFile(s, slash + 1);

    final byte[] newName = substring(s, offset, slash);
    if (p >= 0)
      throw new EntryExistsException(RawParseUtils.decode(newName));
    else if (slash < s.length) {
      final Tree t = new Tree(this, newName);
      insertEntry(p, t);
      return t.addFile(s, slash + 1);
    } else {
View Full Code Here
346
347
348
349
350
351
352
353
354
355
356
    if (p >= 0 && slash < s.length && contents[p] instanceof Tree)
      return ((Tree) contents[p]).addTree(s, slash + 1);

    final byte[] newName = substring(s, offset, slash);
    if (p >= 0)
      throw new EntryExistsException(RawParseUtils.decode(newName));

    final Tree t = new Tree(this, newName);
    insertEntry(p, t);
    return slash == s.length ? t : t.addTree(s, slash + 1);
  }
View Full Code Here
368
369
370
371
372
373
374
375
    p = binarySearch(contents, e.getNameUTF8(), TreeEntry.lastChar(e), 0, e.getNameUTF8().length);
    if (p < 0) {
      e.attachParent(this);
      insertEntry(p, e);
    } else {
      throw new EntryExistsException(e.getName());
    }
  }
View Full Code Here
288
289
290
291
292
293
294
295
296
297
298
    if (p >= 0 && slash < s.length && contents[p] instanceof Tree)
      return ((Tree) contents[p]).addFile(s, slash + 1);

    final byte[] newName = substring(s, offset, slash);
    if (p >= 0)
      throw new EntryExistsException(RawParseUtils.decode(newName));
    else if (slash < s.length) {
      final Tree t = new Tree(this, newName);
      insertEntry(p, t);
      return t.addFile(s, slash + 1);
    } else {
View Full Code Here
338
339
340
341
342
343
344
345
346
347
348
    if (p >= 0 && slash < s.length && contents[p] instanceof Tree)
      return ((Tree) contents[p]).addTree(s, slash + 1);

    final byte[] newName = substring(s, offset, slash);
    if (p >= 0)
      throw new EntryExistsException(RawParseUtils.decode(newName));

    final Tree t = new Tree(this, newName);
    insertEntry(p, t);
    return slash == s.length ? t : t.addTree(s, slash + 1);
  }
View Full Code Here
360
361
362
363
364
365
366
367
    p = binarySearch(contents, e.getNameUTF8(), TreeEntry.lastChar(e), 0, e.getNameUTF8().length);
    if (p < 0) {
      e.attachParent(this);
      insertEntry(p, e);
    } else {
      throw new EntryExistsException(e.getName());
    }
  }
View Full Code Here
295
296
297
298
299
300
301
302
303
304
305
    if (p >= 0 && slash < s.length && contents[p] instanceof Tree)
      return ((Tree) contents[p]).addFile(s, slash + 1);

    final byte[] newName = substring(s, offset, slash);
    if (p >= 0)
      throw new EntryExistsException(RawParseUtils.decode(newName));
    else if (slash < s.length) {
      final Tree t = new Tree(this, newName);
      insertEntry(p, t);
      return t.addFile(s, slash + 1);
    } else {
View Full Code Here
TOP

Related Classes of org.eclipse.jgit.errors.EntryExistsException

  • org.eclipse.jgit.lib.Tree
    • 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.