TreeBag

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def &(that: GenBag[A]): TreeBag[A]

Shorthand for intersect

def &~(that: GenBag[A]): TreeBag[A]

Shorthand for diff

def +(elemCount: (A, Int)): TreeBag[A]

def +(elem: A): TreeBag[A]

Add the element to the bag

def ++(that: GenBag[A]): TreeBag[A]

def ++(elems: GenTraversableOnce[A]): TreeBag[A]

def ++[B >: A, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[TreeBag[A], B, That]): That

def ++:[B >: A, That](that: collection.Traversable[B])(implicit bf: CanBuildFrom[TreeBag[A], B, That]): That

def ++:[B >: A, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[TreeBag[A], B, That]): That

def -(elemCount: (A, Int)): TreeBag[A]

def -(elem: A): TreeBag[A]

def -(elem1: A, elem2: A, elems: A*): TreeBag[A]

def --(that: GenBag[A]): TreeBag[A]

def --(xs: GenTraversableOnce[A]): TreeBag[A]

def /:[B](z: B)(op: (B, A) ⇒ B): B

def :\[B](z: B)(op: (A, B) ⇒ B): B

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def addString(b: StringBuilder): StringBuilder

def addString(b: StringBuilder, sep: String): StringBuilder

def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

def added(elem: A, count: Int): TreeBag[A]

def addedBucket(bucket: collection.BagBucket[A]): TreeBag[A]

def aggregate[B](z: B)(seqop: (B, A) ⇒ B, combop: (B, B) ⇒ B): B

def andThen[A](g: (TreeBag[A]) ⇒ A): (A) ⇒ A

def apply(elem: A): TreeBag[A]

final def asInstanceOf[T0]: T0

implicit val bagConfiguration: SortedBagConfiguration[A]

def bucketsIterator: scala.Iterator[BagBucket]

Iterator over buckets

def canEqual(that: Any): Boolean

def clone(): AnyRef

def collect[B, That](pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[TreeBag[A], B, That]): That

def collectFirst[B](pf: PartialFunction[A, B]): Option[B]

def companion: GenericCompanion[collection.Iterable]

def compose[A](g: (A) ⇒ A): (A) ⇒ TreeBag[A]

def contains(elem: A): Boolean

Tests if some element is contained in this bag.

def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Unit

def copyToArray[B >: A](xs: Array[B]): Unit

def copyToArray[B >: A](xs: Array[B], start: Int): Unit

def copyToBuffer[B >: A](dest: Buffer[B]): Unit

def count(p: (A) ⇒ Boolean): Int

def diff(that: GenBag[A]): TreeBag[A]

Returns a bag containing the multi-set difference of this bag with that bag

def distinct: TreeBag[A]

def distinctIterator: Iterator[A]

Iterator over distinct elements

def drop(n: Int): TreeBag[A]

def dropRight(n: Int): TreeBag[A]

def dropWhile(p: (A) ⇒ Boolean): TreeBag[A]

def empty: TreeBag[A]

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

def equivalentTo(elem: A): TreeBag[A]

Returns a the sub-bag that has only elements equivalent to elem

def exists(p: (A) ⇒ Boolean): Boolean

def filter(p: (A) ⇒ Boolean): TreeBag[A]

def filterNot(p: (A) ⇒ Boolean): TreeBag[A]

def finalize(): Unit

def find(p: (A) ⇒ Boolean): Option[A]

def firstKey: A

def flatMap[B, That](f: (A) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[TreeBag[A], B, That]): That

def flatten[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): collection.Iterable[B]

def fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1

def foldLeft[B](z: B)(op: (B, A) ⇒ B): B

def foldRight[B](z: B)(op: (A, B) ⇒ B): B

def forall(p: (A) ⇒ Boolean): Boolean

def foreach[U](f: (A) ⇒ U): Unit

def from(from: A): TreeBag[A]

def genericBuilder[B]: Builder[B, collection.Iterable[B]]

def getBucket(elem: A): Option[BagBucket]

Returns the bucket associated with some key element.

final def getClass(): Class[_]

def groupBy[K](f: (A) ⇒ K): Map[K, TreeBag[A]]

def grouped(size: Int): Iterator[TreeBag[A]]

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: A

def headOption: Option[A]

def init: TreeBag[A]

def inits: Iterator[TreeBag[A]]

def intersect(that: GenBag[A]): TreeBag[A]

Returns a bag containing the multi-set intersection of this bag and that bag

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[A]

def last: A

def lastKey: A

def lastOption: Option[A]

def leastCommon: TreeBag[A]

Returns a Bag with the least common elements up to the equivalence defined in the BagConfiguration

def map[B, That](f: (A) ⇒ B)(implicit bf: CanBuildFrom[TreeBag[A], B, That]): That

def max[B >: A](implicit cmp: Ordering[B]): A

def maxBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A

def maxMultiplicity: Int

Query for the maximum multiplicity of elements in the bag.

def maxUnion(that: GenBag[A]): TreeBag[A]

Returns a bag containing the multi-set max union (or generalized set union) of this bag and that bag

def min[B >: A](implicit cmp: Ordering[B]): A

def minBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A

def minMultiplicity: Int

Query for the minimum multiplicity of elements in the bag.

def mkString: String

def mkString(sep: String): String

def mkString(start: String, sep: String, end: String): String

def mostCommon: TreeBag[A]

Returns a Bag with the most common elements up to the equivalence defined in the BagConfiguration

def multiplicities: Iterator[(A, Int)]

def multiplicity(elem: A): Int

final def ne(arg0: AnyRef): Boolean

def newBuilder: BagBuilder[A, TreeBag[A]]

Creates a new builder for this bag type.

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

implicit val ord: Ordering[A]

def par: ParIterable[A]

def parCombiner: Combiner[A, ParIterable[A]]

def partition(p: (A) ⇒ Boolean): (TreeBag[A], TreeBag[A])

def product[B >: A](implicit num: Numeric[B]): B

def range(from: A, until: A): TreeBag[A]

def rangeImpl(from: Option[A], until: Option[A]): TreeBag[A]

def reduce[A1 >: A](op: (A1, A1) ⇒ A1): A1

def reduceLeft[B >: A](op: (B, A) ⇒ B): B

def reduceLeftOption[B >: A](op: (B, A) ⇒ B): Option[B]

def reduceOption[A1 >: A](op: (A1, A1) ⇒ A1): Option[A1]

def reduceRight[B >: A](op: (A, B) ⇒ B): B

def reduceRightOption[B >: A](op: (A, B) ⇒ B): Option[B]

def removed(elem: A, count: Int): TreeBag[A]

def removedAll(elem: A): TreeBag[A]

def removedBucket(elem: A): TreeBag[A]

def repr: TreeBag[A]

def reversed: scala.List[A]

def sameElements[B >: A](that: GenIterable[B]): Boolean

def scan[B >: A, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[TreeBag[A], B, That]): That

def scanLeft[B, That](z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[TreeBag[A], B, That]): That

def scanRight[B, That](z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[TreeBag[A], B, That]): That

def seq: collection.Iterable[A]

def size: Int

def slice(from: Int, until: Int): TreeBag[A]

def sliding(size: Int, step: Int): Iterator[TreeBag[A]]

def sliding(size: Int): Iterator[TreeBag[A]]

def span(p: (A) ⇒ Boolean): (TreeBag[A], TreeBag[A])

def splitAt(n: Int): (TreeBag[A], TreeBag[A])

def stringPrefix: String

def subsetOf(that: GenBag[A]): Boolean

Tests if this bag is subset of that bag, where the subset is the multiset subset.

def sum[B >: A](implicit num: Numeric[B]): B

final def synchronized[T0](arg0: ⇒ T0): T0

def tail: TreeBag[A]

def tails: Iterator[TreeBag[A]]

def take(n: Int): TreeBag[A]

def takeRight(n: Int): TreeBag[A]

def takeWhile(p: (A) ⇒ Boolean): TreeBag[A]

def thisCollection: collection.Iterable[A]

def to(to: A): TreeBag[A]

def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, A, Col[A]]): Col[A]

def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]

def toBuffer[B >: A]: Buffer[B]

def toCollection(repr: TreeBag[A]): collection.Iterable[A]

def toIndexedSeq: IndexedSeq[A]

def toIterable: collection.Iterable[A]

def toIterator: Iterator[A]

def toList: scala.List[A]

def toMap: collection.Map[A, Int]

Returns a mapping of the multiplicities of the bag

def toMap[T, U](implicit ev: <:<[A, (T, U)]): Map[T, U]

def toSeq: collection.Seq[A]

def toSet[B >: A]: Set[B]

def toStream: Stream[A]

def toString(): String

def toTraversable: collection.Traversable[A]

def toVector: scala.Vector[A]

def transpose[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): collection.Iterable[collection.Iterable[B]]

def union(that: GenBag[A]): TreeBag[A]

Returns a bag containing the multi-set union of this bag and that bag

def until(until: A): TreeBag[A]

def unzip[A1, A2](implicit asPair: (A) ⇒ (A1, A2)): (collection.Iterable[A1], collection.Iterable[A2])

def unzip3[A1, A2, A3](implicit asTriple: (A) ⇒ (A1, A2, A3)): (collection.Iterable[A1], collection.Iterable[A2], collection.Iterable[A3])

def updatedBucket(bucket: BagBucket): TreeBag[A]

Put or replace the bucket associated with the new bucket.

def view(from: Int, until: Int): IterableView[A, TreeBag[A]]

def view: IterableView[A, TreeBag[A]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def withFilter(p: (A) ⇒ Boolean): FilterMonadic[A, TreeBag[A]]

def withMultiplicity(elem: A, count: Int): TreeBag[A]

Returns a bag with an updated multiplicity of some element

def zip[A1 >: A, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[TreeBag[A], (A1, B), That]): That

def zipAll[B, A1 >: A, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[TreeBag[A], (A1, B), That]): That

def zipWithIndex[A1 >: A, That](implicit bf: CanBuildFrom[TreeBag[A], (A1, Int), That]): That

def |(that: GenBag[A]): TreeBag[A]

Shorthand for union

def /:\[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1