blob: 315e7bea51d6ba44e16f8e8c1c5ea5a86c204736 (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
|
/**
* Copyright (C) 2009-2011 Scalable Solutions AB <http://scalablesolutions.se>
*/
package akka.routing
import akka.actor.ActorRef
import scala.collection.JavaConversions._
import scala.collection.immutable.Seq
/**
* An Iterator that is either always empty or yields an infinite number of Ts.
*/
trait InfiniteIterator[T] extends Iterator[T] {
val items: Seq[T]
}
/**
* CyclicIterator is a round-robin style InfiniteIterator that cycles the supplied List.
*/
case class CyclicIterator[T](val items: Seq[T]) extends InfiniteIterator[T] {
def this(items: java.util.List[T]) = this(items.toList)
@volatile
private[this] var current: Seq[T] = items
def hasNext = items != Nil
def next = {
val nc = if (current == Nil) items else current
current = nc.tail
nc.head
}
override def exists(f: T => Boolean): Boolean = items.exists(f)
}
/**
* This InfiniteIterator always returns the Actor that has the currently smallest mailbox
* useful for work-stealing.
*/
case class SmallestMailboxFirstIterator(val items: Seq[ActorRef]) extends InfiniteIterator[ActorRef] {
def this(items: java.util.List[ActorRef]) = this(items.toList)
def hasNext = items != Nil
def next = items.reduceLeft((a1, a2) => if (a1.mailboxSize < a2.mailboxSize) a1 else a2)
override def exists(f: ActorRef => Boolean): Boolean = items.exists(f)
}
|
