KeySet

abstract def buildKey(v: V): K

return a key for a new variable in the KeySet (abstract)

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def +[B1 >: V](elem1: (K, B1), elem2: (K, B1), elems: (K, B1)*): Map[K, B1]

def +[B1 >: V](kv: (K, B1)): Map[K, B1]

def ++[B1 >: V](xs: GenTraversableOnce[(K, B1)]): Map[K, B1]

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

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

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

def ++=(that: TraversableOnce[V]): KeySet.this.type

add new elements in the KeySet

def ++=(xs: TraversableOnce[(K, V)]): KeySet.this.type

def +=(kv: (K, V)): KeySet.this.type

add a new key & variable in the KeySet (abstract)

def +=(v: V): KeySet.this.type

add a new element in the KeySet (abstract)

def +=(elem1: (K, V), elem2: (K, V), elems: (K, V)*): KeySet.this.type

def -(elem1: K, elem2: K, elems: K*): LinkedHashMap[K, V]

def -(key: K): LinkedHashMap[K, V]

def --(xs: GenTraversableOnce[K]): LinkedHashMap[K, V]

def --=(xs: TraversableOnce[K]): KeySet.this.type

def -=(key: K): KeySet.this.type

def -=(elem1: K, elem2: K, elems: K*): KeySet.this.type

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

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

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

var _loadFactor: Int

def addEntry(e: LinkedEntry[K, V]): 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, (K, V)) ⇒ B, combop: (B, B) ⇒ B): B

def alwaysInitSizeMap: Boolean

def andThen[C](k: (V) ⇒ C): PartialFunction[K, C]

def apply(key: K): V

def applyOrElse[A1 <: K, B1 >: V](x: A1, default: (A1) ⇒ B1): B1

final def asInstanceOf[T0]: T0

def calcSizeMapSize(tableLength: Int): Int

def canEqual(that: Any): Boolean

def clear(): Unit

def clearTable(): Unit

def clone(): LinkedHashMap[K, V]

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

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

def companion: GenericCompanion[Iterable]

def compose[A](g: (A) ⇒ K): (A) ⇒ V

def contains(key: K): Boolean

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

def copyToArray[B >: (K, V)](xs: Array[B]): Unit

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

def copyToBuffer[B >: (K, V)](dest: Buffer[B]): Unit

def count(p: ((K, V)) ⇒ Boolean): Int

def createNewEntry[B1](key: K, value: B1): Entry

def default(key: K): V

def drop(n: Int): LinkedHashMap[K, V]

def dropRight(n: Int): LinkedHashMap[K, V]

def dropWhile(p: ((K, V)) ⇒ Boolean): LinkedHashMap[K, V]

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

def elemHashCode(key: K): Int

def empty: LinkedHashMap[K, V]

def entriesIterator: Iterator[LinkedEntry[K, V]]

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

def exists(p: ((K, V)) ⇒ Boolean): Boolean

def filter(p: ((K, V)) ⇒ Boolean): LinkedHashMap[K, V]

def filterKeys(p: (K) ⇒ Boolean): Map[K, V]

def filterNot(p: ((K, V)) ⇒ Boolean): LinkedHashMap[K, V]

def finalize(): Unit

def find(p: ((K, V)) ⇒ Boolean): Option[(K, V)]

def findEntry(key: K): LinkedEntry[K, V]

def findOrAddEntry[B](key: K, value: B): LinkedEntry[K, V]

var firstEntry: Entry

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

def flatten[B](implicit asTraversable: ((K, V)) ⇒ GenTraversableOnce[B]): Iterable[B]

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

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

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

def forall(p: ((K, V)) ⇒ Boolean): Boolean

def foreach[U](f: ((K, V)) ⇒ U): Unit

def foreachEntry[U](f: (Entry) ⇒ U): Unit

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

def get(key: K): Option[V]

final def getClass(): Class[_]

def getOrElse[B1 >: V](key: K, default: ⇒ B1): B1

def getOrElseUpdate(key: K, op: ⇒ V): V

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

def grouped(size: Int): Iterator[LinkedHashMap[K, V]]

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: (K, V)

def headOption: Option[(K, V)]

final def improve(hcode: Int, seed: Int): Int

final def index(hcode: Int): Int

def init: LinkedHashMap[K, V]

def initWithContents(c: Contents[K, LinkedEntry[K, V]]): Unit

def initialSize: Int

def inits: Iterator[LinkedHashMap[K, V]]

def isDefinedAt(key: K): Boolean

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

def isSizeMapDefined: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[(K, V)]

def keySet: Set[K]

def keys: Iterable[K]

def keysIterator: Iterator[K]

def last: (K, V)

var lastEntry: Entry

def lastOption: Option[(K, V)]

def lift: (K) ⇒ Option[V]

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

