ignite.scala

CacheAffinityPipe

Related Doc: package scala

sealed abstract class CacheAffinityPipe[K, V, T] extends IgnitePipe[T] with HasComputeConfig[CacheAffinity[K, V], T]

Represents a transforming affinity (cache-collocation) computation on the cluster.

Linear Supertypes
HasComputeConfig[CacheAffinity[K, V], T], IgnitePipe[T], Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. CacheAffinityPipe
  2. HasComputeConfig
  3. IgnitePipe
  4. Serializable
  5. AnyRef
  6. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def compute: ComputeRunner

    Definition Classes
    HasComputeConfig
  2. abstract def source: Iterable[CacheAffinity[K, V]]

    Definition Classes
    HasComputeConfig
  3. abstract def transform: (CacheAffinity[K, V]) ⇒ T

    Definition Classes
    HasComputeConfig

Concrete Value Members

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

    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Definition Classes
    AnyRef → Any
  3. def ++(p: IgnitePipe[T]): IgnitePipe[T]

    Merge two pipes of the same type

    Merge two pipes of the same type

    Definition Classes
    IgnitePipe
  4. final def ==(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  5. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  6. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  7. final def eq(arg0: AnyRef): Boolean

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

    Definition Classes
    AnyRef → Any
  9. def execute: Iterable[T]

    Execute the chain and return the computed values.

    Execute the chain and return the computed values.

    Definition Classes
    CacheAffinityPipeIgnitePipe
  10. def filter(f: (T) ⇒ Boolean): IgnitePipe[T]

    Filter elements using the function f.

    Filter elements using the function f.

    Implemented as a flatMap executed on the client.

    Definition Classes
    IgnitePipe
  11. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  12. def flatMap[U](f: (T) ⇒ TraversableOnce[U]): FlatMapCacheAffinityPipe[K, V, U]

    Transform each value using the function f and flatten the result.

    Transform each value using the function f and flatten the result.

    Note: This is not a monadic composition.

    Flatten step is performed on the client. If you have a chain of flatMaps, all functions in the chain are composed and flattening is performed once on the client.

    To manually split the flatMap chain, use .fork. Forking is useful when dealing with long, lazy chains, or when adding a barrier is desired.

    Definition Classes
    CacheAffinityPipeIgnitePipe
  13. def fork: IgnitePipe[T]

    Manually add a fork in the execution chain.

    Manually add a fork in the execution chain. This creates a barrier, which means the subsequent transforms are planned on a fresh Ignite closure.

    Definition Classes
    CacheAffinityPipeIgnitePipe
  14. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  15. def hashCode(): Int

    Definition Classes
    AnyRef → Any
  16. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  17. def map[U](f: (T) ⇒ U): CacheAffinityPipe[K, V, U]

    Transform each element using the function f.

    Transform each element using the function f.

    This is executed on the cluster nodes. Chained map transforms are composed and executed once on the cluster nodes. Use .fork to manually split the chain if tuning is required.

    Definition Classes
    CacheAffinityPipeIgnitePipe
  18. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  19. final def notify(): Unit

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

    Definition Classes
    AnyRef
  21. def reduce(implicit sg: Semigroup[T]): CacheAffinityValueReduction[K, V, T]

    Prepare a Reduction based on the provided Semigroup.

    Prepare a Reduction based on the provided Semigroup.

    Note that results can arrived from cluster nodes in any order, so the operation has to be associative and commutative.

    Definition Classes
    CacheAffinityPipeIgnitePipe
  22. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  23. def toString(): String

    Definition Classes
    AnyRef → Any
  24. final def wait(): Unit

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from HasComputeConfig[CacheAffinity[K, V], T]

Inherited from IgnitePipe[T]

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped