Examples of gnu.trove.list.TIntList

gnu.trove.list.TIntList
Interface for Trove list implementations.

        int ints[] = new int[element_count];
        for ( int i = 0; i < element_count; i++ ) {
            ints[i] = i;
        }


        TIntList list = new TIntArrayList( 20 );
        for ( int i = 0; i < element_count; i++ ) {
            list.add( i );
        }


        assertEquals( element_count, list.size() );


        assertTrue( list.removeAll( ints ) );
        assertEquals( 0, list.size() );
        assertTrue( list.isEmpty() );


        // Reset the list
        list = new TIntArrayList( 20 );
        for ( int i = 0; i < element_count; i++ ) {
            list.add( i );
        }


        ints = new int[( element_count - 4 )] ;
        for ( int i = 0, j = 0; i < ints.length; i++, j++ ) {
            if ( i % 4 == 0 ) {
                j++;
            }
            ints[i] = j;
        }


        assertTrue( list.removeAll( ints ) );
        int expected = 4;
        assertEquals( expected, list.size() );
        for ( int i = 0; i < list.size(); i++ ) {
            expected = i * 5;
            assertEquals( "expected: " + expected + ", was: " + list.get( i ) + ", list: " + list,
                expected , list.get( i ) );
        }
    }

View Full Code Here

    }




    public void testShuffle() {
        int element_count = 20;
        TIntList list = new TIntLinkedList( 20 );
        for ( int i = 0; i < element_count; i++ ) {
            list.add( i );
        }
        TIntList copy = new TIntLinkedList(list);


        list.shuffle( new Random( System.currentTimeMillis() ) );
        boolean differ = false;
        for ( int i = 0; i < list.size(); i++ ) {
            assertTrue( list.contains( i ) );
            if (copy.get(i) != list.get(i))
                differ = true;
        }


        // lost nothing
        Set<Integer> s = new HashSet<Integer>();
        for (TIntIterator iterator = list.iterator(); iterator.hasNext();) {
            int next = iterator.next();
            s.add(next);
        }
        assertTrue(s.size() == list.size());
        assertTrue(copy.size() == list.size());
        assertTrue("list not different " + copy + " shuffled= " + list, differ);
    }

View Full Code Here

    }




    public void testIterator() {
        int element_count = 20;
        TIntList list = new TIntLinkedList();
        for ( int i = 0; i < element_count; i++ ) {
            list.add( i );
        }


        TIntIterator iter = list.iterator();
        assertTrue( "iter should have next: " + list.size(), iter.hasNext() );


        int j = 0;
        while ( iter.hasNext() ) {
            int next = iter.next();
            assertEquals( j, next );
            j++;
        }
        assertFalse( iter.hasNext() );


        iter = list.iterator();
        for ( int i = 0; i < element_count / 2; i++ ) {
            iter.next();
        }
        iter.remove();
        try {

View Full Code Here

    }




    public void testShuffle() {
        int element_count = 20;
        TIntList list = new TIntArrayList( 20 );
        for ( int i = 0; i < element_count; i++ ) {
            list.add( i );
        }


        list.shuffle( new Random( System.currentTimeMillis() ) );
        for ( int i = 0; i < list.size(); i++ ) {
            assertTrue( list.contains( i ) );
        }
    }

View Full Code Here

    }




    public void testIteratorAbuseNext() {
        int element_count = 20;
        TIntList list = new TIntLinkedList();
        for ( int i = 0; i < element_count; i++ ) {
            list.add( i );
        }


        TIntIterator iter = list.iterator();
        while ( iter.hasNext() ) {
            iter.next();
        }
        assertFalse( iter.hasNext() );


        list.remove( 5, 10 );
        assertFalse( iter.hasNext() );
        try {
            iter.next();
            fail( "Expected NoSuchElementException" );
        } catch( NoSuchElementException ex ) {

View Full Code Here

        }
    }




    public void testSubList() throws Exception {
        TIntList subList = list.subList( 1, 4 );
        assertEquals( 3, subList.size() );
        assertEquals( 2, subList.get( 0 ) );
        assertEquals( 4, subList.get( 2 ) );
    }

View Full Code Here

    }




    public void testIterator() {
        int element_count = 20;
        TIntList list = new TIntArrayList();
        for ( int i = 0; i < element_count; i++ ) {
            list.add( i );
        }


        TIntIterator iter = list.iterator();
        assertTrue( "iter should have next: " + list.size(), iter.hasNext() );


        int j = 0;
        while ( iter.hasNext() ) {
            int next = iter.next();
            assertEquals( j, next );
            j++;
        }
        assertFalse( iter.hasNext() );


        iter = list.iterator();
        for ( int i = 0; i < element_count / 2; i++ ) {
            iter.next();
        }
        iter.remove();
        try {

View Full Code Here

    }




    public void testIndexOf() {
        int element_count = 20;
        TIntList a = new TIntLinkedList();
        for ( int i = 1; i <= element_count; i++ ) {
            a.add( i );
        }


        int index = a.indexOf( 10 );
        assertEquals( 9, index );


        // Add more elements, but duplicates
        for ( int i = 1; i <= element_count; i++ ) {
            a.add( i );
        }
        index = a.indexOf( 10 );
        assertEquals( 9, index );


        index = a.indexOf( 5 );
        assertEquals( 4, index );


        index = a.lastIndexOf( 5 );
        assertEquals( 24, index );


        // Non-existant entry
        index = a.indexOf( 100 );
        assertEquals( -1, index );
    }

View Full Code Here

    }




    public void testIteratorAbuseNext() {
        int element_count = 20;
        TIntList list = new TIntArrayList();
        for ( int i = 0; i < element_count; i++ ) {
            list.add( i );
        }


        TIntIterator iter = list.iterator();
        while ( iter.hasNext() ) {
            iter.next();
        }
        assertFalse( iter.hasNext() );


        list.remove( 5, 10 );
        assertFalse( iter.hasNext() );
        try {
            iter.next();
            fail( "Expected NoSuchElementException" );
        } catch( NoSuchElementException ex ) {

View Full Code Here

    }




    public void testIteratorAbuseRemove() {
        int element_count = 20;
        TIntList list = new TIntArrayList();
        for ( int i = 0; i < element_count; i++ ) {
            list.add( i );
        }


        TIntIterator iter = list.iterator();
        while ( iter.hasNext() ) {
            iter.next();
        }
        assertFalse( iter.hasNext() );


        list.remove( 5, 10 );
        assertFalse( iter.hasNext() );


        try {
            iter.remove();
            fail( "Expected ConcurrentModificationException" );

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

Related Classes of gnu.trove.list.TIntList

com.guokr.simbase.store.Recommendation

com.guokr.simbase.store.SparseVectorSet

de.lmu.ifi.dbs.elki.application.GeneratorXMLSpec

gnu.trove.list.array.TArrayListTest

gnu.trove.list.array.TPrimitiveArrayListTest

gnu.trove.list.linked.TIntLinkedList

gnu.trove.list.linked.TLinkedListTest

gnu.trove.list.linked.TPrimitiveLinkedListTest

gnu.trove.map.hash.TObjectPrimitiveHashMapTest

gnu.trove.map.hash.TPrimitiveObjectHashMapTest

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.