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.

PathSuffixFilterTest.java 5.2KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147
  1. /*
  2. * Copyright (C) 2009, Google Inc.
  3. * and other copyright owners as documented in the project's IP log.
  4. *
  5. * This program and the accompanying materials are made available
  6. * under the terms of the Eclipse Distribution License v1.0 which
  7. * accompanies this distribution, is reproduced below, and is
  8. * available at http://www.eclipse.org/org/documents/edl-v10.php
  9. *
  10. * All rights reserved.
  11. *
  12. * Redistribution and use in source and binary forms, with or
  13. * without modification, are permitted provided that the following
  14. * conditions are met:
  15. *
  16. * - Redistributions of source code must retain the above copyright
  17. * notice, this list of conditions and the following disclaimer.
  18. *
  19. * - Redistributions in binary form must reproduce the above
  20. * copyright notice, this list of conditions and the following
  21. * disclaimer in the documentation and/or other materials provided
  22. * with the distribution.
  23. *
  24. * - Neither the name of the Eclipse Foundation, Inc. nor the
  25. * names of its contributors may be used to endorse or promote
  26. * products derived from this software without specific prior
  27. * written permission.
  28. *
  29. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
  30. * CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
  31. * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
  32. * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  33. * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
  34. * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  35. * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
  36. * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
  37. * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
  38. * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
  39. * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  40. * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
  41. * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  42. */
  43. package org.eclipse.jgit.treewalk.filter;
  44. import static org.eclipse.jgit.lib.Constants.OBJ_BLOB;
  45. import static org.junit.Assert.assertEquals;
  46. import java.io.IOException;
  47. import java.util.LinkedList;
  48. import java.util.List;
  49. import org.eclipse.jgit.dircache.DirCache;
  50. import org.eclipse.jgit.dircache.DirCacheBuilder;
  51. import org.eclipse.jgit.dircache.DirCacheEntry;
  52. import org.eclipse.jgit.junit.RepositoryTestCase;
  53. import org.eclipse.jgit.lib.FileMode;
  54. import org.eclipse.jgit.lib.ObjectId;
  55. import org.eclipse.jgit.lib.ObjectInserter;
  56. import org.eclipse.jgit.treewalk.TreeWalk;
  57. import org.junit.Test;
  58. public class PathSuffixFilterTest extends RepositoryTestCase {
  59. @Test
  60. public void testNonRecursiveFiltering() throws IOException {
  61. final ObjectInserter odi = db.newObjectInserter();
  62. final ObjectId aSth = odi.insert(OBJ_BLOB, "a.sth".getBytes());
  63. final ObjectId aTxt = odi.insert(OBJ_BLOB, "a.txt".getBytes());
  64. final DirCache dc = db.readDirCache();
  65. final DirCacheBuilder builder = dc.builder();
  66. final DirCacheEntry aSthEntry = new DirCacheEntry("a.sth");
  67. aSthEntry.setFileMode(FileMode.REGULAR_FILE);
  68. aSthEntry.setObjectId(aSth);
  69. final DirCacheEntry aTxtEntry = new DirCacheEntry("a.txt");
  70. aTxtEntry.setFileMode(FileMode.REGULAR_FILE);
  71. aTxtEntry.setObjectId(aTxt);
  72. builder.add(aSthEntry);
  73. builder.add(aTxtEntry);
  74. builder.finish();
  75. final ObjectId treeId = dc.writeTree(odi);
  76. odi.flush();
  77. final TreeWalk tw = new TreeWalk(db);
  78. tw.setFilter(PathSuffixFilter.create(".txt"));
  79. tw.addTree(treeId);
  80. List<String> paths = new LinkedList<String>();
  81. while (tw.next()) {
  82. paths.add(tw.getPathString());
  83. }
  84. List<String> expected = new LinkedList<String>();
  85. expected.add("a.txt");
  86. assertEquals(expected, paths);
  87. }
  88. @Test
  89. public void testRecursiveFiltering() throws IOException {
  90. final ObjectInserter odi = db.newObjectInserter();
  91. final ObjectId aSth = odi.insert(OBJ_BLOB, "a.sth".getBytes());
  92. final ObjectId aTxt = odi.insert(OBJ_BLOB, "a.txt".getBytes());
  93. final ObjectId bSth = odi.insert(OBJ_BLOB, "b.sth".getBytes());
  94. final ObjectId bTxt = odi.insert(OBJ_BLOB, "b.txt".getBytes());
  95. final DirCache dc = db.readDirCache();
  96. final DirCacheBuilder builder = dc.builder();
  97. final DirCacheEntry aSthEntry = new DirCacheEntry("a.sth");
  98. aSthEntry.setFileMode(FileMode.REGULAR_FILE);
  99. aSthEntry.setObjectId(aSth);
  100. final DirCacheEntry aTxtEntry = new DirCacheEntry("a.txt");
  101. aTxtEntry.setFileMode(FileMode.REGULAR_FILE);
  102. aTxtEntry.setObjectId(aTxt);
  103. builder.add(aSthEntry);
  104. builder.add(aTxtEntry);
  105. final DirCacheEntry bSthEntry = new DirCacheEntry("sub/b.sth");
  106. bSthEntry.setFileMode(FileMode.REGULAR_FILE);
  107. bSthEntry.setObjectId(bSth);
  108. final DirCacheEntry bTxtEntry = new DirCacheEntry("sub/b.txt");
  109. bTxtEntry.setFileMode(FileMode.REGULAR_FILE);
  110. bTxtEntry.setObjectId(bTxt);
  111. builder.add(bSthEntry);
  112. builder.add(bTxtEntry);
  113. builder.finish();
  114. final ObjectId treeId = dc.writeTree(odi);
  115. odi.flush();
  116. final TreeWalk tw = new TreeWalk(db);
  117. tw.setRecursive(true);
  118. tw.setFilter(PathSuffixFilter.create(".txt"));
  119. tw.addTree(treeId);
  120. List<String> paths = new LinkedList<String>();
  121. while (tw.next()) {
  122. paths.add(tw.getPathString());
  123. }
  124. List<String> expected = new LinkedList<String>();
  125. expected.add("a.txt");
  126. expected.add("sub/b.txt");
  127. assertEquals(expected, paths);
  128. }
  129. }