blob: 45ca39fee4425f709d2edd9afb52c93d30594842 (
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
50
51
|
/* NSC -- new Scala compiler
* Copyright 2005-2013 LAMP/EPFL
* @author Martin Odersky
*/
package scala.tools.nsc
package backend
import scala.collection.mutable
/**
* Simple implementation of a worklist algorithm. A processing
* function is applied repeatedly to the first element in the
* worklist, as long as the stack is not empty.
*
* The client class should mix-in this class and initialize the worklist
* field and define the `processElement` method. Then call the `run` method
* providing a function that initializes the worklist.
*
* @author Martin Odersky
* @version 1.0
* @see [[scala.tools.nsc.backend.icode.Linearizers]]
*/
trait WorklistAlgorithm {
type Elem
type WList = mutable.Stack[Elem]
val worklist: WList
/**
* Run the iterative algorithm until the worklist remains empty.
* The initializer is run once before the loop starts and should
* initialize the worklist.
*/
def run(initWorklist: => Unit) = {
initWorklist
while (worklist.nonEmpty)
processElement(dequeue)
}
/**
* Process the current element from the worklist.
*/
def processElement(e: Elem): Unit
/**
* Remove and return the first element to be processed from the worklist.
*/
def dequeue: Elem
}
|
