Skip to content

Commit

Permalink
Fix newlines
Browse files Browse the repository at this point in the history
  • Loading branch information
peter-lawrey committed May 7, 2024
1 parent caaa54c commit 87e7beb
Show file tree
Hide file tree
Showing 14 changed files with 2 additions and 17 deletions.
1 change: 0 additions & 1 deletion .mvn/wrapper/MavenWrapperDownloader.java
Original file line number Diff line number Diff line change
Expand Up @@ -113,5 +113,4 @@ protected PasswordAuthentication getPasswordAuthentication() {
fos.close();
rbc.close();
}

}
1 change: 0 additions & 1 deletion src/main/java/net/openhft/hashing/CityAndFarmHash_1_1.java
Original file line number Diff line number Diff line change
Expand Up @@ -320,7 +320,6 @@ static LongHashFunction asLongHashFunctionWithTwoSeeds(long seed0, long seed1) {
return new AsLongHashFunctionSeeded(seed0, seed1);
}


// FarmHash

private static <T> long naHashLen33To64(Access<T> access, T in, long off, long len) {
Expand Down
1 change: 0 additions & 1 deletion src/main/java/net/openhft/hashing/MurmurHash_3.java
Original file line number Diff line number Diff line change
Expand Up @@ -182,7 +182,6 @@ private static long finalize(long length, long h1, long h2, @Nullable long[] res
h1 = fmix64(h1);
h2 = fmix64(h2);


if (null != result) {
h1 += h2;
result[0] = h1;
Expand Down
1 change: 0 additions & 1 deletion src/test/java/net/openhft/hashing/City64_1_1_Test.java
Original file line number Diff line number Diff line change
Expand Up @@ -51,7 +51,6 @@ public void testCityWithOneSeed() {
test(LongHashFunction.city_1_1(0L, 0L), HASHES_OF_LOOPING_BYTES_WITH_SEEDS_0_0);
}


public void test(LongHashFunction city, long[] hashesOfLoopingBytes) {
byte[] data = new byte[len];
for (int j = 0; j < data.length; j++) {
Expand Down
1 change: 0 additions & 1 deletion src/test/java/net/openhft/hashing/FarmHashTest.java
Original file line number Diff line number Diff line change
Expand Up @@ -59,5 +59,4 @@ public void testNa() {
LongHashFunctionTest.test(f, data, f.hashBytes(data));
}
}

}
Original file line number Diff line number Diff line change
Expand Up @@ -122,7 +122,6 @@ private static void testArrays(LongHashFunction f, byte[] data, long eh, int len
System.arraycopy(shorts, 0, shorts2, 1, shortLen);
assertEquals("short array off len", eh, f.hashShorts(shorts2, 1, shortLen));


char[] chars = new char[shortLen];
bb.asCharBuffer().get(chars);
assertEquals("char array", eh, f.hashChars(chars));
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -158,7 +158,6 @@ private static void testArrays(LongTupleHashFunction f, byte[] data, long[] eh,
System.arraycopy(shorts, 0, shorts2, 1, shortLen);
assertArrayEquals("short array off len", eh, f.hashShorts(shorts2, 1, shortLen));


char[] chars = new char[shortLen];
bb.asCharBuffer().get(chars);
assertArrayEquals("char array", eh, f.hashChars(chars));
Expand Down
3 changes: 1 addition & 2 deletions src/test/java/net/openhft/hashing/MetroHashTest.java
Original file line number Diff line number Diff line change
Expand Up @@ -22,7 +22,6 @@ public static Collection<Object[]> data() {
@Parameterized.Parameter
public int len;


@Test
public void testMetroWithoutSeeds() {
test(LongHashFunction.metro(), HASHES_OF_LOOPING_BYTES_WITHOUT_SEED);
Expand Down Expand Up @@ -2123,4 +2122,4 @@ public void test(LongHashFunction metro, long[] hashesOfLoopingBytes) {
2937352060494234522L,
-2470412390340197582L
};
}
}
1 change: 0 additions & 1 deletion src/test/java/net/openhft/hashing/MurmurHash3Test.java
Original file line number Diff line number Diff line change
Expand Up @@ -16,7 +16,6 @@

package net.openhft.hashing;


import com.google.common.hash.HashFunction;
import com.google.common.hash.Hashing;
import org.junit.Test;
Expand Down
3 changes: 1 addition & 2 deletions src/test/java/net/openhft/hashing/OriginalFarmHashTest.java
Original file line number Diff line number Diff line change
Expand Up @@ -133,7 +133,6 @@ static int testUo(int offset, int len, int expectedIndex) {
return expectedIndex;
}


@Test
public void testUoGo() {
for (Object[] g : GOLDEN_64) {
Expand Down Expand Up @@ -1268,7 +1267,7 @@ public void testUoGo() {
4144237690L, 3350490823L,
4166253320L, 2747410691L,
};

static final long[] UO_EXPECTED = {
3277735313L, 2681724312L,
2598464059L, 797982799L,
Expand Down
1 change: 0 additions & 1 deletion src/test/java/net/openhft/hashing/WyHashTest.java
Original file line number Diff line number Diff line change
Expand Up @@ -31,7 +31,6 @@ public void testWyHasWithOneSeed() {
test(LongHashFunction.wy_3(42L), HASHES_OF_LOOPING_BYTES_WITH_SEED_42);
}


public void test(LongHashFunction wyHash, long[] hashesOfLoopingBytes) {
byte[] data = new byte[len];
for (int j = 0; j < data.length; j++) {
Expand Down
1 change: 0 additions & 1 deletion src/test/java/net/openhft/hashing/XXH128Test.java
Original file line number Diff line number Diff line change
Expand Up @@ -61,7 +61,6 @@ public void test(LongTupleHashFunction h, LongHashFunction hl, long[][] hashesOf
LongHashFunctionTest.test(hl, data, hashesOfLoopingBytes[len][0]);
}
}

/**
* Test data is output of the following program with xxh3 implementation
* from https://github.com/Cyan4973/xxHash
Expand Down
2 changes: 0 additions & 2 deletions src/test/java/net/openhft/hashing/XXH3Test.java
Original file line number Diff line number Diff line change
Expand Up @@ -52,7 +52,6 @@ public void testXXH3WithOneSeed() {
test(LongHashFunction.xx3(42L), XXH3Test_HASHES.HASHES_OF_LOOPING_BYTES_WITH_SEED_42);
}


public void test(LongHashFunction h, long[] hashesOfLoopingBytes) {
byte[] data = new byte[len];
for (int j = 0; j < data.length; j++) {
Expand All @@ -61,7 +60,6 @@ public void test(LongHashFunction h, long[] hashesOfLoopingBytes) {
LongHashFunctionTest.test(h, data, hashesOfLoopingBytes[len]);
}
}

/**
* Test data is output of the following program with xxh3 implementation
* from https://github.com/Cyan4973/xxHash
Expand Down
1 change: 0 additions & 1 deletion src/test/java/net/openhft/hashing/XxHashTest.java
Original file line number Diff line number Diff line change
Expand Up @@ -48,7 +48,6 @@ public void testCityWithOneSeed() {
test(LongHashFunction.xx(42L), HASHES_OF_LOOPING_BYTES_WITH_SEED_42);
}


public void test(LongHashFunction city, long[] hashesOfLoopingBytes) {
byte[] data = new byte[len];
for (int j = 0; j < data.length; j++) {
Expand Down

0 comments on commit 87e7beb

Please sign in to comment.