it.unimi.dsi.fastutil.longs.LongArrayFrontCodedListTest Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of fastutil Show documentation

fastutil extends the Java Collections Framework by providing type-specific maps, sets, lists, and queues with a small memory footprint and fast access and insertion; it provides also big (64-bit) arrays, sets and lists, sorting algorithms, fast, practical I/O classes for binary and text files, and facilities for memory mapping large files. Note that if you have both this jar and fastutil-core.jar in your dependencies, fastutil-core.jar should be excluded.

There is a newer version: 8.5.15

Show newest version

package it.unimi.dsi.fastutil.longs;

import it.unimi.dsi.fastutil.objects.ObjectListIterator;

import java.io.IOException;

import static org.junit.Assert.*;
import org.junit.Test;

@SuppressWarnings({ "rawtypes", "unchecked" })
public class LongArrayFrontCodedListTest {


	private static java.util.Random r = new java.util.Random( 0 );

	private static long genKey() {
		return r.nextLong();
	}

	private static boolean contentEquals( java.util.List x, java.util.List y ) {
		if ( x.size() != y.size() ) return false;
		for ( int i = 0; i < x.size(); i++ )
			if ( !java.util.Arrays.equals( (long[])x.get( i ), (long[])y.get( i ) ) ) return false;
		return true;
	}

	private static int l[];

	private static long[][] a;

	private static void test( int n ) throws IOException, ClassNotFoundException {
		l = new int[ n ];
		a = new long[ n ][];
		for ( int i = 0; i < n; i++ )
			l[ i ] = (int)( Math.abs( r.nextGaussian() ) * 32 );
		for ( int i = 0; i < n; i++ )
			a[ i ] = new long[ l[ i ] ];
		for ( int i = 0; i < n; i++ )
			for ( int j = 0; j < l[ i ]; j++ )
				a[ i ][ j ] = genKey();
		LongArrayFrontCodedList m = new LongArrayFrontCodedList( it.unimi.dsi.fastutil.objects.ObjectIterators.wrap( a ), r.nextInt( 4 ) + 1 );
		it.unimi.dsi.fastutil.objects.ObjectArrayList t = new it.unimi.dsi.fastutil.objects.ObjectArrayList( a );
		// System.out.println(m);
		// for( i = 0; i < t.size(); i++ )
		// System.out.println(ARRAY_LIST.wrap((KEY_TYPE[])t.get(i)));
		/* Now we check that m actually holds that data. */
		assertTrue( "Error: m does not equal t at creation", contentEquals( m, t ) );
		/* Now we check cloning. */
		assertTrue( "Error: m does not equal m.clone()", contentEquals( m, m.clone() ) );
		/* Now we play with iterators. */
		{
			ObjectListIterator i;
			java.util.ListIterator j;
			i = m.listIterator();
			j = t.listIterator();
			for ( int k = 0; k < 2 * n; k++ ) {
				assertTrue( "Error: divergence in hasNext()", i.hasNext() == j.hasNext() );
				assertTrue( "Error: divergence in hasPrevious()", i.hasPrevious() == j.hasPrevious() );
				if ( r.nextFloat() < .8 && i.hasNext() ) {
					assertTrue( "Error: divergence in next()", java.util.Arrays.equals( (long[])i.next(), (long[])j.next() ) );
				}
				else if ( r.nextFloat() < .2 && i.hasPrevious() ) {
					assertTrue( "Error: divergence in previous()", java.util.Arrays.equals( (long[])i.previous(), (long[])j.previous() ) );
				}
				assertTrue( "Error: divergence in nextIndex()", i.nextIndex() == j.nextIndex() );
				assertTrue( "Error: divergence in previousIndex()", i.previousIndex() == j.previousIndex() );
			}
		}
		{
			int from = r.nextInt( m.size() + 1 );
			ObjectListIterator i;
			java.util.ListIterator j;
			i = m.listIterator( from );
			j = t.listIterator( from );
			for ( int k = 0; k < 2 * n; k++ ) {
				assertTrue( "Error: divergence in hasNext() (iterator with starting point " + from + ")", i.hasNext() == j.hasNext() );
				assertTrue( "Error: divergence in hasPrevious() (iterator with starting point " + from + ")", i.hasPrevious() == j.hasPrevious() );
				if ( r.nextFloat() < .8 && i.hasNext() ) {
					assertTrue( "Error: divergence in next() (iterator with starting point " + from + ")", java.util.Arrays.equals( (long[])i.next(), (long[])j.next() ) );
					// System.err.println("Done next " + I + " " + J + "  " + badPrevious);
				}
				else if ( r.nextFloat() < .2 && i.hasPrevious() ) {
					assertTrue( "Error: divergence in previous() (iterator with starting point " + from + ")", java.util.Arrays.equals( (long[])i.previous(), (long[])j.previous() ) );
				}
			}
		}
		java.io.File ff = new java.io.File( "it.unimi.dsi.fastutil.test" );
		java.io.OutputStream os = new java.io.FileOutputStream( ff );
		java.io.ObjectOutputStream oos = new java.io.ObjectOutputStream( os );
		oos.writeObject( m );
		oos.close();
		java.io.InputStream is = new java.io.FileInputStream( ff );
		java.io.ObjectInputStream ois = new java.io.ObjectInputStream( is );
		m = (LongArrayFrontCodedList)ois.readObject();
		ois.close();
		ff.delete();
		assertTrue( "Error: m does not equal t after save/read", contentEquals( m, t ) );
		return;
	}

	@Test
	public void test1() throws IOException, ClassNotFoundException {
		test( 1 );
	}

	@Test
	public void test10() throws Exception, ClassNotFoundException {
		test( 10 );
	}

	@Test
	public void test100() throws IOException, ClassNotFoundException {
		test( 100 );
	}

	@Test
	public void test1000() throws IOException, ClassNotFoundException {
		test( 1000 );
	}

	@Test
	public void test10000() throws IOException, ClassNotFoundException {
		test( 10000 );
	}
}