ox.cads.collection

ShardedSet

class ShardedSet[A] extends HashSet[A]

A class representing a set of As, using sharding and synchronized blocks. The hashes are memoized, and also used to record deleted values.

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

Instance Constructors

  1. new ShardedSet()(implicit arg0: ClassTag[A])

  2. new ShardedSet(shards: Int, initSize: Int)(implicit arg0: ClassTag[A])

    shards

    the number of shards.

    initSize

    the initial size of each shard; this must be a power of 2 shards and initSize should be coprime.

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 clone(): AnyRef

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

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

    Definition Classes
    AnyRef

  9. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  10. def finalize(): Unit

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

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

    Definition Classes
    AnyRef → Any

  12. def hash(k: A): Int

    A hash value guaranteed to be non-negative

    A hash value guaranteed to be non-negative

    Attributes
    protected
    Definition Classes
    HashSet
    Annotations
    @inline()

  13. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  14. 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
    HashSet
    Annotations
    @inline()

  15. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

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

    Definition Classes
    AnyRef

  17. final def notify(): Unit

    Definition Classes
    AnyRef

  18. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  19. def putIfAbsent(key: A): Boolean

    Put key into the set.

    Put key into the set. Return true if it is a new value

    Definition Classes
    ShardedSet → HashSet

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

    Definition Classes
    AnyRef

  21. def toString(): String

    Definition Classes
    AnyRef → Any

  22. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

Inherited from HashSet[A]

Inherited from AnyRef

Inherited from Any

Ungrouped