Package akka.stream.scaladsl
Interface SubFlow<Out,Mat,F,C>
-
- All Superinterfaces:
FlowOps<Out,Mat>
- All Known Implementing Classes:
SubFlowImpl
public interface SubFlow<Out,Mat,F,C> extends FlowOps<Out,Mat>
Attach aSink
to each sub-flow, closing the overall Graph that is being constructed.Note that attributes set on the returned graph, including async boundaries are now for the entire graph and not the
SubFlow
. for exampleasync
will not have any effect as the returned graph is the entire, closed graph.
-
-
Method Summary
All Methods Instance Methods Abstract Methods Modifier and Type Method Description F
concatSubstreams()
Flatten the sub-flows back into the super-flow by concatenating them.F
mergeSubstreams()
Flatten the sub-flows back into the super-flow by performing a merge without parallelism limit (i.e.F
mergeSubstreamsWithParallelism(int parallelism)
Flatten the sub-flows back into the super-flow by performing a merge with the given parallelism limit.<M> C
to(Graph<SinkShape<Out>,M> sink)
Attach aSink
to each sub-flow, closing the overall Graph that is being constructed.-
Methods inherited from interface akka.stream.scaladsl.FlowOps
$plus$plus, addAttributes, alsoTo, alsoToGraph, ask, ask, async, backpressureTimeout, batch, batchWeighted, buffer, collect, collectType, completionTimeout, concat, concatGraph, conflate, conflateWithSeed, delay, delay$default$2, detach, divertTo, divertToGraph, drop, dropWhile, dropWithin, expand, extrapolate, extrapolate$default$2, filter, filterNot, flatMapConcat, flatMapMerge, fold, foldAsync, groupBy, groupBy, grouped, groupedWeightedWithin, groupedWithin, idleTimeout, initialDelay, initialTimeout, interleave, interleave, interleaveGraph, interleaveGraph$default$3, intersperse, intersperse, keepAlive, limit, limitWeighted, log, log$default$2, log$default$3, map, mapAsync, mapAsyncUnordered, mapConcat, mapError, merge, merge$default$2, mergeGraph, mergeSorted, mergeSortedGraph, named, orElse, orElseGraph, prefixAndTail, prepend, prependGraph, recover, recoverWith, recoverWithRetries, reduce, scan, scanAsync, sliding, sliding$default$2, splitAfter, splitAfter, splitWhen, splitWhen, statefulMapConcat, take, takeWhile, takeWhile, takeWithin, throttle, throttle, throttle, throttle, throttleEven, throttleEven, via, watch, wireTap, wireTap, wireTapGraph, withAttributes, zip, zipGraph, zipLatest, zipLatestGraph, zipLatestWith, zipLatestWithGraph, zipWith, zipWithGraph, zipWithIndex
-
-
-
-
Method Detail
-
concatSubstreams
F concatSubstreams()
Flatten the sub-flows back into the super-flow by concatenating them. This is usually a bad idea when combined withgroupBy
since it can easily lead to deadlock—the concatenation does not consume from the second substream until the first has finished and thegroupBy
operator will get back-pressure from the second stream.This is identical in effect to
mergeSubstreamsWithParallelism(1)
.- Returns:
- (undocumented)
-
mergeSubstreams
F mergeSubstreams()
Flatten the sub-flows back into the super-flow by performing a merge without parallelism limit (i.e. having an unbounded number of sub-flows active concurrently).This is identical in effect to
mergeSubstreamsWithParallelism(Integer.MAX_VALUE)
.- Returns:
- (undocumented)
-
mergeSubstreamsWithParallelism
F mergeSubstreamsWithParallelism(int parallelism)
Flatten the sub-flows back into the super-flow by performing a merge with the given parallelism limit. This means that only up toparallelism
substreams will be executed at any given time. Substreams that are not yet executed are also not materialized, meaning that back-pressure will be exerted at the operator that creates the substreams when the parallelism limit is reached.- Parameters:
parallelism
- (undocumented)- Returns:
- (undocumented)
-
to
<M> C to(Graph<SinkShape<Out>,M> sink)
Attach aSink
to each sub-flow, closing the overall Graph that is being constructed.Note that attributes set on the returned graph, including async boundaries are now for the entire graph and not the
SubFlow
. for exampleasync
will not have any effect as the returned graph is the entire, closed graph.
-
-