toggle menu
Simple Robot
3.3.0
jvm
switch theme
search in API
simbot-api
/
love.forte.simbot.utils
/
WeakMap
Weak
Map
class
WeakMap
<
K
,
V
>
(
delegateMap
:
MutableMap
<
K
,
WeakReference
<
V
>
>
)
:
MutableMap
<
K
,
V
>
(
source
)
Value值为 weak 的 Map。
Author
ForteScarlet
Members
Constructors
Weak
Map
Link copied to clipboard
constructor
(
delegateMap
:
MutableMap
<
K
,
WeakReference
<
V
>
>
)
Properties
entries
Link copied to clipboard
open
override
val
entries
:
MutableSet
<
MutableMap.MutableEntry
<
K
,
V
>
>
keys
Link copied to clipboard
open
override
val
keys
:
MutableSet
<
K
>
size
Link copied to clipboard
open
override
val
size
:
Int
values
Link copied to clipboard
open
override
val
values
:
MutableCollection
<
V
>
Functions
clear
Link copied to clipboard
open
override
fun
clear
(
)
compute
Link copied to clipboard
open
fun
compute
(
p0
:
K
,
p1
:
BiFunction
<
in
K
,
in
V
?
,
out
V
?
>
)
:
V
?
compute
If
Absent
Link copied to clipboard
open
fun
computeIfAbsent
(
p0
:
K
,
p1
:
Function
<
in
K
,
out
V
>
)
:
V
compute
If
Present
Link copied to clipboard
open
fun
computeIfPresent
(
p0
:
K
,
p1
:
BiFunction
<
in
K
,
in
V
&
Any
,
out
V
?
>
)
:
V
?
contains
Key
Link copied to clipboard
open
override
fun
containsKey
(
key
:
K
)
:
Boolean
contains
Value
Link copied to clipboard
open
override
fun
containsValue
(
value
:
V
)
:
Boolean
for
Each
Link copied to clipboard
open
fun
forEach
(
p0
:
BiConsumer
<
in
K
,
in
V
>
)
get
Link copied to clipboard
open
operator override
fun
get
(
key
:
K
)
:
V
?
get
Or
Default
Link copied to clipboard
open
fun
getOrDefault
(
key
:
K
,
defaultValue
:
V
)
:
V
is
Empty
Link copied to clipboard
open
override
fun
isEmpty
(
)
:
Boolean
merge
Link copied to clipboard
open
fun
merge
(
p0
:
K
,
p1
:
V
&
Any
,
p2
:
BiFunction
<
in
V
&
Any
,
in
V
&
Any
,
out
V
?
>
)
:
V
?
put
Link copied to clipboard
open
override
fun
put
(
key
:
K
,
value
:
V
)
:
V
?
put
All
Link copied to clipboard
open
override
fun
putAll
(
from
:
Map
<
out
K
,
V
>
)
put
If
Absent
Link copied to clipboard
open
fun
putIfAbsent
(
p0
:
K
,
p1
:
V
)
:
V
?
remove
Link copied to clipboard
open
fun
remove
(
key
:
K
,
value
:
V
)
:
Boolean
open
override
fun
remove
(
key
:
K
)
:
V
?
replace
Link copied to clipboard
open
fun
replace
(
p0
:
K
,
p1
:
V
)
:
V
?
open
fun
replace
(
p0
:
K
,
p1
:
V
,
p2
:
V
)
:
Boolean
replace
All
Link copied to clipboard
open
fun
replaceAll
(
p0
:
BiFunction
<
in
K
,
in
V
,
out
V
>
)