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.

IndexDiff.java 4.8KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166
  1. /*
  2. * Copyright (C) 2007, Dave Watson <dwatson@mimvista.com>
  3. * Copyright (C) 2007-2008, Robin Rosenberg <robin.rosenberg@dewire.com>
  4. * and other copyright owners as documented in the project's IP log.
  5. *
  6. * This program and the accompanying materials are made available
  7. * under the terms of the Eclipse Distribution License v1.0 which
  8. * accompanies this distribution, is reproduced below, and is
  9. * available at http://www.eclipse.org/org/documents/edl-v10.php
  10. *
  11. * All rights reserved.
  12. *
  13. * Redistribution and use in source and binary forms, with or
  14. * without modification, are permitted provided that the following
  15. * conditions are met:
  16. *
  17. * - Redistributions of source code must retain the above copyright
  18. * notice, this list of conditions and the following disclaimer.
  19. *
  20. * - Redistributions in binary form must reproduce the above
  21. * copyright notice, this list of conditions and the following
  22. * disclaimer in the documentation and/or other materials provided
  23. * with the distribution.
  24. *
  25. * - Neither the name of the Eclipse Foundation, Inc. nor the
  26. * names of its contributors may be used to endorse or promote
  27. * products derived from this software without specific prior
  28. * written permission.
  29. *
  30. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
  31. * CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
  32. * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
  33. * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  34. * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
  35. * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  36. * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
  37. * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
  38. * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
  39. * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
  40. * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  41. * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
  42. * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  43. */
  44. package org.eclipse.jgit.lib;
  45. import java.io.File;
  46. import java.io.IOException;
  47. import java.util.HashSet;
  48. import org.eclipse.jgit.lib.GitIndex.Entry;
  49. /**
  50. * Compares the Index, a Tree, and the working directory
  51. */
  52. public class IndexDiff {
  53. private GitIndex index;
  54. private Tree tree;
  55. /**
  56. * Construct an indexdiff for diffing the workdir against
  57. * the index.
  58. *
  59. * @param repository
  60. * @throws IOException
  61. */
  62. public IndexDiff(Repository repository) throws IOException {
  63. this.tree = repository.mapTree(Constants.HEAD);
  64. this.index = repository.getIndex();
  65. }
  66. /**
  67. * Construct an indexdiff for diffing the workdir against both
  68. * the index and a tree.
  69. *
  70. * @param tree
  71. * @param index
  72. */
  73. public IndexDiff(Tree tree, GitIndex index) {
  74. this.tree = tree;
  75. this.index = index;
  76. }
  77. boolean anyChanges = false;
  78. /**
  79. * Run the diff operation. Until this is called, all lists will be empty
  80. * @return if anything is different between index, tree, and workdir
  81. * @throws IOException
  82. */
  83. public boolean diff() throws IOException {
  84. final File root = index.getRepository().getWorkDir();
  85. new IndexTreeWalker(index, tree, root, new AbstractIndexTreeVisitor() {
  86. public void visitEntry(TreeEntry treeEntry, Entry indexEntry, File file) {
  87. if (treeEntry == null) {
  88. added.add(indexEntry.getName());
  89. anyChanges = true;
  90. } else if (indexEntry == null) {
  91. if (!(treeEntry instanceof Tree))
  92. removed.add(treeEntry.getFullName());
  93. anyChanges = true;
  94. } else {
  95. if (!treeEntry.getId().equals(indexEntry.getObjectId())) {
  96. changed.add(indexEntry.getName());
  97. anyChanges = true;
  98. }
  99. }
  100. if (indexEntry != null) {
  101. if (!file.exists()) {
  102. missing.add(indexEntry.getName());
  103. anyChanges = true;
  104. } else {
  105. if (indexEntry.isModified(root, true)) {
  106. modified.add(indexEntry.getName());
  107. anyChanges = true;
  108. }
  109. }
  110. }
  111. }
  112. }).walk();
  113. return anyChanges;
  114. }
  115. HashSet<String> added = new HashSet<String>();
  116. HashSet<String> changed = new HashSet<String>();
  117. HashSet<String> removed = new HashSet<String>();
  118. HashSet<String> missing = new HashSet<String>();
  119. HashSet<String> modified = new HashSet<String>();
  120. /**
  121. * @return list of files added to the index, not in the tree
  122. */
  123. public HashSet<String> getAdded() {
  124. return added;
  125. }
  126. /**
  127. * @return list of files changed from tree to index
  128. */
  129. public HashSet<String> getChanged() {
  130. return changed;
  131. }
  132. /**
  133. * @return list of files removed from index, but in tree
  134. */
  135. public HashSet<String> getRemoved() {
  136. return removed;
  137. }
  138. /**
  139. * @return list of files in index, but not filesystem
  140. */
  141. public HashSet<String> getMissing() {
  142. return missing;
  143. }
  144. /**
  145. * @return list of files on modified on disk relative to the index
  146. */
  147. public HashSet<String> getModified() {
  148. return modified;
  149. }
  150. }