==>>

abstract val size: Int

number of key/value pairs - O(1)

final def !=(arg0: Any): Boolean

final def ##(): Int

def +(a: (A, B))(implicit o: Order[A]): ==>>[A, B]

tupled form of insert

def -(k: A)(implicit o: Order[A]): ==>>[A, B]

alias for delete

final def ==(arg0: Any): Boolean

def \\(other: ==>>[A, B])(implicit o: Order[A]): ==>>[A, B]

def adjust(k: A, f: (B) ⇒ B)(implicit o: Order[A]): ==>>[A, B]

if the key exists, transforms its value - O(log n)

def adjustWithKey(k: A, f: (A, B) ⇒ B)(implicit o: Order[A]): ==>>[A, B]

like adjust but with the key available in the transformation - O(log n)

def alter(k: A, f: (Option[B]) ⇒ Option[B])(implicit o: Order[A]): ==>>[A, B]

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def delete(k: A)(implicit n: Order[A]): ==>>[A, B]

removes a key/value pair - O(log n)

def deleteAt(i: Int): ==>>[A, B]

def deleteMax: ==>>[A, B]

def deleteMin: ==>>[A, B]

def difference(other: ==>>[A, B])(implicit o: Order[A]): ==>>[A, B]

def differenceWith[C](other: ==>>[A, C], f: (B, C) ⇒ Option[B])(implicit o: Order[A]): ==>>[A, B]

def differenceWithKey[C](other: ==>>[A, C], f: (A, B, C) ⇒ Option[B])(implicit o: Order[A]): ==>>[A, B]

final def elemAt(i: Int): Option[(A, B)]

final def eq(arg0: AnyRef): Boolean

def equals(other: Any): Boolean

def filter(p: (B) ⇒ Boolean)(implicit o: Order[A]): ==>>[A, B]

def filterWithKey(p: (A, B) ⇒ Boolean)(implicit o: Order[A]): ==>>[A, B]

def finalize(): Unit

final def findMax: Option[(A, B)]

final def findMin: Option[(A, B)]

def fold[C](z: C)(f: (A, B, C) ⇒ C): C

def foldlWithKey[C](z: C)(f: (C, A, B) ⇒ C): C

def foldrWithKey[C](z: C)(f: (A, B, C) ⇒ C): C

final def getClass(): Class[_]

def hashCode(): Int

def insert(kx: A, x: B)(implicit n: Order[A]): ==>>[A, B]

inserts a new key/value - O(log n).

def insertWith(f: (B, B) ⇒ B, kx: A, x: B)(implicit o: Order[A]): ==>>[A, B]

inserts a new key/value pair, resolving the conflict if the key already exists - O(log n)

def insertWithKey(f: (A, B, B) ⇒ B, kx: A, x: B)(implicit o: Order[A]): ==>>[A, B]

inserts a new key/value pair, resolving the conflict if the key already exists - O(log n)

def intersection[C](other: ==>>[A, C])(implicit o: Order[A]): ==>>[A, B]

def intersectionWith[C, D](other: ==>>[A, C])(f: (B, C) ⇒ D)(implicit o: Order[A]): ==>>[A, D]

def intersectionWithKey[C, D](other: ==>>[A, C])(f: (A, B, C) ⇒ D)(implicit o: Order[A]): ==>>[A, D]

def isEmpty: Boolean

returns true if this map contains no key/value pairs - O(1)

final def isInstanceOf[T0]: Boolean

def isSubmapOf(a: ==>>[A, B])(implicit o: Order[A], e: Equal[B]): Boolean

def isSubmapOfBy(a: ==>>[A, B], f: (B, B) ⇒ Boolean)(implicit o: Order[A]): Boolean

def join(kx: A, x: B, other: ==>>[A, B])(implicit o: Order[A]): ==>>[A, B]

def keySet: Set[A]

def keys: List[A]

final def lookup(k: A)(implicit n: Order[A]): Option[B]

final def lookupAssoc(k: A)(implicit n: Order[A]): Option[(A, B)]

def lookupIndex(k: A)(implicit o: Order[A]): Option[Int]

def map[C](f: (B) ⇒ C): ==>>[A, C]

def mapAccum[C](z: C)(f: (C, B) ⇒ (C, B)): (C, ==>>[A, B])

