001/* 002 * Copyright (C) 2012 The Guava Authors 003 * 004 * Licensed under the Apache License, Version 2.0 (the "License"); 005 * you may not use this file except in compliance with the License. 006 * You may obtain a copy of the License at 007 * 008 * http://www.apache.org/licenses/LICENSE-2.0 009 * 010 * Unless required by applicable law or agreed to in writing, software 011 * distributed under the License is distributed on an "AS IS" BASIS, 012 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 013 * See the License for the specific language governing permissions and 014 * limitations under the License. 015 */ 016 017package com.google.common.collect; 018 019import static com.google.common.base.Preconditions.checkArgument; 020import static com.google.common.base.Preconditions.checkNotNull; 021 022import com.google.common.annotations.Beta; 023import com.google.common.annotations.GwtIncompatible; 024import com.google.common.annotations.VisibleForTesting; 025 026import java.io.Serializable; 027import java.util.ArrayDeque; 028import java.util.Collection; 029import java.util.Queue; 030 031/** 032 * A non-blocking queue which automatically evicts elements from the head of the queue when 033 * attempting to add new elements onto the queue and it is full. 034 * 035 * <p>An evicting queue must be configured with a maximum size. Each time an element is added 036 * to a full queue, the queue automatically removes its head element. This is different from 037 * conventional bounded queues, which either block or reject new elements when full. 038 * 039 * <p>This class is not thread-safe, and does not accept null elements. 040 * 041 * @author Kurt Alfred Kluever 042 * @since 15.0 043 */ 044@Beta 045@GwtIncompatible("java.util.ArrayDeque") 046public final class EvictingQueue<E> extends ForwardingQueue<E> implements Serializable { 047 048 private final Queue<E> delegate; 049 050 @VisibleForTesting 051 final int maxSize; 052 053 private EvictingQueue(int maxSize) { 054 checkArgument(maxSize >= 0, "maxSize (%s) must >= 0", maxSize); 055 this.delegate = new ArrayDeque<E>(maxSize); 056 this.maxSize = maxSize; 057 } 058 059 /** 060 * Creates and returns a new evicting queue that will hold up to {@code maxSize} elements. 061 * 062 * <p>When {@code maxSize} is zero, elements will be evicted immediately after being added to the 063 * queue. 064 */ 065 public static <E> EvictingQueue<E> create(int maxSize) { 066 return new EvictingQueue<E>(maxSize); 067 } 068 069 /** 070 * Returns the number of additional elements that this queue can accept without evicting; 071 * zero if the queue is currently full. 072 * 073 * @since 16.0 074 */ 075 public int remainingCapacity() { 076 return maxSize - size(); 077 } 078 079 @Override protected Queue<E> delegate() { 080 return delegate; 081 } 082 083 /** 084 * Adds the given element to this queue. If the queue is currently full, the element at the head 085 * of the queue is evicted to make room. 086 * 087 * @return {@code true} always 088 */ 089 @Override public boolean offer(E e) { 090 return add(e); 091 } 092 093 /** 094 * Adds the given element to this queue. If the queue is currently full, the element at the head 095 * of the queue is evicted to make room. 096 * 097 * @return {@code true} always 098 */ 099 @Override public boolean add(E e) { 100 checkNotNull(e); // check before removing 101 if (maxSize == 0) { 102 return true; 103 } 104 if (size() == maxSize) { 105 delegate.remove(); 106 } 107 delegate.add(e); 108 return true; 109 } 110 111 @Override public boolean addAll(Collection<? extends E> collection) { 112 return standardAddAll(collection); 113 } 114 115 @Override 116 public boolean contains(Object object) { 117 return delegate().contains(checkNotNull(object)); 118 } 119 120 @Override 121 public boolean remove(Object object) { 122 return delegate().remove(checkNotNull(object)); 123 } 124 125 // TODO(user): Do we want to checkNotNull each element in containsAll, removeAll, and retainAll? 126 127 private static final long serialVersionUID = 0L; 128}