ParallelCollect<T,C> |
Reduce the sequence of values in each 'rail' to a single value.
|
ParallelCollect.ParallelCollectSubscriber<T,C> |
|
ParallelConcatMap<T,R> |
Concatenates the generated Publishers on each rail.
|
ParallelDoOnNextTry<T> |
Calls a Consumer for each upstream value passing by
and handles any failure with a handler function.
|
ParallelDoOnNextTry.ParallelDoOnNextConditionalSubscriber<T> |
|
ParallelDoOnNextTry.ParallelDoOnNextSubscriber<T> |
|
ParallelFilter<T> |
Filters each 'rail' of the source ParallelFlowable with a predicate function.
|
ParallelFilter.BaseFilterSubscriber<T> |
|
ParallelFilter.ParallelFilterConditionalSubscriber<T> |
|
ParallelFilter.ParallelFilterSubscriber<T> |
|
ParallelFilterTry<T> |
Filters each 'rail' of the source ParallelFlowable with a predicate function.
|
ParallelFilterTry.BaseFilterSubscriber<T> |
|
ParallelFilterTry.ParallelFilterConditionalSubscriber<T> |
|
ParallelFilterTry.ParallelFilterSubscriber<T> |
|
ParallelFlatMap<T,R> |
Flattens the generated Publishers on each rail.
|
ParallelFlatMapIterable<T,R> |
Flattens the generated Iterable s on each rail.
|
ParallelFromArray<T> |
Wraps multiple Publishers into a ParallelFlowable which runs them
in parallel.
|
ParallelFromPublisher<T> |
Dispatches the values from upstream in a round robin fashion to subscribers which are
ready to consume elements.
|
ParallelFromPublisher.ParallelDispatcher<T> |
|
ParallelJoin<T> |
Merges the individual 'rails' of the source ParallelFlowable, unordered,
into a single regular Publisher sequence (exposed as Flowable).
|
ParallelJoin.JoinInnerSubscriber<T> |
|
ParallelJoin.JoinSubscription<T> |
|
ParallelJoin.JoinSubscriptionBase<T> |
|
ParallelJoin.JoinSubscriptionDelayError<T> |
|
ParallelMap<T,R> |
Maps each 'rail' of the source ParallelFlowable with a mapper function.
|
ParallelMap.ParallelMapConditionalSubscriber<T,R> |
|
ParallelMap.ParallelMapSubscriber<T,R> |
|
ParallelMapTry<T,R> |
Maps each 'rail' of the source ParallelFlowable with a mapper function
and handle any failure based on a handler function.
|
ParallelMapTry.ParallelMapTryConditionalSubscriber<T,R> |
|
ParallelMapTry.ParallelMapTrySubscriber<T,R> |
|
ParallelPeek<T> |
Execute a Consumer in each 'rail' for the current element passing through.
|
ParallelPeek.ParallelPeekSubscriber<T> |
|
ParallelReduce<T,R> |
Reduce the sequence of values in each 'rail' to a single value.
|
ParallelReduce.ParallelReduceSubscriber<T,R> |
|
ParallelReduceFull<T> |
Reduces all 'rails' into a single value which then gets reduced into a single
Publisher sequence.
|
ParallelReduceFull.ParallelReduceFullInnerSubscriber<T> |
|
ParallelReduceFull.ParallelReduceFullMainSubscriber<T> |
|
ParallelReduceFull.SlotPair<T> |
|
ParallelRunOn<T> |
Ensures each 'rail' from upstream runs on a Worker from a Scheduler.
|
ParallelRunOn.BaseRunOnSubscriber<T> |
|
ParallelRunOn.RunOnConditionalSubscriber<T> |
|
ParallelRunOn.RunOnSubscriber<T> |
|
ParallelSortedJoin<T> |
Given sorted rail sequences (according to the provided comparator) as List
emit the smallest item from these parallel Lists to the Subscriber.
|
ParallelSortedJoin.SortedJoinInnerSubscriber<T> |
|
ParallelSortedJoin.SortedJoinSubscription<T> |
|