HERE Data SDK - Scala API references < Back

Packages

package root

Definition Classes
root
package com

Definition Classes
root
package here

Definition Classes
com
package platform

Definition Classes
here
package data

Definition Classes
platform
package processing
This package provides the Data Processing Library for building distributed data processing applications.
This package provides the Data Processing Library for building distributed data processing applications.
A Runner both implements the interface with the environment for an application to run, and starts the application. The application, in turn, is driven by a Driver, that controls and performs the distributed processing.
Choose a Runner best suited for the environment where the application runs.
The Driver performs one of more tasks which read layers from input catalogs and write to one or more layers of an output catalog.
The main entry point in the processing library is the com.here.platform.data.processing.driver.DriverBuilder class where you can add different kinds of tasks to the driver. The driver runs the tasks, and commits the final results to the output catalog.
Tasks are implemented using one or more compilers.
The simplest compiler is the direct compiler which maps each input tile to N output tiles. The application needs to define com.here.platform.data.processing.compiler.Direct1ToNCompiler.
Other more complex compilation patterns are based on some kind of dependency tracking between input partitions and output partitions.
The processing Library supports the following patterns:
- com.here.platform.data.processing.compiler.NonIncrementalCompiler: non-incremental compilation only - com.here.platform.data.processing.compiler.DepCompiler: non-incremental dependency calculation and incremental compilation - com.here.platform.data.processing.compiler.IncrementalDepCompiler: incremental dependency calculation and compilation - com.here.platform.data.processing.compiler.Direct1ToNCompiler: incremental compilation where every output tile depends only on one input tile, and this mapping is independent from tile content - com.here.platform.data.processing.compiler.DirectMToNCompiler: incremental compilation where every output tile depends on multiple input tiles, and this mapping is independent from tile content - com.here.platform.data.processing.compiler.MapGroupCompiler: incremental compilation where every output tile can depend on multiple input tiles, and this mapping depend on the tile content - com.here.platform.data.processing.compiler.RefTreeCompiler: fully-managed two phases incremental compilation that can resolve references between input partitions. Input/Output dependency management is implemented and the developer doesn't need to provide this logic
The application's main object normally mixes in the a runner trait (like PipelineRunner) to setup the Driver, and interfaces with the environment where the application is run. See the Main classes in the example compilers for more details.
com.here.platform.data.processing.catalog, com.here.platform.data.processing.blobstore, and com.here.platform.data.processing.publisher contain utilities for accessing catalogs and payloads in a Spark-friendly way, providing an RDD-based abstraction over data and metadata. These classes are used by the processing library, but can also be used independently.

Definition Classes
data
package utils

Definition Classes
processing
package parallel

Definition Classes
utils
object Implicits

Definition Classes
parallel
AsyncMapUnorderedIteratorOps
FlatMapWrapper
MapWrapper

c

com.here.platform.data.processing.utils.parallel.Implicits

MapWrapper

implicit final class MapWrapper[V] extends AnyVal

Wrappers to map in parallel an iterator scala.Iterator.

Linear Supertypes

AnyVal, Any

Ordering

Alphabetic
By Inheritance

Inherited

MapWrapper
AnyVal
Any

Hide All
Show All

Visibility

Public
All

Instance Constructors

new MapWrapper(iterator: Iterator[V])

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
Any
final def ##(): Int

Definition Classes
Any
final def ==(arg0: Any): Boolean

Definition Classes
Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def getClass(): Class[_ <: AnyVal]

Definition Classes
AnyVal → Any
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def mapParallel[U](numThreads: Int, threadFactory: ⇒ ThreadFactory = Executors.defaultThreadFactory())(f: (V) ⇒ U): Iterator[U]
Applies a map to an iterator, but it can use a thread pool if numThreads is >1, in that case elements are computed in parallel.
Applies a map to an iterator, but it can use a thread pool if numThreads is >1, in that case elements are computed in parallel.
U
Type of the new values
numThreads
Number of threads to use for parallel invocations of f(). Can only be set to a value larger than 1 if the operations include IO operations, or if multiple cores are available per executor.
threadFactory
The thread factory used to create new threads. This can be used to add initialization code to each worker.
f
Mapping function, providing the new value for the element
returns
An iterator with mapping function applied to each element.
def mapParallel[U](f: (V) ⇒ U, numThreads: Int, threadFactory: ⇒ ThreadFactory): Iterator[U]
Applies a map to an iterator, but it can use a thread pool if numThreads is >1, in that case elements are computed in parallel.
Applies a map to an iterator, but it can use a thread pool if numThreads is >1, in that case elements are computed in parallel.
U
Type of the new values
f
Mapping function, providing the new value for the element
numThreads
Number of threads to use for parallel invocations of f(). Can only be set to a value larger than 1 if the operations include IO operations, or if multiple cores are available per executor.
threadFactory
The thread factory used to create new threads. This can be used to add initialization code to each worker.
returns
An iterator with mapping function applied to each element.
def mapParallel[U](f: (V) ⇒ U, numThreads: Int): Iterator[U]
Applies a map to an iterator, but it can use a thread pool if numThreads is >1, in that case elements are computed in parallel.
Applies a map to an iterator, but it can use a thread pool if numThreads is >1, in that case elements are computed in parallel.
U
Type of the new values
f
Mapping function, providing the new value for the element
numThreads
Number of threads to use for parallel invocations of f(). Can only be set to a value larger than 1 if the operations include IO operations, or if multiple cores are available per executor.
returns
An iterator with mapping function applied to each element.
def mapParallelUnordered[U](numThreads: Int, threadFactory: ⇒ ThreadFactory = Executors.defaultThreadFactory())(f: (V) ⇒ U): Iterator[U]
Applies a map to an iterator, but it can use a thread pool if numThreads is >1, in that case elements are computed in parallel.
Applies a map to an iterator, but it can use a thread pool if numThreads is >1, in that case elements are computed in parallel. Elements are emitted as soon as they are ready, therefore it is possible that the transformed elements are not in the same order as in the input iterator.
U
Type of the new values
numThreads
Number of threads to use for parallel invocations of f(). Can only be set to a value larger than 1 if the operations include IO operations, or if multiple cores are available per executor.
threadFactory
The thread factory used to create new threads. This can be used to add initialization code to each worker.
f
Mapping function, providing the new value for the element
returns
An iterator with mapping function applied to each element.
def mapParallelUnordered[U](f: (V) ⇒ U, numThreads: Int, threadFactory: ⇒ ThreadFactory): Iterator[U]
Applies a map to an iterator, but it can use a thread pool if numThreads is >1, in that case elements are computed in parallel.
Applies a map to an iterator, but it can use a thread pool if numThreads is >1, in that case elements are computed in parallel. Elements are emitted as soon as they are ready, therefore it is possible that the transformed elements are not in the same order as in the input iterator.
U
Type of the new values
f
Mapping function, providing the new value for the element
numThreads
Number of threads to use for parallel invocations of f(). Can only be set to a value larger than 1 if the operations include IO operations, or if multiple cores are available per executor.
threadFactory
The thread factory used to create new threads. This can be used to add initialization code to each worker.
returns
An iterator with mapping function applied to each element.
def mapParallelUnordered[U](f: (V) ⇒ U, numThreads: Int): Iterator[U]
Applies a map to an iterator, but it can use a thread pool if numThreads is >1, in that case elements are computed in parallel.
Applies a map to an iterator, but it can use a thread pool if numThreads is >1, in that case elements are computed in parallel. Elements are emitted as soon as they are ready, therefore it is possible that the transformed elements are not in the same order as in the input iterator.
U
Type of the new values
f
Mapping function, providing the new value for the element
numThreads
Number of threads to use for parallel invocations of f(). Can only be set to a value larger than 1 if the operations include IO operations, or if multiple cores are available per executor.
returns
An iterator with mapping function applied to each element.
def toString(): String

Definition Classes
Any

Inherited from AnyVal

Inherited from Any

Ungrouped