Examples of gnu.trove.set.TIntSet

gnu.trove.set.TIntSet
An implementation of the Set interface that uses an open-addressed hash table to store its contents. Created: Sat Nov 3 10:38:17 2001 @author Eric D. Friedman, Rob Eden, Jeff Randall @version $Id: _E_Set.template,v 1.1.2.5 2009/09/15 02:38:31 upholderoftruth Exp $

        assertEquals( set, deserialized );
    }




    public void testToArray() {
        TIntSet raw_set = new TIntHashSet();
        Set<Integer> set = TDecorators.wrap( raw_set );
        Integer[] ints = {42, 1138, 13, 86, 99};
        set.addAll( Arrays.asList( ints ) );
        Object[] obj_res = set.toArray();
        Arrays.sort( ints );

View Full Code Here


    }




    public void testToArrayMatchesIteratorOrder() {
        TIntSet raw_set = new TIntHashSet();
        Set<Integer> set = TDecorators.wrap( raw_set );
        Integer[] ints = {42, 1138, 13, 86, 99};
        set.addAll( Arrays.asList( ints ) );
        Integer[] toarray_ints = set.toArray( new Integer[ints.length] );

View Full Code Here

    }




    public void testToArrayWithParams() {
        int no_entry_value = Integer.MIN_VALUE;
        TIntSet raw_set = new TIntHashSet( 10, 0.5f, no_entry_value );
        Set<Integer> set = TDecorators.wrap( raw_set );


        Integer[] ints = {42, 1138, 13, 86, 99};
        set.addAll( Arrays.asList( ints ) );

View Full Code Here

    }




    public void testRehashing() throws Exception {
        int size = 10000;
        TIntSet set = new TIntHashSet( 10 );
        for ( int i = 0; i < size; i++ ) {
            set.add( i );
        }
        assertEquals( set.size(), size );
    }

View Full Code Here

    }




    public void testIterator() {


        TIntSet raw_set = new TIntHashSet();
        Set<Integer> set = TDecorators.wrap( raw_set );
        set.add( 1 );
        set.add( 2 );
        set.add( 3 );
        set.add( 4 );

View Full Code Here

    }




    public void testIteratorRemove() {


        TIntSet raw_set = new TIntHashSet();
        Set<Integer> set = TDecorators.wrap( raw_set );
        set.add( 1 );
        set.add( 2 );
        set.add( 3 );
        set.add( 4 );

View Full Code Here






    public void testEquals() {
        Integer[] ints = {1138, 42, 86, 99, 101};
        TIntSet raw_set = new TIntHashSet();
        Set<Integer> set = TDecorators.wrap( raw_set );
        set.addAll( Arrays.asList( ints ) );
        TIntSet raw_other = new TIntHashSet();
        Set<Integer> other = TDecorators.wrap( raw_other );
        other.addAll( Arrays.asList( ints ) );


        assertTrue( "sets incorrectly not equal: " + set + ", " + other,
                set.equals( other ) );


        int[] mismatched = {72, 49, 53, 1024, 999};
        TIntSet raw_unequal = new TIntHashSet();
        raw_unequal.addAll( mismatched );
        Set<Integer> unequal = TDecorators.wrap( raw_unequal );


        assertFalse( "sets incorrectly equal: " + set + ", " + unequal,
                set.equals( unequal ) );

View Full Code Here

    }




    public void testHashcode() {
        int[] ints = {1138, 42, 86, 99, 101};
        TIntSet raw_set = new TIntHashSet();
        raw_set.addAll( ints );
        Set<Integer> set = TDecorators.wrap( raw_set );
        TIntSet raw_other = new TIntHashSet();
        raw_other.addAll( ints );
        Set<Integer> other = TDecorators.wrap( raw_other );


        assertTrue( "hashcodes incorrectly not equal: " + set + ", " + other,
                set.hashCode() == other.hashCode() );


        int[] mismatched = {72, 49, 53, 1024, 999};
        TIntSet unequal = new TIntHashSet();
        unequal.addAll( mismatched );


        assertFalse( "hashcodes unlikely equal: " + set + ", " + unequal,
                set.hashCode() == unequal.hashCode() );
    }

View Full Code Here

        for ( int i = 0; i < keys.length; i++ ) {
            vals[i] = keys[i] * 2;
            map.put( keys[i], vals[i] );
        }


        TIntSet set = map.keySet();
        int[] sorted_keys = new int[ keys.length ];
        System.arraycopy( keys, 0, sorted_keys, 0, keys.length );
        Arrays.sort( sorted_keys );
        int[] setarray = set.toArray();
        Arrays.sort( setarray );
        assertTrue( "expected: " + Arrays.toString( sorted_keys ) +
                    ", was: " + Arrays.toString( setarray ),
                Arrays.equals( sorted_keys, setarray ) );


        setarray = set.toArray( new int[0] );
        Arrays.sort( setarray );
        assertTrue( "expected: " + Arrays.toString( sorted_keys ) +
                    ", was: " + Arrays.toString( setarray ),
                Arrays.equals( sorted_keys, setarray ) );


        assertFalse( "remove of element not in set succeded: " + set, set.remove( 1 ) );
        assertEquals( keys.length, set.size() );
        assertEquals( keys.length, map.size() );


        assertTrue( "remove of element in set failed: " + set, set.remove( 42 ) );
        assertEquals( keys.length - 1, set.size() );
        assertEquals( keys.length - 1, map.size() );


        try {
            set.add( 42 );
            fail( "Expected UnsupportedOperationException" );
        }
        catch ( UnsupportedOperationException ex ) {
            // Expected
        }

View Full Code Here

        for ( int i = 0; i < keys.length; i++ ) {
            vals[i] = keys[i] * 2;
            map.put( keys[i], vals[i] );
        }


        TIntSet set = map.keySet();
        assertEquals( map.size(), set.size() );
        assertFalse( set.isEmpty() );


        // test with a java.util.Map
        Set<Number> java_set = new HashSet<Number>();
        for ( int i = 0; i < keys.length; i++ ) {
            java_set.add( Integer.valueOf( keys[i] ) );
        }
        assertTrue( set.containsAll( java_set ) );
        java_set.add( Integer.valueOf( 12 ) );
        assertFalse( set.containsAll( java_set ) );
        java_set.remove( Integer.valueOf( 12 ) );
        assertTrue( set.containsAll( java_set ) );
        java_set.add( Long.valueOf( 12 ) );
        assertFalse( set.containsAll( java_set ) );


        // test with a TCollection
        TIntSet tintset = new TIntHashSet( keys );
        assertTrue( set.containsAll( tintset ) );
        tintset.add( 12 );
        assertFalse( set.containsAll( tintset ) );


        // test raw array
        assertTrue( set.containsAll( keys ) );
        keys[3] = keys[3] + 1;

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

Related Classes of gnu.trove.set.TIntSet

cc.redberry.core.parser.ParseUtils

cc.redberry.core.transformations.substitutions.SubstitutionIterator$SumFC

com.guokr.simbase.store.Recommendation

com.starlight.intrepid.RemoteCallHandler

edu.ucla.sspace.common.Similarity

edu.ucla.sspace.graph.ChineseWhispersClustering

edu.ucla.sspace.vector.VectorMath

gnu.trove.decorator.TPrimitiveObjectMapDecoratorTest

gnu.trove.decorator.TPrimitiveSetDecoratorTest

gnu.trove.list.array.TPrimitiveArrayListTest

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.