| toArray(Object[]) |  | 0% | | 0% | 4 | 4 | 11 | 11 | 1 | 1 |
| drainTo(Collection, int) | | 0% | | 0% | 3 | 3 | 10 | 10 | 1 | 1 |
| unlinkFirst() | | 0% | | 0% | 3 | 3 | 14 | 14 | 1 | 1 |
| unlinkLast() | | 0% | | 0% | 3 | 3 | 14 | 14 | 1 | 1 |
| linkFirst(Object) | | 0% | | 0% | 3 | 3 | 11 | 11 | 1 | 1 |
| linkLast(Object) | | 0% | | 0% | 3 | 3 | 11 | 11 | 1 | 1 |
| clear() | | 0% | | 0% | 2 | 2 | 13 | 13 | 1 | 1 |
| unlink(LinkedBlockingDeque.Node) | | 0% | | 0% | 3 | 3 | 12 | 12 | 1 | 1 |
| offerFirst(Object, Duration) | | 0% | | 0% | 3 | 3 | 9 | 9 | 1 | 1 |
| offerLast(Object, Duration) | | 0% | | 0% | 3 | 3 | 9 | 9 | 1 | 1 |
| removeFirstOccurrence(Object) | | 0% | | 0% | 4 | 4 | 9 | 9 | 1 | 1 |
| removeLastOccurrence(Object) | | 0% | | 0% | 4 | 4 | 9 | 9 | 1 | 1 |
| LinkedBlockingDeque(Collection) | | 0% | | 0% | 3 | 3 | 9 | 9 | 1 | 1 |
| contains(Object) | | 0% | | 0% | 4 | 4 | 8 | 8 | 1 | 1 |
| pollFirst(Duration) | | 0% | | 0% | 3 | 3 | 8 | 8 | 1 | 1 |
| pollLast(Duration) | | 0% | | 0% | 3 | 3 | 8 | 8 | 1 | 1 |
| toArray() | | 0% | | 0% | 2 | 2 | 7 | 7 | 1 | 1 |
| LinkedBlockingDeque(int, boolean) | | 0% | | 0% | 2 | 2 | 8 | 8 | 1 | 1 |
| writeObject(ObjectOutputStream) | | 0% | | 0% | 2 | 2 | 7 | 7 | 1 | 1 |
| readObject(ObjectInputStream) | | 0% | | 0% | 2 | 2 | 10 | 10 | 1 | 1 |
| putFirst(Object) | | 0% | | 0% | 2 | 2 | 6 | 6 | 1 | 1 |
| putLast(Object) | | 0% | | 0% | 2 | 2 | 6 | 6 | 1 | 1 |
| takeFirst() | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| takeLast() | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| peekFirst() | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| peekLast() | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| offerFirst(Object) | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| offerLast(Object) | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| getTakeQueueLength() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| hasTakeWaiters() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| remainingCapacity() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| interuptTakeWaiters() | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| getFirst() | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| getLast() | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| pollFirst() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| pollLast() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| removeFirst() | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| removeLast() | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| size() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| toString() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| addFirst(Object) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| addLast(Object) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| offerFirst(Object, long, TimeUnit) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| offerLast(Object, long, TimeUnit) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| descendingIterator() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| iterator() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| offer(Object, long, TimeUnit) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| pollFirst(long, TimeUnit) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| pollLast(long, TimeUnit) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| LinkedBlockingDeque(boolean) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| LinkedBlockingDeque(int) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| add(Object) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| drainTo(Collection) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| offer(Object, Duration) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| poll(long, TimeUnit) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| LinkedBlockingDeque() | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| offer(Object) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| poll(Duration) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| push(Object) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| put(Object) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| remove(Object) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| element() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| peek() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| poll() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| pop() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| remove() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| take() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |