Bag

abstract def asSortedMap: SortedMap[A, Int]

abstract def contains(elem: A): Boolean

Check if a bag contains an element

abstract def delete(elem: A): Bag[A]

Deletes an element and returns the new bag It doesn't complain if the element doesn't exist

abstract def elems: Iterator[(A, Int)]

Elements of a Bag with their multiplicity

abstract def insert(elem: A): Bag[A]

Inserts an element in a bag and returns the new bag

abstract def multiplicity(elem: A): Int

Multiplicity of an element in a bag

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def add(elem: A, n: Int): Bag[A]

add an element n times to a bag This default implementation is not efficient, it should be overridden

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(other: Any): Boolean

def finalize(): Unit

def from(t: Traversable[A]): Bag[A]

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def size: Int

Size returns the total number of elements.

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

def toSeq: Seq[A]

def toString(): String

def union(other: Bag[A]): Bag[A]

Union of two bags

final def wait(): Unit

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

final def wait(arg0: Long): Unit