public class LimitedQueue<T> extends LinkedList<T>
LinkedList, but with limited capacity.modCount| Constructor and Description |
|---|
LimitedQueue() |
| Modifier and Type | Method and Description |
|---|---|
boolean |
add(T value) |
boolean |
isFull()
Tells if the list is full or not.
|
add, addAll, addAll, addFirst, addLast, clear, clone, contains, descendingIterator, element, get, getFirst, getLast, indexOf, lastIndexOf, listIterator, offer, offerFirst, offerLast, peek, peekFirst, peekLast, poll, pollFirst, pollLast, pop, push, remove, remove, remove, removeFirst, removeFirstOccurrence, removeLast, removeLastOccurrence, set, size, spliterator, toArray, toArrayiteratorequals, hashCode, listIterator, removeRange, subListcontainsAll, isEmpty, removeAll, retainAll, toStringfinalize, getClass, notify, notifyAll, wait, wait, waitcontainsAll, equals, hashCode, isEmpty, iterator, listIterator, removeAll, replaceAll, retainAll, sort, subListparallelStream, removeIf, streampublic boolean add(T value)
public boolean isFull()
true if maximum size reached, false otherwiseCopyright © 2019 Appulse. All rights reserved.