def mapAccumL[C](a: C)(f: (C, A, B) ⇒ (C, B)): (C, ==>>[A, B])

def mapAccumWithKey[C](z: C)(f: (C, A, B) ⇒ (C, B)): (C, ==>>[A, B])

def mapEither[C, D](f: (B) ⇒ \/[C, D])(implicit o: Order[A]): (==>>[A, C], ==>>[A, D])

def mapEitherWithKey[C, D](f: (A, B) ⇒ \/[C, D])(implicit o: Order[A]): (==>>[A, C], ==>>[A, D])

def mapKeys[C](f: (A) ⇒ C)(implicit o: Order[C]): ==>>[C, B]

def mapKeysWith[C](f: (A) ⇒ C, f2: (B, B) ⇒ B)(implicit o: Order[C]): ==>>[C, B]

def mapOption[C](f: (B) ⇒ Option[C])(implicit o: Order[A]): ==>>[A, C]

def mapOptionWithKey[C](f: (A, B) ⇒ Option[C])(implicit o: Order[A]): ==>>[A, C]

def mapWithKey[C](f: (A, B) ⇒ C): ==>>[A, C]

def maxView: Option[(B, ==>>[A, B])]

def maxViewWithKey: Option[((A, B), ==>>[A, B])]

def member(k: A)(implicit n: Order[A]): Boolean

def merge(other: ==>>[A, B]): ==>>[A, B]

def minView: Option[(B, ==>>[A, B])]

def minViewWithKey: Option[((A, B), ==>>[A, B])]

final def ne(arg0: AnyRef): Boolean

def notMember(k: A)(implicit n: Order[A]): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def partition(p: (B) ⇒ Boolean)(implicit o: Order[A]): (==>>[A, B], ==>>[A, B])

def partitionWithKey(p: (A, B) ⇒ Boolean)(implicit o: Order[A]): (==>>[A, B], ==>>[A, B])

def split(k: A)(implicit o: Order[A]): (==>>[A, B], ==>>[A, B])

def splitLookup(k: A)(implicit o: Order[A]): (==>>[A, B], Option[B], ==>>[A, B])

def splitLookupWithKey(k: A)(implicit o: Order[A]): (==>>[A, B], Option[(A, B)], ==>>[A, B])

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

def toAscList: List[(A, B)]

def toDescList: List[(A, B)]

def toList: List[(A, B)]

def toString(): String

final def trim(lo: (A) ⇒ Ordering, hi: (A) ⇒ Ordering): ==>>[A, B]

final def trimLookupLo(lo: A, cmphi: (A) ⇒ Ordering)(implicit o: Order[A]): (Option[(A, B)], ==>>[A, B])

def union(other: ==>>[A, B])(implicit k: Order[A]): ==>>[A, B]

def unionWith(other: ==>>[A, B])(f: (B, B) ⇒ B)(implicit o: Order[A]): ==>>[A, B]

def unionWithKey(other: ==>>[A, B])(f: (A, B, B) ⇒ B)(implicit o: Order[A]): ==>>[A, B]

def update(k: A, f: (B) ⇒ Option[B])(implicit o: Order[A]): ==>>[A, B]

updates or removes a value - O(log n)

def updateAppend(k: A, v: B)(implicit o: Order[A], bsg: Semigroup[B]): ==>>[A, B]

insert v into the map at k.

def updateAt(i: Int, f: (A, B) ⇒ Option[B]): ==>>[A, B]

def updateLookupWithKey(k: A, f: (A, B) ⇒ Option[B])(implicit o: Order[A]): (Option[B], ==>>[A, B])

looks up a key and updates its value - O(log n)

def updateMax(f: (B) ⇒ Option[B]): ==>>[A, B]

def updateMaxWithKey(f: (A, B) ⇒ Option[B]): ==>>[A, B]

def updateMin(f: (B) ⇒ Option[B]): ==>>[A, B]

def updateMinWithKey(f: (A, B) ⇒ Option[B]): ==>>[A, B]

def updateWithKey(k: A, f: (A, B) ⇒ Option[B])(implicit o: Order[A]): ==>>[A, B]

like update but with the key available in the update function - O(log n)

def values: List[B]

final def wait(): Unit

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

final def wait(arg0: Long): Unit