Examples of gnu.trove.list.TIntList.indexOf()

gnu.trove.list.TIntList.indexOf()
Searches the list front to back for the index of value. @param value an int value @return the first offset of the value, or -1 if it is not inthe list. @see #binarySearch for faster searches on sorted lists

    }


    public void unwatch(IntVar var, Nogood ng) {
        TIntList nogoods = vars2nogood.get(var.getId());
        if (nogoods != null) {
            int ni = nogoods.indexOf(ng.getIdx());
            if (ni > -1) {
                nogoods.removeAt(ni);
                TIntList indices = vars2idxinng.get(var.getId());
                indices.removeAt(ni);
            }

View Full Code Here

        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 );

View Full Code Here


        // 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 );

View Full Code Here

            a.add( i );
        }
        index = a.indexOf( 10 );
        assertEquals( 9, index );


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


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

View Full Code Here


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


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




    public void testBinarySearch() {

View Full Code Here

        TIntList a = new TIntArrayList();
        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 );

View Full Code Here


        // 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 );

View Full Code Here

            a.add( i );
        }


        a.sort();


        index = a.indexOf( 5 );
        assertTrue( "index: " + index, index >= 8 && index <= 9 );


        // Not in this range.
        index = a.binarySearch( 5, 15, 30 );
        assertTrue( "index: " + index, index < 0 );

View Full Code Here

            a.add( i );
        }
        index = a.indexOf( 10 );
        assertEquals( 9, index );


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


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

View Full Code Here


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


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




    public void testBinarySearch() {

View Full Code Here

0 1

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.