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.

AbstractTreeIteratorTest.java 5.8KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170
  1. /*
  2. * Copyright (C) 2009, Google Inc.
  3. * Copyright (C) 2009, Tor Arne Vestbø <torarnv@gmail.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.treewalk;
  45. import java.io.IOException;
  46. import junit.framework.TestCase;
  47. import org.eclipse.jgit.errors.IncorrectObjectTypeException;
  48. import org.eclipse.jgit.lib.Constants;
  49. import org.eclipse.jgit.lib.FileMode;
  50. import org.eclipse.jgit.lib.ObjectReader;
  51. import org.eclipse.jgit.lib.CoreConfig.AutoCRLF;
  52. public class AbstractTreeIteratorTest extends TestCase {
  53. private static String prefix(String path) {
  54. final int s = path.lastIndexOf('/');
  55. return s > 0 ? path.substring(0, s) : "";
  56. }
  57. public class FakeTreeIterator extends WorkingTreeIterator {
  58. public FakeTreeIterator(String pathName, FileMode fileMode) {
  59. super(prefix(pathName), new WorkingTreeOptions(AutoCRLF.FALSE));
  60. mode = fileMode.getBits();
  61. final int s = pathName.lastIndexOf('/');
  62. final byte[] name = Constants.encode(pathName.substring(s + 1));
  63. ensurePathCapacity(pathOffset + name.length, pathOffset);
  64. System.arraycopy(name, 0, path, pathOffset, name.length);
  65. pathLen = pathOffset + name.length;
  66. }
  67. @Override
  68. public AbstractTreeIterator createSubtreeIterator(ObjectReader reader)
  69. throws IncorrectObjectTypeException, IOException {
  70. return null;
  71. }
  72. }
  73. public void testPathCompare() throws Exception {
  74. assertTrue(new FakeTreeIterator("a", FileMode.REGULAR_FILE).pathCompare(
  75. new FakeTreeIterator("a", FileMode.TREE)) < 0);
  76. assertTrue(new FakeTreeIterator("a", FileMode.TREE).pathCompare(
  77. new FakeTreeIterator("a", FileMode.REGULAR_FILE)) > 0);
  78. assertTrue(new FakeTreeIterator("a", FileMode.REGULAR_FILE).pathCompare(
  79. new FakeTreeIterator("a", FileMode.REGULAR_FILE)) == 0);
  80. assertTrue(new FakeTreeIterator("a", FileMode.TREE).pathCompare(
  81. new FakeTreeIterator("a", FileMode.TREE)) == 0);
  82. }
  83. public void testGrowPath() throws Exception {
  84. final FakeTreeIterator i = new FakeTreeIterator("ab", FileMode.TREE);
  85. final byte[] origpath = i.path;
  86. assertEquals(i.path[0], 'a');
  87. assertEquals(i.path[1], 'b');
  88. i.growPath(2);
  89. assertNotSame(origpath, i.path);
  90. assertEquals(origpath.length * 2, i.path.length);
  91. assertEquals(i.path[0], 'a');
  92. assertEquals(i.path[1], 'b');
  93. }
  94. public void testEnsurePathCapacityFastCase() throws Exception {
  95. final FakeTreeIterator i = new FakeTreeIterator("ab", FileMode.TREE);
  96. final int want = 50;
  97. final byte[] origpath = i.path;
  98. assertEquals(i.path[0], 'a');
  99. assertEquals(i.path[1], 'b');
  100. assertTrue(want < i.path.length);
  101. i.ensurePathCapacity(want, 2);
  102. assertSame(origpath, i.path);
  103. assertEquals(i.path[0], 'a');
  104. assertEquals(i.path[1], 'b');
  105. }
  106. public void testEnsurePathCapacityGrows() throws Exception {
  107. final FakeTreeIterator i = new FakeTreeIterator("ab", FileMode.TREE);
  108. final int want = 384;
  109. final byte[] origpath = i.path;
  110. assertEquals(i.path[0], 'a');
  111. assertEquals(i.path[1], 'b');
  112. assertTrue(i.path.length < want);
  113. i.ensurePathCapacity(want, 2);
  114. assertNotSame(origpath, i.path);
  115. assertEquals(512, i.path.length);
  116. assertEquals(i.path[0], 'a');
  117. assertEquals(i.path[1], 'b');
  118. }
  119. public void testEntryFileMode() {
  120. for (FileMode m : new FileMode[] { FileMode.TREE,
  121. FileMode.REGULAR_FILE, FileMode.EXECUTABLE_FILE,
  122. FileMode.GITLINK, FileMode.SYMLINK }) {
  123. final FakeTreeIterator i = new FakeTreeIterator("a", m);
  124. assertEquals(m.getBits(), i.getEntryRawMode());
  125. assertSame(m, i.getEntryFileMode());
  126. }
  127. }
  128. public void testEntryPath() {
  129. FakeTreeIterator i = new FakeTreeIterator("a/b/cd", FileMode.TREE);
  130. assertEquals("a/b/cd", i.getEntryPathString());
  131. assertEquals(2, i.getNameLength());
  132. byte[] b = new byte[3];
  133. b[0] = 0x0a;
  134. i.getName(b, 1);
  135. assertEquals(0x0a, b[0]);
  136. assertEquals('c', b[1]);
  137. assertEquals('d', b[2]);
  138. }
  139. public void testCreateEmptyTreeIterator() {
  140. FakeTreeIterator i = new FakeTreeIterator("a/b/cd", FileMode.TREE);
  141. EmptyTreeIterator e = i.createEmptyTreeIterator();
  142. assertNotNull(e);
  143. assertEquals(i.getEntryPathString() + "/", e.getEntryPathString());
  144. }
  145. }