Examples of 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 $

Examples of gnu.trove.set.TIntSet

            vals[i] = Integer.toString( i + 1 );
            map.put( keys[i], vals[i] );
        }
        assertEquals( element_count, map.size() );


        TIntSet keyset = map.keySet();
        for ( int i = 0; i < keyset.size(); i++ ) {
            assertTrue( keyset.contains( keys[i] ) );
        }
        assertFalse( keyset.isEmpty() );


        assertTrue( "should contain all. keyset: " + keyset + ", " + Arrays.toString( keys ),
                keyset.containsAll( keys ) );


        int[] other_array = new int[ keys.length + 1 ];
        System.arraycopy( keys, 0, other_array, 0, keys.length );
        other_array[other_array.length - 1] = 1138;
        assertFalse( "should not contain all. keyset: " + keyset + ", " + Arrays.toString( other_array ),
                keyset.containsAll( other_array ) );
    }

View Full Code Here

Examples of gnu.trove.set.TIntSet

            vals[i] = Integer.toString( i + 1 );
            map.put( keys[i], vals[i] );
        }
        assertEquals( element_count, map.size() );


        TIntSet keyset = map.keySet();
        for ( int i = 0; i < keyset.size(); i++ ) {
            assertTrue( keyset.contains( keys[i] ) );
        }
        assertFalse( keyset.isEmpty() );


        Collection<Integer> test_collection = new HashSet<Integer>();
        for ( int i = 0; i < element_count; i++ ) {
            test_collection.add( keys[i] );
        }
        keyset.retainAll( test_collection );
        assertFalse( keyset.isEmpty() );
        assertFalse( map.isEmpty() );


        // Reset map
        for ( int i = 0; i < element_count; i++ ) {
            map.put( keys[i], vals[i] );
        }
        assertEquals( element_count, map.size() );


        test_collection.remove( Integer.valueOf( keys[5] ) );
        keyset.retainAll( test_collection );
        assertEquals( element_count - 1, keyset.size() );
        assertEquals( element_count - 1, map.size() );
        assertFalse( keyset.contains( keys[5] ) );
        assertFalse( map.containsKey( keys[5] ) );
        


        // Reset map
        for ( int i = 0; i < element_count; i++ ) {
            map.put( keys[i], vals[i] );
        }
        assertEquals( element_count, map.size() );


        test_collection.add( Integer.valueOf( 1138 ) );
        keyset.retainAll( test_collection );
        
    }

View Full Code Here

Examples of gnu.trove.set.TIntSet

            vals[i] = Integer.toString( i + 1 );
            map.put( keys[i], vals[i] );
        }
        assertEquals( element_count, map.size() );


        TIntSet keyset = map.keySet();
        for ( int i = 0; i < keyset.size(); i++ ) {
            assertTrue( keyset.contains( keys[i] ) );
        }
        assertFalse( keyset.isEmpty() );


        assertFalse( "keyset: " + keyset + ", should be unmodified.",
                keyset.retainAll( keyset ) );


        TIntCollection other = new TIntArrayList( keyset );
        assertFalse( "keyset: " + keyset + ", should be unmodified. other: " +
                     other, keyset.retainAll( other ) );


        other.remove( keys[5] );
        assertTrue( "keyset: " + keyset + ", should be modified. other: " +
                    other, keyset.retainAll( other ) );
        assertFalse( keyset.contains( keys[5] ) );
        assertFalse( map.containsKey( keys[5] ) );
        assertFalse( map.containsValue( vals[5] ) );
        assertTrue( "keyset: " + keyset + ", should contain all in other: " +
                    other, keyset.containsAll( other ) );
    }

View Full Code Here

Examples of gnu.trove.set.TIntSet

            vals[i] = Integer.toString( i + 1 );
            map.put( keys[i], vals[i] );
        }
        assertEquals( element_count, map.size() );


        TIntSet keyset = map.keySet();
        for ( int i = 0; i < keyset.size(); i++ ) {
            assertTrue( keyset.contains( keys[i] ) );
        }
        assertFalse( keyset.isEmpty() );


        assertFalse( "keyset: " + keyset + ", should be unmodified. array: " +
                     Arrays.toString( keys ), keyset.retainAll( keys ) );


        int[] other = new int[element_count - 1];
        for ( int i = 0; i < element_count; i++ ) {
            if ( i < 5 ) {
                other[i] = i + 1;
            }
            if ( i > 5 ) {
                other[i - 1] = i + 1;
            }
        }
        assertTrue( "keyset: " + keyset + ", should be modified. array: " +
                    Arrays.toString( other ), keyset.retainAll( other ) );
    }

View Full Code Here

Examples of gnu.trove.set.TIntSet

            vals[i] = Integer.toString( i + 1 );
            map.put( keys[i], vals[i] );
        }
        assertEquals( element_count, map.size() );


        TIntSet keyset = map.keySet();
        for ( int i = 0; i < keyset.size(); i++ ) {
            assertTrue( keyset.contains( keys[i] ) );
        }
        assertFalse( keyset.isEmpty() );


        TIntSet other = new TIntHashSet();
        other.addAll( keys );


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


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


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


        // Change length, different code branch
        unequal.add( 1 );
        assertFalse( "sets incorrectly equal: " + keyset + ", " + unequal,
                keyset.equals( unequal ) );


        //noinspection ObjectEqualsNull
        assertFalse( keyset.equals( null ) );

View Full Code Here

Examples of gnu.trove.set.TIntSet

            vals[i] = Integer.toString( i + 1 );
            map.put( keys[i], vals[i] );
        }
        assertEquals( element_count, map.size() );


        TIntSet keyset = map.keySet();
        for ( int i = 0; i < keyset.size(); i++ ) {
            assertTrue( keyset.contains( keys[i] ) );
        }
        assertFalse( keyset.isEmpty() );


        assertEquals( keyset.hashCode(), keyset.hashCode() );


        TIntSet other = new TIntHashSet( keys );
        other.add( 1138 );
        assertTrue( keyset.hashCode() != other.hashCode() );
    }

View Full Code Here

Examples of gnu.trove.set.TIntSet

        super.tearDown();
    }




    public void testConstructors() throws Exception {
        TIntSet set = new TIntHashSet();
        assertNotNull(set);


        int[] ints = {1138, 42, 86, 99, 101};
        set.addAll(ints);


        TIntSet copy = new TIntHashSet(set);
        assertTrue("set not a copy: " + set + ", " + copy, set.equals(copy));


        TIntSet another = new TIntHashSet(20);
        another.addAll(ints);
        assertTrue("set not equal: " + set + ", " + copy, set.equals(another));


        another = new TIntHashSet(2, 1.0f);
        another.addAll(ints);
        assertTrue("set not equal: " + set + ", " + copy, set.equals(another));


        another = new TIntHashSet(ints);
        assertTrue("set not equal: " + set + ", " + copy, set.equals(another));
    }

View Full Code Here

Examples of gnu.trove.set.TIntSet

        assertTrue("set not equal: " + set + ", " + copy, set.equals(another));
    }




    public void testIsEmpty() throws Exception {
        TIntSet s = new TIntHashSet();
        assertTrue("new set wasn't empty", s.isEmpty());


        s.add(1);
        assertTrue("set with element reports empty", !s.isEmpty());
        s.clear();
        assertTrue("cleared set reports not-empty", s.isEmpty());
    }

View Full Code Here

Examples of gnu.trove.set.TIntSet

        assertTrue("cleared set reports not-empty", s.isEmpty());
    }




    public void testContains() throws Exception {
        TIntSet s = new TIntHashSet();
        int i = 100;
        s.add(i);
        assertTrue("contains failed", s.contains(i));
        assertFalse("contains failed", s.contains(1000));
    }

View Full Code Here

Examples of gnu.trove.set.TIntSet

    @SuppressWarnings({"ForLoopReplaceableByForEach"})
    public void testContainsAll() throws Exception {


        int[] ints = {1138, 42, 13, 86, 99};


        TIntSet set = new TIntHashSet();
        set.addAll(ints);


        TIntSet other = new TIntHashSet();
        other.addAll(ints);


        List<Number> ints_list = new ArrayList<Number>();
        for (int element : ints) {
            ints_list.add(element);
        }


        for (int index = 0; index < ints.length; index++) {
            assertTrue(Integer.valueOf(ints[index]).toString(),
                    set.contains(ints[index]));
        }


        assertTrue("containsAll(Collection<?>) failed: " + set,
                set.containsAll(ints_list));
        ints_list.remove(Integer.valueOf(42));
        ints_list.add(Long.valueOf(42));
        assertFalse("containsAll(Collection<?>) failed: " + set,
                set.containsAll(ints_list));


        assertTrue("containsAll(TIntSet) failed (same set): " + set,
                set.containsAll(set));


        assertTrue("containsAll(TIntSet) failed (other set): " + set,
                set.containsAll(other));


        assertTrue("containsAll(int[]) failed: " + set,
                set.containsAll(ints));




        int[] failed = {42, 86, 99, 123456};


        TIntSet failed_set = new TIntHashSet();
        failed_set.addAll(failed);


        List<Integer> failed_list = new ArrayList<Integer>();
        for (int element : failed) {
            failed_list.add(element);
        }

View Full Code Here

0 1 2 3 4 5

TOP

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.