Value Members

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

   Definition Classes

   AnyRef → Any

2.  final def ##: Int

   Definition Classes

   AnyRef → Any

3.  final def ==(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

4.  implicit def NonEmptySortedSetCommutativeIdempotent[A](implicit aOrd: scala.math.Ordering[A]): Commutative[NonEmptySortedSet[A]] with Idempotent[NonEmptySortedSet[A]]

   The Commutative and Idempotent (and thus Associative) instance for NonEmptySortedSet.

5.  implicit def NonEmptySortedSetDebug[A](implicit arg0: Debug[A]): Debug[NonEmptySortedSet[A]]

   Derives a Debug[NonEmptySortedSet[A]] given a Debug[A].

6.  implicit val NonEmptySortedSetDeriveEqual: DeriveEqual[NonEmptySortedSet]

   The DeriveEqual instance for NonEmptySortedSet.

7.  implicit def NonEmptySortedSetHashPartialOrd[A]: Hash[NonEmptySortedSet[A]] with PartialOrd[NonEmptySortedSet[A]]

   Derives a Hash[NonEmptySortedSet[A]] and PartialOrd[NonEmptySortedSet[A]] (and thus Equal[NonEmptyList[A]]) instance.

8.  def apply[A](elem: A, others: A*)(implicit ordering: scala.math.Ordering[A]): NonEmptySortedSet[A]
9.  def apply[A](elem: A, others: Iterable[A])(implicit ordering: scala.math.Ordering[A]): NonEmptySortedSet[A]
10.  final def asInstanceOf[T0]: T0

    Definition Classes

    Any

11.  def clone(): AnyRef

    Attributes

    protected[lang]

    Definition Classes

    AnyRef

    Annotations

    @throws(classOf[java.lang.CloneNotSupportedException]) @native()

12.  final def eq(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

13.  def equals(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef → Any

14.  def finalize(): Unit

    Attributes

    protected[lang]

    Definition Classes

    AnyRef

    Annotations

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

15.  def fromIterableOption[A](iterable: Iterable[A])(implicit ordering: scala.math.Ordering[A]): Option[NonEmptySortedSet[A]]

    Constructs a NonEmptySortedSet from an Iterable or None otherwise.

16.  def fromNonEmptyChunk[A](elems: NonEmptyChunk[A])(implicit ordering: scala.math.Ordering[A]): NonEmptySortedSet[A]

    Constructs a NonEmptyChunk from a NonEmptyList.

17.  def fromNonEmptyList[A](elems: NonEmptyList[A])(implicit ordering: scala.math.Ordering[A]): NonEmptySortedSet[A]

    Constructs a NonEmptySortedSet from a NonEmptyList.

18.  def fromSet[A](elem: A, others: SortedSet[A])(implicit ordering: scala.math.Ordering[A]): NonEmptySortedSet[A]

    Constructs a NonEmptySortedSet from an element and SortedSet.

19.  def fromSetOption[A](set: SortedSet[A])(implicit ordering: scala.math.Ordering[A]): Option[NonEmptySortedSet[A]]

    Constructs a NonEmptySortedSet from a SortedSet or None otherwise.

20.  final def getClass(): Class[_ <: AnyRef]

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

21.  def hashCode(): Int

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

22.  final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

23.  final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

24.  final def notify(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

25.  final def notifyAll(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

26.  def single[A](head: A)(implicit ordering: scala.math.Ordering[A]): NonEmptySortedSet[A]

    Constructs a NonEmptySortedSet with the specified single value.

27.  final def synchronized[T0](arg0: => T0): T0

    Definition Classes

    AnyRef

28.  implicit def toSet[A](nonEmptySet: NonEmptySortedSet[A]): Set[A]

    Provides an implicit conversion from NonEmptySortedSet to the Set for interoperability with Scala's collection library.

29.  def toString(): String

    Definition Classes

    AnyRef → Any

30.  def unapply[A](arg: NonEmptySortedSet[A]): Some[(A, SortedSet[A])]
31.  def union[A](l: SortedSet[A], r: NonEmptySortedSet[A])(implicit ordering: scala.math.Ordering[A]): NonEmptySortedSet[A]

    Creates a NonEmptySortedSet containing elements from l and r

32.  def union[A](l: NonEmptySortedSet[A], r: SortedSet[A])(implicit ordering: scala.math.Ordering[A]): NonEmptySortedSet[A]

    Creates a NonEmptySortedSet containing elements from l and r

33.  final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

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

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

    Definition Classes

    AnyRef

    Annotations

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

35.  final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws(classOf[java.lang.InterruptedException]) @native()