| unlink(PortableConcurrentDirectDeque.Node) |  | 0% | | 0% | 26 | 26 | 47 | 47 | 1 | 1 |
| addAll(Collection) | | 0% | | 0% | 12 | 12 | 26 | 26 | 1 | 1 |
| linkFirst(Object) | | 0% | | 0% | 7 | 7 | 12 | 12 | 1 | 1 |
| linkLast(Object) | | 0% | | 0% | 7 | 7 | 12 | 12 | 1 | 1 |
| unlinkFirst(PortableConcurrentDirectDeque.Node, PortableConcurrentDirectDeque.Node) | | 0% | | 0% | 11 | 11 | 14 | 14 | 1 | 1 |
| unlinkLast(PortableConcurrentDirectDeque.Node, PortableConcurrentDirectDeque.Node) | | 0% | | 0% | 11 | 11 | 14 | 14 | 1 | 1 |
| PortableConcurrentDirectDeque(Collection) | | 0% | | 0% | 3 | 3 | 13 | 13 | 1 | 1 |
| skipDeletedPredecessors(PortableConcurrentDirectDeque.Node) | | 0% | | 0% | 9 | 9 | 16 | 16 | 1 | 1 |
| skipDeletedSuccessors(PortableConcurrentDirectDeque.Node) | | 0% | | 0% | 9 | 9 | 16 | 16 | 1 | 1 |
| updateHead() | | 0% | | 0% | 7 | 7 | 8 | 8 | 1 | 1 |
| updateTail() | | 0% | | 0% | 7 | 7 | 8 | 8 | 1 | 1 |
| first() | | 0% | | 0% | 6 | 6 | 6 | 6 | 1 | 1 |
| last() | | 0% | | 0% | 6 | 6 | 6 | 6 | 1 | 1 |
| readObject(ObjectInputStream) | | 0% | | 0% | 3 | 3 | 12 | 12 | 1 | 1 |
| removeFirstOccurrence(Object) | | 0% | | 0% | 5 | 5 | 7 | 7 | 1 | 1 |
| removeLastOccurrence(Object) | | 0% | | 0% | 5 | 5 | 7 | 7 | 1 | 1 |
| initHeadTail(PortableConcurrentDirectDeque.Node, PortableConcurrentDirectDeque.Node) | | 0% | | 0% | 3 | 3 | 10 | 10 | 1 | 1 |
| pollFirst() | | 0% | | 0% | 4 | 4 | 6 | 6 | 1 | 1 |
| pollLast() | | 0% | | 0% | 4 | 4 | 6 | 6 | 1 | 1 |
| contains(Object) | | 0% | | 0% | 5 | 5 | 6 | 6 | 1 | 1 |
| toArrayList() | | 0% | | 0% | 3 | 3 | 6 | 6 | 1 | 1 |
| static {...} | | 0% | | n/a | 1 | 1 | 7 | 7 | 1 | 1 |
| writeObject(ObjectOutputStream) | | 0% | | 0% | 3 | 3 | 7 | 7 | 1 | 1 |
| size() | | 0% | | 0% | 4 | 4 | 6 | 6 | 1 | 1 |
| removeToken(Object) | | 0% | | 0% | 3 | 3 | 6 | 6 | 1 | 1 |
| peekFirst() | | 0% | | 0% | 3 | 3 | 5 | 5 | 1 | 1 |
| peekLast() | | 0% | | 0% | 3 | 3 | 5 | 5 | 1 | 1 |
| PortableConcurrentDirectDeque() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| succ(PortableConcurrentDirectDeque.Node) | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| pred(PortableConcurrentDirectDeque.Node) | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| screenNullResult(Object) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| isEmpty() | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| offerFirst(Object) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| offerLast(Object) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| casHead(PortableConcurrentDirectDeque.Node, PortableConcurrentDirectDeque.Node) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| casTail(PortableConcurrentDirectDeque.Node, PortableConcurrentDirectDeque.Node) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| addFirst(Object) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| addLast(Object) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| getFirst() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getLast() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| removeFirst() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| removeLast() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| clear() | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| toArray(Object[]) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| iterator() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| descendingIterator() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| offerFirstAndReturnToken(Object) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| offerLastAndReturnToken(Object) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| offer(Object) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| add(Object) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| push(Object) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| remove(Object) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| toArray() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| poll() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| remove() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| peek() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| element() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| pop() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| prevTerminator() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| nextTerminator() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |