| offer(Object, long, TimeUnit) |  | 0% | | 0% | 3 | 3 | 18 | 18 | 1 | 1 |
| poll(long, TimeUnit) | | 0% | | 0% | 3 | 3 | 18 | 18 | 1 | 1 |
| toArray(Object[]) | | 0% | | 0% | 2 | 2 | 8 | 8 | 1 | 1 |
| toArray() | | 0% | | 0% | 2 | 2 | 8 | 8 | 1 | 1 |
| take() |  | 68% | | 50% | 1 | 2 | 5 | 15 | 0 | 1 |
| iterator() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| contains(Object) | | 83% | | 50% | 2 | 3 | 2 | 7 | 0 | 1 |
| poll() | | 87% | | 50% | 1 | 2 | 1 | 10 | 0 | 1 |
| peek() | | 81% | | 50% | 1 | 2 | 1 | 7 | 0 | 1 |
| getQueueForPriority(int) | | 81% | | 75% | 1 | 3 | 1 | 5 | 0 | 1 |
| isEmpty() | | 71% | | 50% | 1 | 2 | 0 | 1 | 0 | 1 |
| MultiPriorityBlockingQueue(List, boolean, NextQueueAlgorithm) | | 100% | | 100% | 0 | 5 | 0 | 22 | 0 | 1 |
| drainTo(Collection, int) | | 100% | | 100% | 0 | 3 | 0 | 11 | 0 | 1 |
| put(Object) | | 100% | | 100% | 0 | 2 | 0 | 15 | 0 | 1 |
| offer(Object) | | 100% | | 100% | 0 | 2 | 0 | 11 | 0 | 1 |
| remove(Object) | | 100% | | 100% | 0 | 3 | 0 | 9 | 0 | 1 |
| drainTo(Collection) | | 100% | | 100% | 0 | 2 | 0 | 9 | 0 | 1 |
| toString() | | 100% | | 100% | 0 | 2 | 0 | 8 | 0 | 1 |
| clear() | | 100% | | 100% | 0 | 2 | 0 | 8 | 0 | 1 |
| remainingCapacity() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| size() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| getQueues() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| getNextQueueAlgorithm() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| isFixedSizeQueues() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |