-
Notifications
You must be signed in to change notification settings - Fork 154
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
feat: Add flatMapConcat with parallelism support.
- Loading branch information
Showing
9 changed files
with
729 additions
and
1 deletion.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
204 changes: 204 additions & 0 deletions
204
...ts/src/test/scala/org/apache/pekko/stream/scaladsl/FlowFlatMapConcatParallelismSpec.scala
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,204 @@ | ||
| /* | ||
| * Licensed to the Apache Software Foundation (ASF) under one or more | ||
| * contributor license agreements. See the NOTICE file distributed with | ||
| * this work for additional information regarding copyright ownership. | ||
| * The ASF licenses this file to You under the Apache License, Version 2.0 | ||
| * (the "License"); you may not use this file except in compliance with | ||
| * the License. You may obtain a copy of the License at | ||
| * | ||
| * http://www.apache.org/licenses/LICENSE-2.0 | ||
| * | ||
| * Unless required by applicable law or agreed to in writing, software | ||
| * distributed under the License is distributed on an "AS IS" BASIS, | ||
| * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. | ||
| * See the License for the specific language governing permissions and | ||
| * limitations under the License. | ||
| */ | ||
|
|
||
| package org.apache.pekko.stream.scaladsl | ||
|
|
||
| import java.util.concurrent.ThreadLocalRandom | ||
| import java.util.concurrent.atomic.AtomicInteger | ||
| import org.apache.pekko | ||
| import pekko.pattern.FutureTimeoutSupport | ||
| import pekko.NotUsed | ||
| import pekko.stream._ | ||
| import pekko.stream.testkit.{ ScriptedTest, StreamSpec } | ||
| import pekko.stream.testkit.scaladsl.TestSink | ||
|
|
||
| import java.util.Collections | ||
| import scala.annotation.switch | ||
| import scala.concurrent.duration.DurationInt | ||
| import scala.concurrent.Future | ||
| import scala.util.control.NoStackTrace | ||
|
|
||
| class FlowFlatMapConcatParallelismSpec extends StreamSpec(""" | ||
| pekko.stream.materializer.initial-input-buffer-size = 2 | ||
| """) with ScriptedTest with FutureTimeoutSupport { | ||
| val toSeq = Flow[Int].grouped(1000).toMat(Sink.head)(Keep.right) | ||
|
|
||
| class BoomException extends RuntimeException("BOOM~~") with NoStackTrace | ||
| "A flatMapConcat" must { | ||
|
|
||
| for (i <- 1 until 129) { | ||
| s"work with value presented sources with parallelism: $i" in { | ||
| Source( | ||
| List( | ||
| Source.empty[Int], | ||
| Source.single(1), | ||
| Source.empty[Int], | ||
| Source(List(2, 3, 4)), | ||
| Source.future(Future.successful(5)), | ||
| Source.lazyFuture(() => Future.successful(6)), | ||
| Source.future(after(1.millis)(Future.successful(7))))) | ||
| .flatMapConcat(i, identity) | ||
| .runWith(toSeq) | ||
| .futureValue should ===(1 to 7) | ||
| } | ||
| } | ||
|
|
||
| def generateRandomValuePresentedSources(nums: Int): (Int, List[Source[Int, NotUsed]]) = { | ||
| val seq = List.tabulate(nums) { _ => | ||
| val random = ThreadLocalRandom.current().nextInt(1, 10) | ||
| (random: @switch) match { | ||
| case 1 => Source.single(1) | ||
| case 2 => Source(List(1)) | ||
| case 3 => Source.fromJavaStream(() => Collections.singleton(1).stream()) | ||
| case 4 => Source.future(Future.successful(1)) | ||
| case 5 => Source.future(after(1.millis)(Future.successful(1))) | ||
| case _ => Source.empty[Int] | ||
| } | ||
| } | ||
| val sum = seq.filterNot(_.eq(Source.empty[Int])).size | ||
| (sum, seq) | ||
| } | ||
|
|
||
| def generateSequencedValuePresentedSources(nums: Int): (Int, List[Source[Int, NotUsed]]) = { | ||
| val seq = List.tabulate(nums) { index => | ||
| val random = ThreadLocalRandom.current().nextInt(1, 6) | ||
| (random: @switch) match { | ||
| case 1 => Source.single(index) | ||
| case 2 => Source(List(index)) | ||
| case 3 => Source.fromJavaStream(() => Collections.singleton(index).stream()) | ||
| case 4 => Source.future(Future.successful(index)) | ||
| case 5 => Source.future(after(1.millis)(Future.successful(index))) | ||
| case _ => throw new IllegalStateException("unexpected") | ||
| } | ||
| } | ||
| val sum = (0 until nums).sum | ||
| (sum, seq) | ||
| } | ||
|
|
||
| for (i <- 1 until 129) { | ||
| s"work with generated value presented sources with parallelism: $i " in { | ||
| val (sum, sources @ _) = generateRandomValuePresentedSources(100000) | ||
| Source(sources) | ||
| .flatMapConcat(i, identity(_)) // scala 2.12 can't infer the type of identity | ||
| .runWith(Sink.seq) | ||
| .map(_.sum)(pekko.dispatch.ExecutionContexts.parasitic) | ||
| .futureValue shouldBe sum | ||
| } | ||
| } | ||
|
|
||
| for (i <- 1 until 129) { | ||
| s"work with generated value sequenced sources with parallelism: $i " in { | ||
| val (sum, sources @ _) = generateSequencedValuePresentedSources(100000) | ||
| Source(sources) | ||
| .flatMapConcat(i, identity(_)) // scala 2.12 can't infer the type of identity | ||
| // check the order | ||
| .statefulMap(() => -1)((pre, current) => { | ||
| if (pre + 1 != current) { | ||
| throw new IllegalStateException(s"expected $pre + 1 == $current") | ||
| } | ||
| (current, current) | ||
| }, _ => None) | ||
| .runWith(Sink.seq) | ||
| .map(_.sum)(pekko.dispatch.ExecutionContexts.parasitic) | ||
| .futureValue shouldBe sum | ||
| } | ||
| } | ||
|
|
||
| "work with value presented failed sources" in { | ||
| val ex = new BoomException | ||
| Source( | ||
| List( | ||
| Source.empty[Int], | ||
| Source.single(1), | ||
| Source.empty[Int], | ||
| Source(List(2, 3, 4)), | ||
| Source.future(Future.failed(ex)), | ||
| Source.lazyFuture(() => Future.successful(5)))) | ||
| .flatMapConcat(ThreadLocalRandom.current().nextInt(1, 129), identity) | ||
| .onErrorComplete[BoomException]() | ||
| .runWith(toSeq) | ||
| .futureValue should ===(1 to 4) | ||
| } | ||
|
|
||
| "work with value presented sources when demands slow" in { | ||
| val prob = Source( | ||
| List(Source.empty[Int], Source.single(1), Source(List(2, 3, 4)), Source.lazyFuture(() => Future.successful(5)))) | ||
| .flatMapConcat(ThreadLocalRandom.current().nextInt(1, 129), identity) | ||
| .runWith(TestSink()) | ||
|
|
||
| prob.request(1) | ||
| prob.expectNext(1) | ||
| prob.expectNoMessage(1.seconds) | ||
| prob.request(2) | ||
| prob.expectNext(2, 3) | ||
| prob.expectNoMessage(1.seconds) | ||
| prob.request(2) | ||
| prob.expectNext(4, 5) | ||
| prob.expectComplete() | ||
| } | ||
|
|
||
| val parallelism = ThreadLocalRandom.current().nextInt(4, 65) | ||
| s"can do pre materialization when parallelism > 1, parallelism is $parallelism" in { | ||
| val materializationCounter = new AtomicInteger(0) | ||
| val prob = Source(1 to (parallelism * 3)) | ||
| .flatMapConcat( | ||
| parallelism, | ||
| value => { | ||
| Source | ||
| .lazySingle(() => { | ||
| materializationCounter.incrementAndGet() | ||
| value | ||
| }) | ||
| .buffer(1, overflowStrategy = OverflowStrategy.backpressure) | ||
| }) | ||
| .runWith(TestSink()) | ||
|
|
||
| expectNoMessage(1.seconds) | ||
| materializationCounter.get() shouldBe 0 | ||
|
|
||
| prob.request(1) | ||
| prob.expectNext(1.seconds, 1) | ||
| expectNoMessage(1.seconds) | ||
| materializationCounter.get() shouldBe (parallelism + 1) | ||
| materializationCounter.set(0) | ||
|
|
||
| prob.request(2) | ||
| prob.expectNextN(List(2, 3)) | ||
| expectNoMessage(1.seconds) | ||
| materializationCounter.get() shouldBe 2 | ||
| materializationCounter.set(0) | ||
|
|
||
| prob.request(parallelism - 3) | ||
| prob.expectNextN(4 to parallelism) | ||
| expectNoMessage(1.seconds) | ||
| materializationCounter.get() shouldBe (parallelism - 3) | ||
| materializationCounter.set(0) | ||
|
|
||
| prob.request(parallelism) | ||
| prob.expectNextN(parallelism + 1 to parallelism * 2) | ||
| expectNoMessage(1.seconds) | ||
| materializationCounter.get() shouldBe parallelism | ||
| materializationCounter.set(0) | ||
|
|
||
| prob.request(parallelism) | ||
| prob.expectNextN(parallelism * 2 + 1 to parallelism * 3) | ||
| expectNoMessage(1.seconds) | ||
| materializationCounter.get() shouldBe 0 | ||
| prob.expectComplete() | ||
| } | ||
| } | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.