This class is a wrapper around a "shared array" to provide the Seq trait functions.
Future pool that executes task asynchronously with bounded parallelism level.
A wrapper that behaves as an Array of internal Arrays of T
.
A wrapper that behaves as an Array of internal Arrays of T
.
Internally, however, it keeps only a constant number of arrays, called shards.
Represents a priority queue that is bounded by a small maximum (e.g., < 10 elements).
Represents a priority queue that is bounded by a small maximum (e.g., < 10 elements). The items are simply sorted when needed to be in priority order.
Utility class for unbounded and bounded parallel execution
This class is a wrapper around a "shared array" to provide the Seq trait functions.
The concept of shared array is that a number of Seqs share an array as the internal storage. Each of the arrays is defined by its offset from the beginning of the shared array and length.