abstract
class
AbstractNodeQueue[T] extends AtomicReference[Node[T]]
Instance Constructors
-
new
AbstractNodeQueue()
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
def
+(other: String): String
-
-
final
def
==(arg0: Any): Boolean
-
final
def
accumulateAndGet(arg0: Node[T], arg1: BinaryOperator[Node[T]]): Node[T]
-
final
def
add(value: T): Unit
-
final
def
addNode(n: Node[T]): Unit
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
final
def
compareAndSet(arg0: Node[T], arg1: Node[T]): Boolean
-
final
def
count(): Int
-
-
-
-
-
-
-
def
finalize(): Unit
-
def
formatted(fmtstr: String): String
-
final
def
get(): Node[T]
-
final
def
getAndAccumulate(arg0: Node[T], arg1: BinaryOperator[Node[T]]): Node[T]
-
final
def
getAndSet(arg0: Node[T]): Node[T]
-
final
def
getAndUpdate(arg0: UnaryOperator[Node[T]]): Node[T]
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isEmpty(): Boolean
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
lazySet(arg0: Node[T]): Unit
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
final
def
peek(): T
-
final
def
peekNode(): Node[T]
-
final
def
poll(): T
-
final
def
pollNode(): Node[T]
-
final
def
set(arg0: Node[T]): Unit
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
final
def
updateAndGet(arg0: UnaryOperator[Node[T]]): Node[T]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
final
def
weakCompareAndSet(arg0: Node[T], arg1: Node[T]): Boolean
-