Packages

class SortedMultiSet[A] extends collection.SortedMultiSet[A] with SortedMultiSetOps[A, SortedMultiSet, SortedMultiSet[A]]

An immutable multiset whose elements are sorted.

A

Type of elements

Linear Supertypes
collection.SortedMultiSet[A], SortedMultiSetOps[A, SortedMultiSet, SortedMultiSet[A]], SortedOps[A, SortedMultiSet[A]], collection.MultiSet[A], Equals, MultiSetOps[A, collection.MultiSet, SortedMultiSet[A]], collection.Iterable[A], Traversable[A], IterableOps[A, collection.MultiSet, SortedMultiSet[A]], IterableOnce[A], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. SortedMultiSet
  2. SortedMultiSet
  3. SortedMultiSetOps
  4. SortedOps
  5. MultiSet
  6. Equals
  7. MultiSetOps
  8. Iterable
  9. Traversable
  10. IterableOps
  11. IterableOnce
  12. AnyRef
  13. Any
Implicitly
  1. by toLazyZipOps
  2. by iterableOnceExtensionMethods
  3. by any2stringadd
  4. by StringFormat
  5. by Ensuring
  6. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. class SortedWithFilter extends WithFilter

    Specialize WithFilter for sorted collections

    Specialize WithFilter for sorted collections

    Definition Classes
    SortedMultiSetOps
  2. class WithFilter extends collection.WithFilter[A, CC]
    Definition Classes
    IterableOps

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def +(elem: A): SortedMultiSet[A]

    Alias for incl

    Alias for incl

    Annotations
    @inline()
  4. final def ++[B >: A](suffix: collection.Iterable[B]): collection.MultiSet[B]
    Definition Classes
    IterableOps
    Annotations
    @inline()
  5. final def -(elem: A): SortedMultiSet[A]

    Alias for excl

    Alias for excl

    Annotations
    @inline()
  6. def ->[B](y: B): (SortedMultiSet[A], B)
    Implicit
    This member is added by an implicit conversion from SortedMultiSet[A] to ArrowAssoc[SortedMultiSet[A]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  7. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  8. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  9. def canEqual(that: Any): Boolean
    Definition Classes
    MultiSet → Equals
  10. def className: String
    Definition Classes
    IterableOps
  11. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  12. def coll: SortedMultiSet.this.type
    Attributes
    protected[this]
    Definition Classes
    Iterable → IterableOps
  13. def collect[B](pf: PartialFunction[A, B])(implicit arg0: Ordering[B]): SortedMultiSet[B]

    B

    the element type of the returned collection

    pf

    the partial function which filters and map this sorted multiset

    returns

    a new collection resulting from applying the given partial function pf to each element on which it is defined and collecting the results

    Definition Classes
    SortedMultiSetOps
  14. def collect[B](pf: PartialFunction[A, B]): collection.MultiSet[B]
    Definition Classes
    IterableOps
  15. def collectFirst[B](pf: PartialFunction[A, B]): Option[B]
    Definition Classes
    IterableOps
  16. def concat(that: collection.Iterable[A]): SortedMultiSet[A]

    that

    the collection of elements to add to this multiset

    returns

    a new multiset summing the occurrences of this multiset with the elements of that

    Definition Classes
    SortedMultiSetOpsMultiSetOps
  17. def concat[B >: A](suffix: collection.Iterable[B]): collection.MultiSet[B]
    Definition Classes
    IterableOps
  18. def concatOccurrences(that: collection.Iterable[(A, Int)]): SortedMultiSet[A]

    that

    the collection of occurrences to add to this multiset

    returns

    a new multiset summing the occurrences of this multiset and that collection of occurrences

    Definition Classes
    SortedMultiSetOpsMultiSetOps
  19. def contains(elem: A): Boolean

    elem

    the element to test

    returns

    Whether elem has at least one occurrence in this multiset or not

    Definition Classes
    MultiSetOps
  20. def copyToArray[B >: A](xs: Array[B], start: Int): xs.type
    Definition Classes
    IterableOps
  21. def count(p: (A) ⇒ Boolean): Int
    Definition Classes
    IterableOps
  22. def drop(n: Int): SortedMultiSet[A]
    Definition Classes
    IterableOps
  23. def dropRight(n: Int): SortedMultiSet[A]
    Definition Classes
    IterableOps
  24. def dropWhile(p: (A) ⇒ Boolean): SortedMultiSet[A]
    Definition Classes
    IterableOps
  25. def ensuring(cond: (SortedMultiSet[A]) ⇒ Boolean, msg: ⇒ Any): SortedMultiSet[A]
    Implicit
    This member is added by an implicit conversion from SortedMultiSet[A] to Ensuring[SortedMultiSet[A]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  26. def ensuring(cond: (SortedMultiSet[A]) ⇒ Boolean): SortedMultiSet[A]
    Implicit
    This member is added by an implicit conversion from SortedMultiSet[A] to Ensuring[SortedMultiSet[A]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  27. def ensuring(cond: Boolean, msg: ⇒ Any): SortedMultiSet[A]
    Implicit
    This member is added by an implicit conversion from SortedMultiSet[A] to Ensuring[SortedMultiSet[A]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  28. def ensuring(cond: Boolean): SortedMultiSet[A]
    Implicit
    This member is added by an implicit conversion from SortedMultiSet[A] to Ensuring[SortedMultiSet[A]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  29. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  30. def equals(o: Any): Boolean
    Definition Classes
    MultiSet → Equals → AnyRef → Any
  31. def excl(elem: A): SortedMultiSet[A]

    elem

    the element to remove

    returns

    an immutable sorted multiset containing all the elements of this multiset and one occurrence less of elem

  32. def exists(p: (A) ⇒ Boolean): Boolean
    Definition Classes
    IterableOps
  33. def filter(pred: (A) ⇒ Boolean): SortedMultiSet[A]
    Definition Classes
    IterableOps
  34. def filterNot(pred: (A) ⇒ Boolean): SortedMultiSet[A]
    Definition Classes
    IterableOps
  35. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  36. def find(p: (A) ⇒ Boolean): Option[A]
    Definition Classes
    IterableOps
  37. def firstKey: A
    Definition Classes
    SortedMultiSetOps → SortedOps
  38. def flatMap[B](f: (A) ⇒ IterableOnce[B])(implicit arg0: Ordering[B]): SortedMultiSet[B]

    Builds a new collection by applying a function to all elements of this sorted multiset and using the elements of the resulting collections.

    Builds a new collection by applying a function to all elements of this sorted multiset and using the elements of the resulting collections.

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

    a new collection resulting from applying the given function f to each element of this sorted multiset and concatenating the results.

    Definition Classes
    SortedMultiSetOps
  39. def flatMap[B](f: (A) ⇒ IterableOnce[B]): collection.MultiSet[B]
    Definition Classes
    IterableOps
  40. def flatMapOccurrences[B](f: ((A, Int)) ⇒ IterableOnce[(B, Int)])(implicit arg0: Ordering[B]): SortedMultiSet[B]

    Builds a new collection by applying a function to all pairs of element and its number of occurrences of this sorted multiset and using the elements of the resulting collections.

    Builds a new collection by applying a function to all pairs of element and its number of occurrences of this sorted multiset and using the elements of the resulting collections.

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

    a new collection resulting from applying the given function f to each pair of element and its number of occurrences of this sorted multiset and concatenating the results.

    Definition Classes
    SortedMultiSetOps
  41. def flatMapOccurrences[B](f: ((A, Int)) ⇒ IterableOnce[(B, Int)]): collection.MultiSet[B]

    B

    the element type of the returned collection

    f

    the function to apply

    returns

    a new multiset resulting from applying the given function f to each pair of element and its number of occurrences of this multiset and concatenating the results

    Definition Classes
    MultiSetOps
  42. def flatten[B](implicit ev: (A) ⇒ IterableOnce[B]): collection.MultiSet[B]
    Definition Classes
    IterableOps
  43. def foldLeft[B](z: B)(op: (B, A) ⇒ B): B
    Definition Classes
    IterableOps
  44. def foldRight[B](z: B)(op: (A, B) ⇒ B): B
    Definition Classes
    IterableOps
  45. def forall(p: (A) ⇒ Boolean): Boolean
    Definition Classes
    IterableOps
  46. def foreach[U](f: (A) ⇒ U): Unit
    Definition Classes
    IterableOps
  47. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from SortedMultiSet[A] to StringFormat[SortedMultiSet[A]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  48. def from(from: A): SortedMultiSet[A]
    Definition Classes
    SortedOps
  49. def fromIterable[E](it: collection.Iterable[E]): collection.MultiSet[E]
    Attributes
    protected[this]
    Definition Classes
    IterableOps
  50. def fromOccurrences[E](it: collection.Iterable[(E, Int)]): collection.MultiSet[E]
    Attributes
    protected[this]
    Definition Classes
    MultiSetOps
  51. def fromSpecificIterable(coll: collection.Iterable[A]): SortedMultiSet[A]
    Attributes
    protected[this]
    Definition Classes
    SortedMultiSet → IterableOps
  52. def get(elem: A): Int

    elem

    Element to look up

    returns

    The number of occurrences of elem in this multiset

    Definition Classes
    MultiSetOps
  53. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  54. def groupBy[K](f: (A) ⇒ K): Map[K, SortedMultiSet[A]]
    Definition Classes
    IterableOps
  55. def groupMap[K, B](key: (A) ⇒ K)(f: (A) ⇒ B): Map[K, collection.MultiSet[B]]
    Definition Classes
    IterableOps
  56. def groupMapReduce[K, B](key: (A) ⇒ K)(f: (A) ⇒ B)(reduce: (B, B) ⇒ B): Map[K, B]
    Definition Classes
    IterableOps
  57. def grouped(size: Int): Iterator[SortedMultiSet[A]]
    Definition Classes
    IterableOps
  58. def hashCode(): Int
    Definition Classes
    MultiSet → AnyRef → Any
  59. def head: A
    Definition Classes
    IterableOps
  60. def headOption: Option[A]
    Definition Classes
    IterableOps
  61. def incl(elem: A): SortedMultiSet[A]

    elem

    the element to add

    returns

    an immutable sorted multiset containing all the elements of this multiset and one more occurrence of elem

  62. def init: SortedMultiSet[A]
    Definition Classes
    IterableOps
  63. def isEmpty: Boolean
    Definition Classes
    IterableOps
  64. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  65. def iterableFactory: IterableFactoryLike[collection.MultiSet]
    Definition Classes
    SortedMultiSetOps → IterableOps
  66. def iterator(): Iterator[A]
    Definition Classes
    MultiSetOps → IterableOnce
  67. def iteratorFrom(start: A): Iterator[A]

    Creates an iterator that contains all values from this collection greater than or equal to start according to the ordering of this collection.

    Creates an iterator that contains all values from this collection greater than or equal to start according to the ordering of this collection. x.iteratorFrom(y) is equivalent to but will usually be more efficient than x.from(y).iterator

    start

    The lower-bound (inclusive) of the iterator

    Definition Classes
    SortedMultiSetOps
  68. def knownSize: Int
    Definition Classes
    IterableOps → IterableOnce
  69. def last: A
    Definition Classes
    IterableOps
  70. def lastKey: A
    Definition Classes
    SortedMultiSetOps → SortedOps
  71. def lastOption: Option[A]
    Definition Classes
    IterableOps
  72. def lazyZip[B](that: collection.Iterable[B]): LazyZip2[A, B, SortedMultiSet[A]]
    Implicit
    This member is added by an implicit conversion from SortedMultiSet[A] to LazyZipOps[A, SortedMultiSet[A]] performed by method toLazyZipOps in strawman.collection.Iterable.
    Definition Classes
    LazyZipOps
  73. def map[B](f: (A) ⇒ B)(implicit arg0: Ordering[B]): SortedMultiSet[B]

    Builds a new sorted multiset by applying a function to all elements of this sorted multiset.

    Builds a new sorted multiset by applying a function to all elements of this sorted multiset.

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

    a new collection resulting from applying the given function f to each element of this sorted multiset and collecting the results.

    Definition Classes
    SortedMultiSetOps
  74. def map[B](f: (A) ⇒ B): collection.MultiSet[B]
    Definition Classes
    IterableOps
  75. def mapOccurrences[B](f: ((A, Int)) ⇒ (B, Int))(implicit arg0: Ordering[B]): SortedMultiSet[B]

    Builds a new sorted multiset by applying a function to all pairs of element and its number of occurrences.

    Builds a new sorted multiset by applying a function to all pairs of element and its number of occurrences.

    B

    the element type of the returned collection

    f

    the function to apply

    returns

    a new collection resulting from applying the given function f to each pair of element and its number of occurrences of this sorted multiset and collecting the results.

    Definition Classes
    SortedMultiSetOps
  76. def mapOccurrences[B](f: ((A, Int)) ⇒ (B, Int)): collection.MultiSet[B]

    B

    the element type of the returned collection

    f

    the function to apply

    returns

    a new multiset resulting from applying the given function f to each pair of element and its number of occurrences of this multiset and collecting the results

    Definition Classes
    MultiSetOps
  77. def max[B >: A](implicit ord: Ordering[B]): A
    Definition Classes
    IterableOps
  78. def maxBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A
    Definition Classes
    IterableOps
  79. def min[B >: A](implicit ord: Ordering[B]): A
    Definition Classes
    IterableOps
  80. def minBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A
    Definition Classes
    IterableOps
  81. def mkString: String
    Definition Classes
    IterableOps
  82. def mkString(sep: String): String
    Definition Classes
    IterableOps
  83. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    IterableOps
  84. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  85. def newSpecificBuilder(): Builder[A, SortedMultiSet[A]]
    Attributes
    protected[this]
    Definition Classes
    SortedMultiSet → IterableOps
  86. def nonEmpty: Boolean
    Definition Classes
    IterableOps
  87. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  88. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  89. def occurrences: SortedMap[A, Int]

    returns

    All the elements contained in this multiset and their number of occurrences

    Definition Classes
    SortedMultiSetSortedMultiSetOpsMultiSetOps
  90. implicit val ordering: Ordering[A]
    Definition Classes
    SortedMultiSet → SortedOps
  91. def partition(p: (A) ⇒ Boolean): (SortedMultiSet[A], SortedMultiSet[A])
    Definition Classes
    IterableOps
  92. def product[B >: A](implicit num: Numeric[B]): B
    Definition Classes
    IterableOps
  93. def range(from: A, until: A): SortedMultiSet[A]
    Definition Classes
    SortedOps
  94. def rangeImpl(from: Option[A], until: Option[A]): SortedMultiSet[A]
    Definition Classes
    SortedMultiSet → SortedOps
  95. def rangeTo(to: A): SortedMultiSet[A]
    Definition Classes
    SortedMultiSetOps → SortedOps
  96. def reduce[B >: A](op: (B, B) ⇒ B): B
    Definition Classes
    IterableOps
  97. def reduceLeft[B >: A](op: (B, A) ⇒ B): B
    Definition Classes
    IterableOps
  98. def reduceLeftOption[B >: A](op: (B, A) ⇒ B): Option[B]
    Definition Classes
    IterableOps
  99. def reduceOption[B >: A](op: (B, B) ⇒ B): Option[B]
    Definition Classes
    IterableOps
  100. def reduceRight[B >: A](op: (A, B) ⇒ B): B
    Definition Classes
    IterableOps
  101. def reduceRightOption[B >: A](op: (A, B) ⇒ B): Option[B]
    Definition Classes
    IterableOps
  102. def reversed: collection.Iterable[A]
    Attributes
    protected[this]
    Definition Classes
    IterableOps
  103. def scan[B >: A](z: B)(op: (B, B) ⇒ B): collection.MultiSet[B]
    Definition Classes
    IterableOps
  104. def scanLeft[B](z: B)(op: (B, A) ⇒ B): collection.MultiSet[B]
    Definition Classes
    IterableOps
  105. def scanRight[B](z: B)(op: (A, B) ⇒ B): collection.MultiSet[B]
    Definition Classes
    IterableOps
  106. def size: Int
    Definition Classes
    IterableOps
  107. def slice(from: Int, until: Int): SortedMultiSet[A]
    Definition Classes
    IterableOps
  108. def sliding(size: Int, step: Int): Iterator[SortedMultiSet[A]]
    Definition Classes
    IterableOps
  109. def sliding(size: Int): Iterator[SortedMultiSet[A]]
    Definition Classes
    IterableOps
  110. def sortedFromIterable[B](it: collection.Iterable[B])(implicit arg0: Ordering[B]): SortedMultiSet[B]
    Attributes
    protected[this]
    Definition Classes
    SortedMultiSetSortedMultiSetOps
  111. def sortedFromOccurrences[B](it: collection.Iterable[(B, Int)])(implicit arg0: Ordering[B]): SortedMultiSet[B]
    Attributes
    protected[this]
    Definition Classes
    SortedMultiSetOps
  112. def sortedIterableFactory: SortedIterableFactory[SortedMultiSet]
    Definition Classes
    SortedMultiSetSortedMultiSetOps
  113. def span(p: (A) ⇒ Boolean): (SortedMultiSet[A], SortedMultiSet[A])
    Definition Classes
    IterableOps
  114. def splitAt(n: Int): (SortedMultiSet[A], SortedMultiSet[A])
    Definition Classes
    IterableOps
  115. def sum[B >: A](implicit num: Numeric[B]): B
    Definition Classes
    IterableOps
  116. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  117. def tail: SortedMultiSet[A]
    Definition Classes
    IterableOps
  118. def take(n: Int): SortedMultiSet[A]
    Definition Classes
    IterableOps
  119. def takeRight(n: Int): SortedMultiSet[A]
    Definition Classes
    IterableOps
  120. def takeWhile(p: (A) ⇒ Boolean): SortedMultiSet[A]
    Definition Classes
    IterableOps
  121. val this: SortedMultiSet[A]
    Implicit
    This member is added by an implicit conversion from SortedMultiSet[A] to LazyZipOps[A, SortedMultiSet[A]] performed by method toLazyZipOps in strawman.collection.Iterable.
    Definition Classes
    LazyZipOps
  122. def to[C1](factory: Factory[A, C1]): C1
    Definition Classes
    IterableOps
  123. def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    IterableOps
  124. def toIndexedSeq: IndexedSeq[A]
    Definition Classes
    IterableOps
  125. final def toIterable: SortedMultiSet.this.type
    Definition Classes
    Iterable → IterableOps
  126. def toList: List[A]
    Definition Classes
    IterableOps
  127. def toMap[K, V](implicit ev: <:<[A, (K, V)]): Map[K, V]
    Definition Classes
    IterableOps
  128. def toSeq: Seq[A]
    Definition Classes
    IterableOps
  129. def toSet[B >: A]: Set[B]
    Definition Classes
    IterableOps
  130. def toString(): String
    Definition Classes
    IterableOps → Any
  131. def toVector: Vector[A]
    Definition Classes
    IterableOps
  132. def transpose[B](implicit asIterable: (A) ⇒ collection.Iterable[B]): collection.MultiSet[collection.MultiSet[B]]
    Definition Classes
    IterableOps
  133. def unordered: collection.MultiSet[A]

    this sorted multiset upcasted to an unsorted multiset

    this sorted multiset upcasted to an unsorted multiset

    Definition Classes
    SortedMultiSetSortedMultiSetOps
  134. def until(until: A): SortedMultiSet[A]
    Definition Classes
    SortedOps
  135. def unzip[A1, A2](implicit asPair: <:<[A, (A1, A2)]): (collection.MultiSet[A1], collection.MultiSet[A2])
    Definition Classes
    IterableOps
  136. def view: View[A]
    Definition Classes
    IterableOps
  137. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  138. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  139. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  140. def withFilter(p: (A) ⇒ Boolean): SortedWithFilter
    Definition Classes
    SortedMultiSetOps → IterableOps
  141. def zip[B](that: collection.Iterable[B])(implicit ev: Ordering[B]): SortedMultiSet[(A, B)]

    Returns a sorted multiset formed from this sorted multiset and another iterable collection, by combining corresponding elements in pairs.

    Returns a sorted multiset formed from this sorted multiset and another iterable collection, by combining corresponding elements in pairs.

    B

    the type of the second half of the returned pairs

    that

    The iterable providing the second half of each result pair

    ev

    The ordering instance for type B

    returns

    a new sorted multiset containing pairs consisting of corresponding elements of this sorted multiset and that. The length of the returned collection is the minimum of the lengths of this and that

    Definition Classes
    SortedMultiSetOps
  142. def zip[B](that: collection.Iterable[B]): collection.MultiSet[(A, B)]
    Definition Classes
    IterableOps
  143. def zipWithIndex: SortedMultiSet[(A, Int)]
    Definition Classes
    SortedMultiSetOps → IterableOps
  144. def [B](y: B): (SortedMultiSet[A], B)
    Implicit
    This member is added by an implicit conversion from SortedMultiSet[A] to ArrowAssoc[SortedMultiSet[A]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Shadowed Implicit Value Members

  1. def +(other: String): String
    Implicit
    This member is added by an implicit conversion from SortedMultiSet[A] to any2stringadd[SortedMultiSet[A]] performed by method any2stringadd in scala.Predef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (sortedMultiSet: any2stringadd[SortedMultiSet[A]]).+(other)
    Definition Classes
    any2stringadd

Deprecated Value Members

  1. final def /:[B](z: B)(op: (B, A) ⇒ B): B
    Definition Classes
    IterableOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldLeft instead of /:

  2. final def :\[B](z: B)(op: (A, B) ⇒ B): B
    Definition Classes
    IterableOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldRight instead of :\

  3. def find(p: (A) ⇒ Boolean): Option[A]
    Implicit
    This member is added by an implicit conversion from SortedMultiSet[A] to IterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in strawman.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (sortedMultiSet: IterableOnceExtensionMethods[A]).find(p)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator().find instead of .find on IterableOnce

  4. def foreach[U](f: (A) ⇒ U): Unit
    Implicit
    This member is added by an implicit conversion from SortedMultiSet[A] to IterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in strawman.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (sortedMultiSet: IterableOnceExtensionMethods[A]).foreach(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator().foreach(...) instead of .foreach(...) on IterableOnce

  5. final def hasDefiniteSize: Boolean
    Definition Classes
    IterableOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .knownSize >=0 instead of .hasDefiniteSize

  6. def isEmpty: Boolean
    Implicit
    This member is added by an implicit conversion from SortedMultiSet[A] to IterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in strawman.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (sortedMultiSet: IterableOnceExtensionMethods[A]).isEmpty
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator().isEmpty instead of .isEmpty on IterableOnce

  7. def mkString: String
    Implicit
    This member is added by an implicit conversion from SortedMultiSet[A] to IterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in strawman.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (sortedMultiSet: IterableOnceExtensionMethods[A]).mkString
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator().mkString instead of .mkString on IterableOnce

  8. def mkString(sep: String): String
    Implicit
    This member is added by an implicit conversion from SortedMultiSet[A] to IterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in strawman.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (sortedMultiSet: IterableOnceExtensionMethods[A]).mkString(sep)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator().mkString instead of .mkString on IterableOnce

  9. def mkString(start: String, sep: String, end: String): String
    Implicit
    This member is added by an implicit conversion from SortedMultiSet[A] to IterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in strawman.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (sortedMultiSet: IterableOnceExtensionMethods[A]).mkString(start, sep, end)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator().mkString instead of .mkString on IterableOnce

  10. final def stringPrefix: String
    Definition Classes
    IterableOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use className instead of stringPrefix

  11. def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
    Implicit
    This member is added by an implicit conversion from SortedMultiSet[A] to IterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in strawman.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (sortedMultiSet: IterableOnceExtensionMethods[A]).toArray(arg0)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use ArrayBuffer.from(it).toArray

  12. def toBuffer[B >: A]: Buffer[B]
    Implicit
    This member is added by an implicit conversion from SortedMultiSet[A] to IterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in strawman.collection.IterableOnce.
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use ArrayBuffer.from(it) instead of it.toBuffer

  13. def toList[B >: A]: List[B]
    Implicit
    This member is added by an implicit conversion from SortedMultiSet[A] to IterableOnceExtensionMethods[A] performed by method iterableOnceExtensionMethods in strawman.collection.IterableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (sortedMultiSet: IterableOnceExtensionMethods[A]).toList
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use List.from(it) instead of it.toList

Inherited from collection.SortedMultiSet[A]

Inherited from SortedOps[A, SortedMultiSet[A]]

Inherited from collection.MultiSet[A]

Inherited from Equals

Inherited from collection.Iterable[A]

Inherited from Traversable[A]

Inherited from IterableOps[A, collection.MultiSet, SortedMultiSet[A]]

Inherited from IterableOnce[A]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion toLazyZipOps from SortedMultiSet[A] to LazyZipOps[A, SortedMultiSet[A]]

Inherited by implicit conversion iterableOnceExtensionMethods from SortedMultiSet[A] to IterableOnceExtensionMethods[A]

Inherited by implicit conversion any2stringadd from SortedMultiSet[A] to any2stringadd[SortedMultiSet[A]]

Inherited by implicit conversion StringFormat from SortedMultiSet[A] to StringFormat[SortedMultiSet[A]]

Inherited by implicit conversion Ensuring from SortedMultiSet[A] to Ensuring[SortedMultiSet[A]]

Inherited by implicit conversion ArrowAssoc from SortedMultiSet[A] to ArrowAssoc[SortedMultiSet[A]]

Ungrouped