Du kan inte välja fler än 25 ämnen Ämnen måste starta med en bokstav eller siffra, kan innehålla bindestreck ('-') och vara max 35 tecken långa.

DirCacheBuildIterator.java 4.9KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144
  1. /*
  2. * Copyright (C) 2008-2009, Google Inc.
  3. * Copyright (C) 2009, 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.dircache;
  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.Constants;
  50. import org.eclipse.jgit.lib.ObjectReader;
  51. import org.eclipse.jgit.treewalk.AbstractTreeIterator;
  52. /**
  53. * Iterate and update a {@link org.eclipse.jgit.dircache.DirCache} as part of a
  54. * <code>TreeWalk</code>.
  55. * <p>
  56. * Like {@link org.eclipse.jgit.dircache.DirCacheIterator} this iterator allows
  57. * a DirCache to be used in parallel with other sorts of iterators in a
  58. * TreeWalk. However any entry which appears in the source DirCache and which is
  59. * skipped by the TreeFilter is automatically copied into
  60. * {@link org.eclipse.jgit.dircache.DirCacheBuilder}, thus retaining it in the
  61. * newly updated index.
  62. * <p>
  63. * This iterator is suitable for update processes, or even a simple delete
  64. * algorithm. For example deleting a path:
  65. *
  66. * <pre>
  67. * final DirCache dirc = db.lockDirCache();
  68. * final DirCacheBuilder edit = dirc.builder();
  69. *
  70. * final TreeWalk walk = new TreeWalk(db);
  71. * walk.reset();
  72. * walk.setRecursive(true);
  73. * walk.setFilter(PathFilter.create(&quot;name/to/remove&quot;));
  74. * walk.addTree(new DirCacheBuildIterator(edit));
  75. *
  76. * while (walk.next())
  77. * ; // do nothing on a match as we want to remove matches
  78. * edit.commit();
  79. * </pre>
  80. */
  81. public class DirCacheBuildIterator extends DirCacheIterator {
  82. private final DirCacheBuilder builder;
  83. /**
  84. * Create a new iterator for an already loaded DirCache instance.
  85. * <p>
  86. * The iterator implementation may copy part of the cache's data during
  87. * construction, so the cache must be read in prior to creating the
  88. * iterator.
  89. *
  90. * @param dcb
  91. * the cache builder for the cache to walk. The cache must be
  92. * already loaded into memory.
  93. */
  94. public DirCacheBuildIterator(DirCacheBuilder dcb) {
  95. super(dcb.getDirCache());
  96. builder = dcb;
  97. }
  98. DirCacheBuildIterator(final DirCacheBuildIterator p,
  99. final DirCacheTree dct) {
  100. super(p, dct);
  101. builder = p.builder;
  102. }
  103. /** {@inheritDoc} */
  104. @Override
  105. public AbstractTreeIterator createSubtreeIterator(ObjectReader reader)
  106. throws IncorrectObjectTypeException, IOException {
  107. if (currentSubtree == null)
  108. throw new IncorrectObjectTypeException(getEntryObjectId(),
  109. Constants.TYPE_TREE);
  110. return new DirCacheBuildIterator(this, currentSubtree);
  111. }
  112. /** {@inheritDoc} */
  113. @Override
  114. public void skip() throws CorruptObjectException {
  115. if (currentSubtree != null)
  116. builder.keep(ptr, currentSubtree.getEntrySpan());
  117. else
  118. builder.keep(ptr, 1);
  119. next(1);
  120. }
  121. /** {@inheritDoc} */
  122. @Override
  123. public void stopWalk() {
  124. final int cur = ptr;
  125. final int cnt = cache.getEntryCount();
  126. if (cur < cnt)
  127. builder.keep(cur, cnt - cur);
  128. }
  129. /** {@inheritDoc} */
  130. @Override
  131. protected boolean needsStopWalk() {
  132. return ptr < cache.getEntryCount();
  133. }
  134. }