Making the RoutingSpec deterministic for SmallestMailboxFirst
This commit is contained in:
parent
701af67034
commit
5486d9fbb7
1 changed files with 2 additions and 2 deletions
|
|
@ -114,9 +114,9 @@ class RoutingSpec extends WordSpec with MustMatchers {
|
|||
}
|
||||
}).start()
|
||||
|
||||
val d = loadBalancerActor(new SmallestMailboxFirstIterator(t1 :: t2 :: Nil))
|
||||
val d = loadBalancerActor(new SmallestMailboxFirstIterator(t2 :: t1 :: Nil)) //Will pick the last with the smallest mailbox, so make sure t1 is last
|
||||
|
||||
for (i ← 1 to 500) d ! i
|
||||
for (i ← 1 to 500 ) d ! i
|
||||
|
||||
try {
|
||||
latch.await(20 seconds)
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue