Packages

final class NonEmptySortedMap[K, V] extends AnyRef

A non-empty wrapper for the scala immutable map. Note - this does not attempt to implement all features of map but what the author considers to be the "normal ones".

Self Type
NonEmptySortedMap[K, V]
Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. NonEmptySortedMap
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Value Members

  1. def +(elem: (K, V)): NonEmptySortedMap[K, V]

    Creates a new NonEmptySortedMap with an additional element, unless the element is already present.

    Creates a new NonEmptySortedMap with an additional element, unless the element is already present.

    elem

    the element to be added

    returns

    a new map that contains all elements of this map and that also contains elem.

  2. def ++(elems: Iterable[(K, V)]): NonEmptySortedMap[K, V]

    Creates a new NonEmptySortedMap by adding all elements contained in another collection to this NonEmptySortedMap, omitting duplicates.

    Creates a new NonEmptySortedMap by adding all elements contained in another collection to this NonEmptySortedMap, omitting duplicates.

    This method takes a collection of elements and adds all elements, omitting duplicates, into NonEmptySortedMap.

    Example:

    scala> val a = NonEmptySortedMap(1, 2) ++ NonEmptySortedMap(2, "a")
a: zio.prelude.NonEmptySortedMap[Any] = NonEmptySortedMap(1, 2, a)
    elems

    the collection containing the elements to add.

    returns

    a new NonEmptySortedMap with the given elements added, omitting duplicates.

  3. def add(elem: (K, V)): NonEmptySortedMap[K, V]

    Adds the elem to this NonEmptySortedMap.

    Adds the elem to this NonEmptySortedMap. Alias for +.

  4. def equals(that: Any): Boolean
    Definition Classes
    NonEmptySortedMap → AnyRef → Any
  5. def hashCode(): Int
    Definition Classes
    NonEmptySortedMap → AnyRef → Any
  6. def keySet: NonEmptySortedSet[K]
  7. def mapValues[V1](f: (V) => V1): NonEmptySortedMap[K, V1]

    Produces a new non empty map where values mapped according to function f.

  8. def peel: ((K, V), SortedMap[K, V])

    Returns an element of this NonEmptySortedMap and the remainder, which is a (possibly empty) SortedMap.

    Returns an element of this NonEmptySortedMap and the remainder, which is a (possibly empty) SortedMap.

    Annotations
    @inline()
  9. def peelNonEmpty: ((K, V), Option[NonEmptySortedMap[K, V]])

    Returns an element of this NonEmptySortedMap and the remainder or None, if the remainder is empty.

  10. def remove(elem: K): SortedMap[K, V]

    Removes the elem from this NonEmptySortedMap.

    Removes the elem from this NonEmptySortedMap. Alias for -.

  11. def tailNonEmpty: Option[NonEmptySortedMap[K, V]]

    Returns the tail of this NonEmptySortedMap if it exists or None otherwise.

  12. def toMap: SortedMap[K, V]

    Converts this NonEmptySortedMap to a SortedMap.

  13. def toString(): String
    Definition Classes
    NonEmptySortedMap → AnyRef → Any
  14. def values: NonEmptyChunk[V]