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.

DirCacheBuilderIteratorTest.java 3.8KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106
  1. /*
  2. * Copyright (C) 2008, 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.dircache;
  44. import static org.junit.Assert.assertEquals;
  45. import static org.junit.Assert.assertFalse;
  46. import static org.junit.Assert.assertNotNull;
  47. import static org.junit.Assert.assertSame;
  48. import static org.junit.Assert.assertTrue;
  49. import java.util.Collections;
  50. import org.eclipse.jgit.junit.RepositoryTestCase;
  51. import org.eclipse.jgit.lib.FileMode;
  52. import org.eclipse.jgit.treewalk.TreeWalk;
  53. import org.eclipse.jgit.treewalk.filter.PathFilterGroup;
  54. import org.junit.Test;
  55. public class DirCacheBuilderIteratorTest extends RepositoryTestCase {
  56. @Test
  57. public void testPathFilterGroup_DoesNotSkipTail() throws Exception {
  58. final DirCache dc = db.readDirCache();
  59. final FileMode mode = FileMode.REGULAR_FILE;
  60. final String[] paths = { "a-", "a/b", "a/c", "a/d", "a0b" };
  61. final DirCacheEntry[] ents = new DirCacheEntry[paths.length];
  62. for (int i = 0; i < paths.length; i++) {
  63. ents[i] = new DirCacheEntry(paths[i]);
  64. ents[i].setFileMode(mode);
  65. }
  66. {
  67. final DirCacheBuilder b = dc.builder();
  68. for (DirCacheEntry ent : ents) {
  69. b.add(ent);
  70. }
  71. b.finish();
  72. }
  73. final int expIdx = 2;
  74. final DirCacheBuilder b = dc.builder();
  75. try (TreeWalk tw = new TreeWalk(db)) {
  76. tw.addTree(new DirCacheBuildIterator(b));
  77. tw.setRecursive(true);
  78. tw.setFilter(PathFilterGroup.createFromStrings(Collections
  79. .singleton(paths[expIdx])));
  80. assertTrue("found " + paths[expIdx], tw.next());
  81. final DirCacheIterator c = tw.getTree(0, DirCacheIterator.class);
  82. assertNotNull(c);
  83. assertEquals(expIdx, c.ptr);
  84. assertSame(ents[expIdx], c.getDirCacheEntry());
  85. assertEquals(paths[expIdx], tw.getPathString());
  86. assertEquals(mode.getBits(), tw.getRawMode(0));
  87. assertSame(mode, tw.getFileMode(0));
  88. b.add(c.getDirCacheEntry());
  89. assertFalse("no more entries", tw.next());
  90. }
  91. b.finish();
  92. assertEquals(ents.length, dc.getEntryCount());
  93. for (int i = 0; i < ents.length; i++)
  94. assertSame(ents[i], dc.getEntry(i));
  95. }
  96. }