Du kannst nicht mehr als 25 Themen auswählen Themen müssen mit entweder einem Buchstaben oder einer Ziffer beginnen. Sie können Bindestriche („-“) enthalten und bis zu 35 Zeichen lang sein.

AbstractTreeIteratorTest.java 5.7KB

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