PartitionMap

def != (arg0: AnyRef): Boolean

def != (arg0: Any): Boolean

def ## (): Int

def + [B1 >: Table] (elem1: (String, B1), elem2: (String, B1), elems: (String, B1)*): Map[String, B1]

def + [B1 >: Table] (kv: (String, B1)): Map[String, B1]

def ++ [B1 >: Table] (xs: TraversableOnce[(String, B1)]): Map[String, B1]

def ++ [B1 >: Table] (xs: GenTraversableOnce[(String, B1)]): Map[String, B1]

def ++ [B >: (String, Table), That] (that: TraversableOnce[B])(implicit bf: CanBuildFrom[LinkedHashMap[String, Table], B, That]): That

def ++ [B >: (String, Table), That] (that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[LinkedHashMap[String, Table], B, That]): That

def ++: [B >: (String, Table), That] (that: Traversable[B])(implicit bf: CanBuildFrom[LinkedHashMap[String, Table], B, That]): That

def ++: [B >: (String, Table), That] (that: TraversableOnce[B])(implicit bf: CanBuildFrom[LinkedHashMap[String, Table], B, That]): That

def ++= (xs: TraversableOnce[(String, Table)]): PartitionMap.this.type

def += (kv: (String, Table)): PartitionMap.this.type

def += (elem1: (String, Table), elem2: (String, Table), elems: (String, Table)*): PartitionMap.this.type

def - (elem1: String, elem2: String, elems: String*): LinkedHashMap[String, Table]

def - (key: String): LinkedHashMap[String, Table]

def -- (xs: TraversableOnce[String]): LinkedHashMap[String, Table]

def -- (xs: GenTraversableOnce[String]): LinkedHashMap[String, Table]

def --= (xs: TraversableOnce[String]): PartitionMap.this.type

def -= (key: String): PartitionMap.this.type

def -= (elem1: String, elem2: String, elems: String*): PartitionMap.this.type

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

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

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

def == (arg0: AnyRef): Boolean

def == (arg0: Any): Boolean

var _loadFactor : Int

def addEntry (e: LinkedEntry[String, Table]): Unit

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

def addString (b: StringBuilder): StringBuilder

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

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

def alwaysInitSizeMap : Boolean

def andThen [C] (k: (Table) ⇒ C): PartialFunction[String, C]

def apply (key: String): Table

def asInstanceOf [T0] : T0

def calcSizeMapSize (tableLength: Int): Int

def canEqual (that: Any): Boolean

def clear (): Unit

def clearTable (): Unit

def clone (): LinkedHashMap[String, Table]

def collect [B, That] (pf: PartialFunction[(String, Table), B])(implicit bf: CanBuildFrom[LinkedHashMap[String, Table], B, That]): That

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

def companion : GenericCompanion[Iterable]

def compose [A] (g: (A) ⇒ String): (A) ⇒ Table

def contains (key: String): Boolean

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

def copyToArray [B >: (String, Table)] (xs: Array[B]): Unit

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

def copyToBuffer [B >: (String, Table)] (dest: Buffer[B]): Unit

def count (p: ((String, Table)) ⇒ Boolean): Int

def default (key: String): Table

def drop (n: Int): LinkedHashMap[String, Table]

def dropRight (n: Int): LinkedHashMap[String, Table]

def dropWhile (p: ((String, Table)) ⇒ Boolean): LinkedHashMap[String, Table]

def elemEquals (key1: String, key2: String): Boolean

def elemHashCode (key: String): Int

def empty : LinkedHashMap[String, Table]

def entriesIterator : Iterator[LinkedEntry[String, Table]]

def eq (arg0: AnyRef): Boolean

def equals (that: Any): Boolean

def exists (p: ((String, Table)) ⇒ Boolean): Boolean

def filter (p: ((String, Table)) ⇒ Boolean): LinkedHashMap[String, Table]

def filterKeys (p: (String) ⇒ Boolean): Map[String, Table]

def filterNot (p: ((String, Table)) ⇒ Boolean): LinkedHashMap[String, Table]

def finalize (): Unit

def find (p: ((String, Table)) ⇒ Boolean): Option[(String, Table)]

def findEntry (key: String): LinkedEntry[String, Table]

var firstEntry : Entry

def flatMap [B, That] (f: ((String, Table)) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[LinkedHashMap[String, Table], B, That]): That

def flatten [B] (implicit asTraversable: ((String, Table)) ⇒ TraversableOnce[B]): Traversable[B]

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

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

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

