public void clear ( ) { final T [ ] items = this . items ; if ( tail > head ) { int i = head , n = tail ; do { items [ i ++ ] = null ; } while ( i < n ) ; } else if ( size > 0 ) { // NOTE: when head == tail the buffer can be empty or full for ( int i = head , n = items . length ; i < n ; i ++ ) items [ i ] = null ; for ( int i = 0 , n = tail ; i < n ; i ++ ) items [ i ] = null ; } this . head = 0 ; this . tail = 0 ; this . size = 0 ; }
Removes all items from this circular buffer .