ox.cads.collection

RecursiveSplitOrderingMap

class RecursiveSplitOrderingMap[A, B] extends HashMap[A, B]

A lock-free map using recursive split ordering. Based on Herlihy & Shavit, Section 13.3

Linear Supertypes
HashMap[A, B], AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. RecursiveSplitOrderingMap
  2. HashMap
  3. AnyRef
  4. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new RecursiveSplitOrderingMap(capacity: Int)

Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any

  3. final def ##(): Int

    Definition Classes
    AnyRef → Any

  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any

  6. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  7. def clear: Unit

    Clear the mapping.

    Clear the mapping.

    Definition Classes
    RecursiveSplitOrderingMap → HashMap

  8. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()

  9. def delete(arg: A): Unit

    Delete the value associated with arg

    Delete the value associated with arg

    Definition Classes
    RecursiveSplitOrderingMap → HashMap

  10. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  11. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  12. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()

  13. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any

  14. def getOrElse(arg: A, default: ⇒ B): B

    Get the value associated with arg, or default is arg is not in the map

    Get the value associated with arg, or default is arg is not in the map

    Definition Classes
    RecursiveSplitOrderingMap → HashMap

  15. def getOrElseUpdate(arg: A, op: ⇒ B): B

    If k is not in the map, initialise it to the result of op; otherwise return the value it maps to.

    If k is not in the map, initialise it to the result of op; otherwise return the value it maps to.

    Definition Classes
    RecursiveSplitOrderingMap → HashMap

  16. def hash(k: A): Int

    A hash value.

    A hash value.

    Attributes
    protected
    Definition Classes
    HashMap
    Annotations
    @inline()

  17. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  18. final def improve(hcode: Int): Int

    Improve the quality of a hash.

    Improve the quality of a hash. Code taken from the code for java.util.concurrent.ConcurrentHashMap

    Attributes
    protected
    Definition Classes
    HashMap
    Annotations
    @inline()

  19. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  20. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  21. final def notify(): Unit

    Definition Classes
    AnyRef

  22. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  23. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef

  24. def toString(): String

    Definition Classes
    AnyRef → Any

  25. def update(arg: A, datum: B): Unit

    Add the maplet arg -> datum to the map

    Add the maplet arg -> datum to the map

    Definition Classes
    RecursiveSplitOrderingMap → HashMap

  26. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

  27. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

  28. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

Inherited from HashMap[A, B]

Inherited from AnyRef

Inherited from Any

Ungrouped