Class ConcurrentLinkedHashMap.Node

    • Method Summary

      All Methods Instance Methods Concrete Methods 
      Modifier and Type Method Description
      ConcurrentLinkedHashMap.Node getNext()
      Retrieves the next element or null if either the element is unlinked or the last element on the deque.
      ConcurrentLinkedHashMap.Node getPrevious()
      Retrieves the previous element or null if either the element is unlinked or the first element on the deque.
      (package private) V getValue()
      Retrieves the value held by the current WeightedValue.
      (package private) void makeDead()
      Atomically transitions the node to the dead state and decrements the weightedSize.
      (package private) void makeRetired()
      Atomically transitions the node from the alive state to the retired state, if a valid transition.
      void setNext​(ConcurrentLinkedHashMap.Node next)
      Sets the next element or null if there is no link.
      void setPrevious​(ConcurrentLinkedHashMap.Node prev)
      Sets the previous element or null if there is no link.
      (package private) boolean tryToRetire​(ConcurrentLinkedHashMap.WeightedValue<V> expect)
      Attempts to transition the node from the alive state to the retired state.
      • Methods inherited from class java.util.concurrent.atomic.AtomicReference

        accumulateAndGet, compareAndExchange, compareAndExchangeAcquire, compareAndExchangeRelease, compareAndSet, get, getAcquire, getAndAccumulate, getAndSet, getAndUpdate, getOpaque, getPlain, lazySet, set, setOpaque, setPlain, setRelease, toString, updateAndGet, weakCompareAndSet, weakCompareAndSetAcquire, weakCompareAndSetPlain, weakCompareAndSetRelease, weakCompareAndSetVolatile
      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait