@Test public void testGetKeyAt() { TableCutList list = new TableCutList( 2, true ); list.put( 10, Boolean.TRUE ); assertThat( list.getKeyAt( 0 ), is( equalTo( 10l ) ) ); }
public long getKeyAt( final int indexPosition ) { if ( indexPosition >= size || indexPosition < 0 ) { throw new IndexOutOfBoundsException(); } return keys[indexPosition]; }
TableCutList implements Cloneable { public long getKeyAt( final int indexPosition ) { if ( indexPosition >= size || indexPosition < 0 ) { throw new IndexOutOfBoundsException(); } return keys[indexPosition]; } }
TableCutList implements Cloneable { public long getKeyAt( final int indexPosition ) { if ( indexPosition >= size || indexPosition < 0 ) { throw new IndexOutOfBoundsException(); } return keys[indexPosition]; } TableCutList( final int increment, final boolean enableQuickLookup ); }
TableCutList implements Cloneable { public long getKeyAt( final int indexPosition ) { if ( indexPosition >= size || indexPosition < 0 ) { throw new IndexOutOfBoundsException(); } return keys[indexPosition]; } TableCutList( final int increment, final boolean enableQuickLookup ); TableCutList clone(); void clear(); boolean isEnableQuickLookup(); void setEnableQuickLookup( final boolean enableQuickLookup ); int size(); boolean put( final long key, final Boolean entry ); boolean remove( final long key ); Boolean get( final long key ); Boolean getPrevious( final long key ); boolean containsKey( final long key ); Boolean[] getRawEntries(); long[] getKeys(); long[] getKeys( long[] retval ); int findKeyPosition( final long coordinate, final boolean greater ); int findKeyPosition( final long coordinate, final boolean greater, final int lastFoundPos ); long getKeyAt( final int indexPosition ); Boolean getValueAt( final int indexPosition ); long findKey( final long key, final boolean upperBounds ); void removeAll( final long[] cutArray, final long cutSize ); }
TableCutList implements Cloneable { public long getKeyAt( final int indexPosition ) { if ( indexPosition >= size || indexPosition < 0 ) { throw new IndexOutOfBoundsException(); } return keys[indexPosition]; } TableCutList( final int increment, final boolean enableQuickLookup ); TableCutList clone(); void clear(); boolean isEnableQuickLookup(); void setEnableQuickLookup( final boolean enableQuickLookup ); int size(); boolean put( final long key, final Boolean entry ); boolean remove( final long key ); Boolean get( final long key ); Boolean getPrevious( final long key ); boolean containsKey( final long key ); Boolean[] getRawEntries(); long[] getKeys(); long[] getKeys( long[] retval ); int findKeyPosition( final long coordinate, final boolean greater ); int findKeyPosition( final long coordinate, final boolean greater, final int lastFoundPos ); long getKeyAt( final int indexPosition ); Boolean getValueAt( final int indexPosition ); long findKey( final long key, final boolean upperBounds ); void removeAll( final long[] cutArray, final long cutSize ); static long bin; static long lin; }