DataCollection

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

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

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

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

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

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

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

def ++=(that: TraversableOnce[Data]): DataCollection.this.type

add new elements in the KeySet

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

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

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

def +=(v: Data): DataCollection.this.type

add a new element in the KeySet (abstract)

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

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

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

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

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

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

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

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

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

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

var _loadFactor: Int

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

def alwaysInitSizeMap: Boolean

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

def apply(key: Variable): Data

def applyOrElse[A1 <: Variable, B1 >: Data](x: A1, default: (A1) ⇒ B1): B1

final def asInstanceOf[T0]: T0

def buildKey(data: Data): Variable

returns a new key for the DataCollection KeySet

def calcSizeMapSize(tableLength: Int): Int

def calculableSeries: List[Variable with Calculable]

return a List of Variables with Serie which could be calculated with the given variables

def calculables: List[Variable with Calculable]

return a List of Variables which could be calculated with the given variables

def calculate(vars: Seq[Variable with Calculable] = this.toCalculate): Unit

calculate the given variables and necessary/possible intermediate ones

def calculated: List[Variable with Calculable]

return a Sequence of Variables with Calculable which already exists in the collection (either as input or already calculated)

def calculatedSeries: List[Serie with Calculable]

return a Sequence of Series with Calculable which already exists in the collection (either as input or already calculated)

def canEqual(that: Any): Boolean

def clear(): Unit

def clearTable(): Unit

def clone(): LinkedHashMap[Variable, Data]

def cloneAll: DataCollection

clones the DataSerie

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

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

def companion: GenericCompanion[Iterable]

def complete(vars: Seq[Serie with Calculable] = this.toComplete): Unit

complete the given variables and necessary/possible intermediate ones

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

def contains(key: Variable): Boolean

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

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

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

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

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

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

def dateDs: DataSerie

return a DataSerie with the dates

def default(key: Variable): Data

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

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

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

def dss: DataSeries

Returns the DataSeries from the DataCollection

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

def elemHashCode(key: Variable): Int

def empty: LinkedHashMap[Variable, Data]

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

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

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

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

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

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

def finalize(): Unit

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

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

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

var firstEntry: Entry

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

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

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

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

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

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

def forceComplete(vars: Seq[Serie with Calculable] = this.toComplete): Unit

complete the given variables and necessary/possible intermediate ones

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

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

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

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

final def getClass(): Class[_]

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

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

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

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

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: (Variable, Data)

def headOption: Option[(Variable, Data)]

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

final def index(hcode: Int): Int

def init: LinkedHashMap[Variable, Data]

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

def initialSize: Int

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

def isDefinedAt(key: Variable): Boolean

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

def isSizeMapDefined: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[(Variable, Data)]

def keySet: Set[Variable]

def keys: Iterable[Variable]

def keysIterator: Iterator[Variable]

def last: (Variable, Data)

var lastEntry: Entry

def lastOption: Option[(Variable, Data)]

def lift: (Variable) ⇒ Option[Data]

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

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

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

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

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

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

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

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

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

def ordered: DataCollection

Returns a DataCollection with the order specified in Variable.

def par: ParMap[Variable, Data]

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

def pars: Parameters

Returns the Parameters from the DataCollection

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

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

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

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

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

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

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

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

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

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

def removeDss: DataCollection

Removes the Dataseries from the DataCollection

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

def removeNotAvailablePars: DataCollection

Removes the Parameters who are not availables from the DataCollection

def removePars: DataCollection

Removes the Parameters from the DataCollection

def repr: LinkedHashMap[Variable, Data]

def result(): LinkedHashMap[Variable, Data]

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

def reversed: List[(Variable, Data)]

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

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

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

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

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

var seedvalue: Int

def seq: Map[Variable, Data]

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, Data]

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

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

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

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

def stringPrefix: String

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

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

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

var tableSize: Int

def tableSizeSeed: Int

def tail: LinkedHashMap[Variable, Data]

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

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

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

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

def thisCollection: Iterable[(Variable, Data)]

var threshold: Int

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

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

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

def toCalculate: Seq[Variable with Calculable]

return a Sequence of Variables which do not exists in the collection (either as input or already calulated)

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

def toComplete: List[Serie with Calculable]

return a Sequence of Variables with Serie which already exists in the collection but for which the last value has to be calculated

def toIndexedSeq: IndexedSeq[(Variable, Data)]

def toIterable: Iterable[(Variable, Data)]

def toIterator: Iterator[(Variable, Data)]

def toList: List[(Variable, Data)]

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

def toSeq: Seq[(Variable, Data)]

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

def toStream: Stream[(Variable, Data)]

def toString(): String

def toTraversable: Traversable[(Variable, Data)]

def toVector: Vector[(Variable, Data)]

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

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

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

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

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

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

def values: Iterable[Data]

def valuesIterator: Iterator[Data]

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

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

final def wait(): Unit

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

final def wait(arg0: Long): Unit

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

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

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

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

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

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

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