Package gnu.trove.list

Examples of gnu.trove.list.TIntList

1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
    }


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

        a.reverse();
        a.reverse();
        a.reverse();

        for ( int i = 0, j = a.size(); i < a.size(); i++, j-- ) {
            assertEquals( j, a.get( i ) );
        }
    }
View Full Code Here
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
    }


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

        class ForEach implements TIntProcedure {
            TIntList built = new TIntArrayList();


            public boolean execute( int value ) {
                built.add( value );
                return false;
            }

            TIntList getBuilt() {
                return built;
            }
        }

        ForEach foreach = new ForEach();
        a.forEach( foreach );
        TIntList built = foreach.getBuilt();
        assertEquals( 1, built.size() );
        assertEquals( 1, built.get( 0 ) );
    }
View Full Code Here
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
    }


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

        a.reverse( 1, 19 );

        int[] expected = {1, 19, 18, 17, 16, 15, 14, 13, 12, 11,
                          10, 9, 8, 7, 6, 5, 4, 3, 2, 20};
        for ( int i = 0; i < a.size(); i++ ) {
            assertEquals( expected[i], a.get( i ) );
        }

        try {
            a.reverse( 20, 10 );
            fail( "Expected IllegalArgumentException" );
        }
        catch ( IllegalArgumentException ex ) {
            // Expected
        }
View Full Code Here
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
    }


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

        class ForEach implements TIntProcedure {
            TIntList built = new TIntArrayList();


            public boolean execute( int value ) {
                built.add( value );
                return true;
            }

            TIntList getBuilt() {
                return built;
            }
        }

        ForEach foreach = new ForEach();
        a.forEachDescending( foreach );
        TIntList built = foreach.getBuilt();
        built.reverse();
        assertEquals( a, built );
    }
View Full Code Here
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
/**
*
*/
public class TDecoratorsTest extends TestCase {
  public void testIntListDecorator() {
    TIntList list = new TIntArrayList();
    list.add( 2 );
    list.add( 3 );
    list.add( 4 );
    list.add( 5 );
    list.add( 6 );

    List<Integer> wrapped_list = TDecorators.wrap( list );
    assertEquals( 5, wrapped_list.size() );
    assertEquals( Integer.valueOf( 2 ), wrapped_list.get( 0 ) );
    assertEquals( Integer.valueOf( 3 ), wrapped_list.get( 1 ) );
    assertEquals( Integer.valueOf( 4 ), wrapped_list.get( 2 ) );
    assertEquals( Integer.valueOf( 5 ), wrapped_list.get( 3 ) );
    assertEquals( Integer.valueOf( 6 ), wrapped_list.get( 4 ) );

    list.removeAt( 1 );

    assertEquals( 4, list.size() );
    assertEquals( Integer.valueOf( 2 ), wrapped_list.get( 0 ) );
    assertEquals( Integer.valueOf( 4 ), wrapped_list.get( 1 ) );
    assertEquals( Integer.valueOf( 5 ), wrapped_list.get( 2 ) );
    assertEquals( Integer.valueOf( 6 ), wrapped_list.get( 3 ) );

    wrapped_list.remove( 1 );

    assertEquals( 3, list.size() );
    assertEquals( 2, list.get( 0 ) );
    assertEquals( 5, list.get( 1 ) );
    assertEquals( 6, list.get( 2 ) );

    list.clear();
    assertTrue( wrapped_list.isEmpty() );

    wrapped_list.add( Integer.valueOf( 7 ) );
    assertEquals( 1, list.size() );
    assertEquals( 7, list.get( 0 ) );

    wrapped_list.clear();
    assertTrue( list.isEmpty() );

    list.add( 8 );
    list.add( 9 );
    list.add( 10 );

    Iterator<Integer> wrapper_list_it = wrapped_list.iterator();
    assertTrue( wrapper_list_it.hasNext() );
    assertEquals( Integer.valueOf( 8 ), wrapper_list_it.next() );
    assertTrue( wrapper_list_it.hasNext() );
    assertEquals( Integer.valueOf( 9 ), wrapper_list_it.next() );
    assertTrue( wrapper_list_it.hasNext() );
    assertEquals( Integer.valueOf( 10 ), wrapper_list_it.next() );
    assertFalse( wrapper_list_it.hasNext() );

    wrapper_list_it = wrapped_list.iterator();
    assertTrue( wrapper_list_it.hasNext() );
    assertEquals( Integer.valueOf( 8 ), wrapper_list_it.next() );
    wrapper_list_it.remove();
    assertTrue( wrapper_list_it.hasNext() );
    assertEquals( Integer.valueOf( 9 ), wrapper_list_it.next() );
    assertTrue( wrapper_list_it.hasNext() );
    assertEquals( Integer.valueOf( 10 ), wrapper_list_it.next() );
    assertFalse( wrapper_list_it.hasNext() );

    assertEquals( 2, list.size() );
    assertEquals( 9, list.get( 0 ) );
    assertEquals( 10, list.get( 1 ) );
  }
View Full Code Here
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
    assertEquals( 9, list.get( 0 ) );
    assertEquals( 10, list.get( 1 ) );
  }

  public void testIntListDecoratorSubList() {
    TIntList list = new TIntArrayList();
    list.add( 2 );
    list.add( 3 );
    list.add( 4 );
    list.add( 5 );
    list.add( 6 );

    List<Integer> wrapped_list = TDecorators.wrap( list );

    List<Integer> sublist = wrapped_list.subList( 1, 4 );
    assertEquals( 3, sublist.size() );
    assertEquals( Integer.valueOf( 3 ), sublist.get( 0 ) );
    assertEquals( Integer.valueOf( 4 ), sublist.get( 1 ) );
    assertEquals( Integer.valueOf( 5 ), sublist.get( 2 ) );

    sublist.clear();

    assertEquals( 2, list.size() );
    assertEquals( 2, list.get( 0 ) );
    assertEquals( 6, list.get( 1 ) );
  }
