| Exception Thrown By: | Cause | |
| Class | Method | |
| AbstractQueue | public E remove() | if this queue is empty |
| AbstractQueue | public E element() | if this queue is empty |
| ArrayDeque | public E removeFirst() | if this deque is empty |
| ArrayDeque | public E removeLast() | if this deque is empty |
| ArrayDeque | public E getFirst() | if this deque is empty |
| ArrayDeque | public E getLast() | if this deque is empty |
| ArrayDeque | public E remove() | if this deque is empty |
| ArrayDeque | public E element() | if this deque is empty |
| ArrayDeque | public E pop() | if this deque is empty |
| ConcurrentLinkedDeque | public E getFirst() | if this deque is empty |
| ConcurrentLinkedDeque | public E getLast() | if this deque is empty |
| ConcurrentLinkedDeque | public E removeFirst() | if this deque is empty |
| ConcurrentLinkedDeque | public E removeLast() | if this deque is empty |
| ConcurrentLinkedDeque | public E remove() | if this deque is empty |
| ConcurrentLinkedDeque | public E pop() | if this deque is empty |
| ConcurrentLinkedDeque | public E element() | if this deque is empty |
| ConcurrentSkipListMap | public K firstKey() | if this map is empty |
| ConcurrentSkipListMap | public K lastKey() | if this map is empty |
| ConcurrentSkipListSet | public E first() | if this set is empty |
| ConcurrentSkipListSet | public E last() | if this set is empty |
| DefaultMutableTreeNode | public TreeNode getFirstChild() | if this node has no children |
| DefaultMutableTreeNode | public TreeNode getLastChild() | if this node has no children |
| FlatteningPathIterator | public int currentSegment(float[] coords) | if there are no more elements in the flattening path to be returned |
| FlatteningPathIterator | public int currentSegment(double[] coords) | if there are no more elements in the flattening path to be returned |
| LinkedBlockingDeque | public E removeFirst() | if this deque is empty |
| LinkedBlockingDeque | public E removeLast() | if this deque is empty |
| LinkedBlockingDeque | public E getFirst() | if this deque is empty |
| LinkedBlockingDeque | public E getLast() | if this deque is empty |
| LinkedBlockingDeque | public E remove() | if this deque is empty |
| LinkedBlockingDeque | public E element() | if this deque is empty |
| LinkedBlockingDeque | public E pop() | if this deque is empty |
| LinkedList | public E getFirst() | if this list is empty |
| LinkedList | public E getLast() | if this list is empty |
| LinkedList | public E removeFirst() | if this list is empty |
| LinkedList | public E removeLast() | if this list is empty |
| Optional | public T get() | if there is no value present |
| Scanner | public String next() | if no more tokens are available |
| Scanner | public String next(String pattern) | if no such tokens are available |
| Scanner | public String next(Pattern pattern) | if no more tokens are available |
| Scanner | public String nextLine() | if no line was found |
| Scanner | public Scanner skip(Pattern pattern) | if the specified pattern is not found |
| StringTokenizer | public String nextToken() | if there are no more tokens in this tokenizer's string |
| StringTokenizer | public String nextToken(String delim) | if there are no more tokens in this tokenizer's string. |
| StringTokenizer | public Object nextElement() | if there are no more tokens in this tokenizer's string |
| TreeMap | public K firstKey() | if this map is empty |
| TreeMap | public K lastKey() | if this map is empty |
| TreeSet | public E first() | if this set is empty |
| TreeSet | public E last() | if this set is empty |
