class MultiSet[T] extends ListBuffer[T]
The MultiSet
class provides an implementation for Union, Intersection and
Subset for the generic MultiSet
data type that extends ListBuffer
.
- Alphabetic
- By Inheritance
- MultiSet
- ListBuffer
- DefaultSerializable
- Serializable
- ReusableBuilder
- Builder
- StrictOptimizedSeqOps
- StrictOptimizedIterableOps
- AbstractBuffer
- Buffer
- Shrinkable
- Growable
- Clearable
- AbstractSeq
- Seq
- SeqOps
- Cloneable
- Cloneable
- Iterable
- AbstractSeq
- Seq
- Equals
- SeqOps
- PartialFunction
- Function1
- AbstractIterable
- Iterable
- IterableFactoryDefaults
- IterableOps
- IterableOnceOps
- IterableOnce
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Instance Constructors
- new MultiSet()
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ++[B >: T](suffix: IterableOnce[B]): ListBuffer[B]
- Definition Classes
- IterableOps
- Annotations
- @inline()
- final def ++:[B >: T](prefix: IterableOnce[B]): ListBuffer[B]
- Definition Classes
- SeqOps → IterableOps
- Annotations
- @inline()
- final def ++=(xs: IterableOnce[T]): MultiSet.this.type
- Definition Classes
- Growable
- Annotations
- @inline()
- final def ++=:(elems: IterableOnce[T]): MultiSet.this.type
- Definition Classes
- Buffer
- Annotations
- @inline()
- final def +:[B >: T](elem: B): ListBuffer[B]
- Definition Classes
- SeqOps
- Annotations
- @inline()
- final def +=(elem: T): MultiSet.this.type
- Definition Classes
- Growable
- Annotations
- @inline()
- final def +=:(elem: T): MultiSet.this.type
- Definition Classes
- Buffer
- Annotations
- @inline()
- final def --=(xs: IterableOnce[T]): MultiSet.this.type
- Definition Classes
- Shrinkable
- Annotations
- @inline()
- final def -=(elem: T): MultiSet.this.type
- Definition Classes
- Shrinkable
- Annotations
- @inline()
- final def :+[B >: T](elem: B): ListBuffer[B]
- Definition Classes
- SeqOps
- Annotations
- @inline()
- final def :++[B >: T](suffix: IterableOnce[B]): ListBuffer[B]
- Definition Classes
- SeqOps
- Annotations
- @inline()
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def addAll(xs: IterableOnce[T]): MultiSet.this.type
- Definition Classes
- ListBuffer → Growable
- final def addOne(elem: T): MultiSet.this.type
- Definition Classes
- ListBuffer → Growable
- final def addString(b: StringBuilder): StringBuilder
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def addString(b: StringBuilder, sep: String): StringBuilder
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
- Definition Classes
- IterableOnceOps
- def andThen[C](k: PartialFunction[T, C]): PartialFunction[Int, C]
- Definition Classes
- PartialFunction
- def andThen[C](k: (T) => C): PartialFunction[Int, C]
- Definition Classes
- PartialFunction → Function1
- final def append(elem: T): MultiSet.this.type
- Definition Classes
- Buffer
- Annotations
- @inline()
- final def appendAll(xs: IterableOnce[T]): MultiSet.this.type
- Definition Classes
- Buffer
- Annotations
- @inline()
- def appended[B >: T](elem: B): ListBuffer[B]
- Definition Classes
- StrictOptimizedSeqOps → SeqOps
- def appendedAll[B >: T](suffix: IterableOnce[B]): ListBuffer[B]
- Definition Classes
- StrictOptimizedSeqOps → SeqOps
- def apply(i: Int): T
- Definition Classes
- ListBuffer → SeqOps → Function1
- Annotations
- @throws(scala.this.throws.<init>$default$1[IndexOutOfBoundsException])
- 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
- Seq → Equals
- def className: String
- Attributes
- protected[this]
- Definition Classes
- Iterable
- def clear(): Unit
- Definition Classes
- ListBuffer → ReusableBuilder → Builder → Clearable
- def clone(): ListBuffer[T]
- Definition Classes
- SeqOps → Cloneable → AnyRef
- final def coll: MultiSet.this.type
- Attributes
- protected
- Definition Classes
- Iterable → IterableOps
- def collect[B](pf: PartialFunction[T, B]): ListBuffer[B]
- Definition Classes
- StrictOptimizedIterableOps → IterableOps → IterableOnceOps
- def collectFirst[B](pf: PartialFunction[T, B]): Option[B]
- Definition Classes
- IterableOnceOps
- def combinations(n: Int): Iterator[ListBuffer[T]]
- Definition Classes
- SeqOps
- def compose[R](k: PartialFunction[R, Int]): PartialFunction[R, T]
- Definition Classes
- PartialFunction
- def compose[A](g: (A) => Int): (A) => T
- Definition Classes
- Function1
- Annotations
- @unspecialized()
- final def concat[B >: T](suffix: IterableOnce[B]): ListBuffer[B]
- Definition Classes
- SeqOps → IterableOps
- Annotations
- @inline()
- def contains[A1 >: T](elem: A1): Boolean
- Definition Classes
- SeqOps
- def containsSlice[B >: T](that: Seq[B]): Boolean
- Definition Classes
- SeqOps
- def copyToArray[B >: T](xs: Array[B], start: Int, len: Int): Int
- Definition Classes
- IterableOnceOps
- def copyToArray[B >: T](xs: Array[B], start: Int): Int
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- def copyToArray[B >: T](xs: Array[B]): Int
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- def corresponds[B](that: Seq[B])(p: (T, B) => Boolean): Boolean
- Definition Classes
- SeqOps
- def corresponds[B](that: IterableOnce[B])(p: (T, B) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def count(p: (T) => Boolean): Int
- Definition Classes
- IterableOnceOps
- def diff[B >: T](that: Seq[B]): ListBuffer[T]
- Definition Classes
- StrictOptimizedSeqOps → SeqOps
- def distinct: ListBuffer[T]
- Definition Classes
- SeqOps
- def distinctBy[B](f: (T) => B): ListBuffer[T]
- Definition Classes
- StrictOptimizedSeqOps → SeqOps
- def drop(n: Int): ListBuffer[T]
- Definition Classes
- IterableOps → IterableOnceOps
- def dropInPlace(n: Int): MultiSet.this.type
- Definition Classes
- Buffer
- def dropRight(n: Int): ListBuffer[T]
- Definition Classes
- StrictOptimizedIterableOps → IterableOps
- def dropRightInPlace(n: Int): MultiSet.this.type
- Definition Classes
- Buffer
- def dropWhile(p: (T) => Boolean): ListBuffer[T]
- Definition Classes
- IterableOps → IterableOnceOps
- def dropWhileInPlace(p: (T) => Boolean): MultiSet.this.type
- Definition Classes
- Buffer
- def elementWise: ElementWiseExtractor[Int, T]
- Definition Classes
- PartialFunction
- def empty: ListBuffer[T]
- Definition Classes
- IterableFactoryDefaults → IterableOps
- def endsWith[B >: T](that: Iterable[B]): Boolean
- Definition Classes
- SeqOps
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(o: Any): Boolean
- Definition Classes
- Seq → Equals → AnyRef → Any
- def exists(p: (T) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def filter(pred: (T) => Boolean): ListBuffer[T]
- Definition Classes
- StrictOptimizedIterableOps → IterableOps → IterableOnceOps
- def filterImpl(pred: (T) => Boolean, isFlipped: Boolean): ListBuffer[T]
- Attributes
- protected[collection]
- Definition Classes
- StrictOptimizedIterableOps
- def filterInPlace(p: (T) => Boolean): MultiSet.this.type
- Definition Classes
- ListBuffer
- def filterNot(pred: (T) => Boolean): ListBuffer[T]
- Definition Classes
- StrictOptimizedIterableOps → IterableOps → IterableOnceOps
- def find(p: (T) => Boolean): Option[T]
- Definition Classes
- IterableOnceOps
- def findLast(p: (T) => Boolean): Option[T]
- Definition Classes
- SeqOps
- def flatMap[B](f: (T) => IterableOnce[B]): ListBuffer[B]
- Definition Classes
- StrictOptimizedIterableOps → IterableOps → IterableOnceOps
- def flatMapInPlace(f: (T) => IterableOnce[T]): MultiSet.this.type
- Definition Classes
- ListBuffer
- def flatten[B](implicit toIterableOnce: (T) => IterableOnce[B]): ListBuffer[B]
- Definition Classes
- StrictOptimizedIterableOps → IterableOps → IterableOnceOps
- def fold[A1 >: T](z: A1)(op: (A1, A1) => A1): A1
- Definition Classes
- IterableOnceOps
- def foldLeft[B](z: B)(op: (B, T) => B): B
- Definition Classes
- IterableOnceOps
- def foldRight[B](z: B)(op: (T, B) => B): B
- Definition Classes
- IterableOnceOps
- def forall(p: (T) => Boolean): Boolean
- Definition Classes
- IterableOnceOps
- def foreach[U](f: (T) => U): Unit
- Definition Classes
- IterableOnceOps
- def fromSpecific(coll: IterableOnce[T]): ListBuffer[T]
- Attributes
- protected
- Definition Classes
- IterableFactoryDefaults → IterableOps
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def groupBy[K](f: (T) => K): Map[K, ListBuffer[T]]
- Definition Classes
- IterableOps
- def groupMap[K, B](key: (T) => K)(f: (T) => B): Map[K, ListBuffer[B]]
- Definition Classes
- IterableOps
- def groupMapReduce[K, B](key: (T) => K)(f: (T) => B)(reduce: (B, B) => B): Map[K, B]
- Definition Classes
- IterableOps
- def grouped(size: Int): Iterator[ListBuffer[T]]
- Definition Classes
- IterableOps
- def hashCode(): Int
- Definition Classes
- Seq → AnyRef → Any
- def head: T
- Definition Classes
- IterableOps
- def headOption: Option[T]
- Definition Classes
- IterableOps
- def indexOf[B >: T](elem: B): Int
- Definition Classes
- SeqOps
- Annotations
- @deprecatedOverriding()
- def indexOf[B >: T](elem: B, from: Int): Int
- Definition Classes
- SeqOps
- def indexOfSlice[B >: T](that: Seq[B]): Int
- Definition Classes
- SeqOps
- Annotations
- @deprecatedOverriding()
- def indexOfSlice[B >: T](that: Seq[B], from: Int): Int
- Definition Classes
- SeqOps
- def indexWhere(p: (T) => Boolean): Int
- Definition Classes
- SeqOps
- Annotations
- @deprecatedOverriding()
- def indexWhere(p: (T) => Boolean, from: Int): Int
- Definition Classes
- SeqOps
- def indices: Range
- Definition Classes
- SeqOps
- def init: ListBuffer[T]
- Definition Classes
- IterableOps
- def inits: Iterator[ListBuffer[T]]
- Definition Classes
- IterableOps
- def insert(idx: Int, elem: T): Unit
- Definition Classes
- ListBuffer → Buffer
- def insertAll(idx: Int, elems: IterableOnce[T]): Unit
- Definition Classes
- ListBuffer → Buffer
- 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: Seq[B]): ListBuffer[T]
- Definition Classes
- StrictOptimizedSeqOps → SeqOps
- def isDefinedAt(idx: Int): Boolean
- Definition Classes
- SeqOps
- def isEmpty: Boolean
- Definition Classes
- ListBuffer → SeqOps → IterableOnceOps
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def isTraversableAgain: Boolean
- Definition Classes
- IterableOps → IterableOnceOps
- def iterableFactory: SeqFactory[ListBuffer]
- Definition Classes
- ListBuffer → Buffer → Seq → Iterable → Seq → Iterable → IterableOps
- def iterator: Iterator[T]
- Definition Classes
- ListBuffer → IterableOnce
- def knownSize: Int
- Definition Classes
- ListBuffer → Buffer → Growable → IterableOnce
- def last: T
- Definition Classes
- ListBuffer → IterableOps
- def lastIndexOf[B >: T](elem: B, end: Int): Int
- Definition Classes
- SeqOps
- def lastIndexOfSlice[B >: T](that: Seq[B]): Int
- Definition Classes
- SeqOps
- Annotations
- @deprecatedOverriding()
- def lastIndexOfSlice[B >: T](that: Seq[B], end: Int): Int
- Definition Classes
- SeqOps
- def lastIndexWhere(p: (T) => Boolean): Int
- Definition Classes
- SeqOps
- Annotations
- @deprecatedOverriding()
- def lastIndexWhere(p: (T) => Boolean, end: Int): Int
- Definition Classes
- SeqOps
- def lastOption: Option[T]
- Definition Classes
- ListBuffer → IterableOps
- def lazyZip[B](that: Iterable[B]): LazyZip2[T, B, MultiSet.this.type]
- Definition Classes
- Iterable
- def length: Int
- Definition Classes
- ListBuffer → SeqOps
- def lengthCompare(that: Iterable[_]): Int
- Definition Classes
- SeqOps
- def lengthCompare(len: Int): Int
- Definition Classes
- SeqOps
- final def lengthIs: SizeCompareOps
- Definition Classes
- SeqOps
- Annotations
- @inline()
- def lift: (Int) => Option[T]
- Definition Classes
- PartialFunction
- def map[B](f: (T) => B): ListBuffer[B]
- Definition Classes
- StrictOptimizedIterableOps → IterableOps → IterableOnceOps
- def mapInPlace(f: (T) => T): MultiSet.this.type
- Definition Classes
- ListBuffer
- def mapResult[NewTo](f: (List[T]) => NewTo): Builder[T, NewTo]
- Definition Classes
- Builder
- def max[B >: T](implicit ord: Ordering[B]): T
- Definition Classes
- IterableOnceOps
- def maxBy[B](f: (T) => B)(implicit cmp: Ordering[B]): T
- Definition Classes
- IterableOnceOps
- def maxByOption[B](f: (T) => B)(implicit cmp: Ordering[B]): Option[T]
- Definition Classes
- IterableOnceOps
- def maxOption[B >: T](implicit ord: Ordering[B]): Option[T]
- Definition Classes
- IterableOnceOps
- def min[B >: T](implicit ord: Ordering[B]): T
- Definition Classes
- IterableOnceOps
- def minBy[B](f: (T) => B)(implicit cmp: Ordering[B]): T
- Definition Classes
- IterableOnceOps
- def minByOption[B](f: (T) => B)(implicit cmp: Ordering[B]): Option[T]
- Definition Classes
- IterableOnceOps
- def minOption[B >: T](implicit ord: Ordering[B]): Option[T]
- Definition Classes
- IterableOnceOps
- final def mkString: String
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def mkString(sep: String): String
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- final def mkString(start: String, sep: String, end: String): String
- Definition Classes
- IterableOnceOps
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def newSpecificBuilder: Builder[T, ListBuffer[T]]
- Attributes
- protected
- Definition Classes
- IterableFactoryDefaults → IterableOps
- def nonEmpty: Boolean
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecatedOverriding()
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def occCounts[B](sq: Seq[B]): Map[B, Int]
- Attributes
- protected[collection]
- Definition Classes
- SeqOps
- def orElse[A1 <: Int, B1 >: T](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
- Definition Classes
- PartialFunction
- def padTo[B >: T](len: Int, elem: B): ListBuffer[B]
- Definition Classes
- StrictOptimizedSeqOps → SeqOps
- def padToInPlace(len: Int, elem: T): MultiSet.this.type
- Definition Classes
- Buffer
- def partition(p: (T) => Boolean): (ListBuffer[T], ListBuffer[T])
- Definition Classes
- StrictOptimizedIterableOps → IterableOps
- def partitionMap[A1, A2](f: (T) => Either[A1, A2]): (ListBuffer[A1], ListBuffer[A2])
- Definition Classes
- StrictOptimizedIterableOps → IterableOps
- def patch[B >: T](from: Int, other: IterableOnce[B], replaced: Int): ListBuffer[B]
- Definition Classes
- SeqOps
- def patchInPlace(from: Int, patch: IterableOnce[T], replaced: Int): MultiSet.this.type
- Definition Classes
- ListBuffer → Buffer
- def permutations: Iterator[ListBuffer[T]]
- Definition Classes
- SeqOps
- def prepend(elem: T): MultiSet.this.type
- Definition Classes
- ListBuffer → Buffer
- def prependAll(elems: IterableOnce[T]): MultiSet.this.type
- Definition Classes
- Buffer
- def prependToList(xs: List[T]): List[T]
- Definition Classes
- ListBuffer
- def prepended[B >: T](elem: B): ListBuffer[B]
- Definition Classes
- StrictOptimizedSeqOps → SeqOps
- def prependedAll[B >: T](prefix: IterableOnce[B]): ListBuffer[B]
- Definition Classes
- StrictOptimizedSeqOps → SeqOps
- def product[B >: T](implicit num: Numeric[B]): B
- Definition Classes
- IterableOnceOps
- def reduce[B >: T](op: (B, B) => B): B
- Definition Classes
- IterableOnceOps
- def reduceLeft[B >: T](op: (B, T) => B): B
- Definition Classes
- IterableOnceOps
- def reduceLeftOption[B >: T](op: (B, T) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reduceOption[B >: T](op: (B, B) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def reduceRight[B >: T](op: (T, B) => B): B
- Definition Classes
- IterableOnceOps
- def reduceRightOption[B >: T](op: (T, B) => B): Option[B]
- Definition Classes
- IterableOnceOps
- def remove(idx: Int, count: Int): Unit
- Definition Classes
- ListBuffer → Buffer
- def remove(idx: Int): T
- Definition Classes
- ListBuffer → Buffer
- def result(): List[T]
- Definition Classes
- ListBuffer → ReusableBuilder → Builder
- def reverse: ListBuffer[T]
- Definition Classes
- SeqOps
- def reverseIterator: Iterator[T]
- Definition Classes
- SeqOps
- def reversed: Iterable[T]
- Attributes
- protected
- Definition Classes
- IterableOnceOps
- def runWith[U](action: (T) => U): (Int) => Boolean
- Definition Classes
- PartialFunction
- def sameElements[B >: T](that: IterableOnce[B]): Boolean
- Definition Classes
- SeqOps
- def scan[B >: T](z: B)(op: (B, B) => B): ListBuffer[B]
- Definition Classes
- IterableOps
- def scanLeft[B](z: B)(op: (B, T) => B): ListBuffer[B]
- Definition Classes
- StrictOptimizedIterableOps → IterableOps → IterableOnceOps
- def scanRight[B](z: B)(op: (T, B) => B): ListBuffer[B]
- Definition Classes
- IterableOps
- def search[B >: T](elem: B, from: Int, to: Int)(implicit ord: Ordering[B]): SearchResult
- Definition Classes
- SeqOps
- def search[B >: T](elem: B)(implicit ord: Ordering[B]): SearchResult
- Definition Classes
- SeqOps
- def segmentLength(p: (T) => Boolean, from: Int): Int
- Definition Classes
- SeqOps
- final def segmentLength(p: (T) => Boolean): Int
- Definition Classes
- SeqOps
- final def size: Int
- Definition Classes
- SeqOps → IterableOnceOps
- final def sizeCompare(that: Iterable[_]): Int
- Definition Classes
- SeqOps → IterableOps
- final def sizeCompare(otherSize: Int): Int
- Definition Classes
- SeqOps → IterableOps
- final def sizeHint(coll: IterableOnce[_], delta: Int): Unit
- Definition Classes
- Builder
- def sizeHint(size: Int): Unit
- Definition Classes
- Builder
- final def sizeHintBounded(size: Int, boundingColl: Iterable[_]): Unit
- Definition Classes
- Builder
- final def sizeIs: SizeCompareOps
- Definition Classes
- IterableOps
- Annotations
- @inline()
- def slice(from: Int, until: Int): ListBuffer[T]
- Definition Classes
- IterableOps → IterableOnceOps
- def sliceInPlace(start: Int, end: Int): MultiSet.this.type
- Definition Classes
- Buffer
- def sliding(size: Int, step: Int): Iterator[ListBuffer[T]]
- Definition Classes
- IterableOps
- def sliding(size: Int): Iterator[ListBuffer[T]]
- Definition Classes
- IterableOps
- def sortBy[B](f: (T) => B)(implicit ord: Ordering[B]): ListBuffer[T]
- Definition Classes
- SeqOps
- def sortWith(lt: (T, T) => Boolean): ListBuffer[T]
- Definition Classes
- SeqOps
- def sorted[B >: T](implicit ord: Ordering[B]): ListBuffer[T]
- Definition Classes
- SeqOps
- def span(p: (T) => Boolean): (ListBuffer[T], ListBuffer[T])
- Definition Classes
- StrictOptimizedIterableOps → IterableOps → IterableOnceOps
- def splitAt(n: Int): (ListBuffer[T], ListBuffer[T])
- Definition Classes
- IterableOps → IterableOnceOps
- def startsWith[B >: T](that: IterableOnce[B], offset: Int): Boolean
- Definition Classes
- SeqOps
- def stepper[S <: Stepper[_]](implicit shape: StepperShape[T, S]): S
- Definition Classes
- IterableOnce
- final def strictOptimizedCollect[B, C2](b: Builder[B, C2], pf: PartialFunction[T, B]): C2
- Attributes
- protected[this]
- Definition Classes
- StrictOptimizedIterableOps
- Annotations
- @inline()
- final def strictOptimizedConcat[B >: T, C2](that: IterableOnce[B], b: Builder[B, C2]): C2
- Attributes
- protected[this]
- Definition Classes
- StrictOptimizedIterableOps
- Annotations
- @inline()
- final def strictOptimizedFlatMap[B, C2](b: Builder[B, C2], f: (T) => IterableOnce[B]): C2
- Attributes
- protected[this]
- Definition Classes
- StrictOptimizedIterableOps
- Annotations
- @inline()
- final def strictOptimizedFlatten[B, C2](b: Builder[B, C2])(implicit toIterableOnce: (T) => IterableOnce[B]): C2
- Attributes
- protected[this]
- Definition Classes
- StrictOptimizedIterableOps
- Annotations
- @inline()
- final def strictOptimizedMap[B, C2](b: Builder[B, C2], f: (T) => B): C2
- Attributes
- protected[this]
- Definition Classes
- StrictOptimizedIterableOps
- Annotations
- @inline()
- final def strictOptimizedZip[B, C2](that: IterableOnce[B], b: Builder[(T, B), C2]): C2
- Attributes
- protected[this]
- Definition Classes
- StrictOptimizedIterableOps
- Annotations
- @inline()
- def stringPrefix: String
- Attributes
- protected[this]
- Definition Classes
- ListBuffer → Buffer → Seq → Iterable
- 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 subtractAll(xs: IterableOnce[T]): MultiSet.this.type
- Definition Classes
- Shrinkable
- def subtractOne(elem: T): MultiSet.this.type
- Definition Classes
- ListBuffer → Buffer → Shrinkable
- def sum[B >: T](implicit num: Numeric[B]): B
- Definition Classes
- IterableOnceOps
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def tail: ListBuffer[T]
- Definition Classes
- IterableOps
- def tails: Iterator[ListBuffer[T]]
- Definition Classes
- IterableOps
- def take(n: Int): ListBuffer[T]
- Definition Classes
- IterableOps → IterableOnceOps
- def takeInPlace(n: Int): MultiSet.this.type
- Definition Classes
- Buffer
- def takeRight(n: Int): ListBuffer[T]
- Definition Classes
- StrictOptimizedIterableOps → IterableOps
- def takeRightInPlace(n: Int): MultiSet.this.type
- Definition Classes
- Buffer
- def takeWhile(p: (T) => Boolean): ListBuffer[T]
- Definition Classes
- IterableOps → IterableOnceOps
- def takeWhileInPlace(p: (T) => Boolean): MultiSet.this.type
- Definition Classes
- Buffer
- def tapEach[U](f: (T) => U): ListBuffer[T]
- Definition Classes
- StrictOptimizedIterableOps → IterableOps → IterableOnceOps
- def to[C1](factory: Factory[T, C1]): C1
- Definition Classes
- IterableOnceOps
- def toArray[B >: T](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- IterableOnceOps
- final def toBuffer[B >: T]: Buffer[B]
- Definition Classes
- IterableOnceOps
- Annotations
- @inline()
- def toIndexedSeq: IndexedSeq[T]
- Definition Classes
- IterableOnceOps
- final def toIterable: MultiSet.this.type
- Definition Classes
- Iterable → IterableOps
- def toList: List[T]
- Definition Classes
- ListBuffer → IterableOnceOps
- def toMap[K, V](implicit ev: <:<[T, (K, V)]): Map[K, V]
- Definition Classes
- IterableOnceOps
- def toSeq: Seq[T]
- Definition Classes
- IterableOnceOps
- def toSet[B >: T]: Set[B]
- Definition Classes
- IterableOnceOps
- def toString(): String
- Definition Classes
- Seq → Function1 → Iterable → AnyRef → Any
- def toVector: Vector[T]
- Definition Classes
- IterableOnceOps
- def transpose[B](implicit asIterable: (T) => Iterable[B]): ListBuffer[ListBuffer[B]]
- Definition Classes
- IterableOps
- def unapply(a: Int): Option[T]
- Definition Classes
- PartialFunction
- 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 unzip[A1, A2](implicit asPair: (T) => (A1, A2)): (ListBuffer[A1], ListBuffer[A2])
- Definition Classes
- StrictOptimizedIterableOps → IterableOps
- def unzip3[A1, A2, A3](implicit asTriple: (T) => (A1, A2, A3)): (ListBuffer[A1], ListBuffer[A2], ListBuffer[A3])
- Definition Classes
- StrictOptimizedIterableOps → IterableOps
- def update(idx: Int, elem: T): Unit
- Definition Classes
- ListBuffer → SeqOps
- def updated[B >: T](index: Int, elem: B): ListBuffer[B]
- Definition Classes
- SeqOps
- def view: SeqView[T]
- Definition Classes
- SeqOps → IterableOps
- 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()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- def withFilter(p: (T) => Boolean): WithFilter[T, [_]ListBuffer[_]]
- Definition Classes
- IterableOps
- def writeReplace(): AnyRef
- Attributes
- protected[this]
- Definition Classes
- DefaultSerializable
- def zip[B](that: IterableOnce[B]): ListBuffer[(T, B)]
- Definition Classes
- StrictOptimizedIterableOps → IterableOps
- def zipAll[A1 >: T, B](that: Iterable[B], thisElem: A1, thatElem: B): ListBuffer[(A1, B)]
- Definition Classes
- IterableOps
- def zipWithIndex: ListBuffer[(T, Int)]
- Definition Classes
- StrictOptimizedIterableOps → IterableOps → IterableOnceOps
- 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]): ListBuffer[T]
Return a new
ListBuffer
that is the intersection of 'b' and 'this'.Return a new
ListBuffer
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]): ListBuffer[T]
Return a new
ListBuffer
that is the union of 'b' and 'this'.Return a new
ListBuffer
that is the union of 'b' and 'this'. More efficient since it does not create a newMultiSet
.- b
the other
MultiSet
Deprecated Value Members
- final def +=(elem1: T, elem2: T, elems: T*): MultiSet.this.type
- Definition Classes
- Growable
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use
++=
akaaddAll
instead of varargs+=
; infix operations with an operand of multiple args will be deprecated
- def -=(elem1: T, elem2: T, elems: T*): MultiSet.this.type
- Definition Classes
- Shrinkable
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.3) Use
--=
akasubtractAll
instead of varargs-=
; infix operations with an operand of multiple args will be deprecated
- final def /:[B](z: B)(op: (B, T) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use foldLeft instead of /:
- final def :\[B](z: B)(op: (T, B) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use foldRight instead of :\
- def aggregate[B](z: => B)(seqop: (B, T) => B, combop: (B, B) => B): B
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0)
aggregate
is not relevant for sequential collections. UsefoldLeft(z)(seqop)
instead.
- final def append(elems: T*): MultiSet.this.type
- Definition Classes
- Buffer
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use appendAll instead
- def companion: IterableFactory[[_]ListBuffer[_]]
- Definition Classes
- IterableOps
- Annotations
- @deprecated @deprecatedOverriding() @inline()
- Deprecated
(Since version 2.13.0) Use iterableFactory instead
- final def copyToBuffer[B >: T](dest: Buffer[B]): Unit
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use
dest ++= coll
instead
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated
- def hasDefiniteSize: Boolean
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)
- final def prefixLength(p: (T) => Boolean): Int
- Definition Classes
- SeqOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use segmentLength instead of prefixLength
- final def prepend(elems: T*): MultiSet.this.type
- Definition Classes
- Buffer
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use prependAll instead
- final def repr: ListBuffer[T]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside
- def reverseMap[B](f: (T) => B): ListBuffer[B]
- Definition Classes
- SeqOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .reverseIterator.map(f).to(...) instead of .reverseMap(f)
- def seq: MultiSet.this.type
- Definition Classes
- Iterable
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Iterable.seq always returns the iterable itself
- final def toIterator: Iterator[T]
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .iterator instead of .toIterator
- final def toStream: Stream[T]
- Definition Classes
- IterableOnceOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use .to(LazyList) instead of .toStream
- final def toTraversable: Traversable[T]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use toIterable instead
- final def transform(f: (T) => T): MultiSet.this.type
- Definition Classes
- SeqOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use
mapInPlace
on anIndexedSeq
instead
- def trimEnd(n: Int): Unit
- Definition Classes
- Buffer
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.4) use dropRightInPlace instead
- def trimStart(n: Int): Unit
- Definition Classes
- Buffer
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.4) use dropInPlace instead
- final def union[B >: T](that: Seq[B]): ListBuffer[B]
- Definition Classes
- SeqOps
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.13.0) Use
concat
instead
- def view(from: Int, until: Int): View[T]
- Definition Classes
- IterableOps
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)