DataMapper

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

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

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

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

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

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

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

def ++=(xs: TraversableOnce[(Variable, Variable)]): DataMapper.this.type

def +=(kv: (Variable, Variable)): DataMapper.this.type

def +=(elem1: (Variable, Variable), elem2: (Variable, Variable), elems: (Variable, Variable)*): DataMapper.this.type

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

def -(key: Variable): LinkedHashMap[Variable, Variable]

def --(xs: GenTraversableOnce[Variable]): LinkedHashMap[Variable, Variable]

def --=(xs: TraversableOnce[Variable]): DataMapper.this.type

def -=(key: Variable): DataMapper.this.type

def -=(elem1: Variable, elem2: Variable, elems: Variable*): DataMapper.this.type

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

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

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

var _loadFactor: Int

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

def alwaysInitSizeMap: Boolean

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

def apply(key: Variable): Variable

def applyOrElse[A1 <: Variable, B1 >: Variable](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[Variable, Variable]

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

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

def companion: GenericCompanion[Iterable]

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

def contains(key: Variable): Boolean

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

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

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

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

def count(p: ((Variable, Variable)) ⇒ Boolean): Int

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

def data(key: Variable): Data

return a specific Data from VariableDataMap

val dc: DataCollection

def default(key: Variable): Variable

def drop(n: Int): LinkedHashMap[Variable, Variable]

def dropRight(n: Int): LinkedHashMap[Variable, Variable]

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

def ds(key: Variable, nr: Int): DataSerie

return a specific variable DataSerie from VariableDataMap, with only the last data

def ds(key: Variable): DataSerie

return a specific variable DataSerie from VariableDataMap

def dssDM: DataMapper

return a DataMapper containing all DataSeries only

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

def elemHashCode(key: Variable): Int

def empty: LinkedHashMap[Variable, Variable]

def entriesIterator: Iterator[LinkedEntry[Variable, Variable]]

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

def exists(p: ((Variable, Variable)) ⇒ Boolean): Boolean

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

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

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

def finalize(): Unit

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

def findEntry(key: Variable): LinkedEntry[Variable, Variable]

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

var firstEntry: Entry

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

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

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

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

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

def forall(p: ((Variable, Variable)) ⇒ Boolean): Boolean

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

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

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

def get(key: Variable): Option[Variable]

final def getClass(): Class[_]

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

def getOrElseUpdate(key: Variable, op: ⇒ Variable): Variable

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

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

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: (Variable, Variable)

def headOption: Option[(Variable, Variable)]

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

final def index(hcode: Int): Int

def init: LinkedHashMap[Variable, Variable]

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

def initialSize: Int

def inits: Iterator[LinkedHashMap[Variable, Variable]]

def isDefinedAt(key: Variable): Boolean

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

def isSizeMapDefined: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[(Variable, Variable)]

def keySet: Set[Variable]

def keys: Iterable[Variable]

def keysIterator: Iterator[Variable]

def last: (Variable, Variable)

var lastEntry: Entry

def lastOption: Option[(Variable, Variable)]

def lift: (Variable) ⇒ Option[Variable]

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

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

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

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

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

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

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

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[(Variable, Variable), LinkedHashMap[Variable, Variable]]

def newDc: DataCollection

return all data relative to the keys

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 <: Variable, B1 >: Variable](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

def par(key: Variable): Parameter

return a specific varaible Parameter from VariableDataMap

def par: ParMap[Variable, Variable]

def parCombiner: Combiner[(Variable, Variable), ParMap[Variable, Variable]]

def parsDM: DataMapper

return a DataMapper containing all Parameters only

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

def print: Unit

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

def put(key: Variable, value: Variable): Option[Variable]

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

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

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

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

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

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

def remove(key: Variable): Option[Variable]

def removeEntry(key: Variable): LinkedEntry[Variable, Variable]

def repr: LinkedHashMap[Variable, Variable]

def result(): LinkedHashMap[Variable, Variable]

def retain(p: (Variable, Variable) ⇒ Boolean): DataMapper.this.type

def reversed: List[(Variable, Variable)]

def runWith[U](action: (Variable) ⇒ U): (Variable) ⇒ Boolean

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

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

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

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

var seedvalue: Int

def seq: Map[Variable, Variable]

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[Variable, Variable]

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

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

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

def splitAt(n: Int): (LinkedHashMap[Variable, Variable], LinkedHashMap[Variable, Variable])

def stringPrefix: String

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

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

var table: Array[HashEntry[Variable, LinkedEntry[Variable, Variable]]]

var tableSize: Int

def tableSizeSeed: Int

def tail: LinkedHashMap[Variable, Variable]

def tails: Iterator[LinkedHashMap[Variable, Variable]]

def take(n: Int): LinkedHashMap[Variable, Variable]

def takeRight(n: Int): LinkedHashMap[Variable, Variable]

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

def thisCollection: Iterable[(Variable, Variable)]

var threshold: Int

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

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

def toBuffer[C >: (Variable, Variable)]: Buffer[C]

def toCollection(repr: LinkedHashMap[Variable, Variable]): Iterable[(Variable, Variable)]

def toIndexedSeq: IndexedSeq[(Variable, Variable)]

def toIterable: Iterable[(Variable, Variable)]

def toIterator: Iterator[(Variable, Variable)]

def toList: List[(Variable, Variable)]

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

def toSeq: Seq[(Variable, Variable)]

def toSet[B >: (Variable, Variable)]: Set[B]

def toStream: Stream[(Variable, Variable)]

def toString(): String

def toTraversable: Traversable[(Variable, Variable)]

def toVector: Vector[(Variable, Variable)]

def transform(f: (Variable, Variable) ⇒ Variable): DataMapper.this.type

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

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

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

def update(key: Variable, value: Variable): Unit

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

def values: Iterable[Variable]

def valuesIterator: Iterator[Variable]

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

def view: IterableView[(Variable, Variable), LinkedHashMap[Variable, Variable]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def withDefault(d: (Variable) ⇒ Variable): Map[Variable, Variable]

def withDefaultValue(d: Variable): Map[Variable, Variable]

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

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

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

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

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