org.apache.ignite.scalar.pimps

# ScalarCachePimp

###
Related Docs: object ScalarCachePimp | package pimps

#### class ScalarCachePimp[K, V] extends PimpedType[IgniteCache[K, V]] with Iterable[Entry[K, V]] with Ordered[IgniteCache[K, V]]

#### Overview

Defines Scalar "pimp" for `IgniteCache` on Java side.

Essentially this class extends Java `IgniteCache` interface with Scala specific API adapters using primarily implicit conversions defined in `ScalarConversions` object. What it means is that you can use functions defined in this class on object of Java `IgniteCache` type. Scala will automatically (implicitly) convert it into Scalar's pimp and replace the original call with a call on that pimp.

Note that Scalar provide extensive library of implicit conversion between Java and Scala Ignite counterparts in `ScalarConversions` object

#### Suffix '$' In Names

Symbol `$` is used in names when they conflict with the names in the base Java class that Scala pimp is shadowing or with Java package name that your Scala code is importing. Instead of giving two different names to the same function we've decided to simply mark Scala's side method with `$` suffix.

Linear Supertypes
Ordered[IgniteCache[K, V]], Comparable[IgniteCache[K, V]], Iterable[Entry[K, V]], IterableLike[Entry[K, V], Iterable[Entry[K, V]]], Equals, GenIterable[Entry[K, V]], GenIterableLike[Entry[K, V], Iterable[Entry[K, V]]], Traversable[Entry[K, V]], GenTraversable[Entry[K, V]], GenericTraversableTemplate[Entry[K, V], Iterable], TraversableLike[Entry[K, V], Iterable[Entry[K, V]]], GenTraversableLike[Entry[K, V], Iterable[Entry[K, V]]], Parallelizable[Entry[K, V], ParIterable[Entry[K, V]]], TraversableOnce[Entry[K, V]], GenTraversableOnce[Entry[K, V]], FilterMonadic[Entry[K, V], Iterable[Entry[K, V]]], HasNewBuilder[Entry[K, V], Iterable[javax.cache.Cache.Entry[K,V]] @scala.annotation.unchecked.uncheckedVariance], PimpedType[IgniteCache[K, V]], AnyRef, Any
Ordering

1. Alphabetic
2. By Inheritance

Inherited

1. ScalarCachePimp
2. Ordered
3. Comparable
4. Iterable
5. IterableLike
6. Equals
7. GenIterable
8. GenIterableLike
9. Traversable
10. GenTraversable
11. GenericTraversableTemplate
12. TraversableLike
13. GenTraversableLike
14. Parallelizable
15. TraversableOnce
16. GenTraversableOnce
17. FilterMonadic
18. HasNewBuilder
19. PimpedType
20. AnyRef
21. Any

1. Hide All
2. Show All

Visibility

1. Public
2. All

### Instance Constructors

1. #### new ScalarCachePimp()

### Type Members

1. #### type EntryPred = (Entry[K, V]) ⇒ Boolean

   Type alias.

   Type alias.

   Attributes
     protected

2. #### type KvPred = (K, V) ⇒ Boolean

   Type alias.

   Type alias.

   Attributes
     protected

3. #### type Self = Iterable[Entry[K, V]]

   Attributes
     protected[this]
   Definition Classes
     TraversableLike

4. #### class WithFilter extends FilterMonadic[A, Repr]

   Definition Classes
     TraversableLike

### Value Members

1. #### final def !=(arg0: Any): Boolean

   Definition Classes
     AnyRef → Any

2. #### final def ##(): Int

   Definition Classes
     AnyRef → Any

3. #### def ++[B >: Entry[K, V], That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[Entry[K, V]], B, That]): That

   Definition Classes
     TraversableLike → GenTraversableLike

4. #### def ++:[B >: Entry[K, V], That](that: Traversable[B])(implicit bf: CanBuildFrom[Iterable[Entry[K, V]], B, That]): That

   Definition Classes
     TraversableLike

5. #### def ++:[B >: Entry[K, V], That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[Entry[K, V]], B, That]): That

   Definition Classes
     TraversableLike

6. #### def +=(kv1: (K, V), kv2: (K, V), kvs: (K, V)*): Unit

   Operator alias for the same function `putAll$`.

   Operator alias for the same function `putAll$`.

   kv1

     Key-value pair to store in cache.

   kv2

     Key-value pair to store in cache.

   kvs

     Optional key-value pairs to store in cache.

   See also

     `IgniteCache#putAll(...)`

7. #### def +=(kv: (K, V)): Boolean

   Operator alias for the same function `putx$`.

   Operator alias for the same function `putx$`.

   kv

     Key-Value pair to store in cache.

   returns

     `True` if value was stored in cache, `false` otherwise.

   See also

     `IgniteCache#putx(...)`

8. #### def -=(k1: K, k2: K, ks: K*): Unit

   Operator alias for the same function `remove$`.

   Operator alias for the same function `remove$`.

   k1

     1st key to remove.

   k2

     2nd key to remove.

   ks

     Optional sequence of additional keys to remove.

   See also

     `IgniteCache#removeAll(...)`

9. #### def -=(k: K): V

   Operator alias for the same function `remove$`.

   Operator alias for the same function `remove$`.

   k

     Key whose mapping is to be removed from cache.

   returns

     Previous value associated with specified key, or `null` if there was no value for this key.

   See also

     `IgniteCache#remove(...)`

10. #### def /:[B](z: B)(op: (B, Entry[K, V]) ⇒ B): B

    Definition Classes
      TraversableOnce → GenTraversableOnce

11. #### def :\[B](z: B)(op: (Entry[K, V], B) ⇒ B): B

    Definition Classes
      TraversableOnce → GenTraversableOnce

12. #### def <(that: IgniteCache[K, V]): Boolean

    Definition Classes
      Ordered

13. #### def <=(that: IgniteCache[K, V]): Boolean

    Definition Classes
      Ordered

14. #### final def ==(arg0: Any): Boolean

    Definition Classes
      AnyRef → Any

15. #### def >(that: IgniteCache[K, V]): Boolean

    Definition Classes
      Ordered

16. #### def >=(that: IgniteCache[K, V]): Boolean

    Definition Classes
      Ordered

17. #### def addString(b: StringBuilder): StringBuilder

    Definition Classes
      TraversableOnce

18. #### def addString(b: StringBuilder, sep: String): StringBuilder

    Definition Classes
      TraversableOnce

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

    Definition Classes
      TraversableOnce

20. #### def aggregate[B](z: ⇒ B)(seqop: (B, Entry[K, V]) ⇒ B, combop: (B, B) ⇒ B): B

    Definition Classes
      TraversableOnce → GenTraversableOnce

21. #### def apply(k: K): V

    Retrieves value mapped to the specified key from cache.

    Retrieves value mapped to the specified key from cache. The return value of `null` means entry did not pass the provided filter or cache has no mapping for the key.

    k

      Key to retrieve the value for.

    returns

      Value for the given key.

22. #### final def asInstanceOf[T0]: T0

    Definition Classes
      Any

23. #### def canEqual(that: Any): Boolean

    Definition Classes
      IterableLike → Equals

24. #### def clone(): AnyRef

    Attributes
      protected[java.lang]
    Definition Classes
      AnyRef
    Annotations
      @throws( ... )

25. #### def collect[B, That](pf: PartialFunction[Entry[K, V], B])(implicit bf: CanBuildFrom[Iterable[Entry[K, V]], B, That]): That

    Definition Classes
      TraversableLike → GenTraversableLike

26. #### def collectFirst[B](pf: PartialFunction[Entry[K, V], B]): Option[B]

    Definition Classes
      TraversableOnce

27. #### def companion: GenericCompanion[Iterable]

    Definition Classes
      Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate

28. #### def compare(that: IgniteCache[K, V]): Int

    Compares this cache name to the given cache name.

    Compares this cache name to the given cache name.

    that

      Another cache instance to compare names with.

    Definition Classes
      ScalarCachePimp → Ordered

29. #### def compareTo(that: IgniteCache[K, V]): Int

    Definition Classes
      Ordered → Comparable

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

    Definition Classes
      IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

31. #### def copyToArray[B >: Entry[K, V]](xs: Array[B]): Unit

    Definition Classes
      TraversableOnce → GenTraversableOnce

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

    Definition Classes
      TraversableOnce → GenTraversableOnce

33. #### def copyToBuffer[B >: Entry[K, V]](dest: Buffer[B]): Unit

    Definition Classes
      TraversableOnce

34. #### def count(p: (Entry[K, V]) ⇒ Boolean): Int

    Definition Classes
      TraversableOnce → GenTraversableOnce

35. #### def drop(n: Int): Iterable[Entry[K, V]]

    Definition Classes
      IterableLike → TraversableLike → GenTraversableLike

36. #### def dropRight(n: Int): Iterable[Entry[K, V]]

    Definition Classes
      IterableLike

37. #### def dropWhile(p: (Entry[K, V]) ⇒ Boolean): Iterable[Entry[K, V]]

    Definition Classes
      TraversableLike → GenTraversableLike

38. #### final def eq(arg0: AnyRef): Boolean

    Definition Classes
      AnyRef

39. #### def equals(arg0: Any): Boolean

    Definition Classes
      AnyRef → Any

40. #### def exists(p: (Entry[K, V]) ⇒ Boolean): Boolean

    Definition Classes
      IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

41. #### def filter(p: (Entry[K, V]) ⇒ Boolean): Iterable[Entry[K, V]]

    Definition Classes
      TraversableLike → GenTraversableLike

42. #### def filterNot(p: (Entry[K, V]) ⇒ Boolean): Iterable[Entry[K, V]]

    Definition Classes
      TraversableLike → GenTraversableLike