def forall (p: ((String, Table)) ⇒ Boolean): Boolean

def foreach [U] (f: ((String, Table)) ⇒ U): Unit

def foreachEntry [C] (f: (LinkedEntry[String, Table]) ⇒ C): Unit

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

def get (key: String): Option[Table]

def getClass (): java.lang.Class[_]

def getOrElse [B1 >: Table] (key: String, default: ⇒ B1): B1

def getOrElseUpdate (key: String, op: ⇒ Table): Table

def groupBy [K] (f: ((String, Table)) ⇒ K): Map[K, LinkedHashMap[String, Table]]

def grouped (size: Int): Iterator[LinkedHashMap[String, Table]]

def hasDefiniteSize : Boolean

def hashCode (): Int

def head : (String, Table)

def headOption : Option[(String, Table)]

def improve (hcode: Int): Int

def index (hcode: Int): Int

def init : LinkedHashMap[String, Table]

def initWithContents (c: Contents[String, LinkedEntry[String, Table]]): Unit

def initialSize : Int

def inits : Iterator[LinkedHashMap[String, Table]]

def isDefinedAt (key: String): Boolean

def isEmpty : Boolean

def isInstanceOf [T0] : Boolean

def isSizeMapDefined : Boolean

def isTraversableAgain : Boolean

def iterator : Iterator[(String, Table)]

def keySet : Set[String]

def keys : Iterable[String]

def keysIterator : Iterator[String]

def last : (String, Table)

var lastEntry : Entry

def lastOption : Option[(String, Table)]

def lift : (String) ⇒ Option[Table]

def map [B, That] (f: ((String, Table)) ⇒ B)(implicit bf: CanBuildFrom[LinkedHashMap[String, Table], B, That]): That

def mapResult [NewTo] (f: (LinkedHashMap[String, Table]) ⇒ NewTo): Builder[(String, Table), NewTo]

def mapValues [C] (f: (Table) ⇒ C): Map[String, C]

def max [B >: (String, Table)] (implicit cmp: Ordering[B]): (String, Table)

def maxBy [B] (f: ((String, Table)) ⇒ B)(implicit cmp: Ordering[B]): (String, Table)

def min [B >: (String, Table)] (implicit cmp: Ordering[B]): (String, Table)

def minBy [B] (f: ((String, Table)) ⇒ B)(implicit cmp: Ordering[B]): (String, Table)

def mkString : String

def mkString (sep: String): String

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

def ne (arg0: AnyRef): Boolean

def newBuilder : Builder[(String, Table), LinkedHashMap[String, Table]]

def nnSizeMapAdd (h: Int): Unit

def nnSizeMapRemove (h: Int): Unit

def nnSizeMapReset (tableLength: Int): Unit

def nonEmpty : Boolean

def notify (): Unit

def notifyAll (): Unit

def orElse [A1 <: String, B1 >: Table] (that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

def par : ParMap[String, Table]

def parCombiner : Combiner[(String, Table), ParMap[String, Table]]

def partition (p: ((String, Table)) ⇒ Boolean): (LinkedHashMap[String, Table], LinkedHashMap[String, Table])

def parts : Iterable[String]

A serie of partition domains.

def product [B >: (String, Table)] (implicit num: Numeric[B]): B

def put (key: String, value: Table): Option[Table]

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

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

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

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

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

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

def remove (key: String): Option[Table]

def removeEntry (key: String): LinkedEntry[String, Table]

def repr : LinkedHashMap[String, Table]

def result (): LinkedHashMap[String, Table]

def retain (p: (String, Table) ⇒ Boolean): PartitionMap.this.type

def reversed : List[(String, Table)]

def sameElements [B >: (String, Table)] (that: Iterable[B]): Boolean

def sameElements [B >: (String, Table)] (that: GenIterable[B]): Boolean

def scan [B >: (String, Table), That] (z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[LinkedHashMap[String, Table], B, That]): That

def scanLeft [B, That] (z: B)(op: (B, (String, Table)) ⇒ B)(implicit bf: CanBuildFrom[LinkedHashMap[String, Table], B, That]): That

def scanRight [B, That] (z: B)(op: ((String, Table), B) ⇒ B)(implicit bf: CanBuildFrom[LinkedHashMap[String, Table], B, That]): That

def seq : Map[String, Table]

def size : Int

def sizeHint (coll: scala.collection.TraversableLike[_, _], delta: Int): Unit

def sizeHint (size: Int): Unit

def sizeHintBounded (size: Int, boundingColl: scala.collection.TraversableLike[_, _]): Unit

def sizeMapBucketBitSize : Int

def sizeMapBucketSize : Int

def sizeMapDisable (): Unit

def sizeMapInit (tableLength: Int): Unit

def sizeMapInitAndRebuild (): Unit

var sizemap : Array[Int]

def slice (from: Int, until: Int): LinkedHashMap[String, Table]

def sliding [B >: (String, Table)] (size: Int, step: Int): Iterator[LinkedHashMap[String, Table]]

def sliding [B >: (String, Table)] (size: Int): Iterator[LinkedHashMap[String, Table]]

def span (p: ((String, Table)) ⇒ Boolean): (LinkedHashMap[String, Table], LinkedHashMap[String, Table])

def splitAt (n: Int): (LinkedHashMap[String, Table], LinkedHashMap[String, Table])

def stringPrefix : String

def sum [B >: (String, Table)] (implicit num: Numeric[B]): B

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

var table : Array[HashEntry[String, LinkedEntry[String, Table]]]

var tableSize : Int

def tables : Iterable[Table]

A serie of tables.

def tail : LinkedHashMap[String, Table]

def tails : Iterator[LinkedHashMap[String, Table]]

def take (n: Int): LinkedHashMap[String, Table]

def takeRight (n: Int): LinkedHashMap[String, Table]

def takeWhile (p: ((String, Table)) ⇒ Boolean): LinkedHashMap[String, Table]

def thisCollection : Iterable[(String, Table)]

var threshold : Int

def toArray [B >: (String, Table)] (implicit arg0: ClassManifest[B]): Array[B]

def toBuffer [C >: (String, Table)] : Buffer[C]

def toCollection (repr: LinkedHashMap[String, Table]): Iterable[(String, Table)]

def toIndexedSeq [B >: (String, Table)] : IndexedSeq[B]

def toIterable : Iterable[(String, Table)]

def toIterator : Iterator[(String, Table)]

def toList : List[(String, Table)]

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

def toSeq : Seq[(String, Table)]

def toSet [B >: (String, Table)] : Set[B]

def toStream : Stream[(String, Table)]

def toString (): String

A printable PartitionMap.

def toTraversable : Traversable[(String, Table)]

def transform (f: (String, Table) ⇒ Table): PartitionMap.this.type

def transpose [B] (implicit asTraversable: ((String, Table)) ⇒ TraversableOnce[B]): Traversable[Traversable[B]]

def unzip [A1, A2] (implicit asPair: ((String, Table)) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

def unzip3 [A1, A2, A3] (implicit asTriple: ((String, Table)) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])

def update (key: String, value: Table): Unit

def updated [B1 >: Table] (key: String, value: B1): Map[String, B1]

def values : Iterable[Table]

def valuesIterator : Iterator[Table]

def view (from: Int, until: Int): IterableView[(String, Table), LinkedHashMap[String, Table]]

def view : IterableView[(String, Table), LinkedHashMap[String, Table]]

def wait (): Unit

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

def wait (arg0: Long): Unit

def withDefault (d: (String) ⇒ Table): Map[String, Table]

def withDefaultValue (d: Table): Map[String, Table]

def withFilter (p: ((String, Table)) ⇒ Boolean): FilterMonadic[(String, Table), LinkedHashMap[String, Table]]

def zip [A1 >: (String, Table), B, That] (that: Iterable[B])(implicit bf: CanBuildFrom[LinkedHashMap[String, Table], (A1, B), That]): That

def zip [A1 >: (String, Table), B, That] (that: GenIterable[B])(implicit bf: CanBuildFrom[LinkedHashMap[String, Table], (A1, B), That]): That

def zipAll [B, A1 >: (String, Table), That] (that: Iterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[LinkedHashMap[String, Table], (A1, B), That]): That

def zipAll [B, A1 >: (String, Table), That] (that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[LinkedHashMap[String, Table], (A1, B), That]): That

def zipWithIndex [A1 >: (String, Table), That] (implicit bf: CanBuildFrom[LinkedHashMap[String, Table], (A1, Int), That]): That

def elements : Iterator[(String, Table)]

def entries : Iterator[LinkedEntry[String, Table]]

def first : (String, Table)

def firstOption : Option[(String, Table)]

def mapElements [C] (f: (Table) ⇒ C): Map[String, C]

def projection : IterableView[(String, Table), LinkedHashMap[String, Table]]

def removeKey (key: String): Option[Table]