Packages

object HashSet extends ImmutableSetFactory[HashSet] with Serializable

This object provides a set of operations needed to create immutable.HashSet values.

Source
HashSet.scala
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. HashSet
  2. Serializable
  3. Serializable
  4. ImmutableSetFactory
  5. SetFactory
  6. GenericSeqCompanion
  7. GenSetFactory
  8. GenericCompanion
  9. AnyRef
  10. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. class HashSet1 [A] extends LeafHashSet[A]
  2. class HashTrieSet [A] extends HashSet[A]

    A branch node of the HashTrieSet with at least one and up to 32 children.

    A branch node of the HashTrieSet with at least one and up to 32 children.

    A

    the type of the elements contained in this hash set. How levels work: When looking up or adding elements, the part of the hashcode that is used to address the children array depends on how deep we are in the tree. This is accomplished by having a level parameter in all internal methods that starts at 0 and increases by 5 (32 = 25) every time we go deeper into the tree. hashcode (binary): 00000000000000000000000000000000 level=0 (depth=0) level=5 (depth=1) level=10 (depth=2) ^^^^ ... Be careful: a non-toplevel HashTrieSet is not a self-contained set, so e.g. calling contains on it will not work! It relies on its depth in the Trie for which part of a hash to use to address the children, but this information (the level) is not stored due to storage efficiency reasons but has to be passed explicitly! How bitmap and elems correspond: A naive implementation of a HashTrieSet would always have an array of size 32 for children and leave the unused children empty (null). But that would be very wasteful regarding memory. Instead, only non-empty children are stored in elems, and the bitmap is used to encode which elem corresponds to which child bucket. The lowest 1 bit corresponds to the first element, the second-lowest to the second, etc. bitmap (binary): 00010000000000000000100000000000 elems: [a,b] children: ---b----------------a-----------

Value Members

  1. def apply[A](elems: A*): HashSet[A]

    Creates a collection with the specified elements.

    Creates a collection with the specified elements.

    A

    the type of the collection's elements

    elems

    the elements of the created collection

    returns

    a new collection with elements elems

    Definition Classes
    GenericCompanion
  2. implicit def canBuildFrom[A]: CanBuildFrom[Coll, A, HashSet[A]]

    The standard CanBuildFrom instance for immutable.HashSet objects.

  3. def empty[A]: HashSet[A]

    An empty collection of type Set[A]

    An empty collection of type Set[A]

    A

    the type of the set's elements

    Definition Classes
    ImmutableSetFactoryGenericCompanion
  4. def newBuilder[A]: Builder[A, HashSet[A]]

    The default builder for Set objects.

    The default builder for Set objects.

    A

    the type of the set's elements

    Definition Classes
    ImmutableSetFactoryGenSetFactoryGenericCompanion
  5. def setCanBuildFrom[A]: CanBuildFrom[HashSet[_], A, HashSet[A]]

    The standard CanBuildFrom instance for Set objects.

    The standard CanBuildFrom instance for Set objects.

    Definition Classes
    GenSetFactory