使用scala actor框架作为fork-join计算？

import scala.actors.Future
import scala.actors.Futures._

def mergeSort[A <% Ordered[A]](xs : List[A]) : List[A] =  {
  // merge is not interesting,it's sequential.  The complexity lies in keeping it tail recursive
  def merge[A <% Ordered[A]](accum : List[A],left : List[A],right : List[A]) : List[A] = {
    (left,right) match {
      case (lhead::ltail,rhead::rtail) => 
        if (lhead <= rhead) merge(lhead :: accum,ltail,right)
        else merge(rhead :: accum,left,rtail)
      case (Nil,_) => accum reverse_::: right
      case _ => accum reverse_::: left
    }
  }

    // here's the parallel sort bit
  def sort[A <% Ordered[A]](xs : List[A],length : Int) : List[A] =  {
    if (length <= 1) xs
    else {
      val leftLength = length / 2
      val rightLength = length - leftLength
      val (left,right) = xs splitAt leftLength

      // fork
      val leftFork = future { sort(left,leftLength) }
      val rightFork = future { sort(right,rightLength) }

      // join
      val leftJoin = leftFork()
      val rightJoin = rightFork()

      // merge
      merge(Nil,leftJoin,rightJoin)
    }  
  }

  sort(xs,xs.length)
}

现在，这个问题的核心。如果Scala没有期货，你可以根据演员自己写一个。确实。它会看起来或多或少是这样的。

import scala.actors.Actor 
import scala.actors.Actor._

object MyFuture {
  def apply[T](x : => T) : MyFuture[T] = {
    val future = new MyFuture[T]

    val act = actor {
      react {
        case sender : Actor => sender ! (future,x)
      }
    }

    act ! self

    future

  }
}

class MyFuture[A] extends Function0[A] {
  me => 

  lazy val result = receive {
    case (`me`,result) => result.asInstanceOf[A]
  }

  def apply() = result

}

你会这样使用它

scala> val x = MyFuture(28 * 1000)
x: Foo.MyFuture[Int] = <function>

scala> x()
res4: Int = 28000