public static class LockFreePrefixTree.Node extends AtomicLong
| Modifier and Type | Method and Description |
|---|---|
LockFreePrefixTree.Node |
at(LockFreePrefixTree.Allocator allocator,
long childKey)
Get existing (or create if missing) child with the given key.
|
long |
bitwiseOrValue(long pattern)
Atomically does the bitwise-or on the current value.
|
long |
incValue()
Increment value.
|
void |
setValue(long value)
Set the value for the
LockFreePrefixTree.Node. |
String |
toString() |
long |
value() |
accumulateAndGet, addAndGet, compareAndExchange, compareAndExchangeAcquire, compareAndExchangeRelease, compareAndSet, decrementAndGet, doubleValue, floatValue, get, getAcquire, getAndAccumulate, getAndAdd, getAndDecrement, getAndIncrement, getAndSet, getAndUpdate, getOpaque, getPlain, incrementAndGet, intValue, lazySet, longValue, set, setOpaque, setPlain, setRelease, updateAndGet, weakCompareAndSetAcquire, weakCompareAndSetPlain, weakCompareAndSetRelease, weakCompareAndSetVolatilebyteValue, shortValuepublic long value()
LockFreePrefixTree.Nodepublic void setValue(long value)
LockFreePrefixTree.Node.value - the new value.public long incValue()
LockFreePrefixTree.Node.public long bitwiseOrValue(long pattern)
pattern - a bit pattern to do bitwise-or withpublic LockFreePrefixTree.Node at(LockFreePrefixTree.Allocator allocator, long childKey)
null if the operation cannot complete, for example, due to inability
to allocate nodes.childKey - the key of the child.null if cannot complete.public String toString()
toString in class AtomicLong