@Test public void testClear() { TableCutList list = new TableCutList( 2, true ); list.put( 10, Boolean.TRUE ); list.put( 20, Boolean.TRUE ); list.clear(); assertThat( list.size(), is( equalTo( 0 ) ) ); assertThat( list.get( 10 ), is( equalTo( null ) ) ); assertThat( list.get( 20 ), is( equalTo( null ) ) ); }
public void clear() { this.size = 0; this.scaleFactor = 0; }
TableCutList implements Cloneable { public void clear() { this.size = 0; this.scaleFactor = 0; } }
TableCutList implements Cloneable { public void clear() { this.size = 0; this.scaleFactor = 0; } TableCutList( final int increment, final boolean enableQuickLookup ); }
TableCutList implements Cloneable { public void clear() { this.size = 0; this.scaleFactor = 0; } 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 void clear() { this.size = 0; this.scaleFactor = 0; } 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; }