class MultiSet[T] extends MutableList[T]
The MultiSet
class provides an implementation for Union, Intersection and
Subset for the generic MultiSet
data type that extends MutableList
.
- Alphabetic
- By Inheritance
- MultiSet
- MutableList
- Serializable
- Serializable
- Builder
- Growable
- Clearable
- LinearSeqOptimized
- LinearSeq
- LinearSeq
- LinearSeqLike
- AbstractSeq
- Seq
- SeqLike
- Cloneable
- Cloneable
- Cloneable
- Iterable
- Traversable
- Mutable
- AbstractSeq
- Seq
- SeqLike
- GenSeq
- GenSeqLike
- PartialFunction
- Function1
- AbstractIterable
- Iterable
- IterableLike
- Equals
- GenIterable
- GenIterableLike
- AbstractTraversable
- Traversable
- GenTraversable
- GenericTraversableTemplate
- TraversableLike
- GenTraversableLike
- Parallelizable
- TraversableOnce
- GenTraversableOnce
- FilterMonadic
- HasNewBuilder
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
- new MultiSet()
Type Members
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
def
++[B >: T, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[MutableList[T], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
++:[B >: T, That](that: Traversable[B])(implicit bf: CanBuildFrom[MutableList[T], B, That]): That
- Definition Classes
- TraversableLike
-
def
++:[B >: T, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[MutableList[T], B, That]): That
- Definition Classes
- TraversableLike
-
def
++=(xs: TraversableOnce[T]): MultiSet.this.type
- Definition Classes
- Growable
-
def
+:[B >: T, That](elem: B)(implicit bf: CanBuildFrom[MutableList[T], B, That]): That
- Definition Classes
- SeqLike → GenSeqLike
-
def
+=(elem: T): MultiSet.this.type
- Definition Classes
- MutableList → Builder → Growable
-
def
+=(elem1: T, elem2: T, elems: T*): MultiSet.this.type
- Definition Classes
- Growable
-
def
+=:(elem: T): MultiSet.this.type
- Definition Classes
- MutableList
-
def
/:[B](z: B)(op: (B, T) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
:+[B >: T, That](elem: B)(implicit bf: CanBuildFrom[MutableList[T], B, That]): That
- Definition Classes
- SeqLike → GenSeqLike
-
def
:\[B](z: B)(op: (T, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
addString(b: StringBuilder): StringBuilder
- Definition Classes
- TraversableOnce
-
def
addString(b: StringBuilder, sep: String): StringBuilder
- Definition Classes
- TraversableOnce
-
def
addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
- Definition Classes
- TraversableOnce
-
def
aggregate[B](z: ⇒ B)(seqop: (B, T) ⇒ B, combop: (B, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
andThen[C](k: (T) ⇒ C): PartialFunction[Int, C]
- Definition Classes
- PartialFunction → Function1
-
def
appendElem(elem: T): Unit
- Attributes
- protected
- Definition Classes
- MutableList
-
def
apply(n: Int): T
- Definition Classes
- MutableList → LinearSeqOptimized → SeqLike → GenSeqLike → Function1
-
def
applyOrElse[A1 <: Int, B1 >: T](x: A1, default: (A1) ⇒ B1): B1
- Definition Classes
- PartialFunction
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
canEqual(that: Any): Boolean
- Definition Classes
- IterableLike → Equals
-
def
clear(): Unit
- Definition Classes
- MutableList → Builder → Growable → Clearable
-
def
clone(): MutableList[T]
- Definition Classes
- MutableList → Cloneable → AnyRef
-
def
collect[B, That](pf: PartialFunction[T, B])(implicit bf: CanBuildFrom[MutableList[T], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
collectFirst[B](pf: PartialFunction[T, B]): Option[B]
- Definition Classes
- TraversableOnce
-
def
combinations(n: Int): Iterator[MutableList[T]]
- Definition Classes
- SeqLike
-
def
companion: GenericCompanion[MutableList]
- Definition Classes
- MutableList → LinearSeq → LinearSeq → Seq → Iterable → Traversable → Seq → GenSeq → Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
-
def
compose[A](g: (A) ⇒ Int): (A) ⇒ T
- Definition Classes
- Function1
- Annotations
- @unspecialized()
-
def
contains[A1 >: T](elem: A1): Boolean
- Definition Classes
- LinearSeqOptimized → SeqLike
-
def
containsSlice[B](that: GenSeq[B]): Boolean
- Definition Classes
- SeqLike
-
def
copyToArray[B >: T](xs: Array[B], start: Int, len: Int): Unit
- Definition Classes
- IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: T](xs: Array[B]): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: T](xs: Array[B], start: Int): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToBuffer[B >: T](dest: Buffer[B]): Unit
- Definition Classes
- TraversableOnce
-
final
def
corresponds[B](that: GenSeq[B])(p: (T, B) ⇒ Boolean): Boolean
- Definition Classes
- LinearSeqLike → SeqLike → GenSeqLike
- Annotations
- @tailrec()
-
def
count(p: (T) ⇒ Boolean): Int
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
diff[B >: T](that: GenSeq[B]): MutableList[T]
- Definition Classes
- SeqLike → GenSeqLike
-
def
distinct: MutableList[T]
- Definition Classes
- SeqLike → GenSeqLike
-
def
drop(n: Int): MutableList[T]
- Definition Classes
- LinearSeqOptimized → IterableLike → TraversableLike → GenTraversableLike
-
def
dropRight(n: Int): MutableList[T]
- Definition Classes
- LinearSeqOptimized → IterableLike
-
def
dropWhile(p: (T) ⇒ Boolean): MutableList[T]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
endsWith[B](that: GenSeq[B]): Boolean
- Definition Classes
- SeqLike → GenSeqLike
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(that: Any): Boolean
- Definition Classes
- GenSeqLike → Equals → Any
-
def
exists(p: (T) ⇒ Boolean): Boolean
- Definition Classes
- LinearSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
filter(p: (T) ⇒ Boolean): MutableList[T]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
filterNot(p: (T) ⇒ Boolean): MutableList[T]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
find(p: (T) ⇒ Boolean): Option[T]
- Definition Classes
- LinearSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
var
first0: LinkedList[T]
- Attributes
- protected
- Definition Classes
- MutableList
-
def
flatMap[B, That](f: (T) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[MutableList[T], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike → FilterMonadic
-
def
flatten[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): MutableList[B]
- Definition Classes
- GenericTraversableTemplate
-
def
fold[A1 >: T](z: A1)(op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldLeft[B](z: B)(op: (B, T) ⇒ B): B
- Definition Classes
- LinearSeqOptimized → TraversableOnce → GenTraversableOnce
-
def
foldRight[B](z: B)(op: (T, B) ⇒ B): B
- Definition Classes
- LinearSeqOptimized → IterableLike → TraversableOnce → GenTraversableOnce
-
def
forall(p: (T) ⇒ Boolean): Boolean
- Definition Classes
- LinearSeqOptimized → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
-
def
foreach[U](f: (T) ⇒ U): Unit
- Definition Classes
- LinearSeqOptimized → IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
-
def
genericBuilder[B]: Builder[B, MutableList[B]]
- Definition Classes
- GenericTraversableTemplate
-
def
get(n: Int): Option[T]
- Definition Classes
- MutableList
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
groupBy[K](f: (T) ⇒ K): Map[K, MutableList[T]]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
grouped(size: Int): Iterator[MutableList[T]]
- Definition Classes
- IterableLike
-
def
hasDefiniteSize: Boolean
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
hashCode(): Int
- Definition Classes
- LinearSeqLike → GenSeqLike → AnyRef → Any
-
def
head: T
- Definition Classes
- MutableList → LinearSeqOptimized → IterableLike → GenericTraversableTemplate → TraversableLike → GenTraversableLike
-
def
headOption: Option[T]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
indexOf[B >: T](elem: B, from: Int): Int
- Definition Classes
- GenSeqLike
-
def
indexOf[B >: T](elem: B): Int
- Definition Classes
- GenSeqLike
-
def
indexOfSlice[B >: T](that: GenSeq[B], from: Int): Int
- Definition Classes
- SeqLike
-
def
indexOfSlice[B >: T](that: GenSeq[B]): Int
- Definition Classes
- SeqLike
-
def
indexWhere(p: (T) ⇒ Boolean, from: Int): Int
- Definition Classes
- LinearSeqOptimized → SeqLike → GenSeqLike
-
def
indexWhere(p: (T) ⇒ Boolean): Int
- Definition Classes
- GenSeqLike
-
def
indices: Range
- Definition Classes
- SeqLike
-
def
init: MutableList[T]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
inits: Iterator[MutableList[T]]
- Definition Classes
- TraversableLike
-
def
intersect(b: MultiSet[T]): MultiSet[T]
Return a new
MultiSet
that is the intersection of 'this' and 'b'.Return a new
MultiSet
that is the intersection of 'this' and 'b'.- b
the other
MultiSet
-
def
intersect[B >: T](that: GenSeq[B]): MutableList[T]
- Definition Classes
- SeqLike → GenSeqLike
-
def
isDefinedAt(x: Int): Boolean
- Definition Classes
- LinearSeqOptimized → GenSeqLike
-
def
isEmpty: Boolean
- Definition Classes
- MutableList → LinearSeqOptimized → SeqLike → IterableLike → GenericTraversableTemplate → TraversableLike → TraversableOnce → GenTraversableOnce
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
isTraversableAgain: Boolean
- Definition Classes
- TraversableLike → GenTraversableLike → GenTraversableOnce
-
def
iterator: Iterator[T]
- Definition Classes
- MutableList → LinearSeqLike → IterableLike → GenIterableLike
-
def
last: T
- Definition Classes
- MutableList → LinearSeqOptimized → TraversableLike → GenTraversableLike
-
var
last0: LinkedList[T]
- Attributes
- protected
- Definition Classes
- MutableList
-
def
lastIndexOf[B >: T](elem: B, end: Int): Int
- Definition Classes
- GenSeqLike
-
def
lastIndexOf[B >: T](elem: B): Int
- Definition Classes
- GenSeqLike
-
def
lastIndexOfSlice[B >: T](that: GenSeq[B], end: Int): Int
- Definition Classes
- SeqLike
-
def
lastIndexOfSlice[B >: T](that: GenSeq[B]): Int
- Definition Classes
- SeqLike
-
def
lastIndexWhere(p: (T) ⇒ Boolean, end: Int): Int
- Definition Classes
- LinearSeqOptimized → SeqLike → GenSeqLike
-
def
lastIndexWhere(p: (T) ⇒ Boolean): Int
- Definition Classes
- GenSeqLike
-
def
lastOption: Option[T]
- Definition Classes
- TraversableLike → GenTraversableLike
-
var
len: Int
- Attributes
- protected
- Definition Classes
- MutableList
-
def
length: Int
- Definition Classes
- MutableList → LinearSeqOptimized → SeqLike → GenSeqLike
-
def
lengthCompare(len: Int): Int
- Definition Classes
- LinearSeqOptimized → SeqLike
-
def
lift: (Int) ⇒ Option[T]
- Definition Classes
- PartialFunction
-
def
map[B, That](f: (T) ⇒ B)(implicit bf: CanBuildFrom[MutableList[T], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike → FilterMonadic
-
def
mapResult[NewTo](f: (MutableList[T]) ⇒ NewTo): Builder[T, NewTo]
- Definition Classes
- Builder
-
def
max[B >: T](implicit cmp: Ordering[B]): T
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
maxBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
min[B >: T](implicit cmp: Ordering[B]): T
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
minBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString: String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString(sep: String): String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString(start: String, sep: String, end: String): String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
newBuilder: Builder[T, MutableList[T]]
- Attributes
- protected[this]
- Definition Classes
- MutableList → GenericTraversableTemplate → TraversableLike → HasNewBuilder
-
def
nonEmpty: Boolean
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
orElse[A1 <: Int, B1 >: T](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
- Definition Classes
- PartialFunction
-
def
padTo[B >: T, That](len: Int, elem: B)(implicit bf: CanBuildFrom[MutableList[T], B, That]): That
- Definition Classes
- SeqLike → GenSeqLike
-
def
par: ParSeq[T]
- Definition Classes
- Parallelizable
-
def
parCombiner: Combiner[T, ParSeq[T]]
- Attributes
- protected[this]
- Definition Classes
- SeqLike → SeqLike → TraversableLike → Parallelizable
-
def
partition(p: (T) ⇒ Boolean): (MutableList[T], MutableList[T])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
patch[B >: T, That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[MutableList[T], B, That]): That
- Definition Classes
- SeqLike → GenSeqLike
-
def
permutations: Iterator[MutableList[T]]
- Definition Classes
- SeqLike
-
def
prefixLength(p: (T) ⇒ Boolean): Int
- Definition Classes
- GenSeqLike
-
def
prependElem(elem: T): Unit
- Attributes
- protected
- Definition Classes
- MutableList
-
def
product[B >: T](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduce[A1 >: T](op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceLeft[B >: T](op: (B, T) ⇒ B): B
- Definition Classes
- LinearSeqOptimized → TraversableOnce
-
def
reduceLeftOption[B >: T](op: (B, T) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceOption[A1 >: T](op: (A1, A1) ⇒ A1): Option[A1]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceRight[B >: T](op: (T, B) ⇒ B): B
- Definition Classes
- LinearSeqOptimized → IterableLike → TraversableOnce → GenTraversableOnce
-
def
reduceRightOption[B >: T](op: (T, B) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
repr: MutableList[T]
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
result(): MutableList[T]
- Definition Classes
- MutableList → Builder
-
def
reverse: MutableList[T]
- Definition Classes
- SeqLike → GenSeqLike
-
def
reverseIterator: Iterator[T]
- Definition Classes
- SeqLike
-
def
reverseMap[B, That](f: (T) ⇒ B)(implicit bf: CanBuildFrom[MutableList[T], B, That]): That
- Definition Classes
- SeqLike → GenSeqLike
-
def
reversed: List[T]
- Attributes
- protected[this]
- Definition Classes
- TraversableOnce
-
def
runWith[U](action: (T) ⇒ U): (Int) ⇒ Boolean
- Definition Classes
- PartialFunction
-
def
sameElements[B >: T](that: GenIterable[B]): Boolean
- Definition Classes
- LinearSeqOptimized → IterableLike → GenIterableLike
-
def
scan[B >: T, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[MutableList[T], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
scanLeft[B, That](z: B)(op: (B, T) ⇒ B)(implicit bf: CanBuildFrom[MutableList[T], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
scanRight[B, That](z: B)(op: (T, B) ⇒ B)(implicit bf: CanBuildFrom[MutableList[T], B, That]): That
- Definition Classes
- TraversableLike → GenTraversableLike
- Annotations
- @migration
- Migration
(Changed in version 2.9.0) The behavior of
scanRight
has changed. The previous behavior can be reproduced with scanRight.reverse.
-
def
segmentLength(p: (T) ⇒ Boolean, from: Int): Int
- Definition Classes
- LinearSeqOptimized → SeqLike → GenSeqLike
-
def
seq: LinearSeq[T]
- Definition Classes
- LinearSeq → LinearSeq → LinearSeqLike → Seq → Seq → GenSeq → GenSeqLike → Iterable → Iterable → GenIterable → Traversable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
-
def
size: Int
- Definition Classes
- SeqLike → GenTraversableLike → TraversableOnce → GenTraversableOnce
-
def
sizeHint(coll: TraversableLike[_, _], delta: Int): Unit
- Definition Classes
- Builder
-
def
sizeHint(coll: TraversableLike[_, _]): Unit
- Definition Classes
- Builder
-
def
sizeHint(size: Int): Unit
- Definition Classes
- Builder
-
def
sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit
- Definition Classes
- Builder
-
def
sizeHintIfCheap: Int
- Attributes
- protected[scala.collection]
- Definition Classes
- GenTraversableOnce
-
def
slice(from: Int, until: Int): MutableList[T]
- Definition Classes
- LinearSeqOptimized → IterableLike → TraversableLike → GenTraversableLike
-
def
sliding(size: Int, step: Int): Iterator[MutableList[T]]
- Definition Classes
- IterableLike
-
def
sliding(size: Int): Iterator[MutableList[T]]
- Definition Classes
- IterableLike
-
def
sortBy[B](f: (T) ⇒ B)(implicit ord: Ordering[B]): MutableList[T]
- Definition Classes
- SeqLike
-
def
sortWith(lt: (T, T) ⇒ Boolean): MutableList[T]
- Definition Classes
- SeqLike
-
def
sorted[B >: T](implicit ord: Ordering[B]): MutableList[T]
- Definition Classes
- SeqLike
-
def
span(p: (T) ⇒ Boolean): (MutableList[T], MutableList[T])
- Definition Classes
- LinearSeqOptimized → TraversableLike → GenTraversableLike
-
def
splitAt(n: Int): (MutableList[T], MutableList[T])
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
startsWith[B](that: GenSeq[B], offset: Int): Boolean
- Definition Classes
- SeqLike → GenSeqLike
-
def
startsWith[B](that: GenSeq[B]): Boolean
- Definition Classes
- GenSeqLike
-
def
stringPrefix: String
- Definition Classes
- TraversableLike → GenTraversableLike
-
def
subsetOf(b: MultiSet[T]): Boolean
Determine whether 'b' is a subset of 'this'
MultiSet
.Determine whether 'b' is a subset of 'this'
MultiSet
.- b
the other
MultiSet
-
def
sum[B >: T](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
tail: MutableList[T]
- Definition Classes
- MutableList → LinearSeqOptimized → TraversableLike → GenTraversableLike
-
final
def
tailImpl(tl: MutableList[T]): Unit
- Attributes
- protected
- Definition Classes
- MutableList
-
def
tails: Iterator[MutableList[T]]
- Definition Classes
- TraversableLike
-
def
take(n: Int): MutableList[T]
- Definition Classes
- LinearSeqOptimized → IterableLike → TraversableLike → GenTraversableLike
-
def
takeRight(n: Int): MutableList[T]
- Definition Classes
- IterableLike
-
def
takeWhile(p: (T) ⇒ Boolean): MutableList[T]
- Definition Classes
- LinearSeqOptimized → IterableLike → TraversableLike → GenTraversableLike
-
def
thisCollection: LinearSeq[T]
- Attributes
- protected[this]
- Definition Classes
- LinearSeqLike → SeqLike → IterableLike → TraversableLike
-
def
to[Col[_]](implicit cbf: CanBuildFrom[Nothing, T, Col[T]]): Col[T]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
-
def
toArray[B >: T](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toBuffer[B >: T]: Buffer[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toCollection(repr: MutableList[T]): LinearSeq[T]
- Attributes
- protected[this]
- Definition Classes
- LinearSeqLike → SeqLike → IterableLike → TraversableLike
-
def
toIndexedSeq: IndexedSeq[T]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toIterable: Iterable[T]
- Definition Classes
- IterableLike → TraversableOnce → GenTraversableOnce
-
def
toIterator: Iterator[T]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableOnce
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
toList: List[T]
- Definition Classes
- MutableList → TraversableOnce → GenTraversableOnce
-
def
toMap[T, U](implicit ev: <:<[T, (T, U)]): Map[T, U]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toQueue: Queue[T]
- Definition Classes
- MutableList
-
def
toSeq: Seq[T]
- Definition Classes
- SeqLike → GenSeqLike → TraversableOnce → GenTraversableOnce
-
def
toSet[B >: T]: Set[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toStream: Stream[T]
- Definition Classes
- IterableLike → TraversableLike → GenTraversableOnce
-
def
toString(): String
- Definition Classes
- SeqLike → TraversableLike → Any
-
def
toTraversable: Traversable[T]
- Definition Classes
- TraversableLike → TraversableOnce → GenTraversableOnce
- Annotations
- @deprecatedOverriding( ... , "2.11.0" )
-
def
toVector: Vector[T]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
transform(f: (T) ⇒ T): MultiSet.this.type
- Definition Classes
- SeqLike
-
def
transpose[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): MutableList[MutableList[B]]
- Definition Classes
- GenericTraversableTemplate
- Annotations
- @migration
- Migration
(Changed in version 2.9.0)
transpose
throws anIllegalArgumentException
if collections are not uniformly sized.
-
def
union(b: MultiSet[T]): MultiSet[T]
Return a new
MultiSet
that is the union of 'this' and 'b'.Return a new
MultiSet
that is the union of 'this' and 'b'.- b
the other
MultiSet
-
def
union[B >: T, That](that: GenSeq[B])(implicit bf: CanBuildFrom[MutableList[T], B, That]): That
- Definition Classes
- SeqLike → GenSeqLike
-
def
unzip[A1, A2](implicit asPair: (T) ⇒ (A1, A2)): (MutableList[A1], MutableList[A2])
- Definition Classes
- GenericTraversableTemplate
-
def
unzip3[A1, A2, A3](implicit asTriple: (T) ⇒ (A1, A2, A3)): (MutableList[A1], MutableList[A2], MutableList[A3])
- Definition Classes
- GenericTraversableTemplate
-
def
update(n: Int, x: T): Unit
- Definition Classes
- MutableList → SeqLike
-
def
updated[B >: T, That](index: Int, elem: B)(implicit bf: CanBuildFrom[MutableList[T], B, That]): That
- Definition Classes
- SeqLike → GenSeqLike
-
def
view(from: Int, until: Int): SeqView[T, MutableList[T]]
- Definition Classes
- SeqLike → IterableLike → TraversableLike
-
def
view: SeqView[T, MutableList[T]]
- Definition Classes
- SeqLike → IterableLike → TraversableLike
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
withFilter(p: (T) ⇒ Boolean): FilterMonadic[T, MutableList[T]]
- Definition Classes
- TraversableLike → FilterMonadic
-
def
zip[A1 >: T, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[MutableList[T], (A1, B), That]): That
- Definition Classes
- IterableLike → GenIterableLike
-
def
zipAll[B, A1 >: T, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[MutableList[T], (A1, B), That]): That
- Definition Classes
- IterableLike → GenIterableLike
-
def
zipWithIndex[A1 >: T, That](implicit bf: CanBuildFrom[MutableList[T], (A1, Int), That]): That
- Definition Classes
- IterableLike → GenIterableLike
-
def
⊆(b: MultiSet[T]): Boolean
Determine whether 'b' is a subset of 'this'
MultiSet
.Determine whether 'b' is a subset of 'this'
MultiSet
.- b
the other
MultiSet
-
def
⋂(b: MultiSet[T]): MutableList[T]
Return a new
MutableList
that is the intersection of 'b' and 'this'.Return a new
MutableList
that is the intersection of 'b' and 'this'. More efficient since it does not create a newMultiSet
.- b
the other
MultiSet
-
def
⋃(b: MultiSet[T]): MutableList[T]
Return a new
MutableList
that is the union of 'b' and 'this'.Return a new
MutableList
that is the union of 'b' and 'this'. More efficient since it does not create a newMultiSet
.- b
the other
MultiSet