Node

class Node<K, V> : Map.Entry<K, V>

Constructors

Node
Link copied to clipboard

Create the header entry.

open fun Node()
Node
Link copied to clipboard

Create a regular entry.

open fun Node(parent: LinkedHashTreeMap.Node<K, V>, key: K, hash: Int, next: LinkedHashTreeMap.Node<K, V>, prev: LinkedHashTreeMap.Node<K, V>)

Functions

comparingByKey
Link copied to clipboard
open fun <K : Comparable<out Any>?, V> comparingByKey(): Comparator<Map.Entry<K, V>>
comparingByValue
Link copied to clipboard
open fun <K, V : Comparable<out Any>?> comparingByValue(): Comparator<Map.Entry<K, V>>
equals
Link copied to clipboard
open fun equals(o: Any): Boolean
abstract fun equals(p: Any): Boolean
first
Link copied to clipboard

Returns the first node in this subtree.

open fun first(): LinkedHashTreeMap.Node<K, V>
getKey
Link copied to clipboard
abstract fun getKey(): K
getValue
Link copied to clipboard
abstract fun getValue(): V
hashCode
Link copied to clipboard
open fun hashCode(): Int
abstract fun hashCode(): Int
last
Link copied to clipboard

Returns the last node in this subtree.

open fun last(): LinkedHashTreeMap.Node<K, V>
setValue
Link copied to clipboard
abstract fun setValue(p: V): V
toString
Link copied to clipboard
open fun toString(): String

Properties

hash
Link copied to clipboard
val hash: Int
height
Link copied to clipboard
open val height: Int
key
Link copied to clipboard
val key: K
left
Link copied to clipboard
open val left: LinkedHashTreeMap.Node<K, V>
next
Link copied to clipboard
open val next: LinkedHashTreeMap.Node<K, V>
parent
Link copied to clipboard
open val parent: LinkedHashTreeMap.Node<K, V>
prev
Link copied to clipboard
open val prev: LinkedHashTreeMap.Node<K, V>
right
Link copied to clipboard
open val right: LinkedHashTreeMap.Node<K, V>
value
Link copied to clipboard
open var value: V