package collection
Ordering
- Alphabetic
Visibility
- Public
- All
Type Members
-
final
class
IndexedSet[A, B] extends AbstractSet[A] with SetLike[A, IndexedSet[A, B]]
This class implements immutable indexed sets using a hash trie.
This class implements immutable indexed sets using a hash trie.
An indexed set is like a set, however elements are indexed (hashed) by a given key. A function
indexedBy: A => Bis used to map elements to their keys. The key can be used to test for membership or retrieve the element, like in a map.Indexed sets guarantee no two elements share the same key.
- A
the type of the elements contained in this indexed set
- B
the type of the keys in this indexed set
Value Members
-
object
IndexedSet
This object provides a set of operations needed to create
IndexedSetvalues.