final class PNCounterMap[K] extends AbstractORMapWrapper[K, Long, PNCounter] with Map[K, Long]

Convenience wrapper class for ORMap that uses PNCounter's for values.

This offers a few extra methods for interacting with the map.

Linear Supertypes
AbstractORMapWrapper[K, Long, PNCounter], AbstractMap[K, Long], Map[K, Long], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. PNCounterMap
  2. AbstractORMapWrapper
  3. AbstractMap
  4. Map
  5. AnyRef
  6. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new PNCounterMap(ormap: ORMap[K, PNCounter])

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def clear(): Unit
    Definition Classes
    AbstractORMapWrapper → AbstractMap → Map
  6. def clone(): AnyRef
    Attributes
    protected[util]
    Definition Classes
    AbstractMap → AnyRef
    Annotations
    @throws( ... )
  7. def compute(arg0: K, arg1: BiFunction[_ >: K, _ >: Long, _ <: Long]): Long
    Definition Classes
    Map
  8. def computeIfAbsent(arg0: K, arg1: Function[_ >: K, _ <: Long]): Long
    Definition Classes
    Map
  9. def computeIfPresent(arg0: K, arg1: BiFunction[_ >: K, _ >: Long, _ <: Long]): Long
    Definition Classes
    Map
  10. def containsKey(key: Any): Boolean
    Definition Classes
    AbstractORMapWrapper → AbstractMap → Map
  11. def containsValue(arg0: Any): Boolean
    Definition Classes
    AbstractMap → Map
  12. def decrement(key: Any, by: Long): Long

    Decrement the counter at the given key by the given amount.

    Decrement the counter at the given key by the given amount.

    The counter will be created if it is not already in the map.

    key

    The key of the counter.

    by

    The amount to decrement by.

    returns

    The new value of the counter.

  13. def entrySet(): Set[Entry[K, Long]]
    Definition Classes
    AbstractORMapWrapper → AbstractMap → Map
  14. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  15. def equals(arg0: Any): Boolean
    Definition Classes
    AbstractMap → Map → AnyRef → Any
  16. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  17. def forEach(arg0: BiConsumer[_ >: K, _ >: Long]): Unit
    Definition Classes
    Map
  18. def get(key: Any): Long
    Definition Classes
    AbstractORMapWrapper → AbstractMap → Map
  19. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  20. def getOrDefault(arg0: Any, arg1: Long): Long
    Definition Classes
    Map
  21. def getValue(key: Any): Long

    Get the value for the given key.

    Get the value for the given key.

    This differs from Map#get(Object) in that it returns a primitive long, and thus avoids an allocation.

    key

    The key to get the value for.

    returns

    The current value of the counter at that key, or zero if no counter exists for that key.

  22. def hashCode(): Int
    Definition Classes
    AbstractMap → Map → AnyRef → Any
  23. def increment(key: Any, by: Long): Long

    Increment the counter at the given key by the given amount.

    Increment the counter at the given key by the given amount.

    The counter will be created if it is not already in the map.

    key

    The key of the counter.

    by

    The amount to increment by.

    returns

    The new value of the counter.

  24. def isEmpty(): Boolean
    Definition Classes
    AbstractMap → Map
  25. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  26. def keySet(): Set[K]
    Definition Classes
    AbstractORMapWrapper → AbstractMap → Map
  27. def merge(arg0: K, arg1: Long, arg2: BiFunction[_ >: Long, _ >: Long, _ <: Long]): Long
    Definition Classes
    Map
  28. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  29. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  30. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  31. def put(key: K, value: Long): Long

    Not supported on PNCounter, use increment/decrement instead.

    Not supported on PNCounter, use increment/decrement instead.

    Definition Classes
    PNCounterMap → AbstractORMapWrapper → AbstractMap → Map
  32. def putAll(arg0: Map[_ <: K, _ <: Long]): Unit
    Definition Classes
    AbstractMap → Map
  33. def putIfAbsent(arg0: K, arg1: Long): Long
    Definition Classes
    Map
  34. def remove(key: Any): Long
    Definition Classes
    AbstractORMapWrapper → AbstractMap → Map
  35. def remove(arg0: Any, arg1: Any): Boolean
    Definition Classes
    Map
  36. def replace(arg0: K, arg1: Long): Long
    Definition Classes
    Map
  37. def replace(arg0: K, arg1: Long, arg2: Long): Boolean
    Definition Classes
    Map
  38. def replaceAll(arg0: BiFunction[_ >: K, _ >: Long, _ <: Long]): Unit
    Definition Classes
    Map
  39. def size(): Int
    Definition Classes
    AbstractORMapWrapper → AbstractMap → Map
  40. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  41. def toString(): String
    Definition Classes
    AbstractMap → AnyRef → Any
  42. def values(): Collection[Long]
    Definition Classes
    AbstractMap → Map
  43. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  44. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  45. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()

Inherited from AbstractORMapWrapper[K, Long, PNCounter]

Inherited from AbstractMap[K, Long]

Inherited from Map[K, Long]

Inherited from AnyRef

Inherited from Any

Ungrouped