43. #### def finalize(): Unit

    Attributes
      protected[java.lang]
    Definition Classes
      AnyRef
    Annotations
      @throws( classOf[java.lang.Throwable] )

44. #### def find(p: (Entry[K, V]) ⇒ Boolean): Option[Entry[K, V]]

    Definition Classes
      IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

45. #### def flatMap[B, That](f: (Entry[K, V]) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[Entry[K, V]], B, That]): That

    Definition Classes
      TraversableLike → GenTraversableLike → FilterMonadic

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

    Definition Classes
      GenericTraversableTemplate

47. #### def fold[A1 >: Entry[K, V]](z: A1)(op: (A1, A1) ⇒ A1): A1

    Definition Classes
      TraversableOnce → GenTraversableOnce

48. #### def foldLeft[B](z: B)(op: (B, Entry[K, V]) ⇒ B): B

    Definition Classes
      TraversableOnce → GenTraversableOnce

49. #### def foldRight[B](z: B)(op: (Entry[K, V], B) ⇒ B): B

    Definition Classes
      IterableLike → TraversableOnce → GenTraversableOnce

50. #### def forall(p: (Entry[K, V]) ⇒ Boolean): Boolean

    Definition Classes
      IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

51. #### def foreach[U](f: (Entry[K, V]) ⇒ U): Unit

    Definition Classes
      IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic

52. #### def genericBuilder[B]: Builder[B, Iterable[B]]

    Definition Classes
      GenericTraversableTemplate

53. #### final def getClass(): Class[_]

    Definition Classes
      AnyRef → Any

54. #### def getOrElse(k: K, default: ⇒ V): V

    Returns the value associated with a key, or a default value if the key is not contained in the map.

    Returns the value associated with a key, or a default value if the key is not contained in the map.

    k

      The key.

    default

      A computation that yields a default value in case key is not in cache.

    returns

      The cache value associated with `key` if it exists, otherwise the result of the `default` computation.

55. #### def groupBy[K](f: (Entry[K, V]) ⇒ K): Map[K, Iterable[Entry[K, V]]]

    Definition Classes
      TraversableLike → GenTraversableLike

56. #### def grouped(size: Int): Iterator[Iterable[Entry[K, V]]]

    Definition Classes
      IterableLike

57. #### def hasDefiniteSize: Boolean

    Definition Classes
      TraversableLike → TraversableOnce → GenTraversableOnce

58. #### def hashCode(): Int

    Definition Classes
      AnyRef → Any

59. #### def head: Entry[K, V]

    Definition Classes
      IterableLike → TraversableLike → GenTraversableLike

60. #### def headOption: Option[Entry[K, V]]

    Definition Classes
      TraversableLike → GenTraversableLike

61. #### var impl: IgniteCache[K, V]

    Attributes
      protected

62. #### def init: Iterable[Entry[K, V]]

    Definition Classes
      TraversableLike → GenTraversableLike

63. #### def inits: Iterator[Iterable[Entry[K, V]]]

    Definition Classes
      TraversableLike

64. #### def isEmpty: Boolean

    Definition Classes
      IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

65. #### final def isInstanceOf[T0]: Boolean

    Definition Classes
      Any

66. #### final def isTraversableAgain: Boolean

    Definition Classes
      TraversableLike → GenTraversableLike → GenTraversableOnce

67. #### def iterator: Iterator[Entry[K, V]]

    Gets iterator for cache entries.

    Gets iterator for cache entries.

    Definition Classes
      ScalarCachePimp → IterableLike → GenIterableLike

68. #### def last: Entry[K, V]

    Definition Classes
      TraversableLike → GenTraversableLike

69. #### def lastOption: Option[Entry[K, V]]

    Definition Classes
      TraversableLike → GenTraversableLike

70. #### def map[B, That](f: (Entry[K, V]) ⇒ B)(implicit bf: CanBuildFrom[Iterable[Entry[K, V]], B, That]): That

    Definition Classes
      TraversableLike → GenTraversableLike → FilterMonadic

71. #### def max[B >: Entry[K, V]](implicit cmp: Ordering[B]): Entry[K, V]

    Definition Classes
      TraversableOnce → GenTraversableOnce

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

    Definition Classes
      TraversableOnce → GenTraversableOnce

73. #### def min[B >: Entry[K, V]](implicit cmp: Ordering[B]): Entry[K, V]

    Definition Classes
      TraversableOnce → GenTraversableOnce

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

    Definition Classes
      TraversableOnce → GenTraversableOnce

75. #### def mkString: String

    Definition Classes
      TraversableOnce → GenTraversableOnce

76. #### def mkString(sep: String): String

    Definition Classes
      TraversableOnce → GenTraversableOnce

77. #### def mkString(start: String, sep: String, end: String): String

    Definition Classes
      TraversableOnce → GenTraversableOnce

78. #### final def ne(arg0: AnyRef): Boolean

    Definition Classes
      AnyRef

