Node
Functions on the entry nodes of the hash map.
Definitions
def getBucketNext(e: Node[k, v, r]): Option[Node[k, v, r]] \ r§ SourceReturns the next entry in the same bucket as e, if any.
def getHash(e: Node[k, v, r]): Int32§ SourceReturns the cached hash code of the key of the entry e.
def getKey(e: Node[k, v, r]): k§ SourceReturns the key of the entry e.
def getOrderNext(e: Node[k, v, r]): Option[Node[k, v, r]] \ r§ SourceReturns the entry following e in insertion order, if any.
def getOrderPrev(e: Node[k, v, r]): Option[Node[k, v, r]] \ r§ SourceReturns the entry preceding e in insertion order, if any.
def getValue(e: Node[k, v, r]): v \ r§ SourceReturns the value of the entry e.
def setBucketNext(next: Option[Node[k, v, r]], e: Node[k, v, r]): Unit \ r§ SourceSets the next entry in the same bucket as e to next.
def setOrderNext(next: Option[Node[k, v, r]], e: Node[k, v, r]): Unit \ r§ SourceSets the entry following e in insertion order to next.
def setOrderPrev(prev: Option[Node[k, v, r]], e: Node[k, v, r]): Unit \ r§ SourceSets the entry preceding e in insertion order to prev.
def setValue(v: v, e: Node[k, v, r]): Unit \ r§ SourceSets the value of the entry e to v.