ben/brouter
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions 1

Reformat whole codebase using Android Studio

Browse source
This commit is contained in:
Manuel Fuhr 2022-07-11 06:30:17 +02:00
parent d5322667d5
commit c15913c1ab
161 changed files with 15124 additions and 18537 deletions
Download patch file Download diff file Expand all files Collapse all files

103
brouter-util/src/test/java/btools/util/DenseLongMapTest.java
View file

@ -7,107 +7,94 @@ import java.util.HashSet;
import org.junit.Assert;
import org.junit.Test;
public class DenseLongMapTest
{
public class DenseLongMapTest {
@Test
public void hashMapComparisonTest()
{
hashMapComparison( 100000, 100000, 100000 );
hashMapComparison( 100000, 100000, 13000000 );
public void hashMapComparisonTest() {
hashMapComparison(100000, 100000, 100000);
hashMapComparison(100000, 100000, 13000000);
}
private void hashMapComparison( int mapsize, int trycount, long keyrange )
{
Random rand = new Random( 12345 );
HashMap<Long,Integer> hmap = new HashMap<Long,Integer>();
DenseLongMap dmap = new DenseLongMap( 512 );
private void hashMapComparison(int mapsize, int trycount, long keyrange) {
Random rand = new Random(12345);
HashMap<Long, Integer> hmap = new HashMap<Long, Integer>();
DenseLongMap dmap = new DenseLongMap(512);
for( int i=0; i<mapsize; i++ )
{
int value = i%255;
long k = (long)(rand.nextDouble()*keyrange);
Long KK = new Long( k );
for (int i = 0; i < mapsize; i++) {
int value = i % 255;
long k = (long) (rand.nextDouble() * keyrange);
Long KK = new Long(k);
hmap.put( KK, new Integer ( value ) );
dmap.put( k, value ); // duplicate puts allowed!
hmap.put(KK, new Integer(value));
dmap.put(k, value); // duplicate puts allowed!
}
for( int i=0; i<trycount; i++ )
{
long k = (long)(rand.nextDouble()*keyrange);
Long KK = new Long( k );
Integer VV = hmap.get( KK );
for (int i = 0; i < trycount; i++) {
long k = (long) (rand.nextDouble() * keyrange);
Long KK = new Long(k);
Integer VV = hmap.get(KK);
int hvalue = VV == null ? -1 : VV.intValue();
int dvalue = dmap.getInt( k );
int dvalue = dmap.getInt(k);
if ( hvalue != dvalue )
{
Assert.fail( "value missmatch for key " + k + " hashmap=" + hvalue + " densemap=" + dvalue );
if (hvalue != dvalue) {
Assert.fail("value missmatch for key " + k + " hashmap=" + hvalue + " densemap=" + dvalue);
}
}
}
@Test
public void oneBitTest()
{
public void oneBitTest() {
int keyrange = 300000;
int mapputs = 100000;
int trycount = 100000;
Random rand = new Random( 12345 );
Random rand = new Random(12345);
HashSet<Long> hset = new HashSet<Long>();
DenseLongMap dmap = new DenseLongMap( 512 );
for( int i=0; i<mapputs; i++ )
{
long k = (long)(rand.nextDouble()*keyrange);
hset.add( new Long( k ) );
dmap.put( k, 0 );
DenseLongMap dmap = new DenseLongMap(512);
for (int i = 0; i < mapputs; i++) {
long k = (long) (rand.nextDouble() * keyrange);
hset.add(new Long(k));
dmap.put(k, 0);
}
for( int i=0; i<trycount; i++ )
{
long k = (long)(rand.nextDouble()*keyrange);
boolean hcontains = hset.contains( new Long( k ) );
boolean dcontains = dmap.getInt( k ) == 0;
for (int i = 0; i < trycount; i++) {
long k = (long) (rand.nextDouble() * keyrange);
boolean hcontains = hset.contains(new Long(k));
boolean dcontains = dmap.getInt(k) == 0;
if ( hcontains != dcontains )
{
Assert.fail( "value missmatch for key " + k + " hashset=" + hcontains + " densemap=" + dcontains );
if (hcontains != dcontains) {
Assert.fail("value missmatch for key " + k + " hashset=" + hcontains + " densemap=" + dcontains);
}
}
}
// @Test - memory test disabled for load reasons
public void memoryUsageTest()
{
public void memoryUsageTest() {
int keyrange = 32000000;
int mapputs = keyrange * 2;
Random rand = new Random( 12345 );
DenseLongMap dmap = new DenseLongMap( 6 );
Random rand = new Random(12345);
DenseLongMap dmap = new DenseLongMap(6);
System.gc();
long mem1 = Runtime.getRuntime().totalMemory() - Runtime.getRuntime().freeMemory();
for( int i=0; i<mapputs; i++ )
{
int value = i%63;
long k = (long)(rand.nextDouble()*keyrange);
dmap.put( k, value );
for (int i = 0; i < mapputs; i++) {
int value = i % 63;
long k = (long) (rand.nextDouble() * keyrange);
dmap.put(k, value);
}
System.gc();
long mem2 = Runtime.getRuntime().totalMemory() - Runtime.getRuntime().freeMemory();
long memusage = mem2-mem1;
long memusage = mem2 - mem1;
if ( memusage > (keyrange/8)*7 )
{
Assert.fail( "memory usage too high: " + memusage + " for keyrange " + keyrange );
if (memusage > (keyrange / 8) * 7) {
Assert.fail("memory usage too high: " + memusage + " for keyrange " + keyrange);
}
// need to use the map again for valid memory measure
Assert.assertTrue( "out of range test", dmap.getInt(-1) == -1 );
Assert.assertTrue("out of range test", dmap.getInt(-1) == -1);
}
}