NonEmptySortedSet

Value Members

1. final def !=(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

3. 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.

4. 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.

5. final def ==(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

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

   

   Adds the elem to this NonEmptySortedSet.

   Adds the elem to this NonEmptySortedSet. Alias for +.

7. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

8. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

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

   

   Definition Classes

   AnyRef

10. def equals(that: Any): Boolean

    

    Definition Classes

    NonEmptySortedSet → AnyRef → Any

11. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

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

    

    Definition Classes

    AnyRef → Any

13. def hashCode(): Int

    

    Definition Classes

    NonEmptySortedSet → AnyRef → Any

14. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

15. def map[B](f: (A) ⇒ B)(implicit sOrdering: scala.math.Ordering[B]): NonEmptySortedSet[B]

    

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 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()

20. def peelNonEmpty: (A, Option[NonEmptySortedSet[A]])

    

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

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

    

    Removes the elem from this NonEmptySortedSet.

    Removes the elem from this NonEmptySortedSet. Alias for -.

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

    

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

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

    

    Definition Classes

    AnyRef

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

    

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

25. def toNonEmptyChunk: NonEmptyChunk[A]

    

    Converts this NonEmptySortedSet to a NonEmptyChunk.

26. def toNonEmptyList: NonEmptyList[A]

    

    Converts this NonEmptySortedSet to a NonEmptyList.

27. def toSet: SortedSet[A]

    

    Converts this NonEmptySortedSet to a SortedSet.

28. def toString(): String

    

    Definition Classes

    NonEmptySortedSet → AnyRef → Any

29. 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.

30. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )