Packages

final class NonEmptySortedSet[A] extends AnyRef

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

Value Members

  1. def +(elem: A): NonEmptySortedSet[A]

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

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

    elem

    the element to be added

    returns

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

  2. def ++(elems: Iterable[A]): NonEmptySortedSet[A]

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

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

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

    Example:

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

    the collection containing the elements to add.

    returns

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

  3. def add(elem: A): NonEmptySortedSet[A]

    Adds the elem to this NonEmptySortedSet.

    Adds the elem to this NonEmptySortedSet. Alias for +.

  4. def equals(that: Any): Boolean
    Definition Classes
    NonEmptySortedSet → AnyRef → Any
  5. def hashCode(): Int
    Definition Classes
    NonEmptySortedSet → AnyRef → Any
  6. def map[B](f: (A) => B)(implicit sOrdering: scala.math.Ordering[B]): NonEmptySortedSet[B]
  7. def peel: (A, SortedSet[A])

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

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

    Annotations
    @inline()
  8. def peelNonEmpty: (A, Option[NonEmptySortedSet[A]])

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

  9. def remove(elem: A): SortedSet[A]

    Removes the elem from this NonEmptySortedSet.

    Removes the elem from this NonEmptySortedSet. Alias for -.

  10. def removeNonEmpty(elem: A): Option[NonEmptySortedSet[A]]

    removes the elem from NonEmptySortedSet, returning Some(NonEmptySortedSet) if there's anything left, otherwise None

  11. def tailNonEmpty: Option[NonEmptySortedSet[A]]

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

  12. def toNonEmptyChunk: NonEmptyChunk[A]

    Converts this NonEmptySortedSet to a NonEmptyChunk.

  13. def toNonEmptyList: NonEmptyList[A]

    Converts this NonEmptySortedSet to a NonEmptyList.

  14. def toSet: SortedSet[A]

    Converts this NonEmptySortedSet to a SortedSet.

  15. def toString(): String
    Definition Classes
    NonEmptySortedSet → AnyRef → Any
  16. def union(that: SortedSet[A]): NonEmptySortedSet[A]

    Computes the union between of NonEmptySortedSet and another set.

    Computes the union between of NonEmptySortedSet and another set.

    that

    the set to form the union with.

    returns

    a new NonEmptySortedSet consisting of all elements that are in this set or in the given set that.