View Full Code Here
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93

    public void testContains() {
        int element_count = 10;

        TIntList a = new TIntArrayList();
        assertTrue( a.isEmpty() );

        for ( int i = 1; i <= element_count; i++ ) {
            a.add( i );
        }

        for ( int i = 1; i <= element_count; i++ ) {
            assertTrue( "element " + i + " not found in " + a, a.contains( i ) );
        }

        assertFalse( "list doesn't hold MAX_VALUE: " + a,
                a.contains( Integer.MAX_VALUE ) );
    }
View Full Code Here
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123

    public void testInsert() {
        int element_count = 10;

        TIntList a = new TIntArrayList();
        assertTrue( a.isEmpty() );

        for ( int i = 1; i <= element_count; i++ ) {
            a.add( i );
        }

        int testval = 1138;
        a.insert( 5, testval );

        for ( int i = 0; i < 5; i++ ) {
            int result = a.get( i );
            int expected = i + 1;
            assertTrue( "element " + result + " should be " + expected,
                    result == expected );
        }

        assertEquals( testval, a.get( 5 ) );

        for ( int i = 6; i < a.size(); i++ ) {
            int result = a.get( i );
            assertTrue( "element " + result + " should be " + i,
                    result == i );
        }
    }
View Full Code Here
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98

    public void testContains() {
        int element_count = 10;

        TIntList a = new TIntLinkedList();
        assertTrue( a.isEmpty() );

        for ( int i = 1; i <= element_count; i++ ) {
            a.add( i );
        }

        for ( int i = 1; i <= element_count; i++ ) {
            assertTrue( "element " + i + " not found in " + a, a.contains( i ) );
        }

        assertFalse("list doesn't hold MAX_VALUE: " + a,
                a.contains(Integer.MAX_VALUE));
    }
View Full Code Here
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
    public void testInsertArray() {
        int element_count = 10;
        int[] ints = {1138, 42, 86, 99, 101};

        TIntList a = new TIntArrayList();
        assertTrue( a.isEmpty() );

        for ( int i = 1; i <= element_count; i++ ) {
            a.add( i );
        }

        a.insert( 0, ints );
        assertEquals( ints.length + element_count, a.size() );

        for ( int i = 0; i < ints.length; i++ ) {
            assertEquals( ints[i], a.get( i ) );
        }
        for ( int i = ints.length, j = 1;
              i < ints.length + element_count;
              i++, j++ ) {
            assertEquals( j, a.get( i ) );
        }
    }
View Full Code Here
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
    • Copyright © 2018 www.massapicom. All rights reserved.
    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.