final class NonEmptySortedSet[A] extends AnyRef
- Self Type
- NonEmptySortedSet[A]
- Alphabetic
- By Inheritance
- NonEmptySortedSet
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- 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
.
- def ++(elems: Iterable[A]): NonEmptySortedSet[A]
Creates a new
NonEmptySortedSet
by adding all elements contained in another collection to thisNonEmptySortedSet
, omitting duplicates.Creates a new
NonEmptySortedSet
by adding all elements contained in another collection to thisNonEmptySortedSet
, 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.
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def add(elem: A): NonEmptySortedSet[A]
Adds the
elem
to thisNonEmptySortedSet
.Adds the
elem
to thisNonEmptySortedSet
. Alias for+
. - final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(that: Any): Boolean
- Definition Classes
- NonEmptySortedSet → AnyRef → Any
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def hashCode(): Int
- Definition Classes
- NonEmptySortedSet → AnyRef → Any
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def map[B](f: (A) => B)(implicit sOrdering: scala.math.Ordering[B]): NonEmptySortedSet[B]
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- 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()
- def peelNonEmpty: (A, Option[NonEmptySortedSet[A]])
Returns an element of this
NonEmptySortedSet
and the remainder orNone
, if the remainder is empty. - def remove(elem: A): SortedSet[A]
Removes the
elem
from thisNonEmptySortedSet
.Removes the
elem
from thisNonEmptySortedSet
. Alias for-
. - def removeNonEmpty(elem: A): Option[NonEmptySortedSet[A]]
removes the elem from
NonEmptySortedSet
, returning Some(NonEmptySortedSet) if there's anything left, otherwise None - final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def tailNonEmpty: Option[NonEmptySortedSet[A]]
Returns the tail of this
NonEmptySortedSet
if it exists orNone
otherwise. - def toNonEmptyChunk: NonEmptyChunk[A]
Converts this
NonEmptySortedSet
to aNonEmptyChunk
. - def toNonEmptyList: NonEmptyList[A]
Converts this
NonEmptySortedSet
to aNonEmptyList
. - def toSet: SortedSet[A]
Converts this
NonEmptySortedSet
to aSortedSet
. - def toString(): String
- Definition Classes
- NonEmptySortedSet → AnyRef → Any
- 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 setthat
.
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()