implicit class VertxAsyncMapOps[K, V] extends AnyRef
- Alphabetic
- By Inheritance
- VertxAsyncMapOps
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
- new VertxAsyncMapOps(target: AsyncMap[K, V])
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clearL(): Task[Unit]
Clear all entries in the map
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
getL(k: K): Task[V]
Get a value from the map, asynchronously.
Get a value from the map, asynchronously.
- k
the key
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
putIfAbsentL(k: K, v: V, ttl: Long): Task[V]
Link
#putIfAbsent
but specifying a time to live for the entry.Link
#putIfAbsent
but specifying a time to live for the entry. Entry will expire and get evicted after the ttl.- k
the key
- v
the value
- ttl
The time to live (in ms) for the entry
-
def
putIfAbsentL(k: K, v: V): Task[V]
Put the entry only if there is no entry with the key already present.
Put the entry only if there is no entry with the key already present. If key already present then the existing value will be returned to the handler, otherwise null.
- k
the key
- v
the value
-
def
putL(k: K, v: V, ttl: Long): Task[Unit]
Like
#put
but specifying a time to live for the entry.Like
#put
but specifying a time to live for the entry. Entry will expire and get evicted after the ttl.- k
the key
- v
the value
- ttl
The time to live (in ms) for the entry
-
def
putL(k: K, v: V): Task[Unit]
Put a value in the map, asynchronously.
Put a value in the map, asynchronously.
- k
the key
- v
the value
-
def
removeIfPresentL(k: K, v: V): Task[Boolean]
Remove a value from the map, only if entry already exists with same value.
Remove a value from the map, only if entry already exists with same value.
- k
the key
- v
the value
-
def
removeL(k: K): Task[V]
Remove a value from the map, asynchronously.
Remove a value from the map, asynchronously.
- k
the key
-
def
replaceIfPresentL(k: K, oldValue: V, newValue: V): Task[Boolean]
Replace the entry only if it is currently mapped to a specific value
Replace the entry only if it is currently mapped to a specific value
- k
the key
- oldValue
the existing value
- newValue
the new value
-
def
replaceL(k: K, v: V): Task[V]
Replace the entry only if it is currently mapped to some value
Replace the entry only if it is currently mapped to some value
- k
the key
- v
the new value
-
def
sizeL(): Task[Int]
Provide the number of entries in the map
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
- val target: AsyncMap[K, V]
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()