router/com.therouter.router/RegexpKeyedMap

RegexpKeyedMap

class RegexpKeyedMap<V> : HashMap<String?, V?>

专门为路由服务，因为路由的path存在正则的情况

Constructors

RegexpKeyedMap

fun RegexpKeyedMap()

Functions

afterNodeAccess

open fun afterNodeAccess(p0: HashMap.Node<String?, V?>)

afterNodeInsertion

open fun afterNodeInsertion(p0: Boolean)

afterNodeRemoval

open fun afterNodeRemoval(p0: HashMap.Node<String?, V?>)

capacity

fun capacity(): Int

clear

open override fun clear()

clone

open override fun clone(): Any

compute

open override fun compute(p0: String?, p1: BiFunction<in String?, in V?, out V?>): V?

computeIfAbsent

open override fun computeIfAbsent(p0: String?, p1: Function<in String?, out V?>): V?

computeIfPresent

open override fun computeIfPresent(p0: String?, p1: BiFunction<in String?, in V, out V?>): V?

containsKey

open override fun containsKey(key: String?): Boolean

containsValue

open override fun containsValue(value: V?): Boolean

equals

open operator override fun equals(other: Any?): Boolean

forEach

open override fun forEach(p0: BiConsumer<in String?, in V?>)

get

open operator override fun get(key: String?): V?

getNode

fun getNode(p0: Int, p1: Any): HashMap.Node<String?, V?>

getOrDefault

open override fun getOrDefault(key: String?, defaultValue: V?): V?

hashCode

open override fun hashCode(): Int

internalWriteEntries

open fun internalWriteEntries(p0: ObjectOutputStream)

isEmpty

open override fun isEmpty(): Boolean

loadFactor

fun loadFactor(): Float

merge

open override fun merge(p0: String?, p1: V, p2: BiFunction<in V, in V, out V?>): V?

newNode

open fun newNode(p0: Int, p1: String?, p2: V?, p3: HashMap.Node<String?, V?>): HashMap.Node<String?, V?>

newTreeNode

open fun newTreeNode(p0: Int, p1: String?, p2: V?, p3: HashMap.Node<String?, V?>): HashMap.TreeNode<String?, V?>

put

open override fun put(key: String?, value: V?): V?

putAll

open override fun putAll(from: Map<out String?, V?>)

putIfAbsent

open override fun putIfAbsent(p0: String?, p1: V?): V?

putMapEntries

fun putMapEntries(p0: MutableMap<out String?, out V?>, p1: Boolean)

putVal

fun putVal(p0: Int, p1: String?, p2: V?, p3: Boolean, p4: Boolean): V?

reinitialize

open fun reinitialize()

remove

open override fun remove(key: String?): V?

open override fun remove(key: String?, value: V?): Boolean

removeNode

fun removeNode(p0: Int, p1: Any, p2: Any, p3: Boolean, p4: Boolean): HashMap.Node<String?, V?>

replace

open override fun replace(p0: String?, p1: V?): V?

open override fun replace(p0: String?, p1: V?, p2: V?): Boolean

replaceAll

open override fun replaceAll(p0: BiFunction<in String?, in V?, out V?>)

replacementNode

open fun replacementNode(p0: HashMap.Node<String?, V?>, p1: HashMap.Node<String?, V?>): HashMap.Node<String?, V?>

replacementTreeNode

open fun replacementTreeNode(p0: HashMap.Node<String?, V?>, p1: HashMap.Node<String?, V?>): HashMap.TreeNode<String?, V?>

resize

fun resize(): Array<HashMap.Node<String?, V?>>

toString

open override fun toString(): String

treeifyBin

fun treeifyBin(p0: Array<HashMap.Node<String?, V?>>, p1: Int)

Properties

entries

open override val entries: MutableSet<MutableMap.MutableEntry<String?, V?>>

entrySet

val entrySet: MutableSet<MutableMap.MutableEntry<String?, V?>>

keys

open override val keys: MutableSet<String?>

keySet

val keySet: MutableSet<String?>

loadFactor

val loadFactor: Float

modCount

val modCount: Int

size

val size: Int

size

open override val size: Int

table

val table: Array<HashMap.Node<String?, V?>>

threshold

val threshold: Int

values

open override val values: MutableCollection<V?>

values

val values: MutableCollection<V?>