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
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
|
/* NSC -- new Scala compiler
* Copyright 2005-2006 LAMP/EPFL
* @author Burak Emir
*/
// $Id$
package scala.tools.nsc.matching
import scala.tools.nsc.util.Position
trait PatternNodes requires transform.ExplicitOuter {
import global._
/** Intermediate data structure for algebraic + pattern matcher
*/
class PatternNode {
var pos = FirstPos
var tpe: Type = _
var or: PatternNode = _
var and: PatternNode = _
def bodyToTree(): Tree = this match {
case _b:Body =>
_b.body(0)
}
def getTpe(): Type = tpe
def setType(tpe: Type): Unit = { this.tpe = tpe }
def dup(): PatternNode = {
var res: PatternNode = this match {
case h:Header =>
new Header(h.selector, h.next)
case b:Body=>
new Body(b.bound, b.guard, b.body)
case DefaultPat() =>
DefaultPat()
case ConstrPat(casted) =>
ConstrPat(casted)
case SequencePat(casted, len) =>
SequencePat(casted, len)
case ConstantPat(value) =>
ConstantPat(value)
case VariablePat(tree) =>
VariablePat(tree)
case AltPat(subheader) =>
AltPat(subheader)
case _ =>
error(""); null
}
res.pos = pos
res.tpe = tpe
res.or = or
res.and = and
res
}
def symbol: Symbol = this match {
case UnapplyPat(casted, fn) =>
casted
case ConstrPat(casted) =>
casted
case SequencePat(casted, _) =>
casted
case RightIgnoringSequencePat(casted, _, _) =>
casted
case _ =>
NoSymbol //.NONE
}
def nextH(): PatternNode = this match {
case _h:Header => _h.next
case _ => null
}
def isDefaultPat(): boolean = this match {
case DefaultPat() => true
case _ => false
}
/** returns true if
* p and q are equal (constructor | sequence) type tests, or
* "q matches" => "p matches"
*/
def isSameAs(q: PatternNode): boolean = this match {
case ConstrPat(_) =>
q match {
case ConstrPat(_) =>
isSameType(q.getTpe(), this.getTpe())
case _ =>
false
}
case SequencePat(_, plen) =>
q match {
case SequencePat(_, qlen) =>
(plen == qlen) && isSameType(q.getTpe(), this.getTpe())
case _ =>
false
}
case _ =>
subsumes(q)
}
/** returns true if "q matches" => "p matches"
*/
def subsumes(q:PatternNode): Boolean = this match {
case DefaultPat() =>
q match {
case DefaultPat() =>
true
case _ =>
false
}
case ConstrPat(_) =>
q match {
case ConstrPat(_) =>
isSubType(q.getTpe(), this.getTpe())
case _ =>
false
}
case SequencePat(_, plen) =>
q match {
case SequencePat(_, qlen) =>
(plen == qlen) && isSubType(q.getTpe(), this.getTpe())
case _ =>
false
}
case ConstantPat(pval) =>
q match {
case ConstantPat(qval) =>
pval == qval
case _ =>
false
}
case VariablePat(tree) =>
q match {
case VariablePat(other) =>
(tree.symbol != null) &&
(tree.symbol != NoSymbol) &&
(!tree.symbol.isError) &&
(tree.symbol == other.symbol)
case _ =>
false
}
case _ =>
false
}
override def toString(): String = this match {
case _h:Header =>
"Header(" + _h.selector + ")";
case _b:Body =>
"Body"
case DefaultPat() =>
"DefaultPat"
case ConstrPat(casted) =>
"ConstrPat(" + casted + ")"
case SequencePat(casted, len) =>
"SequencePat(" + casted + ", " + len + "...)"
case RightIgnoringSequencePat(casted, castedRest, minlen) =>
"RightIgnoringSequencePat(" + casted + ", " + castedRest + ", "+ minlen + "...)"
case ConstantPat(value) =>
"ConstantPat(" + value + ")"
case VariablePat(tree) =>
"VariablePat"
case UnapplyPat(casted, fn) =>
"UnapplyPat(" + casted + ")"
case _ =>
"<unknown pat>"
}
def print(indent: String, sb: StringBuffer): StringBuffer = {
val patNode = this
def cont = if (patNode.or != null) patNode.or.print(indent, sb) else sb
def newIndent(s: String) = {
val removeBar: Boolean = (null == patNode.or)
val sb = new StringBuffer()
sb.append(indent)
if (removeBar)
sb.setCharAt(indent.length() - 1, ' ')
var i = 0; while (i < s.length()) {
sb.append(' ')
i = i + 1
}
sb.toString()
}
if (patNode == null)
sb.append(indent).append("NULL")
else
patNode match {
case UnapplyPat(_,fn) =>
sb.append(indent + "UNAPPLY(" + fn + ")").append('\n')
case _h: Header =>
val selector = _h.selector
val next = _h.next
sb.append(indent + "HEADER(" + patNode.getTpe() +
", " + selector + ")").append('\n')
patNode.or.print(indent + "|", sb)
if (next != null)
next.print(indent, sb)
else
sb
case ConstrPat(casted) =>
val s = ("-- " + patNode.getTpe().symbol.name +
"(" + patNode.getTpe() + ", " + casted + ") -> ")
val nindent = newIndent(s)
sb.append(nindent + s).append('\n')
patNode.and.print(nindent, sb)
cont
case SequencePat( casted, plen ) =>
val s = ("-- " + patNode.getTpe().symbol.name + "(" +
patNode.getTpe() +
", " + casted + ", " + plen + ") -> ")
val nindent = newIndent(s)
sb.append(indent + s).append('\n')
patNode.and.print(nindent, sb)
cont
case DefaultPat() =>
sb.append(indent + "-- _ -> ").append('\n')
patNode.and.print(indent.substring(0, indent.length() - 1) +
" ", sb)
cont
case ConstantPat(value) =>
val s = "-- CONST(" + value + ") -> "
val nindent = newIndent(s)
sb.append(indent + s).append('\n')
patNode.and.print( nindent, sb)
cont
case VariablePat(tree) =>
val s = "-- STABLEID(" + tree + ": " + patNode.getTpe() + ") -> "
val nindent = newIndent(s)
sb.append(indent + s).append('\n')
patNode.and.print(nindent, sb)
cont
case AltPat(header) =>
sb.append(indent + "-- ALTERNATIVES:").append('\n')
header.print(indent + " * ", sb)
patNode.and.print(indent + " * -> ", sb)
cont
case _b:Body =>
if ((_b.guard.length == 0) && (_b.body.length == 0))
sb.append(indent + "true").append('\n')
else
sb.append(indent + "BODY(" + _b.body.length + ")").append('\n')
}
} // def print
} // class PatternNode
class Header(sel1: Tree, next1: Header) extends PatternNode {
var selector: Tree = sel1
var next: Header = next1
}
class Body(bound1: Array[Array[ValDef]], guard1:Array[Tree], body1:Array[Tree]) extends PatternNode {
var bound = bound1
var guard = guard1
var body = body1
}
case class DefaultPat()extends PatternNode
case class ConstrPat(casted:Symbol) extends PatternNode
case class UnapplyPat(prod:Symbol, fn:Tree) extends PatternNode
case class ConstantPat(value: Any /*AConstant*/) extends PatternNode
case class VariablePat(tree: Tree) extends PatternNode
case class AltPat(subheader: Header) extends PatternNode
case class SequencePat(casted: Symbol, len: int) extends PatternNode // only used in PatternMatcher
case class RightIgnoringSequencePat(casted: Symbol, castedRest: Symbol, minlen: int) extends PatternNode //PM
/** the environment for a body of a case
* @param owner the owner of the variables created here
*/
class CaseEnv {
// (val owner:Symbol, unit:CompilationUnit)
private var boundVars: Array[ValDef] = new Array[ValDef](4)
private var numVars = 0
/** substitutes a symbol on the right hand side of a ValDef
*
* @param oldSymm ...
* @param newInit ...
*/
def substitute(oldSym: Symbol, newInit: Tree): Unit = {
var i = 0; while (i < numVars) {
if (boundVars(i).rhs.symbol == oldSym) {
boundVars(i) = ValDef(boundVars(i).symbol, newInit)
return
}
i = i + 1
}
}
/**
* @param sym ...
* @param tpe ...
* @param init ...
*/
def newBoundVar(sym: Symbol, tpe: Type, init: Tree): Unit = {
//if(sym == Symbol.NoSymbol ) {
// scala.Predef.Error("can't add variable with NoSymbol");
//}
//sym.setOwner( owner ); // FIXME should be corrected earlier
//@maybe is corrected now? bq
if (numVars == boundVars.length) {
val newVars = new Array[ValDef](numVars * 2)
System.arraycopy(boundVars, 0, newVars, 0, numVars)
this.boundVars = newVars
}
sym.setInfo(tpe)
this.boundVars(numVars) = ValDef(sym, init.duplicate)
numVars = numVars + 1
}
def getBoundVars(): Array[ValDef] = {
val newVars = new Array[ValDef](numVars)
System.arraycopy(boundVars, 0, newVars, 0, numVars)
newVars
}
override def equals(obj: Any): Boolean = {
if (!(obj.isInstanceOf[CaseEnv]))
return false
val env = obj.asInstanceOf[CaseEnv]
if (env.numVars != numVars)
return false
var i = 0; while (i < numVars) {
if ((boundVars(i).name != env.boundVars(i).name) ||
!isSameType(boundVars(i).tpe, env.boundVars(i).tpe) ||
(boundVars(i).rhs != env.boundVars(i).rhs))
return false
i = i + 1
}
true
}
} // class CaseEnv
}
|