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

gnu.trove.list.TIntList.binarySearch()
Performs a binary search for value in the entire list. Note that you must @{link #sort sort} the list before doing a search. @param value the value to search for @return the absolute offset in the list of the value, or itsnegative insertion point into the sorted list.

        a.sort();


        int index = a.binarySearch( 5 );
        assertEquals( 4, index );


        index = a.binarySearch( 8 );
        assertEquals( 7, index );


        // Add more elements, but duplicates
        for ( int i = 1; i <= element_count; i++ ) {
            a.add( i );

View Full Code Here


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


        try {
            a.binarySearch( 5, 10, 55 );
            fail( "Expected ArrayIndexOutOfBoundsException" );

View Full Code Here

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


        try {
            a.binarySearch( 5, 10, 55 );
            fail( "Expected ArrayIndexOutOfBoundsException" );
        }
        catch ( IndexOutOfBoundsException ex ) {
            // Expected
        }

View Full Code Here

        catch ( IndexOutOfBoundsException ex ) {
            // Expected
        }


        try {
            a.binarySearch( 5, -1, 15 );
            fail( "Expected ArrayIndexOutOfBoundsException" );
        }
        catch ( IndexOutOfBoundsException ex ) {
            // Expected
        }

View Full Code Here

            a.add( i );
        }


        a.sort();


        int index = a.binarySearch( 5 );
        assertEquals( 4, index );


        index = a.binarySearch( 8 );
        assertEquals( 7, index );

View Full Code Here

        a.sort();


        int index = a.binarySearch( 5 );
        assertEquals( 4, index );


        index = a.binarySearch( 8 );
        assertEquals( 7, index );


        // Add more elements, but duplicates
        for ( int i = 1; i <= element_count; i++ ) {
            a.add( i );

View Full Code Here


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


        try {
            a.binarySearch( 5, 10, 55 );
            fail( "Expected ArrayIndexOutOfBoundsException" );

View Full Code Here

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


        try {
            a.binarySearch( 5, 10, 55 );
            fail( "Expected ArrayIndexOutOfBoundsException" );
        }
        catch ( ArrayIndexOutOfBoundsException ex ) {
            // Expected
        }

View Full Code Here

        catch ( ArrayIndexOutOfBoundsException ex ) {
            // Expected
        }


        try {
            a.binarySearch( 5, -1, 15 );
            fail( "Expected ArrayIndexOutOfBoundsException" );
        }
        catch ( ArrayIndexOutOfBoundsException ex ) {
            // Expected
        }

View Full Code Here

            a.add( i );
        }


        a.sort();


        int index = a.binarySearch( 5 );
        assertEquals( 4, index );


        index = a.binarySearch( 8 );
        assertEquals( 7, index );

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.