79. #### def newBuilder: Builder[Entry[K, V], Iterable[Entry[K, V]]]

    Attributes
      protected[this]
    Definition Classes
      GenericTraversableTemplate → HasNewBuilder

80. #### def nonEmpty: Boolean

    Definition Classes
      TraversableOnce → GenTraversableOnce

81. #### final def notify(): Unit

    Definition Classes
      AnyRef

82. #### final def notifyAll(): Unit

    Definition Classes
      AnyRef

83. #### def opt(k: K): Option[V]

    Retrieves value mapped to the specified key from cache as an option.

    Retrieves value mapped to the specified key from cache as an option. The return value of `null` means entry did not pass the provided filter or cache has no mapping for the key.

    k

      Key to retrieve the value for.

    returns

      Value for the given key.

    See also

      `IgniteCache.get(...)`

84. #### def par: ParIterable[Entry[K, V]]

    Definition Classes
      Parallelizable

85. #### def parCombiner: Combiner[Entry[K, V], ParIterable[Entry[K, V]]]

    Attributes
      protected[this]
    Definition Classes
      TraversableLike → Parallelizable

86. #### def partition(p: (Entry[K, V]) ⇒ Boolean): (Iterable[Entry[K, V]], Iterable[Entry[K, V]])

    Definition Classes
      TraversableLike → GenTraversableLike

87. #### def product[B >: Entry[K, V]](implicit num: Numeric[B]): B

    Definition Classes
      TraversableOnce → GenTraversableOnce

88. #### def put$(kv: (K, V)): V

    Stores given key-value pair in cache.

    Stores given key-value pair in cache. If filters are provided, then entries will be stored in cache only if they pass the filter. Note that filter check is atomic, so value stored in cache is guaranteed to be consistent with the filters.

    If write-through is enabled, the stored value will be persisted to `GridCacheStore` via `GridCacheStore#put(String, GridCacheTx, Object, Object)` method.

    ##### Transactions

    This method is transactional and will enlist the entry into ongoing transaction if there is one.

    kv

      Key-Value pair to store in cache.

    returns

      Previous value associated with specified key, or `null` if entry did not pass the filter, or if there was no mapping for the key in swap or in persistent storage.

    See also

      `IgniteCache#put(...)`

89. #### def putAll$(kvs: Seq[(K, V)]): Unit

    Stores given key-value pairs from the sequence in cache.

    Stores given key-value pairs from the sequence in cache.

    If write-through is enabled, the stored values will be persisted to `GridCacheStore` via `GridCacheStore#putAll(String, GridCacheTx, Map)` method.

    ##### Transactions

    This method is transactional and will enlist the entry into ongoing transaction if there is one.

    kvs

      Key-value pairs to store in cache. If `null` this function is no-op.

    See also

      `IgniteCache#putAll(...)`

90. #### def putAll$(kv1: (K, V), kv2: (K, V), kvs: (K, V)*): Unit

    Stores given key-value pairs in cache.

    Stores given key-value pairs in cache.

    If write-through is enabled, the stored values will be persisted to `GridCacheStore` via `GridCacheStore#putAll(String, GridCacheTx, Map)` method.

    ##### Transactions

    This method is transactional and will enlist the entry into ongoing transaction if there is one.

    kv1

      Key-value pair to store in cache.

    kv2

      Key-value pair to store in cache.

    kvs

      Optional key-value pairs to store in cache.

    See also

      `IgniteCache#putAll(...)`

91. #### def putOpt$(kv: (K, V)): Option[V]

    Stores given key-value pair in cache.

    Stores given key-value pair in cache. If filters are provided, then entries will be stored in cache only if they pass the filter. Note that filter check is atomic, so value stored in cache is guaranteed to be consistent with the filters.

    If write-through is enabled, the stored value will be persisted to `GridCacheStore` via `GridCacheStore#put(String, GridCacheTx, Object, Object)` method.

    ##### Transactions

    This method is transactional and will enlist the entry into ongoing transaction if there is one.

    kv

      Key-Value pair to store in cache.

    returns

      Previous value associated with specified key as an option.

    See also

      `IgniteCache#put(...)`

92. #### def putx$(kv: (K, V)): Boolean

    Stores given key-value pair in cache.

    Stores given key-value pair in cache. If filters are provided, then entries will be stored in cache only if they pass the filter. Note that filter check is atomic, so value stored in cache is guaranteed to be consistent with the filters.

    If write-through is enabled, the stored value will be persisted to `GridCacheStore` via `GridCacheStore#put(String, GridCacheTx, Object, Object)` method.

    ##### Transactions

    This method is transactional and will enlist the entry into ongoing transaction if there is one.

    kv

      Key-Value pair to store in cache.

    returns

      `True` if value was stored in cache, `false` otherwise.

    See also

      `IgniteCache#putx(...)`

93. #### def reduce[A1 >: Entry[K, V]](op: (A1, A1) ⇒ A1): A1

    Definition Classes
      TraversableOnce → GenTraversableOnce

94. #### def reduceLeft[B >: Entry[K, V]](op: (B, Entry[K, V]) ⇒ B): B

    Definition Classes
      TraversableOnce

95. #### def reduceLeftOption[B >: Entry[K, V]](op: (B, Entry[K, V]) ⇒ B): Option[B]

    Definition Classes
      TraversableOnce → GenTraversableOnce

96. #### def reduceOption[A1 >: Entry[K, V]](op: (A1, A1) ⇒ A1): Option[A1]

    Definition Classes
      TraversableOnce → GenTraversableOnce

97. #### def reduceRight[B >: Entry[K, V]](op: (Entry[K, V], B) ⇒ B): B

    Definition Classes
      IterableLike → TraversableOnce → GenTraversableOnce

98. #### def reduceRightOption[B >: Entry[K, V]](op: (Entry[K, V], B) ⇒ B): Option[B]

    Definition Classes
      TraversableOnce → GenTraversableOnce

99. #### def remove$(k: K): V

    Removes given key mapping from cache.

    Removes given key mapping from cache. If cache previously contained value for the given key, then this value is returned. Otherwise, in case of `CacheMode#REPLICATED` caches, the value will be loaded from swap and, if it's not there, and read-through is allowed, from the underlying `GridCacheStore` storage. In case of `CacheMode#PARTITIONED` caches, the value will be loaded from the primary node, which in its turn may load the value from the swap storage, and consecutively, if it's not in swap and read-through is allowed, from the underlying persistent storage. If value has to be loaded from persistent storage, `GridCacheStore#load(String, GridCacheTx, Object)` method will be used.

    If the returned value is not needed, method `removex$(...)` should always be used instead of this one to avoid the overhead associated with returning of the previous value.

    If write-through is enabled, the value will be removed from 'GridCacheStore' via `GridCacheStore#remove(String, GridCacheTx, Object)` method.

    ##### Transactions

    This method is transactional and will enlist the entry into ongoing transaction if there is one.

    k

      Key whose mapping is to be removed from cache.

    returns

      Previous value associated with specified key, or `null` if there was no value for this key.

    See also

      `IgniteCache#remove(...)`

100. #### def removeAll$(k1: K, k2: K, ks: K*): Unit

     Removes given key mappings from cache.

     Removes given key mappings from cache.

     If write-through is enabled, the values will be removed from `GridCacheStore` via `GridCacheStore#removeAll(String, GridCacheTx, Collection)` method.

     ##### Transactions

     This method is transactional and will enlist the entry into ongoing transaction if there is one.

     k1

       1st key to remove.

     k2

       2nd key to remove.

     ks

       Optional sequence of additional keys to remove.

     See also

       `IgniteCache#removeAll(...)`

101. #### def removeAll$(ks: Seq[K]): Unit

     Removes given key mappings from cache.

     Removes given key mappings from cache.

     If write-through is enabled, the values will be removed from `GridCacheStore` via `GridCacheStore#removeAll(String, GridCacheTx, Collection)` method.

     ##### Transactions

     This method is transactional and will enlist the entry into ongoing transaction if there is one.

     ks

       Sequence of additional keys to remove. If `null` - this function is no-op.

     See also

       `IgniteCache#removeAll(...)`

102. #### def removeOpt$(k: K): Option[V]

     Removes given key mapping from cache.

     Removes given key mapping from cache. If cache previously contained value for the given key, then this value is returned. Otherwise, in case of `CacheMode#REPLICATED` caches, the value will be loaded from swap and, if it's not there, and read-through is allowed, from the underlying `GridCacheStore` storage. In case of `CacheMode#PARTITIONED` caches, the value will be loaded from the primary node, which in its turn may load the value from the swap storage, and consecutively, if it's not in swap and read-through is allowed, from the underlying persistent storage. If value has to be loaded from persistent storage, `GridCacheStore#load(String, GridCacheTx, Object)` method will be used.

     If the returned value is not needed, method `removex$(...)` should always be used instead of this one to avoid the overhead associated with returning of the previous value.

     If write-through is enabled, the value will be removed from 'GridCacheStore' via `GridCacheStore#remove(String, GridCacheTx, Object)` method.

     ##### Transactions

     This method is transactional and will enlist the entry into ongoing transaction if there is one.

     k

       Key whose mapping is to be removed from cache.

     returns

       Previous value associated with specified key as an option.

     See also

       `IgniteCache#remove(...)`

103. #### def repr: Iterable[Entry[K, V]]

     Definition Classes
       TraversableLike → GenTraversableLike

104. #### def reversed: List[Entry[K, V]]

     Attributes
       protected[this]
     Definition Classes
       TraversableOnce

105. #### def sameElements[B >: Entry[K, V]](that: GenIterable[B]): Boolean

     Definition Classes
       IterableLike → GenIterableLike

106. #### def scan(kvp: KvPred)(implicit m: Manifest[V]): QueryCursor[Entry[K, V]]

     Creates and executes ad-hoc `SCAN` query returning its result.

     Creates and executes ad-hoc `SCAN` query returning its result.

     Note that if query is executed more than once (potentially with different arguments) it is more performant to create query via standard mechanism and execute it multiple times with different arguments. The analogy is similar to JDBC `PreparedStatement`. Note also that this function will return all results at once without pagination and therefore memory limits should be taken into account.

     Note that query value class will be taken implicitly as exact type `V` of this cache projection.

     kvp

       Filter to be used prior to returning key-value pairs to user. See `CacheQuery` for more details.

     returns

       Collection of cache key-value pairs.

107. #### def scan(cls: Class[_ <: V], kvp: KvPred): QueryCursor[Entry[K, V]]

     Creates and executes ad-hoc `SCAN` query returning its result.

     Creates and executes ad-hoc `SCAN` query returning its result.

     Note that if query is executed more than once (potentially with different arguments) it is more performant to create query via standard mechanism and execute it multiple times with different arguments. The analogy is similar to JDBC `PreparedStatement`. Note also that this function will return all results at once without pagination and therefore memory limits should be taken into account.

     cls

       Query values class. Since cache can, in general, contain values of any subtype of `V` query needs to know the exact type it should operate on.

     kvp

       Filter to be used prior to returning key-value pairs to user. See `CacheQuery` for more details.

     returns

       Collection of cache key-value pairs.

108. #### def scan[B >: Entry[K, V], That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Iterable[Entry[K, V]], B, That]): That

     Definition Classes
       TraversableLike → GenTraversableLike

109. #### def scanLeft[B, That](z: B)(op: (B, Entry[K, V]) ⇒ B)(implicit bf: CanBuildFrom[Iterable[Entry[K, V]], B, That]): That

     Definition Classes
       TraversableLike → GenTraversableLike

110. #### def scanRight[B, That](z: B)(op: (Entry[K, V], B) ⇒ B)(implicit bf: CanBuildFrom[Iterable[Entry[K, V]], B, That]): That

     Definition Classes
       TraversableLike → GenTraversableLike
     Annotations
       @migration
     Migration

       (Changed in version 2.9.0) The behavior of `scanRight` has changed. The previous behavior can be reproduced with scanRight.reverse.

111. #### def seq: Iterable[Entry[K, V]]

     Definition Classes
       Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce

112. #### def size: Int

     Definition Classes
       TraversableOnce → GenTraversableOnce

113. #### def slice(from: Int, until: Int): Iterable[Entry[K, V]]

     Definition Classes
       IterableLike → TraversableLike → GenTraversableLike

114. #### def sliding(size: Int, step: Int): Iterator[Iterable[Entry[K, V]]]

     Definition Classes
       IterableLike

115. #### def sliding(size: Int): Iterator[Iterable[Entry[K, V]]]

     Definition Classes
       IterableLike

116. #### def span(p: (Entry[K, V]) ⇒ Boolean): (Iterable[Entry[K, V]], Iterable[Entry[K, V]])

     Definition Classes
       TraversableLike → GenTraversableLike

117. #### def splitAt(n: Int): (Iterable[Entry[K, V]], Iterable[Entry[K, V]])

     Definition Classes
       TraversableLike → GenTraversableLike

118. #### def sql(clause: String, args: Any*)(implicit m: Manifest[V]): QueryCursor[Entry[K, V]]

     Creates and executes ad-hoc `SQL` query returning its result.

     Creates and executes ad-hoc `SQL` query returning its result.

     Note that if query is executed more than once (potentially with different arguments) it is more performant to create query via standard mechanism and execute it multiple times with different arguments. The analogy is similar to JDBC `PreparedStatement`. Note also that this function will return all results at once without pagination and therefore memory limits should be taken into account.

     Note that query value class will be taken implicitly as exact type `V` of this cache projection.

     clause

       Query SQL clause. See `CacheQuery` for more details.

     args

       Optional list of query arguments.

     returns

       Collection of cache key-value pairs.

119. #### def sql(cls: Class[_ <: V], clause: String): QueryCursor[Entry[K, V]]

     Creates and executes ad-hoc `SQL` query returning its result.

     Creates and executes ad-hoc `SQL` query returning its result.

     Note that if query is executed more than once (potentially with different arguments) it is more performant to create query via standard mechanism and execute it multiple times with different arguments. The analogy is similar to JDBC `PreparedStatement`. Note also that this function will return all results at once without pagination and therefore memory limits should be taken into account.

     cls

       Query values class. Since cache can, in general, contain values of any subtype of `V` query needs to know the exact type it should operate on.

     clause

       Query SQL clause. See `CacheQuery` for more details.

     returns

       Collection of cache key-value pairs.

120. #### def sql(cls: Class[_ <: V], clause: String, args: Any*): QueryCursor[Entry[K, V]]

     Creates and executes ad-hoc `SQL` query returning its result.

     Creates and executes ad-hoc `SQL` query returning its result.

     Note that if query is executed more than once (potentially with different arguments) it is more performant to create query via standard mechanism and execute it multiple times with different arguments. The analogy is similar to JDBC `PreparedStatement`. Note also that this function will return all results at once without pagination and therefore memory limits should be taken into account.

     cls

       Query values class. Since cache can, in general, contain values of any subtype of `V` query needs to know the exact type it should operate on.

     clause

       Query SQL clause. See `CacheQuery` for more details.

     args

       Optional list of query arguments.

     returns

       Collection of cache key-value pairs.

121. #### def sqlFields(clause: String): QueryCursor[List[_]]

     Creates and executes ad-hoc `SQL` no-arg fields query returning its result.

     Creates and executes ad-hoc `SQL` no-arg fields query returning its result.

     Note that if query is executed more than once (potentially with different arguments) it is more performant to create query via standard mechanism and execute it multiple times with different arguments. The analogy is similar to JDBC `PreparedStatement`. Note also that this function will return all results at once without pagination and therefore memory limits should be taken into account.

     clause

       Query SQL clause. See `CacheQuery` for more details.

     returns

       Sequence of sequences of field values.

122. #### def sqlFields(clause: String, args: Any*): QueryCursor[List[_]]

     Creates and executes ad-hoc `SQL` fields query returning its result.

     Creates and executes ad-hoc `SQL` fields query returning its result.

     Note that if query is executed more than once (potentially with different arguments) it is more performant to create query via standard mechanism and execute it multiple times with different arguments. The analogy is similar to JDBC `PreparedStatement`. Note also that this function will return all results at once without pagination and therefore memory limits should be taken into account.

     clause

       Query SQL clause. See `CacheQuery` for more details.

     args

       Optional list of query arguments.

     returns

       Sequence of sequences of field values.

123. #### def stringPrefix: String

     Definition Classes
       TraversableLike → GenTraversableLike

124. #### def sum[B >: Entry[K, V]](implicit num: Numeric[B]): B

     Definition Classes
       TraversableOnce → GenTraversableOnce

125. #### final def synchronized[T0](arg0: ⇒ T0): T0

     Definition Classes
       AnyRef

126. #### def tail: Iterable[Entry[K, V]]

     Definition Classes
       TraversableLike → GenTraversableLike

127. #### def tails: Iterator[Iterable[Entry[K, V]]]

     Definition Classes
       TraversableLike

128. #### def take(n: Int): Iterable[Entry[K, V]]

     Definition Classes
       IterableLike → TraversableLike → GenTraversableLike

129. #### def takeRight(n: Int): Iterable[Entry[K, V]]

     Definition Classes
       IterableLike

130. #### def takeWhile(p: (Entry[K, V]) ⇒ Boolean): Iterable[Entry[K, V]]

     Definition Classes
       IterableLike → TraversableLike → GenTraversableLike

131. #### def text(clause: String)(implicit m: Manifest[V]): QueryCursor[Entry[K, V]]

     Creates and executes ad-hoc `TEXT` query returning its result.

     Creates and executes ad-hoc `TEXT` query returning its result.

     Note that if query is executed more than once (potentially with different arguments) it is more performant to create query via standard mechanism and execute it multiple times with different arguments. The analogy is similar to JDBC `PreparedStatement`. Note also that this function will return all results at once without pagination and therefore memory limits should be taken into account.

     Note that query value class will be taken implicitly as exact type `V` of this cache projection.

     clause

       Query text clause. See `CacheQuery` for more details.

     returns

       Collection of cache key-value pairs.

132. #### def text(cls: Class[_ <: V], clause: String): QueryCursor[Entry[K, V]]

     Creates and executes ad-hoc `TEXT` query returning its result.

     Creates and executes ad-hoc `TEXT` query returning its result.

     Note that if query is executed more than once (potentially with different arguments) it is more performant to create query via standard mechanism and execute it multiple times with different arguments. The analogy is similar to JDBC `PreparedStatement`. Note also that this function will return all results at once without pagination and therefore memory limits should be taken into account.

     cls

       Query values class. Since cache can, in general, contain values of any subtype of `V` query needs to know the exact type it should operate on.

     clause

       Query text clause. See `CacheQuery` for more details.

     returns

       Collection of cache key-value pairs.

133. #### def thisCollection: Iterable[Entry[K, V]]

     Attributes
       protected[this]
     Definition Classes
       IterableLike → TraversableLike

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

     Definition Classes
       TraversableLike → TraversableOnce → GenTraversableOnce

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

     Definition Classes
       TraversableOnce → GenTraversableOnce

136. #### def toBuffer[B >: Entry[K, V]]: Buffer[B]

     Definition Classes
       TraversableOnce → GenTraversableOnce

137. #### def toCollection(repr: Iterable[Entry[K, V]]): Iterable[Entry[K, V]]

     Attributes
       protected[this]
     Definition Classes
       IterableLike → TraversableLike

138. #### def toIndexedSeq: IndexedSeq[Entry[K, V]]

     Definition Classes
       TraversableOnce → GenTraversableOnce

139. #### def toIterable: Iterable[Entry[K, V]]

     Definition Classes
       IterableLike → TraversableOnce → GenTraversableOnce

140. #### def toIterator: Iterator[Entry[K, V]]

     Definition Classes
       IterableLike → TraversableLike → GenTraversableOnce
     Annotations
       @deprecatedOverriding( ... , "2.11.0" )

141. #### def toJavaSet[T](it: Iterable[T]): Set[T]

     Attributes
       protected

142. #### def toList: List[Entry[K, V]]

     Definition Classes
       TraversableOnce → GenTraversableOnce

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

     Definition Classes
       TraversableOnce → GenTraversableOnce

144. #### def toSeq: Seq[Entry[K, V]]

     Definition Classes
       TraversableOnce → GenTraversableOnce

145. #### def toSet[B >: Entry[K, V]]: Set[B]

     Definition Classes
       TraversableOnce → GenTraversableOnce

146. #### def toStream: Stream[Entry[K, V]]

     Definition Classes
       IterableLike → TraversableLike → GenTraversableOnce

147. #### def toString(): String

     Definition Classes
       TraversableLike → Any

148. #### def toTraversable: Traversable[Entry[K, V]]

     Definition Classes
       TraversableLike → TraversableOnce → GenTraversableOnce
     Annotations
       @deprecatedOverriding( ... , "2.11.0" )

149. #### def toVector: Vector[Entry[K, V]]

     Definition Classes
       TraversableOnce → GenTraversableOnce

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

     Definition Classes
       GenericTraversableTemplate
     Annotations
       @migration
     Migration

       (Changed in version 2.9.0) `transpose` throws an `IllegalArgumentException` if collections are not uniformly sized.

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

     Definition Classes
       GenericTraversableTemplate

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

     Definition Classes
       GenericTraversableTemplate

153. #### lazy val value: IgniteCache[K, V]

     Definition Classes
       ScalarCachePimp → PimpedType

154. #### def view(from: Int, until: Int): IterableView[Entry[K, V], Iterable[Entry[K, V]]]

     Definition Classes
       IterableLike → TraversableLike

155. #### def view: IterableView[Entry[K, V], Iterable[Entry[K, V]]]

     Definition Classes
       IterableLike → TraversableLike

156. #### final def wait(): Unit

     Definition Classes
       AnyRef
     Annotations
       @throws( ... )

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

     Definition Classes
       AnyRef
     Annotations
       @throws( ... )

158. #### final def wait(arg0: Long): Unit

     Definition Classes
       AnyRef
     Annotations
       @throws( ... )

159. #### def withFilter(p: (Entry[K, V]) ⇒ Boolean): FilterMonadic[Entry[K, V], Iterable[Entry[K, V]]]

     Definition Classes
       TraversableLike → FilterMonadic

160. #### def zip[A1 >: Entry[K, V], B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Iterable[Entry[K, V]], (A1, B), That]): That

     Definition Classes
       IterableLike → GenIterableLike

161. #### def zipAll[B, A1 >: Entry[K, V], That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Iterable[Entry[K, V]], (A1, B), That]): That

     Definition Classes
       IterableLike → GenIterableLike

162. #### def zipWithIndex[A1 >: Entry[K, V], That](implicit bf: CanBuildFrom[Iterable[Entry[K, V]], (A1, Int), That]): That

     Definition Classes
       IterableLike → GenIterableLike

### Inherited from Ordered[IgniteCache[K, V]]

### Inherited from Comparable[IgniteCache[K, V]]

### Inherited from Iterable[Entry[K, V]]

### Inherited from IterableLike[Entry[K, V], Iterable[Entry[K, V]]]

### Inherited from Equals

### Inherited from GenIterable[Entry[K, V]]

### Inherited from GenIterableLike[Entry[K, V], Iterable[Entry[K, V]]]

### Inherited from Traversable[Entry[K, V]]

### Inherited from GenTraversable[Entry[K, V]]

### Inherited from GenericTraversableTemplate[Entry[K, V], Iterable]

### Inherited from TraversableLike[Entry[K, V], Iterable[Entry[K, V]]]

### Inherited from GenTraversableLike[Entry[K, V], Iterable[Entry[K, V]]]

### Inherited from Parallelizable[Entry[K, V], ParIterable[Entry[K, V]]]

### Inherited from TraversableOnce[Entry[K, V]]

### Inherited from GenTraversableOnce[Entry[K, V]]

### Inherited from FilterMonadic[Entry[K, V], Iterable[Entry[K, V]]]

### Inherited from HasNewBuilder[Entry[K, V], Iterable[javax.cache.Cache.Entry[K,V]] @scala.annotation.unchecked.uncheckedVariance]

### Inherited from PimpedType[IgniteCache[K, V]]

### Inherited from AnyRef

### Inherited from Any

### Ungrouped