Nelze vybrat více než 25 témat Téma musí začínat písmenem nebo číslem, může obsahovat pomlčky („-“) a může být dlouhé až 35 znaků.

SimilarityIndexTest.java 4.6KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151
  1. /*
  2. * Copyright (C) 2010, 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.diff;
  44. import java.io.ByteArrayInputStream;
  45. import java.io.IOException;
  46. import junit.framework.TestCase;
  47. import org.eclipse.jgit.lib.Constants;
  48. public class SimilarityIndexTest extends TestCase {
  49. public void testIndexingSmallObject() {
  50. SimilarityIndex si = hash("" //
  51. + "A\n" //
  52. + "B\n" //
  53. + "D\n" //
  54. + "B\n" //
  55. );
  56. int key_A = keyFor("A\n");
  57. int key_B = keyFor("B\n");
  58. int key_D = keyFor("D\n");
  59. assertTrue(key_A != key_B && key_A != key_D && key_B != key_D);
  60. assertEquals(3, si.size());
  61. assertEquals(2, si.count(si.findIndex(key_A)));
  62. assertEquals(4, si.count(si.findIndex(key_B)));
  63. assertEquals(2, si.count(si.findIndex(key_D)));
  64. }
  65. public void testIndexingLargeObject() throws IOException {
  66. byte[] in = ("" //
  67. + "A\n" //
  68. + "B\n" //
  69. + "B\n" //
  70. + "B\n").getBytes("UTF-8");
  71. SimilarityIndex si = new SimilarityIndex();
  72. si.hash(new ByteArrayInputStream(in), in.length);
  73. assertEquals(2, si.size());
  74. }
  75. public void testCommonScore_SameFiles() {
  76. String text = "" //
  77. + "A\n" //
  78. + "B\n" //
  79. + "D\n" //
  80. + "B\n";
  81. SimilarityIndex src = hash(text);
  82. SimilarityIndex dst = hash(text);
  83. assertEquals(8, src.common(dst));
  84. assertEquals(8, dst.common(src));
  85. assertEquals(100, src.score(dst, 100));
  86. assertEquals(100, dst.score(src, 100));
  87. }
  88. public void testCommonScore_EmptyFiles() {
  89. SimilarityIndex src = hash("");
  90. SimilarityIndex dst = hash("");
  91. assertEquals(0, src.common(dst));
  92. assertEquals(0, dst.common(src));
  93. }
  94. public void testCommonScore_TotallyDifferentFiles() {
  95. SimilarityIndex src = hash("A\n");
  96. SimilarityIndex dst = hash("D\n");
  97. assertEquals(0, src.common(dst));
  98. assertEquals(0, dst.common(src));
  99. }
  100. public void testCommonScore_SimiliarBy75() {
  101. SimilarityIndex src = hash("A\nB\nC\nD\n");
  102. SimilarityIndex dst = hash("A\nB\nC\nQ\n");
  103. assertEquals(6, src.common(dst));
  104. assertEquals(6, dst.common(src));
  105. assertEquals(75, src.score(dst, 100));
  106. assertEquals(75, dst.score(src, 100));
  107. }
  108. private static SimilarityIndex hash(String text) {
  109. SimilarityIndex src = new SimilarityIndex() {
  110. @Override
  111. void hash(byte[] raw, int ptr, final int end) {
  112. while (ptr < end) {
  113. int hash = raw[ptr] & 0xff;
  114. int start = ptr;
  115. do {
  116. int c = raw[ptr++] & 0xff;
  117. if (c == '\n')
  118. break;
  119. } while (ptr < end && ptr - start < 64);
  120. add(hash, ptr - start);
  121. }
  122. }
  123. };
  124. byte[] raw = Constants.encode(text);
  125. src.setFileSize(raw.length);
  126. src.hash(raw, 0, raw.length);
  127. src.sort();
  128. return src;
  129. }
  130. private static int keyFor(String line) {
  131. SimilarityIndex si = hash(line);
  132. assertEquals("single line scored", 1, si.size());
  133. return si.key(0);
  134. }
  135. }