an array of events to use in the list.
the number of threads.
Find all minimal matching pairs.
Find all minimal matching pairs.
Create clones of the non-sentinel nodes in the list, so it can be recreated.
Create clones of the non-sentinel nodes in the list, so it can be recreated.
Find an earliest-ending minimal matching pair, if one exists.
Find an earliest-ending minimal matching pair, if one exists.
Get the original sequence number of the earliest remaining dequeue return event, and all values that could be returned by that dequeue.
Get the original sequence number of the earliest remaining dequeue return event, and all values that could be returned by that dequeue.
Convert the linked list to a string.
Convert the linked list to a string.
Get a minimal successul dequeue, or null if there is no such.
Get a minimal successul dequeue, or null if there is no such.
Are there no dequeues?
Are there no dequeues?
Remove the pair of events inv and ret corresponding to a dequeue, reestablishing I1, I3, I4 and I5.
Remove the pair of events inv and ret corresponding to a dequeue, reestablishing I1, I3, I4 and I5. Pre: these are matching invocation and return events.
Remove minimal matching pair, e, d.
Remove minimal matching pair, e, d.
Remove matching pair, performed by et and dt.
Remove matching pair, performed by et and dt.
A history for the QueueLinTester.
the type of data stored in the queue.