/** {@inheritDoc} */ public boolean removeAll( short[] array ) { boolean changed = false; for ( int i = array.length; i-- > 0; ) { if ( remove(array[i]) ) { changed = true; } } return changed; }
/** {@inheritDoc} */ public boolean remove( short value ) { for ( int index = 0; index < _pos; index++ ) { if ( value == _data[index] ) { remove( index, 1 ); return true; } } return false; }
/** {@inheritDoc} */ public boolean removeAll( Collection<?> collection ) { boolean changed = false; for ( Object element : collection ) { if ( element instanceof Short ) { short c = ( ( Short ) element ).shortValue(); if ( remove( c ) ) { changed = true; } } } return changed; }
/** {@inheritDoc} */ public boolean retainAll( short[] array ) { boolean changed = false; Arrays.sort( array ); short[] data = _data; for ( int i = _pos; i-- > 0; ) { if ( Arrays.binarySearch( array, data[i] ) < 0 ) { remove( i, 1 ); changed = true; } } return changed; }
/** {@inheritDoc} */ public void remove() { if ( lastRet == -1 ) throw new IllegalStateException(); try { TShortArrayList.this.remove( lastRet, 1); if ( lastRet < cursor ) cursor--; lastRet = -1; } catch ( IndexOutOfBoundsException e ) { throw new ConcurrentModificationException(); } } }
/** {@inheritDoc} */ public short removeAt( int offset ) { short old = get( offset ); remove( offset, 1 ); return old; }
/** {@inheritDoc} */ public boolean removeAll( TShortCollection collection ) { if ( collection == this ) { clear(); return true; } boolean changed = false; TShortIterator iter = collection.iterator(); while ( iter.hasNext() ) { short element = iter.next(); if ( remove( element ) ) { changed = true; } } return changed; }
/** {@inheritDoc} */ public boolean remove( short value ) { for ( int index = 0; index < _pos; index++ ) { if ( value == _data[index] ) { remove( index, 1 ); return true; } } return false; }
/** {@inheritDoc} */ @Override public boolean remove( short value ) { for ( int index = 0; index < _pos; index++ ) { if ( value == _data[index] ) { remove( index, 1 ); return true; } } return false; }
/** {@inheritDoc} */ public boolean removeAll( short[] array ) { boolean changed = false; for ( int i = array.length; i-- > 0; ) { if ( remove(array[i]) ) { changed = true; } } return changed; }
/** {@inheritDoc} */ public boolean remove( short value ) { for ( int index = 0; index < _pos; index++ ) { if ( value == _data[index] ) { remove( index, 1 ); return true; } } return false; }
/** {@inheritDoc} */ public boolean removeAll( short[] array ) { boolean changed = false; for ( int i = array.length; i-- > 0; ) { if ( remove(array[i]) ) { changed = true; } } return changed; }
/** {@inheritDoc} */ public boolean removeAll( short[] array ) { boolean changed = false; for ( int i = array.length; i-- > 0; ) { if ( remove(array[i]) ) { changed = true; } } return changed; }
/** {@inheritDoc} */ public boolean remove( short value ) { for ( int index = 0; index < _pos; index++ ) { if ( value == _data[index] ) { remove( index, 1 ); return true; } } return false; }
/** {@inheritDoc} */ public boolean removeAll( Collection<?> collection ) { boolean changed = false; for ( Object element : collection ) { if ( element instanceof Short ) { short c = ( ( Short ) element ).shortValue(); if ( remove( c ) ) { changed = true; } } } return changed; }
/** {@inheritDoc} */ public boolean retainAll( short[] array ) { boolean changed = false; Arrays.sort( array ); short[] data = _data; for ( int i = _pos; i-- > 0; ) { if ( Arrays.binarySearch( array, data[i] ) < 0 ) { remove( i, 1 ); changed = true; } } return changed; }
/** {@inheritDoc} */ public short removeAt( int offset ) { short old = get( offset ); remove( offset, 1 ); return old; }
/** {@inheritDoc} */ @Override public short removeAt( int offset ) { short old = get( offset ); remove( offset, 1 ); return old; }
/** {@inheritDoc} */ public short removeAt( int offset ) { short old = get( offset ); remove( offset, 1 ); return old; }
/** {@inheritDoc} */ public short removeAt( int offset ) { short old = get( offset ); remove( offset, 1 ); return old; }