HashMapMergerResultKernel

Instance Constructors

new HashMapMergerResultKernel(keys: Array[Buffer[K]], vals: Array[Buffer[V]], root: Array[HashMap[K, V]])

Value Members

final def !=(arg0: AnyRef): Boolean

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

Definition Classes
Any
final def ##(): Int

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

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

Definition Classes
Any
def afterCreateRoot(tree: Ref[Int, Unit]): Unit

Initializes the workstealing tree root.
Initializes the workstealing tree root.
By default does nothing, but some kernels may choose to override this default behaviour.

Definition Classes
Kernel
def afterExpand(old: Node[Int, Unit], node: Node[Int, Unit]): Unit

Initializes a node that has just been stolen.
Initializes a node that has just been stolen.
By default does nothing, but some kernels may choose to override this default behaviour to store operation-specific information into the node.

Definition Classes
Kernel
def apply(node: Node[Int, Unit], chunkSize: Int): Unit

Processes the specified chunk.
Processes the specified chunk.

Definition Classes
HashMapMergerResultKernel → Kernel
final def asInstanceOf[T0]: T0

Definition Classes
Any
def beforeWorkOn(tree: Ref[Int, Unit], node: Node[Int, Unit]): Unit

Initializes the workstealing tree node.
Initializes the workstealing tree node.
By default does nothing, but some kernels may choose to override this default behaviour to store operation-specific information into the node.

Definition Classes
Kernel
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def combine(a: Unit, b: Unit): Unit

Combines results from two chunks into the aggregate result.
Combines results from two chunks into the aggregate result.

Definition Classes
HashMapMergerResultKernel → Kernel
final def completeIteration(stealer: Stealer[Int]): Unit

Completes the iteration in the stealer.
Completes the iteration in the stealer.
Some parallel operations do not traverse all the elements in a chunk or a node. The purpose of this method is to bring the node into a Completed or Stolen state before proceeding.

Attributes
protected
Definition Classes
Kernel
def completeNode(intermediate: Unit, tree: Ref[Int, Unit], worker: WorkerTask): Boolean

Completes the iteration in the node.
Completes the iteration in the node.
Some parallel operations do not traverse all the elements in a chunk or a node. The purpose of this method is to bring the node into a Completed or Stolen state before proceeding.

Attributes
protected
Definition Classes
Kernel
def defaultIncrementStepFactor: Int

Definition Classes
Kernel
def defaultIncrementStepFrequency: Int

Definition Classes
Kernel
final def eq(arg0: AnyRef): Boolean

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

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
final def improve(hcode: Int): Int

Attributes
protected
Definition Classes
HashUtils
def incrementStepFactor(config: Config): Int

Definition Classes
HashMapMergerResultKernel → Kernel
def incrementStepFrequency(config: Config): Int

Definition Classes
Kernel
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
val keys: Array[Buffer[K]]
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def notTerminated: Boolean

Returns true as long as terminationCause is null.
Returns true as long as terminationCause is null.

Definition Classes
Kernel
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
final def pushUp(tree: Ref[Int, Unit], worker: WorkerTask): Unit

Pushes the result up the tree
Pushes the result up the tree
After completing node worker tryes to push the result up the tree, as far as he could

Attributes
protected
Definition Classes
Kernel
Annotations
@tailrec()
val root: Array[HashMap[K, V]]
final def setTerminationCause(tc: TerminationCause): Unit

Definition Classes
Kernel
Annotations
@tailrec()
def storeIntermediateResult(node: Node[Int, Unit], res: Unit): Unit

Stores the result of processing the node into the lresult field.
Stores the result of processing the node into the lresult field.
This behaviour can be overridden.

Definition Classes
Kernel
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
val terminationCauseRef: AtomicReference[TerminationCause]

Used for cancelling operations early (e.
Used for cancelling operations early (e.g. due to exceptions). Holds information on why the operation failed

Attributes
protected
Definition Classes
Kernel
def toString(): String

Definition Classes
AnyRef → Any
def validateResult(r: Unit): Unit

Returns the result if there was no early termination.
Returns the result if there was no early termination. Otherwise may throw an exception based on the termination cause.

Definition Classes
Kernel
Annotations
@inline()
val vals: Array[Buffer[V]]
final def wait(): Unit

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

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

Definition Classes
AnyRef
Annotations
@throws( ... )
def workOn(tree: Ref[Int, Unit], config: Config, worker: WorkerTask): Boolean

Returns true if completed with no stealing.
Returns true if completed with no stealing. Returns false if steal occurred.
May be overridden in subclass to specialize for better performance.

Definition Classes
IndexedKernel → Kernel
def zero: Unit

The neutral element of the reduction.
The neutral element of the reduction.

Definition Classes
HashMapMergerResultKernel → Kernel

class HashMapMergerResultKernel[K, V] extends IndexedKernel[Int, Unit] with HashUtils

Instance Constructors

new HashMapMergerResultKernel(keys: Array[Buffer[K]], vals: Array[Buffer[V]], root: Array[HashMap[K, V]])

Value Members

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def afterCreateRoot(tree: Ref[Int, Unit]): Unit

def afterExpand(old: Node[Int, Unit], node: Node[Int, Unit]): Unit

def apply(node: Node[Int, Unit], chunkSize: Int): Unit

final def asInstanceOf[T0]: T0

def beforeWorkOn(tree: Ref[Int, Unit], node: Node[Int, Unit]): Unit

def clone(): AnyRef

def combine(a: Unit, b: Unit): Unit

final def completeIteration(stealer: Stealer[Int]): Unit

def completeNode(intermediate: Unit, tree: Ref[Int, Unit], worker: WorkerTask): Boolean

def defaultIncrementStepFactor: Int

def defaultIncrementStepFrequency: Int

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def improve(hcode: Int): Int

def incrementStepFactor(config: Config): Int

def incrementStepFrequency(config: Config): Int

final def isInstanceOf[T0]: Boolean

val keys: Array[Buffer[K]]

final def ne(arg0: AnyRef): Boolean

def notTerminated: Boolean

final def notify(): Unit

final def notifyAll(): Unit

final def pushUp(tree: Ref[Int, Unit], worker: WorkerTask): Unit

val root: Array[HashMap[K, V]]

final def setTerminationCause(tc: TerminationCause): Unit

def storeIntermediateResult(node: Node[Int, Unit], res: Unit): Unit

final def synchronized[T0](arg0: ⇒ T0): T0

val terminationCauseRef: AtomicReference[TerminationCause]

def toString(): String

def validateResult(r: Unit): Unit

val vals: Array[Buffer[V]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def workOn(tree: Ref[Int, Unit], config: Config, worker: WorkerTask): Boolean

def zero: Unit

Inherited from HashUtils

Inherited from IndexedKernel[Int, Unit]

Inherited from Kernel[Int, Unit]

Inherited from AnyRef

Inherited from Any

Ungrouped