object NonEmptySortedMap
Linear Supertypes
Ordering
- Alphabetic
 - By Inheritance
 
Inherited
- NonEmptySortedMap
 - AnyRef
 - Any
 
- Hide All
 - Show All
 
Visibility
- Public
 - Protected
 
Value Members
-   final  def !=(arg0: Any): Boolean
- Definition Classes
 - AnyRef → Any
 
 -   final  def ##: Int
- Definition Classes
 - AnyRef → Any
 
 -   final  def ==(arg0: Any): Boolean
- Definition Classes
 - AnyRef → Any
 
 -    def apply[K, V](elem: (K, V), others: (K, V)*)(implicit sOrdering: scala.math.Ordering[K]): NonEmptySortedMap[K, V]
Creates a
NonEmptySortedMapwith the specified elements.Creates a
NonEmptySortedMapwith the specified elements.- elem
 an element of the created
NonEmptySortedMap- others
 the remaining elements of the created
NonEmptySortedMap- returns
 a new
NonEmptySortedMapwith elementselemandothers
 -  def apply[K, V](elem: (K, V), others: Iterable[(K, V)])(implicit sOrdering: scala.math.Ordering[K]): NonEmptySortedMap[K, V]
 -   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(arg0: AnyRef): Boolean
- Definition Classes
 - AnyRef → Any
 
 -    def finalize(): Unit
- Attributes
 - protected[lang]
 - Definition Classes
 - AnyRef
 - Annotations
 - @throws(classOf[java.lang.Throwable])
 
 -    def fromIterableOption[K, V](iterable: Iterable[(K, V)])(implicit sOrdering: scala.math.Ordering[K]): Option[NonEmptySortedMap[K, V]]
Constructs a
NonEmptySortedMapfrom anIterableorNoneotherwise. -    def fromMap[K, V](elem: (K, V), others: SortedMap[K, V])(implicit sOrdering: scala.math.Ordering[K]): NonEmptySortedMap[K, V]
Constructs a
NonEmptySortedMapfrom an element andSortedMap. -    def fromMapOption[K, V](map: SortedMap[K, V])(implicit sOrdering: scala.math.Ordering[K]): Option[NonEmptySortedMap[K, V]]
Constructs a
NonEmptySortedMapfrom aSortedMaporNoneotherwise. -    def fromNonEmptyChunk[K, V](elems: NonEmptyChunk[(K, V)])(implicit sOrdering: scala.math.Ordering[K]): NonEmptySortedMap[K, V]
Constructs a
NonEmptySortedMapfrom aNonEmptyChunk. -    def fromNonEmptyList[K, V](elems: NonEmptyList[(K, V)])(implicit sOrdering: scala.math.Ordering[K]): NonEmptySortedMap[K, V]
Constructs a
NonEmptySortedMapfrom aNonEmptyList. -   final  def getClass(): Class[_ <: AnyRef]
- Definition Classes
 - AnyRef → Any
 - Annotations
 - @native()
 
 -    def hashCode(): Int
- Definition Classes
 - AnyRef → Any
 - Annotations
 - @native()
 
 -   final  def isInstanceOf[T0]: Boolean
- Definition Classes
 - Any
 
 -   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 single[K, V](head: (K, V))(implicit sOrdering: scala.math.Ordering[K]): NonEmptySortedMap[K, V]
Constructs a
NonEmptySortedMapwith the specified single value. -   final  def synchronized[T0](arg0: => T0): T0
- Definition Classes
 - AnyRef
 
 -   implicit  def toMap[K, V](nonEmptyMap: NonEmptySortedMap[K, V]): SortedMap[K, V]
Provides an implicit conversion from
NonEmptySortedMapto theSortedMapfor interoperability with Scala's collection library. -    def toString(): String
- Definition Classes
 - AnyRef → Any
 
 -  def unapply[K, V](arg: NonEmptySortedMap[K, V]): Some[((K, V), SortedMap[K, V])]
 -   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()