Instance Constructors
-
new
Store
()
Type Members
-
type
Entry
= LinkedEntry[Any, Entry]
-
type
Self
= LinkedHashMap[Any, Entry]
Value Members
-
def
!=
(arg0: AnyRef): Boolean
-
def
!=
(arg0: Any): Boolean
-
def
##
(): Int
-
def
+
[B1 >: Entry]
(elem1: (Any, B1), elem2: (Any, B1), elems: (Any, B1)*): Map[Any, B1]
-
def
+
[B1 >: Entry]
(kv: (Any, B1)): Map[Any, B1]
-
def
++
[B1 >: Entry]
(xs: TraversableOnce[(Any, B1)]): Map[Any, B1]
-
def
++
[B1 >: Entry]
(xs: GenTraversableOnce[(Any, B1)]): Map[Any, B1]
-
def
++
[B >: (Any, Entry), That]
(that: TraversableOnce[B])(implicit bf: CanBuildFrom[LinkedHashMap[Any, Entry], B, That]): That
-
def
++
[B >: (Any, Entry), That]
(that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[LinkedHashMap[Any, Entry], B, That]): That
-
def
++:
[B >: (Any, Entry), That]
(that: Traversable[B])(implicit bf: CanBuildFrom[LinkedHashMap[Any, Entry], B, That]): That
-
def
++:
[B >: (Any, Entry), That]
(that: TraversableOnce[B])(implicit bf: CanBuildFrom[LinkedHashMap[Any, Entry], B, That]): That
-
def
++=
(xs: TraversableOnce[(Any, Entry)]): Store.this.type
-
def
+=
(kv: (Any, Entry)): Store.this.type
-
def
+=
(elem1: (Any, Entry), elem2: (Any, Entry), elems: (Any, Entry)*): Store.this.type
-
def
-
(elem1: Any, elem2: Any, elems: Any*): LinkedHashMap[Any, Entry]
-
def
-
(key: Any): LinkedHashMap[Any, Entry]
-
def
--
(xs: TraversableOnce[Any]): LinkedHashMap[Any, Entry]
-
def
--
(xs: GenTraversableOnce[Any]): LinkedHashMap[Any, Entry]
-
def
--=
(xs: TraversableOnce[Any]): Store.this.type
-
def
-=
(key: Any): Store.this.type
-
def
-=
(elem1: Any, elem2: Any, elems: Any*): Store.this.type
-
def
/:
[B]
(z: B)(op: (B, (Any, Entry)) ⇒ B): B
-
def
/:\
[A1 >: (Any, Entry)]
(z: A1)(op: (A1, A1) ⇒ A1): A1
-
def
:\
[B]
(z: B)(op: ((Any, Entry), B) ⇒ B): B
-
def
==
(arg0: AnyRef): Boolean
-
def
==
(arg0: Any): Boolean
-
var
_loadFactor
: Int
-
def
addEntry
(e: LinkedEntry[Any, Entry]): 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, (Any, Entry)) ⇒ B, combop: (B, B) ⇒ B): B
-
def
alwaysInitSizeMap
: Boolean
-
def
andThen
[C]
(k: (Entry) ⇒ C): PartialFunction[Any, C]
-
def
apply
(key: Any): Entry
-
def
asInstanceOf
[T0]
: T0
-
def
calcSizeMapSize
(tableLength: Int): Int
-
def
canEqual
(that: Any): Boolean
-
def
clear
(): Unit
-
def
clearTable
(): Unit
-
def
clone
(): LinkedHashMap[Any, Entry]
-
def
collect
[B, That]
(pf: PartialFunction[(Any, Entry), B])(implicit bf: CanBuildFrom[LinkedHashMap[Any, Entry], B, That]): That
-
def
collectFirst
[B]
(pf: PartialFunction[(Any, Entry), B]): Option[B]
-
def
companion
: GenericCompanion[Iterable]
-
def
compose
[A]
(g: (A) ⇒ Any): (A) ⇒ Entry
-
def
contains
(key: Any): Boolean
-
def
copyToArray
[B >: (Any, Entry)]
(xs: Array[B], start: Int, len: Int): Unit
-
def
copyToArray
[B >: (Any, Entry)]
(xs: Array[B]): Unit
-
def
copyToArray
[B >: (Any, Entry)]
(xs: Array[B], start: Int): Unit
-
def
copyToBuffer
[B >: (Any, Entry)]
(dest: Buffer[B]): Unit
-
def
count
(p: ((Any, Entry)) ⇒ Boolean): Int
-
def
default
(key: Any): Entry
-
def
drop
(n: Int): LinkedHashMap[Any, Entry]
-
def
dropRight
(n: Int): LinkedHashMap[Any, Entry]
-
def
dropWhile
(p: ((Any, Entry)) ⇒ Boolean): LinkedHashMap[Any, Entry]
-
def
elemEquals
(key1: Any, key2: Any): Boolean
-
def
elemHashCode
(key: Any): Int
-
def
empty
: LinkedHashMap[Any, Entry]
-
def
entriesIterator
: Iterator[LinkedEntry[Any, Entry]]
-
def
eq
(arg0: AnyRef): Boolean
-
def
equals
(that: Any): Boolean
-
def
exists
(p: ((Any, Entry)) ⇒ Boolean): Boolean
-
def
filter
(p: ((Any, Entry)) ⇒ Boolean): LinkedHashMap[Any, Entry]
-
def
filterKeys
(p: (Any) ⇒ Boolean): Map[Any, Entry]
-
def
filterNot
(p: ((Any, Entry)) ⇒ Boolean): LinkedHashMap[Any, Entry]
-
def
finalize
(): Unit
-
def
find
(p: ((Any, Entry)) ⇒ Boolean): Option[(Any, Entry)]
-
def
findEntry
(key: Any): LinkedEntry[Any, Entry]
-
var
firstEntry
: Entry
-
def
flatMap
[B, That]
(f: ((Any, Entry)) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[LinkedHashMap[Any, Entry], B, That]): That
-
def
flatten
[B]
(implicit asTraversable: ((Any, Entry)) ⇒ TraversableOnce[B]): Traversable[B]
-
def
fold
[A1 >: (Any, Entry)]
(z: A1)(op: (A1, A1) ⇒ A1): A1
-
def
foldLeft
[B]
(z: B)(op: (B, (Any, Entry)) ⇒ B): B
-
def
foldRight
[B]
(z: B)(op: ((Any, Entry), B) ⇒ B): B
-
def
forall
(p: ((Any, Entry)) ⇒ Boolean): Boolean
-
def
foreach
[U]
(f: ((Any, Entry)) ⇒ U): Unit
-
def
foreachEntry
[C]
(f: (LinkedEntry[Any, Entry]) ⇒ C): Unit
-
def
genericBuilder
[B]
: Builder[B, Iterable[B]]
-
def
get
(key: Any): Option[Entry]
-
def
getClass
(): java.lang.Class[_]
-
def
getEntry
(key: Any): Option[Entry]
-
def
getOrElse
[B1 >: Entry]
(key: Any, default: ⇒ B1): B1
-
def
getOrElseUpdate
(key: Any, op: ⇒ Entry): Entry
-
def
groupBy
[K]
(f: ((Any, Entry)) ⇒ K): Map[K, LinkedHashMap[Any, Entry]]
-
def
grouped
(size: Int): Iterator[LinkedHashMap[Any, Entry]]
-
def
hasDefiniteSize
: Boolean
-
def
hashCode
(): Int
-
def
head
: (Any, Entry)
-
def
headOption
: Option[(Any, Entry)]
-
def
improve
(hcode: Int): Int
-
def
index
(hcode: Int): Int
-
def
init
: LinkedHashMap[Any, Entry]
-
def
initWithContents
(c: Contents[Any, LinkedEntry[Any, Entry]]): Unit
-
def
initialSize
: Int
-
def
inits
: Iterator[LinkedHashMap[Any, Entry]]
-
def
isDefinedAt
(key: Any): Boolean
-
def
isEmpty
: Boolean
-
def
isInstanceOf
[T0]
: Boolean
-
def
isSizeMapDefined
: Boolean
-
def
isTraversableAgain
: Boolean
-
def
iterator
: Iterator[(Any, Entry)]
-
def
keySet
: Set[Any]
-
def
keys
: Iterable[Any]
-
def
keysIterator
: Iterator[Any]
-
def
last
: (Any, Entry)
-
var
lastEntry
: Entry
-
def
lastOption
: Option[(Any, Entry)]
-
def
lift
: (Any) ⇒ Option[Entry]
-
def
map
[B, That]
(f: ((Any, Entry)) ⇒ B)(implicit bf: CanBuildFrom[LinkedHashMap[Any, Entry], B, That]): That
-
def
mapResult
[NewTo]
(f: (LinkedHashMap[Any, Entry]) ⇒ NewTo): Builder[(Any, Entry), NewTo]
-
def
mapValues
[C]
(f: (Entry) ⇒ C): Map[Any, C]
-
def
max
[B >: (Any, Entry)]
(implicit cmp: Ordering[B]): (Any, Entry)
-
def
maxBy
[B]
(f: ((Any, Entry)) ⇒ B)(implicit cmp: Ordering[B]): (Any, Entry)
-
def
min
[B >: (Any, Entry)]
(implicit cmp: Ordering[B]): (Any, Entry)
-
def
minBy
[B]
(f: ((Any, Entry)) ⇒ B)(implicit cmp: Ordering[B]): (Any, Entry)
-
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[(Any, Entry), LinkedHashMap[Any, Entry]]
-
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 <: Any, B1 >: Entry]
(that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
-
def
par
: ParMap[Any, Entry]
-
def
parCombiner
: Combiner[(Any, Entry), ParMap[Any, Entry]]
-
def
partition
(p: ((Any, Entry)) ⇒ Boolean): (LinkedHashMap[Any, Entry], LinkedHashMap[Any, Entry])
-
def
product
[B >: (Any, Entry)]
(implicit num: Numeric[B]): B
-
def
put
(key: Any, value: Entry): Option[Entry]
-
def
reduce
[A1 >: (Any, Entry)]
(op: (A1, A1) ⇒ A1): A1
-
def
reduceLeft
[B >: (Any, Entry)]
(op: (B, (Any, Entry)) ⇒ B): B
-
def
reduceLeftOption
[B >: (Any, Entry)]
(op: (B, (Any, Entry)) ⇒ B): Option[B]
-
def
reduceOption
[A1 >: (Any, Entry)]
(op: (A1, A1) ⇒ A1): Option[A1]
-
def
reduceRight
[B >: (Any, Entry)]
(op: ((Any, Entry), B) ⇒ B): B
-
def
reduceRightOption
[B >: (Any, Entry)]
(op: ((Any, Entry), B) ⇒ B): Option[B]
-
def
remove
(key: Any): Option[Entry]
-
def
removeEntry
(key: Any): LinkedEntry[Any, Entry]
-
def
repr
: LinkedHashMap[Any, Entry]
-
def
result
(): LinkedHashMap[Any, Entry]
-
def
retain
(p: (Any, Entry) ⇒ Boolean): Store.this.type
-
def
reversed
: List[(Any, Entry)]
-
def
sameElements
[B >: (Any, Entry)]
(that: Iterable[B]): Boolean
-
def
sameElements
[B >: (Any, Entry)]
(that: GenIterable[B]): Boolean
-
def
scan
[B >: (Any, Entry), That]
(z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[LinkedHashMap[Any, Entry], B, That]): That
-
def
scanLeft
[B, That]
(z: B)(op: (B, (Any, Entry)) ⇒ B)(implicit bf: CanBuildFrom[LinkedHashMap[Any, Entry], B, That]): That
-
def
scanRight
[B, That]
(z: B)(op: ((Any, Entry), B) ⇒ B)(implicit bf: CanBuildFrom[LinkedHashMap[Any, Entry], B, That]): That
-
def
seq
: Map[Any, Entry]
-
def
setEntry
(key: Any, entry: Entry): Unit
-
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[Any, Entry]
-
def
sliding
[B >: (Any, Entry)]
(size: Int, step: Int): Iterator[LinkedHashMap[Any, Entry]]
-
def
sliding
[B >: (Any, Entry)]
(size: Int): Iterator[LinkedHashMap[Any, Entry]]
-
def
span
(p: ((Any, Entry)) ⇒ Boolean): (LinkedHashMap[Any, Entry], LinkedHashMap[Any, Entry])
-
def
splitAt
(n: Int): (LinkedHashMap[Any, Entry], LinkedHashMap[Any, Entry])
-
def
stringPrefix
: String
-
def
sum
[B >: (Any, Entry)]
(implicit num: Numeric[B]): B
-
def
synchronized
[T0]
(arg0: ⇒ T0): T0
-
var
table
: Array[HashEntry[Any, LinkedEntry[Any, Entry]]]
-
var
tableSize
: Int
-
def
tail
: LinkedHashMap[Any, Entry]
-
def
tails
: Iterator[LinkedHashMap[Any, Entry]]
-
def
take
(n: Int): LinkedHashMap[Any, Entry]
-
def
takeRight
(n: Int): LinkedHashMap[Any, Entry]
-
def
takeWhile
(p: ((Any, Entry)) ⇒ Boolean): LinkedHashMap[Any, Entry]
-
def
thisCollection
: Iterable[(Any, Entry)]
-
var
threshold
: Int
-
def
toArray
[B >: (Any, Entry)]
(implicit arg0: ClassManifest[B]): Array[B]
-
def
toBuffer
[C >: (Any, Entry)]
: Buffer[C]
-
def
toCollection
(repr: LinkedHashMap[Any, Entry]): Iterable[(Any, Entry)]
-
def
toIndexedSeq
[B >: (Any, Entry)]
: IndexedSeq[B]
-
def
toIterable
: Iterable[(Any, Entry)]
-
def
toIterator
: Iterator[(Any, Entry)]
-
def
toList
: List[(Any, Entry)]
-
def
toMap
[T, U]
(implicit ev: <:<[(Any, Entry), (T, U)]): Map[T, U]
-
def
toSeq
: Seq[(Any, Entry)]
-
def
toSet
[B >: (Any, Entry)]
: Set[B]
-
def
toStream
: Stream[(Any, Entry)]
-
def
toString
(): String
-
def
toTraversable
: Traversable[(Any, Entry)]
-
def
transform
(f: (Any, Entry) ⇒ Entry): Store.this.type
-
def
transpose
[B]
(implicit asTraversable: ((Any, Entry)) ⇒ TraversableOnce[B]): Traversable[Traversable[B]]
-
def
unzip
[A1, A2]
(implicit asPair: ((Any, Entry)) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])
-
def
unzip3
[A1, A2, A3]
(implicit asTriple: ((Any, Entry)) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
-
def
update
(key: Any, value: Entry): Unit
-
def
updated
[B1 >: Entry]
(key: Any, value: B1): Map[Any, B1]
-
def
values
: Iterable[Entry]
-
def
valuesIterator
: Iterator[Entry]
-
def
view
(from: Int, until: Int): IterableView[(Any, Entry), LinkedHashMap[Any, Entry]]
-
def
view
: IterableView[(Any, Entry), LinkedHashMap[Any, Entry]]
-
def
wait
(): Unit
-
def
wait
(arg0: Long, arg1: Int): Unit
-
def
wait
(arg0: Long): Unit
-
def
withDefault
(d: (Any) ⇒ Entry): Map[Any, Entry]
-
def
withDefaultValue
(d: Entry): Map[Any, Entry]
-
def
withFilter
(p: ((Any, Entry)) ⇒ Boolean): FilterMonadic[(Any, Entry), LinkedHashMap[Any, Entry]]
-
def
zip
[A1 >: (Any, Entry), B, That]
(that: Iterable[B])(implicit bf: CanBuildFrom[LinkedHashMap[Any, Entry], (A1, B), That]): That
-
def
zip
[A1 >: (Any, Entry), B, That]
(that: GenIterable[B])(implicit bf: CanBuildFrom[LinkedHashMap[Any, Entry], (A1, B), That]): That
-
def
zipAll
[B, A1 >: (Any, Entry), That]
(that: Iterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[LinkedHashMap[Any, Entry], (A1, B), That]): That
-
def
zipAll
[B, A1 >: (Any, Entry), That]
(that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[LinkedHashMap[Any, Entry], (A1, B), That]): That
-
def
zipWithIndex
[A1 >: (Any, Entry), That]
(implicit bf: CanBuildFrom[LinkedHashMap[Any, Entry], (A1, Int), That]): That
-
def
elements
: Iterator[(Any, Entry)]
-
def
entries
: Iterator[LinkedEntry[Any, Entry]]
-
def
first
: (Any, Entry)
-
def
firstOption
: Option[(Any, Entry)]
-
def
mapElements
[C]
(f: (Entry) ⇒ C): Map[Any, C]
-
def
projection
: IterableView[(Any, Entry), LinkedHashMap[Any, Entry]]
-
def
removeKey
(key: Any): Option[Entry]
Inherited from LinkedHashMap[Any, Entry]
Inherited from Serializable
Inherited from Serializable
Inherited from HashTable[Any, LinkedEntry[Any, Entry]]
Inherited from HashUtils[Any]
Inherited from Map[Any, Entry]
Inherited from MapLike[Any, Entry, LinkedHashMap[Any, Entry]]
Inherited from Cloneable[LinkedHashMap[Any, Entry]]
Inherited from Shrinkable[Any]
Inherited from Builder[(Any, Entry), LinkedHashMap[Any, Entry]]
Inherited from Growable[(Any, Entry)]
Inherited from Map[Any, Entry]
Inherited from MapLike[Any, Entry, LinkedHashMap[Any, Entry]]
Inherited from Subtractable[Any, LinkedHashMap[Any, Entry]]
Inherited from PartialFunction[Any, Entry]
Inherited from (Any) ⇒ Entry
Inherited from GenMap[Any, Entry]
Inherited from GenMapLike[Any, Entry, LinkedHashMap[Any, Entry]]
Inherited from Iterable[(Any, Entry)]
Inherited from Iterable[(Any, Entry)]
Inherited from IterableLike[(Any, Entry), LinkedHashMap[Any, Entry]]
Inherited from Equals
Inherited from GenIterable[(Any, Entry)]
Inherited from GenIterableLike[(Any, Entry), LinkedHashMap[Any, Entry]]
Inherited from Traversable[(Any, Entry)]
Inherited from Mutable
Inherited from Traversable[(Any, Entry)]
Inherited from GenTraversable[(Any, Entry)]
Inherited from GenericTraversableTemplate[(Any, Entry), Iterable]
Inherited from TraversableLike[(Any, Entry), LinkedHashMap[Any, Entry]]
Inherited from GenTraversableLike[(Any, Entry), LinkedHashMap[Any, Entry]]
Inherited from Parallelizable[(Any, Entry), ParMap[Any, Entry]]
Inherited from TraversableOnce[(Any, Entry)]
Inherited from GenTraversableOnce[(Any, Entry)]
Inherited from FilterMonadic[(Any, Entry), LinkedHashMap[Any, Entry]]
Inherited from HasNewBuilder[(Any, Entry), LinkedHashMap[Any, Entry]]
Inherited from AnyRef
Inherited from Any