Created
September 29, 2010 19:16
-
-
Save derekjw/603356 to your computer and use it in GitHub Desktop.
This file contains hidden or 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
package org.example | |
import se.scalablesolutions.akka.actor.{Actor, ActorRef} | |
import Actor.{actorOf} | |
import collection.immutable.Queue | |
case class State(value: Int) | |
trait ComputationType | |
case object Add extends ComputationType | |
case object Multiply extends ComputationType | |
trait Message | |
case class Change(state: State) extends Message | |
case class ComputationRequest(computationType: ComputationType, input: Int) extends Message | |
case class ComputationResult(computationType: ComputationType, input: Int, state: Option[State], result: Option[Int]) extends Message | |
abstract class Computer(f: (Int, Int) => Int) extends Actor { | |
var state: Option[State] = None | |
def compute(in: Int): Option[Int] = state.map(s => f(s.value, in)) | |
def receive = { | |
case Change(newState) => state = Some(newState) | |
case ComputationRequest(t, in) => self reply ComputationResult(t, in, state, compute(in)) | |
} | |
} | |
class AddingComputer extends Computer(_ + _) | |
class MultiplyingComputer extends Computer(_ * _) | |
class ComputationRequestQueue(val computer: ActorRef) { | |
private var queue = Queue.empty[ComputationRequest] | |
private var busy = false | |
private def sendRequest(in: ComputationRequest)(implicit sender: Some[ActorRef]) { | |
computer ! in | |
busy = true | |
} | |
def newRequest(in: ComputationRequest)(implicit sender: Some[ActorRef]) { if (busy) (queue = queue.enqueue(in)) else (sendRequest(in)) } | |
def next(implicit sender: Some[ActorRef]) { | |
if (!queue.isEmpty) { | |
val (n, q) = queue.dequeue | |
sendRequest(n) | |
queue = q | |
} else (busy = false) | |
} | |
} | |
class StateManager extends Actor { | |
var state: Option[State] = None | |
val computerQueues: Map[ComputationType, ComputationRequestQueue] = | |
Map(Add -> new ComputationRequestQueue(actorOf[AddingComputer].start), | |
Multiply -> new ComputationRequestQueue(actorOf[MultiplyingComputer].start)) | |
def receive = { | |
case c @ Change(s) => | |
state = Some(s) | |
computerQueues.foreach(q => q._2.computer ! c) | |
case cr @ ComputationRequest(t, _) => | |
computerQueues.get(t).foreach(_.newRequest(cr)) | |
case ComputationResult(t, i, s, r) => | |
computerQueues.get(t).foreach(_.next) | |
println("Results of '"+t+"' with '" + i + "' and '" + s + "' is '" + r + "'") | |
} | |
} | |
object Main { | |
def main(args: Array[String]) { | |
val computers = actorOf[StateManager].start | |
val inputs = List(1,2,3,4,5,6,7,8,9,0) | |
inputs.foreach(i => computers ! ComputationRequest(Add, i)) | |
inputs.foreach(i => computers ! ComputationRequest(Multiply, i)) | |
computers ! Change(State(5)) | |
inputs.foreach(i => computers ! ComputationRequest(Add, i)) | |
inputs.foreach(i => computers ! ComputationRequest(Multiply, i)) | |
computers ! Change(State(0)) | |
inputs.foreach(i => computers ! ComputationRequest(Add, i)) | |
inputs.foreach(i => computers ! ComputationRequest(Multiply, i)) | |
computers ! Change(State(10)) | |
inputs.foreach(i => computers ! ComputationRequest(Add, i)) | |
inputs.foreach(i => computers ! ComputationRequest(Multiply, i)) | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment