org.gridgain.scalar.pimps

ScalarCacheProjectionPimp

class ScalarCacheProjectionPimp[K, V] extends PimpedType[GridCacheProjection[K, V]] with Iterable[GridCacheEntry[K, V]]

Overview

Defines Scalar "pimp" for GridCacheProjection on Java side.

Essentially this class extends Java GridCacheProjection 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 GridCacheProjection 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 GridGain 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
Iterable[GridCacheEntry[K, V]], IterableLike[GridCacheEntry[K, V], Iterable[GridCacheEntry[K, V]]], Equals, GenIterable[GridCacheEntry[K, V]], GenIterableLike[GridCacheEntry[K, V], Iterable[GridCacheEntry[K, V]]], Traversable[GridCacheEntry[K, V]], GenTraversable[GridCacheEntry[K, V]], GenericTraversableTemplate[GridCacheEntry[K, V], Iterable], TraversableLike[GridCacheEntry[K, V], Iterable[GridCacheEntry[K, V]]], GenTraversableLike[GridCacheEntry[K, V], Iterable[GridCacheEntry[K, V]]], Parallelizable[GridCacheEntry[K, V], ParIterable[GridCacheEntry[K, V]]], TraversableOnce[GridCacheEntry[K, V]], GenTraversableOnce[GridCacheEntry[K, V]], FilterMonadic[GridCacheEntry[K, V], Iterable[GridCacheEntry[K, V]]], HasNewBuilder[GridCacheEntry[K, V], Iterable[org.gridgain.grid.cache.GridCacheEntry[K,V]] @scala.annotation.unchecked.uncheckedVariance], PimpedType[GridCacheProjection[K, V]], AnyRef, Any
Known Subclasses
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. ScalarCacheProjectionPimp
  2. Iterable
  3. IterableLike
  4. Equals
  5. GenIterable
  6. GenIterableLike
  7. Traversable
  8. GenTraversable
  9. GenericTraversableTemplate
  10. TraversableLike
  11. GenTraversableLike
  12. Parallelizable
  13. TraversableOnce
  14. GenTraversableOnce
  15. FilterMonadic
  16. HasNewBuilder
  17. PimpedType
  18. AnyRef
  19. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new ScalarCacheProjectionPimp()

Type Members

  1. type EntryPred = (GridCacheEntry[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[GridCacheEntry[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 >: GridCacheEntry[K, V], That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[GridCacheEntry[K, V]], B, That]): That

    Definition Classes
    TraversableLike ? GenTraversableLike
  4. def ++:[B >: GridCacheEntry[K, V], That](that: Traversable[B])(implicit bf: CanBuildFrom[Iterable[GridCacheEntry[K, V]], B, That]): That

    Definition Classes
    TraversableLike
  5. def ++:[B >: GridCacheEntry[K, V], That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[GridCacheEntry[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

    org.gridgain.grid.cache.GridCacheProjection#putAll(...)

  7. def +=(kv: (K, V), p: EntryPred*): Boolean

    Operator alias for the same function putx$.

    Operator alias for the same function putx$.

    kv

    Key-Value pair to store in cache.

    p

    Optional filter to check prior to putting value in cache. Note that filter check is atomic with put operation.

    returns

    True if value was stored in cache, false otherwise.

    See also

    org.gridgain.grid.cache.GridCacheProjection#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

    org.gridgain.grid.cache.GridCacheProjection#removeAll(...)

  9. def -=(k: K, p: EntryPred*): 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.

    p

    Optional filters to check prior to removing value form cache. Note that filter is checked atomically together with remove operation.

    returns

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

    See also

    org.gridgain.grid.cache.GridCacheProjection#remove(...)

  10. def /:[B](z: B)(op: (B, GridCacheEntry[K, V]) ? B): B

    Definition Classes
    TraversableOnce ? GenTraversableOnce
  11. def :\[B](z: B)(op: (GridCacheEntry[K, V], B) ? B): B

    Definition Classes
    TraversableOnce ? GenTraversableOnce
  12. final def ==(arg0: Any): Boolean

    Definition Classes
    AnyRef ? Any
  13. def addString(b: StringBuilder): StringBuilder

    Definition Classes
    TraversableOnce
  14. def addString(b: StringBuilder, sep: String): StringBuilder

    Definition Classes
    TraversableOnce
  15. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    Definition Classes
    TraversableOnce
  16. def aggregate[B](z: ? B)(seqop: (B, GridCacheEntry[K, V]) ? B, combop: (B, B) ? B): B

    Definition Classes
    TraversableOnce ? GenTraversableOnce
  17. 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.

  18. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  19. def canEqual(that: Any): Boolean

    Definition Classes
    IterableLike ? Equals
  20. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  21. def collect[B, That](pf: PartialFunction[GridCacheEntry[K, V], B])(implicit bf: CanBuildFrom[Iterable[GridCacheEntry[K, V]], B, That]): That

    Definition Classes
    TraversableLike ? GenTraversableLike
  22. def collectFirst[B](pf: PartialFunction[GridCacheEntry[K, V], B]): Option[B]

    Definition Classes
    TraversableOnce
  23. def companion: GenericCompanion[Iterable]

    Definition Classes
    Iterable ? GenIterable ? Traversable ? GenTraversable ? GenericTraversableTemplate
  24. def copyToArray[B >: GridCacheEntry[K, V]](xs: Array[B], start: Int, len: Int): Unit

    Definition Classes
    IterableLike ? TraversableLike ? TraversableOnce ? GenTraversableOnce
  25. def copyToArray[B >: GridCacheEntry[K, V]](xs: Array[B]): Unit

    Definition Classes
    TraversableOnce ? GenTraversableOnce
  26. def copyToArray[B >: GridCacheEntry[K, V]](xs: Array[B], start: Int): Unit

    Definition Classes
    TraversableOnce ? GenTraversableOnce
  27. def copyToBuffer[B >: GridCacheEntry[K, V]](dest: Buffer[B]): Unit

    Definition Classes
    TraversableOnce
  28. def count(p: (GridCacheEntry[K, V]) ? Boolean): Int

    Definition Classes
    TraversableOnce ? GenTraversableOnce
  29. def drop(n: Int): Iterable[GridCacheEntry[K, V]]

    Definition Classes
    IterableLike ? TraversableLike ? GenTraversableLike
  30. def dropRight(n: Int): Iterable[GridCacheEntry[K, V]]

    Definition Classes
    IterableLike
  31. def dropWhile(p: (GridCacheEntry[K, V]) ? Boolean): Iterable[GridCacheEntry[K, V]]

    Definition Classes
    TraversableLike ? GenTraversableLike
  32. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  33. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef ? Any
  34. def exists(p: (GridCacheEntry[K, V]) ? Boolean): Boolean

    Definition Classes
    IterableLike ? TraversableLike ? TraversableOnce ? GenTraversableOnce
  35. def filter(p: (GridCacheEntry[K, V]) ? Boolean): Iterable[GridCacheEntry[K, V]]

    Definition Classes
    TraversableLike ? GenTraversableLike
  36. def filterNot(p: (GridCacheEntry[K, V]) ? Boolean): Iterable[GridCacheEntry[K, V]]

    Definition Classes
    TraversableLike ? GenTraversableLike
  37. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  38. def find(p: (GridCacheEntry[K, V]) ? Boolean): Option[GridCacheEntry[K, V]]

    Definition Classes
    IterableLike ? TraversableLike ? TraversableOnce ? GenTraversableOnce
  39. def flatMap[B, That](f: (GridCacheEntry[K, V]) ? GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[GridCacheEntry[K, V]], B, That]): That

    Definition Classes
    TraversableLike ? GenTraversableLike ? FilterMonadic
  40. def flatten[B](implicit asTraversable: (GridCacheEntry[K, V]) ? GenTraversableOnce[B]): Iterable[B]

    Definition Classes
    GenericTraversableTemplate
  41. def fold[A1 >: GridCacheEntry[K, V]](z: A1)(op: (A1, A1) ? A1): A1

    Definition Classes
    TraversableOnce ? GenTraversableOnce
  42. def foldLeft[B](z: B)(op: (B, GridCacheEntry[K, V]) ? B): B

    Definition Classes
    TraversableOnce ? GenTraversableOnce
  43. def foldRight[B](z: B)(op: (GridCacheEntry[K, V], B) ? B): B

    Definition Classes
    IterableLike ? TraversableOnce ? GenTraversableOnce
  44. def forall(p: (GridCacheEntry[K, V]) ? Boolean): Boolean

    Definition Classes
    IterableLike ? TraversableLike ? TraversableOnce ? GenTraversableOnce
  45. def foreach[U](f: (GridCacheEntry[K, V]) ? U): Unit

    Definition Classes
    IterableLike ? TraversableLike ? GenTraversableLike ? TraversableOnce ? GenTraversableOnce ? FilterMonadic
  46. def genericBuilder[B]: Builder[B, Iterable[B]]

    Definition Classes
    GenericTraversableTemplate
  47. final def getClass(): Class[_]

    Definition Classes
    AnyRef ? Any
  48. 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.

  49. def groupBy[K](f: (GridCacheEntry[K, V]) ? K): Map[K, Iterable[GridCacheEntry[K, V]]]

    Definition Classes
    TraversableLike ? GenTraversableLike
  50. def grouped(size: Int): Iterator[Iterable[GridCacheEntry[K, V]]]

    Definition Classes
    IterableLike
  51. def hasDefiniteSize: Boolean

    Definition Classes
    TraversableLike ? TraversableOnce ? GenTraversableOnce
  52. def hashCode(): Int

    Definition Classes
    AnyRef ? Any
  53. def head: GridCacheEntry[K, V]

    Definition Classes
    IterableLike ? TraversableLike ? GenTraversableLike
  54. def headOption: Option[GridCacheEntry[K, V]]

    Definition Classes
    TraversableLike ? GenTraversableLike
  55. var impl: GridCacheProjection[K, V]

    Attributes
    protected
  56. def init: Iterable[GridCacheEntry[K, V]]

    Definition Classes
    TraversableLike ? GenTraversableLike
  57. def inits: Iterator[Iterable[GridCacheEntry[K, V]]]

    Definition Classes
    TraversableLike
  58. def isEmpty: Boolean

    Definition Classes
    IterableLike ? TraversableLike ? TraversableOnce ? GenTraversableOnce
  59. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  60. final def isTraversableAgain: Boolean

    Definition Classes
    TraversableLike ? GenTraversableLike ? GenTraversableOnce
  61. def iterator: Iterator[GridCacheEntry[K, V]]

    Gets iterator for cache entries.

    Gets iterator for cache entries.

    Definition Classes
    ScalarCacheProjectionPimp ? IterableLike ? GenIterableLike
  62. def last: GridCacheEntry[K, V]

    Definition Classes
    TraversableLike ? GenTraversableLike
  63. def lastOption: Option[GridCacheEntry[K, V]]

    Definition Classes
    TraversableLike ? GenTraversableLike
  64. def map[B, That](f: (GridCacheEntry[K, V]) ? B)(implicit bf: CanBuildFrom[Iterable[GridCacheEntry[K, V]], B, That]): That

    Definition Classes
    TraversableLike ? GenTraversableLike ? FilterMonadic
  65. def max[B >: GridCacheEntry[K, V]](implicit cmp: Ordering[B]): GridCacheEntry[K, V]

    Definition Classes
    TraversableOnce ? GenTraversableOnce
  66. def maxBy[B](f: (GridCacheEntry[K, V]) ? B)(implicit cmp: Ordering[B]): GridCacheEntry[K, V]

    Definition Classes
    TraversableOnce ? GenTraversableOnce
  67. def min[B >: GridCacheEntry[K, V]](implicit cmp: Ordering[B]): GridCacheEntry[K, V]

    Definition Classes
    TraversableOnce ? GenTraversableOnce
  68. def minBy[B](f: (GridCacheEntry[K, V]) ? B)(implicit cmp: Ordering[B]): GridCacheEntry[K, V]

    Definition Classes
    TraversableOnce ? GenTraversableOnce
  69. def mkString: String

    Definition Classes
    TraversableOnce ? GenTraversableOnce
  70. def mkString(sep: String): String

    Definition Classes
    TraversableOnce ? GenTraversableOnce
  71. def mkString(start: String, sep: String, end: String): String

    Definition Classes
    TraversableOnce ? GenTraversableOnce
  72. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  73. def newBuilder: Builder[GridCacheEntry[K, V], Iterable[GridCacheEntry[K, V]]]

    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate ? HasNewBuilder
  74. def nonEmpty: Boolean

    Definition Classes
    TraversableOnce ? GenTraversableOnce
  75. final def notify(): Unit

    Definition Classes
    AnyRef
  76. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  77. def opt(k: K, p: EntryPred = null): 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.

    p

    Filter to check prior to getting the value. Note that filter check together with getting the value is an atomic operation.

    returns

    Value for the given key.

    See also

    org.gridgain.grid.cache.GridCacheProjection.get(...)

  78. def par: ParIterable[GridCacheEntry[K, V]]

    Definition Classes
    Parallelizable
  79. def parCombiner: Combiner[GridCacheEntry[K, V], ParIterable[GridCacheEntry[K, V]]]

    Attributes
    protected[this]
    Definition Classes
    TraversableLike ? Parallelizable
  80. def partition(p: (GridCacheEntry[K, V]) ? Boolean): (Iterable[GridCacheEntry[K, V]], Iterable[GridCacheEntry[K, V]])

    Definition Classes
    TraversableLike ? GenTraversableLike
  81. def product[B >: GridCacheEntry[K, V]](implicit num: Numeric[B]): B

    Definition Classes
    TraversableOnce ? GenTraversableOnce
  82. def put$(kv: (K, V), p: EntryPred*): 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.

    Cache Flags

    This method is not available if any of the following flags are set on projection: GridCacheFlag#LOCAL, GridCacheFlag#READ.

    kv

    Key-Value pair to store in cache.

    p

    Optional filter to check prior to putting value in cache. Note that filter check is atomic with put operation.

    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

    org.gridgain.grid.cache.GridCacheProjection#put(...)

  83. 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.

    Cache Flags

    This method is not available if any of the following flags are set on projection: GridCacheFlag#LOCAL, GridCacheFlag#READ.

    kvs

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

    See also

    org.gridgain.grid.cache.GridCacheProjection#putAll(...)

  84. 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.

    Cache Flags

    This method is not available if any of the following flags are set on projection: GridCacheFlag#LOCAL, GridCacheFlag#READ.

    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

    org.gridgain.grid.cache.GridCacheProjection#putAll(...)

  85. def putOpt$(kv: (K, V), p: EntryPred*): 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.

    Cache Flags

    This method is not available if any of the following flags are set on projection: GridCacheFlag#LOCAL, GridCacheFlag#READ.

    kv

    Key-Value pair to store in cache.

    p

    Optional filter to check prior to putting value in cache. Note that filter check is atomic with put operation.

    returns

    Previous value associated with specified key as an option.

    See also

    org.gridgain.grid.cache.GridCacheProjection#put(...)

  86. def putx$(kv: (K, V), p: EntryPred*): 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.

    Cache Flags

    This method is not available if any of the following flags are set on projection: GridCacheFlag#LOCAL, GridCacheFlag#READ.

    kv

    Key-Value pair to store in cache.

    p

    Optional filter to check prior to putting value in cache. Note that filter check is atomic with put operation.

    returns

    True if value was stored in cache, false otherwise.

    See also

    org.gridgain.grid.cache.GridCacheProjection#putx(...)

  87. def reduce[A1 >: GridCacheEntry[K, V]](op: (A1, A1) ? A1): A1

    Definition Classes
    TraversableOnce ? GenTraversableOnce
  88. def reduceLeft[B >: GridCacheEntry[K, V]](op: (B, GridCacheEntry[K, V]) ? B): B

    Definition Classes
    TraversableOnce
  89. def reduceLeftOption[B >: GridCacheEntry[K, V]](op: (B, GridCacheEntry[K, V]) ? B): Option[B]

    Definition Classes
    TraversableOnce ? GenTraversableOnce
  90. def reduceOption[A1 >: GridCacheEntry[K, V]](op: (A1, A1) ? A1): Option[A1]

    Definition Classes
    TraversableOnce ? GenTraversableOnce
  91. def reduceRight[B >: GridCacheEntry[K, V]](op: (GridCacheEntry[K, V], B) ? B): B

    Definition Classes
    IterableLike ? TraversableOnce ? GenTraversableOnce
  92. def reduceRightOption[B >: GridCacheEntry[K, V]](op: (GridCacheEntry[K, V], B) ? B): Option[B]

    Definition Classes
    TraversableOnce ? GenTraversableOnce
  93. def remove$(k: K, p: EntryPred*): 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 GridCacheMode#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 GridCacheMode#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.

    Cache Flags

    This method is not available if any of the following flags are set on projection: GridCacheFlag#LOCAL, GridCacheFlag#READ.

    k

    Key whose mapping is to be removed from cache.

    p

    Optional filters to check prior to removing value form cache. Note that filter is checked atomically together with remove operation.

    returns

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

    See also

    org.gridgain.grid.cache.GridCacheProjection#remove(...)

  94. 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.

    Cache Flags

    This method is not available if any of the following flags are set on projection: GridCacheFlag#LOCAL, GridCacheFlag#READ.

    k1

    1st key to remove.

    k2

    2nd key to remove.

    ks

    Optional sequence of additional keys to remove.

    See also

    org.gridgain.grid.cache.GridCacheProjection#removeAll(...)

  95. 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.

    Cache Flags

    This method is not available if any of the following flags are set on projection: GridCacheFlag#LOCAL, GridCacheFlag#READ.

    ks

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

    See also

    org.gridgain.grid.cache.GridCacheProjection#removeAll(...)

  96. def removeOpt$(k: K, p: EntryPred*): 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 GridCacheMode#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 GridCacheMode#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.

    Cache Flags

    This method is not available if any of the following flags are set on projection: GridCacheFlag#LOCAL, GridCacheFlag#READ.

    k

    Key whose mapping is to be removed from cache.

    p

    Optional filters to check prior to removing value form cache. Note that filter is checked atomically together with remove operation.

    returns

    Previous value associated with specified key as an option.

    See also

    org.gridgain.grid.cache.GridCacheProjection#remove(...)

  97. def repr: Iterable[GridCacheEntry[K, V]]

    Definition Classes
    TraversableLike ? GenTraversableLike
  98. def reversed: List[GridCacheEntry[K, V]]

    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  99. def sameElements[B >: GridCacheEntry[K, V]](that: GenIterable[B]): Boolean

    Definition Classes
    IterableLike ? GenIterableLike
  100. def scan(kvp: KvPred)(implicit m: Manifest[V]): Iterable[(K, V)]

    Creates and executes ad-hoc SCAN query on global projection returning its result.

    Creates and executes ad-hoc SCAN query on global projection 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 GridCacheQuery for more details.

    returns

    Collection of cache key-value pairs.

  101. def scan(cls: Class[_ <: V], kvp: KvPred): Iterable[(K, V)]

    Creates and executes ad-hoc SCAN query on global projection returning its result.

    Creates and executes ad-hoc SCAN query on global projection 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 GridCacheQuery for more details.

    returns

    Collection of cache key-value pairs.

  102. def scan(grid: GridProjection, kvp: KvPred)(implicit m: Manifest[V]): Iterable[(K, V)]

    Creates and executes ad-hoc SCAN query on given projection returning its result.

    Creates and executes ad-hoc SCAN query on given projection 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.

    grid

    Grid projection on which this query will be executed. If null the global projection will be used.

    kvp

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

    returns

    Collection of cache key-value pairs.

  103. def scan(grid: GridProjection = null, cls: Class[_ <: V], kvp: KvPred): Iterable[(K, V)]

    Creates and executes ad-hoc SCAN query on given projection returning its result.

    Creates and executes ad-hoc SCAN query on given projection 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.

    grid

    Grid projection on which this query will be executed. If null the global projection will be used.

    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 GridCacheQuery for more details.

    returns

    Collection of cache key-value pairs.

  104. def scan[B >: GridCacheEntry[K, V], That](z: B)(op: (B, B) ? B)(implicit cbf: CanBuildFrom[Iterable[GridCacheEntry[K, V]], B, That]): That

    Definition Classes
    TraversableLike ? GenTraversableLike
  105. def scanLeft[B, That](z: B)(op: (B, GridCacheEntry[K, V]) ? B)(implicit bf: CanBuildFrom[Iterable[GridCacheEntry[K, V]], B, That]): That

    Definition Classes
    TraversableLike ? GenTraversableLike
  106. def scanReduce[R1, R2](kvp: KvPred, rmtRdc: (Iterable[(K, V)]) ? R1, locRdc: (Iterable[R1]) ? R2)(implicit m: Manifest[V]): R2

    Creates and executes ad-hoc SCAN reduce query on global projection returning its result.

    Creates and executes ad-hoc SCAN reduce query on global projection 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 GridCacheQuery for more details.

    rmtRdc

    Reduce function that will be called on each remote node.

    locRdc

    Reduce function that will be called on local node.

    returns

    Reduced value.

  107. def scanReduce[R1, R2](cls: Class[_ <: V], kvp: KvPred, rmtRdc: (Iterable[(K, V)]) ? R1, locRdc: (Iterable[R1]) ? R2): R2

    Creates and executes ad-hoc SCAN reduce query on global projection returning its result.

    Creates and executes ad-hoc SCAN reduce query on global projection 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 GridCacheQuery for more details.

    rmtRdc

    Reduce function that will be called on each remote node.

    locRdc

    Reduce function that will be called on local node.

    returns

    Reduced value.

  108. def scanReduce[R1, R2](grid: GridProjection, kvp: KvPred, rmtRdc: (Iterable[(K, V)]) ? R1, locRdc: (Iterable[R1]) ? R2)(implicit m: Manifest[V]): R2

    Creates and executes ad-hoc SCAN reduce query on given projection returning its result.

    Creates and executes ad-hoc SCAN reduce query on given projection 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.

    grid

    Grid projection on which this query will be executed. If null the global projection will be used.

    kvp

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

    rmtRdc

    Reduce function that will be called on each remote node.

    locRdc

    Reduce function that will be called on local node.

    returns

    Reduced value.

  109. def scanReduce[R1, R2](grid: GridProjection = null, cls: Class[_ <: V], kvp: KvPred, rmtRdc: (Iterable[(K, V)]) ? R1, locRdc: (Iterable[R1]) ? R2): R2

    Creates and executes ad-hoc SCAN reduce query on given projection returning its result.

    Creates and executes ad-hoc SCAN reduce query on given projection 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.

    grid

    Grid projection on which this query will be executed. If null the global projection will be used.

    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 GridCacheQuery for more details.

    rmtRdc

    Reduce function that will be called on each remote node.

    locRdc

    Reduce function that will be called on local node.

    returns

    Reduced value.

  110. def scanReduceRemote[R](kvp: KvPred, rmtRdc: (Iterable[(K, V)]) ? R)(implicit m: Manifest[V]): Iterable[R]

    Creates and executes ad-hoc SCAN reduce query on global projection returning its result.

    Creates and executes ad-hoc SCAN reduce query on global projection 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 GridCacheQuery for more details.

    rmtRdc

    Reduce function that will be called on each remote node.

    returns

    Collection of reduced values.

  111. def scanReduceRemote[R](cls: Class[_ <: V], kvp: KvPred, rmtRdc: (Iterable[(K, V)]) ? R): Iterable[R]

    Creates and executes ad-hoc SCAN reduce query on global projection returning its result.

    Creates and executes ad-hoc SCAN reduce query on global projection 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 GridCacheQuery for more details.

    rmtRdc

    Reduce function that will be called on each remote node.

    returns

    Collection of reduced values.

  112. def scanReduceRemote[R](grid: GridProjection, kvp: KvPred, rmtRdc: (Iterable[(K, V)]) ? R)(implicit m: Manifest[V]): Iterable[R]

    Creates and executes ad-hoc SCAN reduce query on given projection returning its result.

    Creates and executes ad-hoc SCAN reduce query on given projection 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.

    grid

    Grid projection on which this query will be executed. If null the global projection will be used.

    kvp

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

    rmtRdc

    Reduce function that will be called on each remote node.

    returns

    Collection of reduced values.

  113. def scanReduceRemote[R](grid: GridProjection = null, cls: Class[_ <: V], kvp: KvPred, rmtRdc: (Iterable[(K, V)]) ? R): Iterable[R]

    Creates and executes ad-hoc SCAN reduce query on given projection returning its result.

    Creates and executes ad-hoc SCAN reduce query on given projection 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.

    grid

    Grid projection on which this query will be executed. If null the global projection will be used.

    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 GridCacheQuery for more details.

    rmtRdc

    Reduce function that will be called on each remote node.

    returns

    Collection of reduced values.

  114. def scanRight[B, That](z: B)(op: (GridCacheEntry[K, V], B) ? B)(implicit bf: CanBuildFrom[Iterable[GridCacheEntry[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.

  115. def scanTransform[T](kvp: KvPred, trans: (V) ? T)(implicit m: Manifest[V]): Iterable[(K, T)]

    Creates and executes ad-hoc SCAN transform query on global projection returning its result.

    Creates and executes ad-hoc SCAN transform query on global projection 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 GridCacheQuery for more details.

    trans

    Transform function that will be applied to each returned value.

    returns

    Collection of cache key-value pairs.

  116. def scanTransform[T](cls: Class[_ <: V], kvp: KvPred, trans: (V) ? T): Iterable[(K, T)]

    Creates and executes ad-hoc SCAN transform query on global projection returning its result.

    Creates and executes ad-hoc SCAN transform query on global projection 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 GridCacheQuery for more details.

    trans

    Transform function that will be applied to each returned value.

    returns

    Collection of cache key-value pairs.

  117. def scanTransform[T](grid: GridProjection, kvp: KvPred, trans: (V) ? T)(implicit m: Manifest[V]): Iterable[(K, T)]

    Creates and executes ad-hoc SCAN transform query on given projection returning its result.

    Creates and executes ad-hoc SCAN transform query on given projection 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.

    grid

    Grid projection on which this query will be executed. If null the global projection will be used.

    kvp

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

    trans

    Transform function that will be applied to each returned value.

    returns

    Collection of cache key-value pairs.

  118. def scanTransform[T](grid: GridProjection = null, cls: Class[_ <: V], kvp: KvPred, trans: (V) ? T): Iterable[(K, T)]

    Creates and executes ad-hoc SCAN transform query on given projection returning its result.

    Creates and executes ad-hoc SCAN transform query on given projection 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.

    grid

    Grid projection on which this query will be executed. If null the global projection will be used.

    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 GridCacheQuery for more details.

    trans

    Transform function that will be applied to each returned value.

    returns

    Collection of cache key-value pairs.

  119. def seq: Iterable[GridCacheEntry[K, V]]

    Definition Classes
    Iterable ? GenIterable ? Traversable ? GenTraversable ? Parallelizable ? TraversableOnce ? GenTraversableOnce
  120. def size: Int

    Definition Classes
    TraversableOnce ? GenTraversableOnce
  121. def slice(from: Int, until: Int): Iterable[GridCacheEntry[K, V]]

    Definition Classes
    IterableLike ? TraversableLike ? GenTraversableLike
  122. def sliding(size: Int, step: Int): Iterator[Iterable[GridCacheEntry[K, V]]]

    Definition Classes
    IterableLike
  123. def sliding(size: Int): Iterator[Iterable[GridCacheEntry[K, V]]]

    Definition Classes
    IterableLike
  124. def span(p: (GridCacheEntry[K, V]) ? Boolean): (Iterable[GridCacheEntry[K, V]], Iterable[GridCacheEntry[K, V]])

    Definition Classes
    TraversableLike ? GenTraversableLike
  125. def splitAt(n: Int): (Iterable[GridCacheEntry[K, V]], Iterable[GridCacheEntry[K, V]])

    Definition Classes
    TraversableLike ? GenTraversableLike
  126. def sql(clause: String, args: Any*)(implicit m: Manifest[V]): Iterable[(K, V)]

    Creates and executes ad-hoc SQL query on global projection returning its result.

    Creates and executes ad-hoc SQL query on global projection 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 GridCacheQuery for more details.

    args

    Optional list of query arguments.

    returns

    Collection of cache key-value pairs.

  127. def sql(cls: Class[_ <: V], clause: String, args: Any*): Iterable[(K, V)]

    Creates and executes ad-hoc SQL query on global projection returning its result.

    Creates and executes ad-hoc SQL query on global projection 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 GridCacheQuery for more details.

    args

    Optional list of query arguments.

    returns

    Collection of cache key-value pairs.

  128. def sql(grid: GridProjection, clause: String, args: Any*)(implicit m: Manifest[V]): Iterable[(K, V)]

    Creates and executes ad-hoc SQL query on given projection returning its result.

    Creates and executes ad-hoc SQL query on given projection 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.

    grid

    Grid projection on which this query will be executed. If null the global projection will be used.

    clause

    Query SQL clause. See GridCacheQuery for more details.

    args

    Optional list of query arguments.

    returns

    Collection of cache key-value pairs.

  129. def sql(grid: GridProjection = null, cls: Class[_ <: V], clause: String): Iterable[(K, V)]

    Creates and executes ad-hoc SQL query on given projection returning its result.

    Creates and executes ad-hoc SQL query on given projection 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.

    grid

    Grid projection on which this query will be executed. If null the global projection will be used.

    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 GridCacheQuery for more details.

    returns

    Collection of cache key-value pairs.

  130. def sql(grid: GridProjection, cls: Class[_ <: V], clause: String, args: Any*): Iterable[(K, V)]

    Creates and executes ad-hoc SQL query on given projection returning its result.

    Creates and executes ad-hoc SQL query on given projection 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.

    grid

    Grid projection on which this query will be executed. If null the global projection will be used.

    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 GridCacheQuery for more details.

    args

    Optional list of query arguments.

    returns

    Collection of cache key-value pairs.

  131. def sqlFields(grid: GridProjection = null, clause: String): IndexedSeq[IndexedSeq[Any]]

    Creates and executes ad-hoc SQL no-arg fields query on given projection returning its result.

    Creates and executes ad-hoc SQL no-arg fields query on given projection 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.

    grid

    Optional grid projection on which this query will be executed. If null the global projection will be used.

    clause

    Query SQL clause. See GridCacheQuery for more details.

    returns

    Sequence of sequences of field values.

  132. def sqlFields(grid: GridProjection, clause: String, args: Any*): IndexedSeq[IndexedSeq[Any]]

    Creates and executes ad-hoc SQL fields query on given projection returning its result.

    Creates and executes ad-hoc SQL fields query on given projection 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.

    grid

    Optional grid projection on which this query will be executed. If null the global projection will be used.

    clause

    Query SQL clause. See GridCacheQuery for more details.

    args

    Optional list of query arguments.

    returns

    Sequence of sequences of field values.

  133. def sqlReduce[R1, R2](clause: String, rmtRdc: (Iterable[(K, V)]) ? R1, locRdc: (Iterable[R1]) ? R2, args: Any*)(implicit m: Manifest[V]): R2

    Creates and executes ad-hoc SQL reduce query on global projection returning its result.

    Creates and executes ad-hoc SQL reduce query on global projection 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 GridCacheQuery for more details.

    rmtRdc

    Reduce function that will be called on each remote node.

    locRdc

    Reduce function that will be called on local node.

    args

    Optional list of query arguments.

    returns

    Reduced value.

  134. def sqlReduce[R1, R2](cls: Class[_ <: V], clause: String, rmtRdc: (Iterable[(K, V)]) ? R1, locRdc: (Iterable[R1]) ? R2, args: Any*): R2

    Creates and executes ad-hoc SQL reduce query on global projection returning its result.

    Creates and executes ad-hoc SQL reduce query on global projection 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 GridCacheQuery for more details.

    rmtRdc

    Reduce function that will be called on each remote node.

    locRdc

    Reduce function that will be called on local node.

    args

    Optional list of query arguments.

    returns

    Reduced value.

  135. def sqlReduce[R1, R2](grid: GridProjection, clause: String, rmtRdc: (Iterable[(K, V)]) ? R1, locRdc: (Iterable[R1]) ? R2, args: Any*)(implicit m: Manifest[V]): R2

    Creates and executes ad-hoc SQL reduce query on given projection returning its result.

    Creates and executes ad-hoc SQL reduce query on given projection 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.

    grid

    Grid projection on which this query will be executed. If null the global projection will be used.

    clause

    Query SQL clause. See GridCacheQuery for more details.

    rmtRdc

    Reduce function that will be called on each remote node.

    locRdc

    Reduce function that will be called on local node.

    args

    Optional list of query arguments.

    returns

    Reduced value.

  136. def sqlReduce[R1, R2](grid: GridProjection = null, cls: Class[_ <: V], clause: String, rmtRdc: (Iterable[(K, V)]) ? R1, locRdc: (Iterable[R1]) ? R2): R2

    Creates and executes ad-hoc SQL reduce query on given projection returning its result.

    Creates and executes ad-hoc SQL reduce query on given projection 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.

    grid

    Grid projection on which this query will be executed. If null the global projection will be used.

    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 GridCacheQuery for more details.

    rmtRdc

    Reduce function that will be called on each remote node.

    locRdc

    Reduce function that will be called on local node.

    returns

    Reduced value.

  137. def sqlReduce[R1, R2](grid: GridProjection, cls: Class[_ <: V], clause: String, rmtRdc: (Iterable[(K, V)]) ? R1, locRdc: (Iterable[R1]) ? R2, args: Any*): R2

    Creates and executes ad-hoc SQL reduce query on given projection returning its result.

    Creates and executes ad-hoc SQL reduce query on given projection 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.

    grid

    Grid projection on which this query will be executed. If null the global projection will be used.

    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 GridCacheQuery for more details.

    rmtRdc

    Reduce function that will be called on each remote node.

    locRdc

    Reduce function that will be called on local node.

    args

    Optional list of query arguments.

    returns

    Reduced value.

  138. def sqlReduceRemote[R](clause: String, rmtRdc: (Iterable[(K, V)]) ? R, args: Any*)(implicit m: Manifest[V]): Iterable[R]

    Creates and executes ad-hoc SQL reduce query on global projection returning its result.

    Creates and executes ad-hoc SQL reduce query on global projection 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 GridCacheQuery for more details.

    rmtRdc

    Reduce function that will be called on each remote node.

    args

    Optional list of query arguments.

    returns

    Collection of reduced values.

  139. def sqlReduceRemote[R](cls: Class[_ <: V], clause: String, rmtRdc: (Iterable[(K, V)]) ? R, args: Any*): Iterable[R]

    Creates and executes ad-hoc SQL reduce query on global projection returning its result.

    Creates and executes ad-hoc SQL reduce query on global projection 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 GridCacheQuery for more details.

    rmtRdc

    Reduce function that will be called on each remote node.

    args

    Optional list of query arguments.

    returns

    Collection of reduced values.

  140. def sqlReduceRemote[R](grid: GridProjection, clause: String, rmtRdc: (Iterable[(K, V)]) ? R, args: Any*)(implicit m: Manifest[V]): Iterable[R]

    Creates and executes ad-hoc SQL reduce query on given projection returning its result.

    Creates and executes ad-hoc SQL reduce query on given projection 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.

    grid

    Grid projection on which this query will be executed. If null the global projection will be used.

    clause

    Query SQL clause. See GridCacheQuery for more details.

    rmtRdc

    Reduce function that will be called on each remote node.

    args

    Optional list of query arguments.

    returns

    Collection of reduced values.

  141. def sqlReduceRemote[R](grid: GridProjection = null, cls: Class[_ <: V], clause: String, rmtRdc: (Iterable[(K, V)]) ? R): Iterable[R]

    Creates and executes ad-hoc SQL reduce query on given projection returning its result.

    Creates and executes ad-hoc SQL reduce query on given projection 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.

    grid

    Grid projection on which this query will be executed. If null the global projection will be used.

    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 GridCacheQuery for more details.

    rmtRdc

    Reduce function that will be called on each remote node.

    returns

    Collection of reduced values.

  142. def sqlReduceRemote[R](grid: GridProjection, cls: Class[_ <: V], clause: String, rmtRdc: (Iterable[(K, V)]) ? R, args: Any*): Iterable[R]

    Creates and executes ad-hoc SQL reduce query on given projection returning its result.

    Creates and executes ad-hoc SQL reduce query on given projection 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.

    grid

    Grid projection on which this query will be executed. If null the global projection will be used.

    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 GridCacheQuery for more details.

    rmtRdc

    Reduce function that will be called on each remote node.

    args

    Optional list of query arguments.

    returns

    Collection of reduced values.

  143. def sqlTransform[T](clause: String, trans: (V) ? T, args: Any*)(implicit m: Manifest[V]): Iterable[(K, T)]

    Creates and executes ad-hoc SQL transform query on global projection returning its result.

    Creates and executes ad-hoc SQL transform query on global projection 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 GridCacheQuery for more details.

    trans

    Transform function that will be applied to each returned value.

    args

    Optional list of query arguments.

    returns

    Collection of cache key-value pairs.

  144. def sqlTransform[T](cls: Class[_ <: V], clause: String, trans: (V) ? T, args: Any*): Iterable[(K, T)]

    Creates and executes ad-hoc SQL transform query on global projection returning its result.

    Creates and executes ad-hoc SQL transform query on global projection 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 GridCacheQuery for more details.

    trans

    Transform function that will be applied to each returned value.

    args

    Optional list of query arguments.

    returns

    Collection of cache key-value pairs.

  145. def sqlTransform[T](grid: GridProjection, clause: String, trans: (V) ? T, args: Any*)(implicit m: Manifest[V]): Iterable[(K, T)]

    Creates and executes ad-hoc SQL transform query on given projection returning its result.

    Creates and executes ad-hoc SQL transform query on given projection 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.

    grid

    Grid projection on which this query will be executed. If null the global projection will be used.

    clause

    Query SQL clause. See GridCacheQuery for more details.

    trans

    Transform function that will be applied to each returned value.

    args

    Optional list of query arguments.

    returns

    Collection of cache key-value pairs.

  146. def sqlTransform[T](grid: GridProjection = null, cls: Class[_ <: V], clause: String, trans: (V) ? T): Iterable[(K, T)]

    Creates and executes ad-hoc SQL transform query on given projection returning its result.

    Creates and executes ad-hoc SQL transform query on given projection 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.

    grid

    Grid projection on which this query will be executed. If null the global projection will be used.

    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 GridCacheQuery for more details.

    trans

    Transform function that will be applied to each returned value.

    returns

    Collection of cache key-value pairs.

  147. def sqlTransform[T](grid: GridProjection, cls: Class[_ <: V], clause: String, trans: (V) ? T, args: Any*): Iterable[(K, T)]

    Creates and executes ad-hoc SQL transform query on given projection returning its result.

    Creates and executes ad-hoc SQL transform query on given projection 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.

    grid

    Grid projection on which this query will be executed. If null the global projection will be used.

    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 GridCacheQuery for more details.

    trans

    Transform function that will be applied to each returned value.

    args

    Optional list of query arguments.

    returns

    Collection of cache key-value pairs.

  148. def stringPrefix: String

    Definition Classes
    TraversableLike ? GenTraversableLike
  149. def sum[B >: GridCacheEntry[K, V]](implicit num: Numeric[B]): B

    Definition Classes
    TraversableOnce ? GenTraversableOnce
  150. final def synchronized[T0](arg0: ? T0): T0

    Definition Classes
    AnyRef
  151. def tail: Iterable[GridCacheEntry[K, V]]

    Definition Classes
    TraversableLike ? GenTraversableLike
  152. def tails: Iterator[Iterable[GridCacheEntry[K, V]]]

    Definition Classes
    TraversableLike
  153. def take(n: Int): Iterable[GridCacheEntry[K, V]]

    Definition Classes
    IterableLike ? TraversableLike ? GenTraversableLike
  154. def takeRight(n: Int): Iterable[GridCacheEntry[K, V]]

    Definition Classes
    IterableLike
  155. def takeWhile(p: (GridCacheEntry[K, V]) ? Boolean): Iterable[GridCacheEntry[K, V]]

    Definition Classes
    IterableLike ? TraversableLike ? GenTraversableLike
  156. def text(clause: String)(implicit m: Manifest[V]): Iterable[(K, V)]

    Creates and executes ad-hoc TEXT query on global projection returning its result.

    Creates and executes ad-hoc TEXT query on global projection 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 GridCacheQuery for more details.

    returns

    Collection of cache key-value pairs.

  157. def text(cls: Class[_ <: V], clause: String): Iterable[(K, V)]

    Creates and executes ad-hoc TEXT query on global projection returning its result.

    Creates and executes ad-hoc TEXT query on global projection 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 GridCacheQuery for more details.

    returns

    Collection of cache key-value pairs.

  158. def text(grid: GridProjection, clause: String)(implicit m: Manifest[V]): Iterable[(K, V)]

    Creates and executes ad-hoc TEXT query on given projection returning its result.

    Creates and executes ad-hoc TEXT query on given projection 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.

    grid

    Grid projection on which this query will be executed. If null the global projection will be used.

    clause

    Query text clause. See GridCacheQuery for more details.

    returns

    Collection of cache key-value pairs.

  159. def text(grid: GridProjection = null, cls: Class[_ <: V], clause: String): Iterable[(K, V)]

    Creates and executes ad-hoc TEXT query on given projection returning its result.

    Creates and executes ad-hoc TEXT query on given projection 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.

    grid

    Grid projection on which this query will be executed. If null the global projection will be used.

    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 GridCacheQuery for more details.

    returns

    Collection of cache key-value pairs.

  160. def textReduce[R1, R2](clause: String, rmtRdc: (Iterable[(K, V)]) ? R1, locRdc: (Iterable[R1]) ? R2)(implicit m: Manifest[V]): R2

    Creates and executes ad-hoc TEXT reduce query on global projection returning its result.

    Creates and executes ad-hoc TEXT reduce query on global projection 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 GridCacheQuery for more details.

    rmtRdc

    Reduce function that will be called on each remote node.

    locRdc

    Reduce function that will be called on local node.

    returns

    Reduced value.

  161. def textReduce[R1, R2](cls: Class[_ <: V], clause: String, rmtRdc: (Iterable[(K, V)]) ? R1, locRdc: (Iterable[R1]) ? R2): R2

    Creates and executes ad-hoc TEXT reduce query on global projection returning its result.

    Creates and executes ad-hoc TEXT reduce query on global projection 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 GridCacheQuery for more details.

    rmtRdc

    Reduce function that will be called on each remote node.

    locRdc

    Reduce function that will be called on local node.

    returns

    Reduced value.

  162. def textReduce[R1, R2](grid: GridProjection, clause: String, rmtRdc: (Iterable[(K, V)]) ? R1, locRdc: (Iterable[R1]) ? R2)(implicit m: Manifest[V]): R2

    Creates and executes ad-hoc TEXT reduce query on given projection returning its result.

    Creates and executes ad-hoc TEXT reduce query on given projection 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.

    grid

    Grid projection on which this query will be executed. If null the global projection will be used.

    clause

    Query text clause. See GridCacheQuery for more details.

    rmtRdc

    Reduce function that will be called on each remote node.

    locRdc

    Reduce function that will be called on local node.

    returns

    Reduced value.

  163. def textReduce[R1, R2](grid: GridProjection = null, cls: Class[_ <: V], clause: String, rmtRdc: (Iterable[(K, V)]) ? R1, locRdc: (Iterable[R1]) ? R2): R2

    Creates and executes ad-hoc TEXT reduce query on given projection returning its result.

    Creates and executes ad-hoc TEXT reduce query on given projection 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.

    grid

    Grid projection on which this query will be executed. If null the global projection will be used.

    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 GridCacheQuery for more details.

    rmtRdc

    Reduce function that will be called on each remote node.

    locRdc

    Reduce function that will be called on local node.

    returns

    Reduced value.

  164. def textReduceRemote[R](clause: String, rmtRdc: (Iterable[(K, V)]) ? R)(implicit m: Manifest[V]): Iterable[R]

    Creates and executes ad-hoc TEXT reduce query on global projection returning its result.

    Creates and executes ad-hoc TEXT reduce query on global projection 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 GridCacheQuery for more details.

    rmtRdc

    Reduce function that will be called on each remote node.

    returns

    Collection of reduced values.

  165. def textReduceRemote[R](cls: Class[_ <: V], clause: String, rmtRdc: (Iterable[(K, V)]) ? R): Iterable[R]

    Creates and executes ad-hoc TEXT reduce query on global projection returning its result.

    Creates and executes ad-hoc TEXT reduce query on global projection 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 GridCacheQuery for more details.

    rmtRdc

    Reduce function that will be called on each remote node.

    returns

    Collection of reduced values.

  166. def textReduceRemote[R](grid: GridProjection, clause: String, rmtRdc: (Iterable[(K, V)]) ? R)(implicit m: Manifest[V]): Iterable[R]

    Creates and executes ad-hoc TEXT reduce query on given projection returning its result.

    Creates and executes ad-hoc TEXT reduce query on given projection 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.

    grid

    Grid projection on which this query will be executed. If null the global projection will be used.

    clause

    Query text clause. See GridCacheQuery for more details.

    rmtRdc

    Reduce function that will be called on each remote node.

    returns

    Collection of reduced values.

  167. def textReduceRemote[R](grid: GridProjection = null, cls: Class[_ <: V], clause: String, rmtRdc: (Iterable[(K, V)]) ? R): Iterable[R]

    Creates and executes ad-hoc TEXT reduce query on given projection returning its result.

    Creates and executes ad-hoc TEXT reduce query on given projection 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.

    grid

    Grid projection on which this query will be executed. If null the global projection will be used.

    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 GridCacheQuery for more details.

    rmtRdc

    Reduce function that will be called on each remote node.

    returns

    Collection of reduced values.

  168. def textTransform[T](clause: String, trans: (V) ? T)(implicit m: Manifest[V]): Iterable[(K, T)]

    Creates and executes ad-hoc TEXT transform query on global projection returning its result.

    Creates and executes ad-hoc TEXT transform query on global projection 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 GridCacheQuery for more details.

    trans

    Transform function that will be applied to each returned value.

    returns

    Collection of cache key-value pairs.

  169. def textTransform[T](cls: Class[_ <: V], clause: String, trans: (V) ? T): Iterable[(K, T)]

    Creates and executes ad-hoc TEXT transform query on global projection returning its result.

    Creates and executes ad-hoc TEXT transform query on global projection 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 GridCacheQuery for more details.

    trans

    Transform function that will be applied to each returned value.

    returns

    Collection of cache key-value pairs.

  170. def textTransform[T](grid: GridProjection, clause: String, trans: (V) ? T)(implicit m: Manifest[V]): Iterable[(K, T)]

    Creates and executes ad-hoc TEXT transform query on given projection returning its result.

    Creates and executes ad-hoc TEXT transform query on given projection 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.

    grid

    Grid projection on which this query will be executed. If null the global projection will be used.

    clause

    Query text clause. See GridCacheQuery for more details.

    trans

    Transform function that will be applied to each returned value.

    returns

    Collection of cache key-value pairs.

  171. def textTransform[T](grid: GridProjection = null, cls: Class[_ <: V], clause: String, trans: (V) ? T): Iterable[(K, T)]

    Creates and executes ad-hoc TEXT transform query on given projection returning its result.

    Creates and executes ad-hoc TEXT transform query on given projection 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.

    grid

    Grid projection on which this query will be executed. If null the global projection will be used.

    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 GridCacheQuery for more details.

    trans

    Transform function that will be applied to each returned value.

    returns

    Collection of cache key-value pairs.

  172. def thisCollection: Iterable[GridCacheEntry[K, V]]

    Attributes
    protected[this]
    Definition Classes
    IterableLike ? TraversableLike
  173. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, GridCacheEntry[K, V], Col[GridCacheEntry[K, V]]]): Col[GridCacheEntry[K, V]]

    Definition Classes
    TraversableLike ? TraversableOnce ? GenTraversableOnce
  174. def toArray[B >: GridCacheEntry[K, V]](implicit arg0: ClassTag[B]): Array[B]

    Definition Classes
    TraversableOnce ? GenTraversableOnce
  175. def toBuffer[B >: GridCacheEntry[K, V]]: Buffer[B]

    Definition Classes
    TraversableOnce ? GenTraversableOnce
  176. def toCollection(repr: Iterable[GridCacheEntry[K, V]]): Iterable[GridCacheEntry[K, V]]

    Attributes
    protected[this]
    Definition Classes
    IterableLike ? TraversableLike
  177. def toIndexedSeq: IndexedSeq[GridCacheEntry[K, V]]

    Definition Classes
    TraversableOnce ? GenTraversableOnce
  178. def toIterable: Iterable[GridCacheEntry[K, V]]

    Definition Classes
    IterableLike ? TraversableOnce ? GenTraversableOnce
  179. def toIterator: Iterator[GridCacheEntry[K, V]]

    Definition Classes
    IterableLike ? TraversableLike ? GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  180. def toList: List[GridCacheEntry[K, V]]

    Definition Classes
    TraversableOnce ? GenTraversableOnce
  181. def toMap[T, U](implicit ev: <:<[GridCacheEntry[K, V], (T, U)]): Map[T, U]

    Definition Classes
    TraversableOnce ? GenTraversableOnce
  182. def toSeq: Seq[GridCacheEntry[K, V]]

    Definition Classes
    TraversableOnce ? GenTraversableOnce
  183. def toSet[B >: GridCacheEntry[K, V]]: Set[B]

    Definition Classes
    TraversableOnce ? GenTraversableOnce
  184. def toStream: Stream[GridCacheEntry[K, V]]

    Definition Classes
    IterableLike ? TraversableLike ? GenTraversableOnce
  185. def toString(): String

    Definition Classes
    TraversableLike ? Any
  186. def toTraversable: Traversable[GridCacheEntry[K, V]]

    Definition Classes
    TraversableLike ? TraversableOnce ? GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  187. def toVector: Vector[GridCacheEntry[K, V]]

    Definition Classes
    TraversableOnce ? GenTraversableOnce
  188. def transpose[B](implicit asTraversable: (GridCacheEntry[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.

  189. def unzip[A1, A2](implicit asPair: (GridCacheEntry[K, V]) ? (A1, A2)): (Iterable[A1], Iterable[A2])

    Definition Classes
    GenericTraversableTemplate
  190. def unzip3[A1, A2, A3](implicit asTriple: (GridCacheEntry[K, V]) ? (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])

    Definition Classes
    GenericTraversableTemplate
  191. lazy val value: GridCacheProjection[K, V]

  192. def view(from: Int, until: Int): IterableView[GridCacheEntry[K, V], Iterable[GridCacheEntry[K, V]]]

    Definition Classes
    IterableLike ? TraversableLike
  193. def view: IterableView[GridCacheEntry[K, V], Iterable[GridCacheEntry[K, V]]]

    Definition Classes
    IterableLike ? TraversableLike
  194. def viewByEntry(p: EntryPred): GridCacheProjection[K, V]

    Gets cache projection based on given entry filter.

    Gets cache projection based on given entry filter. This filter will be simply passed through to all cache operations on this projection. Unlike viewByKv function, this filter will not be used for pre-filtering.

    p

    Filter to be passed through to all cache operations. If null, then the same projection is returned. If cache operation receives its own filter, then filters will be anded.

    returns

    Projection based on given filter.

    See also

    org.gridgain.grid.cache.GridCacheProjection.projection(...)

  195. def viewByKv(p: (K, V) ? Boolean): GridCacheProjection[K, V]

    Gets cache projection based on given key-value predicate.

    Gets cache projection based on given key-value predicate. Whenever makes sense, this predicate will be used to pre-filter cache operations. If operation passed pre-filtering, this filter will be passed through to cache operations as well.

    p

    Key-value predicate for this projection. If null, then the same projection is returned.

    returns

    Projection for given key-value predicate.

    See also

    org.gridgain.grid.cache.GridCacheProjection.projection(...)

  196. def viewByType[A, B](k: Class[A], v: Class[B]): GridCacheProjection[A, B]

    Gets cache projection only for given key and value type.

    Gets cache projection only for given key and value type. Only non-null key-value pairs that have matching key and value pairs will be used in this projection.

    Note that this method should be used instead of projection(...) on Java side as it properly converts types from Scala counterparts to Java ones.

    Cache Flags

    The resulting projection will have flag GridCacheFlag#STRICT set on it.

    k

    Key type.

    v

    Value type.

    returns

    Cache projection for given key and value types.

    See also

    org.gridgain.grid.cache.GridCacheProjection.projection(...)

  197. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  198. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  199. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  200. def withFilter(p: (GridCacheEntry[K, V]) ? Boolean): FilterMonadic[GridCacheEntry[K, V], Iterable[GridCacheEntry[K, V]]]

    Definition Classes
    TraversableLike ? FilterMonadic
  201. def zip[A1 >: GridCacheEntry[K, V], B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Iterable[GridCacheEntry[K, V]], (A1, B), That]): That

    Definition Classes
    IterableLike ? GenIterableLike
  202. def zipAll[B, A1 >: GridCacheEntry[K, V], That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Iterable[GridCacheEntry[K, V]], (A1, B), That]): That

    Definition Classes
    IterableLike ? GenIterableLike
  203. def zipWithIndex[A1 >: GridCacheEntry[K, V], That](implicit bf: CanBuildFrom[Iterable[GridCacheEntry[K, V]], (A1, Int), That]): That

    Definition Classes
    IterableLike ? GenIterableLike

Inherited from Iterable[GridCacheEntry[K, V]]

Inherited from IterableLike[GridCacheEntry[K, V], Iterable[GridCacheEntry[K, V]]]

Inherited from Equals

Inherited from GenIterable[GridCacheEntry[K, V]]

Inherited from GenIterableLike[GridCacheEntry[K, V], Iterable[GridCacheEntry[K, V]]]

Inherited from Traversable[GridCacheEntry[K, V]]

Inherited from GenTraversable[GridCacheEntry[K, V]]

Inherited from GenericTraversableTemplate[GridCacheEntry[K, V], Iterable]

Inherited from TraversableLike[GridCacheEntry[K, V], Iterable[GridCacheEntry[K, V]]]

Inherited from GenTraversableLike[GridCacheEntry[K, V], Iterable[GridCacheEntry[K, V]]]

Inherited from Parallelizable[GridCacheEntry[K, V], ParIterable[GridCacheEntry[K, V]]]

Inherited from TraversableOnce[GridCacheEntry[K, V]]

Inherited from GenTraversableOnce[GridCacheEntry[K, V]]

Inherited from FilterMonadic[GridCacheEntry[K, V], Iterable[GridCacheEntry[K, V]]]

Inherited from HasNewBuilder[GridCacheEntry[K, V], Iterable[org.gridgain.grid.cache.GridCacheEntry[K,V]] @scala.annotation.unchecked.uncheckedVariance]

Inherited from PimpedType[GridCacheProjection[K, V]]

Inherited from AnyRef

Inherited from Any

Ungrouped

GridGain™ - Scalar DSL, ver. 6.5.6
2014 Copyright © GridGain Systems