def mapResult[NewTo](f: (LinkedHashMap[K, V]) ⇒ NewTo): Builder[(K, V), NewTo]

def mapValues[C](f: (V) ⇒ C): Map[K, C]

def max[B >: (K, V)](implicit cmp: Ordering[B]): (K, V)

def maxBy[B](f: ((K, V)) ⇒ B)(implicit cmp: Ordering[B]): (K, V)

def min[B >: (K, V)](implicit cmp: Ordering[B]): (K, V)

def minBy[B](f: ((K, V)) ⇒ B)(implicit cmp: Ordering[B]): (K, V)

def mkString: String

def mkString(sep: String): String

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

final def ne(arg0: AnyRef): Boolean

def newBuilder: Builder[(K, V), LinkedHashMap[K, V]]

def nnSizeMapAdd(h: Int): Unit

def nnSizeMapRemove(h: Int): Unit

def nnSizeMapReset(tableLength: Int): Unit

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def orElse[A1 <: K, B1 >: V](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

def par: ParMap[K, V]

def parCombiner: Combiner[(K, V), ParMap[K, V]]

def partition(p: ((K, V)) ⇒ Boolean): (LinkedHashMap[K, V], LinkedHashMap[K, V])

def product[B >: (K, V)](implicit num: Numeric[B]): B

def put(key: K, value: V): Option[V]

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

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

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

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

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

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

def remove(key: K): Option[V]

def removeEntry(key: K): LinkedEntry[K, V]

def repr: LinkedHashMap[K, V]

def result(): LinkedHashMap[K, V]

def retain(p: (K, V) ⇒ Boolean): KeySet.this.type

def reversed: List[(K, V)]

def runWith[U](action: (V) ⇒ U): (K) ⇒ Boolean

def sameElements[B >: (K, V)](that: GenIterable[B]): Boolean

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

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

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

var seedvalue: Int

def seq: Map[K, V]

def size: Int

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

def sizeHint(coll: TraversableLike[_, _]): Unit

def sizeHint(size: Int): Unit

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

final def sizeMapBucketBitSize: Int

final 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[K, V]

def sliding(size: Int, step: Int): Iterator[LinkedHashMap[K, V]]

def sliding(size: Int): Iterator[LinkedHashMap[K, V]]

def span(p: ((K, V)) ⇒ Boolean): (LinkedHashMap[K, V], LinkedHashMap[K, V])

def splitAt(n: Int): (LinkedHashMap[K, V], LinkedHashMap[K, V])

def stringPrefix: String

def sum[B >: (K, V)](implicit num: Numeric[B]): B

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

var table: Array[HashEntry[K, LinkedEntry[K, V]]]

var tableSize: Int

def tableSizeSeed: Int

def tail: LinkedHashMap[K, V]

def tails: Iterator[LinkedHashMap[K, V]]

def take(n: Int): LinkedHashMap[K, V]

def takeRight(n: Int): LinkedHashMap[K, V]

def takeWhile(p: ((K, V)) ⇒ Boolean): LinkedHashMap[K, V]

def thisCollection: Iterable[(K, V)]

var threshold: Int

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

def toArray[B >: (K, V)](implicit arg0: ClassTag[B]): Array[B]

def toBuffer[C >: (K, V)]: Buffer[C]

def toCollection(repr: LinkedHashMap[K, V]): Iterable[(K, V)]

def toIndexedSeq: IndexedSeq[(K, V)]

def toIterable: Iterable[(K, V)]

def toIterator: Iterator[(K, V)]

def toList: List[(K, V)]

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

def toSeq: Seq[(K, V)]

def toSet[B >: (K, V)]: Set[B]

def toStream: Stream[(K, V)]

def toString(): String

def toTraversable: Traversable[(K, V)]

def toVector: Vector[(K, V)]

def transform(f: (K, V) ⇒ V): KeySet.this.type

def transpose[B](implicit asTraversable: ((K, V)) ⇒ GenTraversableOnce[B]): Iterable[Iterable[B]]

def unzip[A1, A2](implicit asPair: ((K, V)) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

def unzip3[A1, A2, A3](implicit asTriple: ((K, V)) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])

def update(key: K, value: V): Unit

def updated[B1 >: V](key: K, value: B1): Map[K, B1]

def values: Iterable[V]

def valuesIterator: Iterator[V]

def view(from: Int, until: Int): IterableView[(K, V), LinkedHashMap[K, V]]

def view: IterableView[(K, V), LinkedHashMap[K, V]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def withDefault(d: (K) ⇒ V): Map[K, V]

def withDefaultValue(d: V): Map[K, V]

def withFilter(p: ((K, V)) ⇒ Boolean): FilterMonadic[(K, V), LinkedHashMap[K, V]]

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

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

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

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