ox.cads.testing

EnqueueInvokeEvent

class EnqueueInvokeEvent[A] extends QueueLinNode

Invocation events used in the queue linearization algorithm.

Linear Supertypes
QueueLinNode, Event, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. EnqueueInvokeEvent
  2. QueueLinNode
  3. Event
  4. AnyRef
  5. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new EnqueueInvokeEvent(t: Int, value: A)

Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any

  3. final def ##(): Int

    Definition Classes
    AnyRef → Any

  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any

  6. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  7. def clone(): EnqueueInvokeEvent[A]

    Clone this.

    Clone this.

    Definition Classes
    EnqueueInvokeEvent → QueueLinNode → AnyRef

  8. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  9. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  10. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()

  11. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any

  12. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  13. var index: Double

    Sequence number.

    Sequence number.

    Definition Classes
    QueueLinNode

  14. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  15. def isUnsuccessfulDequeue(eR: Double): Boolean

    Is this the invocation of a minimal unsuccessful dequeue operation? Here minimal means the operation starts before index eR.

    Is this the invocation of a minimal unsuccessful dequeue operation? Here minimal means the operation starts before index eR.

    eR

    the index of the earliest return.

    Definition Classes
    QueueLinNode

  16. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  17. var next: QueueLinNode

    The next node in the linked list.

    The next node in the linked list.

    Definition Classes
    QueueLinNode

  18. var nextLocal: QueueLinNode

    Next operation of this thread.

    Next operation of this thread.

    Definition Classes
    QueueLinNode

  19. final def notify(): Unit

    Definition Classes
    AnyRef

  20. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  21. var origIndex: Int

    Sequence number in the original history.

    Sequence number in the original history.

    Definition Classes
    QueueLinNode

  22. var prev: QueueLinNode

    The previous node in the linked list.

    The previous node in the linked list.

    Definition Classes
    QueueLinNode

  23. var prevLocal: QueueLinNode

    Previous operation of this thread.

    Previous operation of this thread.

    Definition Classes
    QueueLinNode

  24. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef

  25. def toString(): String

    Definition Classes
    EnqueueInvokeEvent → AnyRef → Any

  26. val value: A

  27. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

  28. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

  29. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

Inherited from QueueLinNode

Inherited from Event

Inherited from AnyRef

Inherited from Any

Ungrouped