You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

EmptyTreeIterator.java 4.3KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145
  1. /*
  2. * Copyright (C) 2008-2009, Google Inc.
  3. * Copyright (C) 2007, Robin Rosenberg <robin.rosenberg@dewire.com>
  4. * Copyright (C) 2008, Shawn O. Pearce <spearce@spearce.org>
  5. * and other copyright owners as documented in the project's IP log.
  6. *
  7. * This program and the accompanying materials are made available
  8. * under the terms of the Eclipse Distribution License v1.0 which
  9. * accompanies this distribution, is reproduced below, and is
  10. * available at http://www.eclipse.org/org/documents/edl-v10.php
  11. *
  12. * All rights reserved.
  13. *
  14. * Redistribution and use in source and binary forms, with or
  15. * without modification, are permitted provided that the following
  16. * conditions are met:
  17. *
  18. * - Redistributions of source code must retain the above copyright
  19. * notice, this list of conditions and the following disclaimer.
  20. *
  21. * - Redistributions in binary form must reproduce the above
  22. * copyright notice, this list of conditions and the following
  23. * disclaimer in the documentation and/or other materials provided
  24. * with the distribution.
  25. *
  26. * - Neither the name of the Eclipse Foundation, Inc. nor the
  27. * names of its contributors may be used to endorse or promote
  28. * products derived from this software without specific prior
  29. * written permission.
  30. *
  31. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
  32. * CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
  33. * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
  34. * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  35. * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
  36. * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  37. * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
  38. * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
  39. * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
  40. * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
  41. * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  42. * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
  43. * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  44. */
  45. package org.eclipse.jgit.treewalk;
  46. import java.io.IOException;
  47. import org.eclipse.jgit.errors.CorruptObjectException;
  48. import org.eclipse.jgit.errors.IncorrectObjectTypeException;
  49. import org.eclipse.jgit.lib.ObjectId;
  50. import org.eclipse.jgit.lib.ObjectReader;
  51. /** Iterator over an empty tree (a directory with no files). */
  52. public class EmptyTreeIterator extends AbstractTreeIterator {
  53. /** Create a new iterator with no parent. */
  54. public EmptyTreeIterator() {
  55. // Create a root empty tree.
  56. }
  57. EmptyTreeIterator(final AbstractTreeIterator p) {
  58. super(p);
  59. pathLen = pathOffset;
  60. }
  61. /**
  62. * Create an iterator for a subtree of an existing iterator.
  63. * <p>
  64. * The caller is responsible for setting up the path of the child iterator.
  65. *
  66. * @param p
  67. * parent tree iterator.
  68. * @param childPath
  69. * path array to be used by the child iterator. This path must
  70. * contain the path from the top of the walk to the first child
  71. * and must end with a '/'.
  72. * @param childPathOffset
  73. * position within <code>childPath</code> where the child can
  74. * insert its data. The value at
  75. * <code>childPath[childPathOffset-1]</code> must be '/'.
  76. */
  77. public EmptyTreeIterator(final AbstractTreeIterator p,
  78. final byte[] childPath, final int childPathOffset) {
  79. super(p, childPath, childPathOffset);
  80. pathLen = childPathOffset - 1;
  81. }
  82. @Override
  83. public AbstractTreeIterator createSubtreeIterator(final ObjectReader reader)
  84. throws IncorrectObjectTypeException, IOException {
  85. return new EmptyTreeIterator(this);
  86. }
  87. @Override
  88. public boolean hasId() {
  89. return false;
  90. }
  91. @Override
  92. public ObjectId getEntryObjectId() {
  93. return ObjectId.zeroId();
  94. }
  95. @Override
  96. public byte[] idBuffer() {
  97. return zeroid;
  98. }
  99. @Override
  100. public int idOffset() {
  101. return 0;
  102. }
  103. @Override
  104. public void reset() {
  105. // Do nothing.
  106. }
  107. @Override
  108. public boolean first() {
  109. return true;
  110. }
  111. @Override
  112. public boolean eof() {
  113. return true;
  114. }
  115. @Override
  116. public void next(final int delta) throws CorruptObjectException {
  117. // Do nothing.
  118. }
  119. @Override
  120. public void back(final int delta) throws CorruptObjectException {
  121. // Do nothing.
  122. }
  123. @Override
  124. public void stopWalk() {
  125. if (parent != null)
  126. parent.stopWalk();
  127. }
  128. }