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

added crc logic for datafile access

Browse source
This commit is contained in:
Arndt Brenschede 2014-02-02 17:04:17 +01:00
parent e88465f5ec
commit b4aa961f2d
26 changed files with 621 additions and 1364 deletions
Download patch file Download diff file Expand all files Collapse all files

60
brouter-util/src/test/java/btools/util/CompactSetTest.java Normal file
View file

@ -0,0 +1,60 @@
package btools.util;
import java.util.Random;
import java.util.HashSet;
import org.junit.Assert;
import org.junit.Test;
public class CompactSetTest
{
@Test
public void hashSetComparisonTest()
{
hashSetComparison( 0, 1 );
hashSetComparison( 1, 1 );
hashSetComparison( 2, 2 );
hashSetComparison( 3, 3 );
hashSetComparison( 4, 4 );
hashSetComparison( 5, 5 );
hashSetComparison( 7, 10 );
hashSetComparison( 8, 10 );
hashSetComparison( 10000, 20000 );
}
private void hashSetComparison( int setsize, int trycount )
{
Random rand = new Random( 12345 );
HashSet<Long> hset = new HashSet<Long>();
CompactLongSet cset_slow = new CompactLongSet();
CompactLongSet cset_fast = new CompactLongSet();
for( int i=0; i<setsize; i++ )
{
long k = setsize < 10 ? i : rand.nextInt( 20000 );
Long KK = new Long( k );
if ( !hset.contains( KK ) )
{
hset.add( KK );
cset_slow.add( k );
cset_fast.fastAdd( k );
}
}
for( int i=0; i<trycount*2; i++ )
{
if ( i == trycount )
{
cset_slow = new FrozenLongSet( cset_slow );
cset_fast = new FrozenLongSet( cset_fast );
}
long k = setsize < 10 ? i : rand.nextInt( 20000 );
Long KK = new Long( k );
boolean contained = hset.contains( KK );
Assert.assertTrue( "contains missmatch (slow)", contained == cset_slow.contains( k ) );
Assert.assertTrue( "contains missmatch (fast)", contained == cset_fast.contains( k ) );
}
}
}