问题
I have an operator/component in Akka stream that aims to compute a value within a window of 5 seconds. So, I created my operator/component using TimerGraphStageLogic
which you can see on the code below. In order to test it I created 2 sources, one that increments and the other that decrements, then I merge them using the Merge
shape, then I use my windowFlowShape
, and finally emit them in a Sink
shape. I ensure that the TimerGraphStageLogic is working because I tested it in another PoC. In this example I am justing replacing the generic type T
to Int
since I have to specify what my window will aggregate.
However, my problem is that I cannot aggregate the Int
values inside the window stage operator. I receive an error in runtime when I try to execute sum = sum + elem
that says:
overloaded method value + with alternatives:
(x: scala.Int)scala.Int <and>
(x: Char)scala.Int <and>
(x: Short)scala.Int <and>
(x: Byte)scala.Int
cannot be applied to (Int(in class WindowProcessingTimerFlow))
sum = sum + elem
Here is my code which compiles but throws the above error in runtime:
import akka.actor.ActorSystem
import akka.stream._
import akka.stream.scaladsl.{Flow, GraphDSL, Merge, RunnableGraph, Sink, Source}
import akka.stream.stage._
import scala.collection.mutable
import scala.concurrent.duration._
object StreamOpenGraphWindow {
def main(args: Array[String]): Unit = {
run()
}
def run() = {
implicit val system = ActorSystem("StreamOpenGraphWindow")
val sourceNegative = Source(Stream.from(0, -1)).throttle(1, 1 second)
val sourcePositive = Source(Stream.from(0)).throttle(1, 1 second)
// Step 1 - setting up the fundamental for a stream graph
val windowRunnableGraph = RunnableGraph.fromGraph(
GraphDSL.create() { implicit builder =>
import GraphDSL.Implicits._
// Step 2 - create shapes
val mergeShape = builder.add(Merge[Int](2))
val windowFlow = Flow.fromGraph(new WindowProcessingTimerFlow[Int](5 seconds))
val windowFlowShape = builder.add(windowFlow)
val sinkShape = builder.add(Sink.foreach[Int](x => println(s"sink: $x")))
// Step 3 - tying up the components
sourceNegative ~> mergeShape.in(0)
sourcePositive ~> mergeShape.in(1)
mergeShape.out ~> windowFlowShape ~> sinkShape
// Step 4 - return the shape
ClosedShape
}
)
// run the graph and materialize it
val graph = windowRunnableGraph.run()
}
// step 0: define the shape
class WindowProcessingTimerFlow[Int](silencePeriod: FiniteDuration) extends GraphStage[FlowShape[Int, Int]] {
// step 1: define the ports and the component-specific members
val in = Inlet[Int]("WindowProcessingTimerFlow.in")
val out = Outlet[Int]("WindowProcessingTimerFlow.out")
// step 3: create the logic
override def createLogic(inheritedAttributes: Attributes): GraphStageLogic = new TimerGraphStageLogic(shape) {
// mutable state
val batch = new mutable.Queue[Int]
var open = false
// step 4: define mutable state implement my logic here
setHandler(in, new InHandler {
override def onPush(): Unit = {
try {
val nextElement = grab(in)
batch.enqueue(nextElement)
if (open) {
pull(in) // send demand upstream signal, asking for another element
} else {
var sum: scala.Int = 0
val set: Iterable[Int] = batch.dequeueAll(_ => true).to[collection.immutable.Iterable]
set.toList.foreach { elem =>
sum = sum + elem // ************* WHY I CANNOT DO IT? *************
}
push(out, sum)
open = true
scheduleOnce(None, silencePeriod)
}
} catch {
case e: Throwable => failStage(e)
}
}
})
setHandler(out, new OutHandler {
override def onPull(): Unit = {
pull(in)
}
})
override protected def onTimer(timerKey: Any): Unit = {
open = false
}
}
// step 2: construct a new shape
override def shape: FlowShape[Int, Int] = FlowShape[Int, Int](in, out)
}
}
回答1:
Because you are creating a type parameter named Int
which shadows the type Int
definition where defining:
class WindowProcessingTimerFlow[Int](silencePeriod: FiniteDuration) extends GraphStage[FlowShape[Int, Int]] {
Try to remove the generic from it:
class WindowProcessingTimerFlow(silencePeriod: FiniteDuration) extends GraphStage[FlowShape[Int, Int]] {
来源:https://stackoverflow.com/questions/65322171/how-do-i-compute-an-aggregation-inside-a-graphstage-in-akka-streams