@Override @WriteLock public boolean remove( final Object o ) { return deque.remove( o ); }
@Override @WriteLock public E removeFirst() { return deque.removeFirst(); }
/** * {@inheritDoc} */ @Override @WriteLock public void clear() { set.clear(); }
@Override @WriteLock public void remove() { it.remove(); } };
@Override @WriteLock public boolean removeAll( final Collection<?> c ) { return list.removeAll( c ); }
@Override @WriteLock public boolean offer( final E e ) { return queue.offer( e ); }
@Override @WriteLock public E poll() { return queue.poll(); }
@Override @WriteLock public E remove() { return queue.remove(); } }
@Override @WriteLock public void remove() { it.remove(); } };
@Override @WriteLock public E pollFirst() { return deque.pollFirst(); }
@Override @WriteLock public E pop() { return deque.pop(); }
@Override @WriteLock public void push( E e ) { deque.push( e ); }
/** * {@inheritDoc} */ @Override @WriteLock public boolean retainAll( Collection<?> c ) { return set.retainAll( c ); }
@WriteLock @Override public void add( final int index, final E element ) { list.add( index, element ); }
@Override @WriteLock public boolean retainAll( final Collection<?> c ) { return list.retainAll( c ); }
@Override @WriteLock public E set( final int index, final E element ) { return list.set( index, element ); }
@Override @WriteLock public boolean offerLast( E e ) { return deque.offerLast( e ); }
/** * Removes and returns the first element from this list. * * @return the first element from this list * @throws NoSuchElementException if this list is empty */ @WriteLock @Override public E removeFirst() { return removeEntry( header.next ); }
@Override @WriteLock public boolean offer( E e ) { boolean added = super.offer( e ); if( added ) { e.instanceReturnedToPool(); } return added; }
@Override @WriteLock public void addLast( E e ) { super.addLast( e ); e.instanceReturnedToPool(); }