summaryrefslogtreecommitdiff
path: root/sources/scalac
diff options
context:
space:
mode:
authorMartin Odersky <odersky@gmail.com>2003-11-14 16:55:21 +0000
committerMartin Odersky <odersky@gmail.com>2003-11-14 16:55:21 +0000
commit1ce2b54384639ff358071e8965a5cf39a5a43882 (patch)
tree4b17bb9ca078870b163db66db8f3ba77849ade00 /sources/scalac
parentd71d7bb6f1f6924cb27662b73fdcbf2b37bfd3ae (diff)
downloadscala-1ce2b54384639ff358071e8965a5cf39a5a43882.tar.gz
scala-1ce2b54384639ff358071e8965a5cf39a5a43882.tar.bz2
scala-1ce2b54384639ff358071e8965a5cf39a5a43882.zip
*** empty log message ***
Diffstat (limited to 'sources/scalac')
-rw-r--r--sources/scalac/Global.java2
-rw-r--r--sources/scalac/ast/Tree.java.tmpl4
-rw-r--r--sources/scalac/ast/TreeCloner.java2
-rw-r--r--sources/scalac/ast/TreeGen.java18
-rw-r--r--sources/scalac/symtab/Symbol.java6
-rw-r--r--sources/scalac/transformer/AddConstructors.java2
-rw-r--r--sources/scalac/transformer/AddInterfaces.java4
-rw-r--r--sources/scalac/transformer/Erasure.java36
-rw-r--r--sources/scalac/transformer/ExplicitOuterClassesPhase.java4
-rw-r--r--sources/scalac/transformer/TailCall.java8
-rw-r--r--sources/scalac/transformer/matching/CodeFactory.java6
-rw-r--r--sources/scalac/transformer/matching/Label.java4
-rw-r--r--sources/scalac/transformer/matching/LeftTracerInScala.java6
-rw-r--r--sources/scalac/transformer/matching/PatternMatcher.java16
-rw-r--r--sources/scalac/transformer/matching/SequenceMatcher.java4
-rw-r--r--sources/scalac/transformer/matching/TracerInScala.java2
16 files changed, 65 insertions, 59 deletions
diff --git a/sources/scalac/Global.java b/sources/scalac/Global.java
index eeba341b3f..772cddb2e7 100644
--- a/sources/scalac/Global.java
+++ b/sources/scalac/Global.java
@@ -445,7 +445,7 @@ public class Global {
new Tree[] {
last,
make.Literal(last.pos,
- show(last.type())).setType(
+ show(last.getType())).setType(
definitions.JAVA_STRING_TYPE())});
}
TreeList body = new TreeList();
diff --git a/sources/scalac/ast/Tree.java.tmpl b/sources/scalac/ast/Tree.java.tmpl
index e39768b597..dc5c93ed91 100644
--- a/sources/scalac/ast/Tree.java.tmpl
+++ b/sources/scalac/ast/Tree.java.tmpl
@@ -60,7 +60,7 @@ public class Tree {
// Public Methods - tree type
/** Get the type of the node. */
- public Type type() {
+ public Type getType() {
assert type != null : Debug.show(this);
return type;
}
@@ -75,7 +75,7 @@ public class Tree {
/** Get types attached to array of nodes. */
public static Type[] typeOf(Tree[] trees) {
Type[] types = new Type[trees.length];
- for (int i = 0; i < trees.length; i++) types[i] = trees[i].type();
+ for (int i = 0; i < trees.length; i++) types[i] = trees[i].getType();
return types;
}
diff --git a/sources/scalac/ast/TreeCloner.java b/sources/scalac/ast/TreeCloner.java
index 30a63b9255..ff05b4d256 100644
--- a/sources/scalac/ast/TreeCloner.java
+++ b/sources/scalac/ast/TreeCloner.java
@@ -74,7 +74,7 @@ public class TreeCloner extends Transformer {
* type map to the given tree's type.
*/
public Type getTypeFor(Tree tree) {
- return types.apply(tree.type());
+ return types.apply(tree.getType());
}
/** Traverses the given tree and returns a deeply cloned one. */
diff --git a/sources/scalac/ast/TreeGen.java b/sources/scalac/ast/TreeGen.java
index 047a6dfd86..1f18b8a979 100644
--- a/sources/scalac/ast/TreeGen.java
+++ b/sources/scalac/ast/TreeGen.java
@@ -690,9 +690,9 @@ public class TreeGen implements Kinds, Modifiers, TypeTags {
/** Builds an If node with given condition and branches. */
public If If(int pos, Tree cond, Tree thenpart, Tree elsepart) {
global.nextPhase();
- Type type = thenpart.type().isSameAs(elsepart.type())
+ Type type = thenpart.getType().isSameAs(elsepart.getType())
? thenpart.type
- : Type.lub(new Type[] {thenpart.type(), elsepart.type()});
+ : Type.lub(new Type[] {thenpart.getType(), elsepart.getType()});
global.prevPhase();
return If(pos, cond, thenpart, elsepart, type);
}
@@ -722,8 +722,8 @@ public class TreeGen implements Kinds, Modifiers, TypeTags {
Tree otherwise)
{
Type[] types = new Type[bodies.length + 1];
- for (int i = 0; i < bodies.length; i++) types[i] = bodies[i].type();
- types[bodies.length] = otherwise.type();
+ for (int i = 0; i < bodies.length; i++) types[i] = bodies[i].getType();
+ types[bodies.length] = otherwise.getType();
global.nextPhase();
Type type = Type.lub(types);
global.prevPhase();
@@ -938,7 +938,7 @@ public class TreeGen implements Kinds, Modifiers, TypeTags {
/** Builds an CaseDef node with given pattern, guard and body. */
public CaseDef CaseDef(Tree pattern, Tree guard, Tree body) {
CaseDef tree = make.CaseDef(pattern.pos, pattern, guard, body);
- tree.setType(body.type());
+ tree.setType(body.getType());
return tree;
}
@@ -969,9 +969,9 @@ public class TreeGen implements Kinds, Modifiers, TypeTags {
/** Asserts type of given tree is a subtype of given type. */
private boolean assertTreeSubTypeOf(Tree tree, Type expected) {
global.nextPhase();
- assert tree.type().isSubType(expected):
+ assert tree.getType().isSubType(expected):
"\ntree : " + tree +
- "\ntype : " + tree.type() +
+ "\ntype : " + tree.getType() +
"\nexpected: " + expected;
global.prevPhase();
return true;
@@ -1134,8 +1134,8 @@ public class TreeGen implements Kinds, Modifiers, TypeTags {
}
public Tree Cons(int pos, Type elemtpe, Tree hd, Tree tl) {
- assert hd.type().isSubType(elemtpe): elemtpe + " -- " + hd;
- assert tl.type().isSubType(definitions.LIST_TYPE(elemtpe)):
+ assert hd.getType().isSubType(elemtpe): elemtpe + " -- " + hd;
+ assert tl.getType().isSubType(definitions.LIST_TYPE(elemtpe)):
elemtpe + " -- " + tl;
return New(mkPrimaryConstr(pos,
global.definitions
diff --git a/sources/scalac/symtab/Symbol.java b/sources/scalac/symtab/Symbol.java
index 04843818e2..dbc5666727 100644
--- a/sources/scalac/symtab/Symbol.java
+++ b/sources/scalac/symtab/Symbol.java
@@ -923,6 +923,9 @@ public abstract class Symbol implements Modifiers, Kinds {
public Type type() {
return info();
}
+ public Type getType() {
+ return info();
+ }
/** Get type at start of next phase
*/
@@ -1514,6 +1517,9 @@ public abstract class TypeSymbol extends Symbol {
public Type type() {
return primaryConstructor().type().resultType();
}
+ public Type getType() {
+ return primaryConstructor().type().resultType();
+ }
/**
* Get closure at start of current phase. The closure of a symbol
diff --git a/sources/scalac/transformer/AddConstructors.java b/sources/scalac/transformer/AddConstructors.java
index e89ca6fc79..eada0f3ecc 100644
--- a/sources/scalac/transformer/AddConstructors.java
+++ b/sources/scalac/transformer/AddConstructors.java
@@ -265,7 +265,7 @@ public class AddConstructors extends GenTransformer {
return gen.Ident(tree.pos, symbol);
case TypeTerm():
- return gen.TypeTerm(tree.pos, subst.apply(tree.type()));
+ return gen.TypeTerm(tree.pos, subst.apply(tree.getType()));
default:
return super.transform(tree);
diff --git a/sources/scalac/transformer/AddInterfaces.java b/sources/scalac/transformer/AddInterfaces.java
index d6a4727ef7..dd58d55799 100644
--- a/sources/scalac/transformer/AddInterfaces.java
+++ b/sources/scalac/transformer/AddInterfaces.java
@@ -73,7 +73,7 @@ class AddInterfaces extends Transformer {
public Tree transform(Tree tree) {
// Update tree type, to take into account the new (type)
// symbols of enclosing classes / methods.
- Type newTp = tree.type();
+ Type newTp = tree.getType();
if (typeSubst != null) newTp = typeSubst.apply(newTp);
if (thisTypeSubst != null) newTp = thisTypeSubst.apply(newTp);
tree.setType(newTp);
@@ -201,7 +201,7 @@ class AddInterfaces extends Transformer {
&& owner != defs.ANY_CLASS
&& owner != defs.ANYREF_CLASS
&& owner != defs.JAVA_OBJECT_CLASS) {
- Type qualifierType = qualifier.type().bound();
+ Type qualifierType = qualifier.getType().bound();
if (phase.needInterface(qualifierType.symbol())) {
Type castType = qualifierType.baseType(owner);
qualifier = gen.mkAsInstanceOf(qualifier, castType);
diff --git a/sources/scalac/transformer/Erasure.java b/sources/scalac/transformer/Erasure.java
index be4cb30607..ee09f2c502 100644
--- a/sources/scalac/transformer/Erasure.java
+++ b/sources/scalac/transformer/Erasure.java
@@ -141,11 +141,11 @@ public class Erasure extends GenTransformer implements Modifiers {
case New(Template(Tree[] base, Tree[] body)):
assert base.length == 1 && body.length == 0: tree;
- if (tree.type().symbol() == definitions.ARRAY_CLASS) {
+ if (tree.getType().symbol() == definitions.ARRAY_CLASS) {
switch (base[0]) {
case Apply(_, Tree[] args):
assert args.length == 1: tree;
- Type element = getArrayElementType(tree.type()).erasure();
+ Type element = getArrayElementType(tree.getType()).erasure();
Tree size = transform(args[0]);
return genNewUnboxedArray(tree.pos, element, size);
default:
@@ -160,7 +160,7 @@ public class Erasure extends GenTransformer implements Modifiers {
Symbol symbol = fun.symbol();
if (symbol == definitions.ANY_AS) {
assert targs.length == 1 && vargs.length == 0: tree;
- return coerce(getQualifier(fun), targs[0].type().erasure());
+ return coerce(getQualifier(fun), targs[0].getType().erasure());
}
if (symbol == definitions.ANY_IS) {
assert targs.length == 1 && vargs.length == 0: tree;
@@ -203,7 +203,7 @@ public class Erasure extends GenTransformer implements Modifiers {
qualifier = transform(qualifier);
qualifier = coerce(qualifier, symbol.owner().type().erasure());
// Might end up with "box(unbox(...))". That's needed by backend.
- if (isUnboxedType(qualifier.type())) qualifier = box(qualifier);
+ if (isUnboxedType(qualifier.getType())) qualifier = box(qualifier);
return gen.Select(tree.pos, qualifier, symbol);
case Ident(_):
@@ -214,7 +214,7 @@ public class Erasure extends GenTransformer implements Modifiers {
case Block(_):
case If(_, _, _):
case Switch(_, _, _, _):
- return transform(tree, tree.type().fullErasure());
+ return transform(tree, tree.getType().fullErasure());
default:
return super.transform(tree);
@@ -295,8 +295,8 @@ public class Erasure extends GenTransformer implements Modifiers {
/** Coerces the given tree to the given type. */
private Tree coerce(Tree tree, Type pt) {
- if (isSubType(tree.type(), pt)) return tree;
- if (isUnboxedType(tree.type())) {
+ if (isSubType(tree.getType(), pt)) return tree;
+ if (isUnboxedType(tree.getType())) {
if (!isUnboxedType(pt)) return coerce(box(tree), pt);
} else if (isUnboxedType(pt)) {
if (tree.type.symbol() == definitions.ARRAY_CLASS
@@ -307,9 +307,9 @@ public class Erasure extends GenTransformer implements Modifiers {
/** Boxes the given tree. */
private Tree box(Tree tree) {
- Symbol symbol = primitives.getBoxValueSymbol(tree.type());
+ Symbol symbol = primitives.getBoxValueSymbol(tree.getType());
Tree boxtree = gen.mkRef(tree.pos, symbol);
- return tree.type().equals(UNBOXED_UNIT)
+ return tree.getType().equals(UNBOXED_UNIT)
? gen.Block(new Tree[]{tree, gen.mkApply__(boxtree)})
: gen.mkApply_V(boxtree, new Tree[]{tree});
}
@@ -335,7 +335,7 @@ public class Erasure extends GenTransformer implements Modifiers {
/** Generates an application with given function and arguments. */
private Tree genApply(int pos, Tree fun, Tree[] args) {
- switch (fun.type()) {
+ switch (fun.getType()) {
case MethodType(Symbol[] params, Type result):
Tree[] args1 = args;
for (int i = 0; i < args.length; i++) {
@@ -349,7 +349,7 @@ public class Erasure extends GenTransformer implements Modifiers {
}
return gen.mkApply_V(pos, fun, args1);
default:
- throw Debug.abort("illegal type " + fun.type() + " for " + fun);
+ throw Debug.abort("illegal type " + fun.getType() + " for " + fun);
}
}
@@ -389,16 +389,16 @@ public class Erasure extends GenTransformer implements Modifiers {
/** Generates an unboxed array length operation. */
private Tree genUnboxedArrayLength(int pos, Tree array) {
- assert isUnboxedArrayType(array.type()): array;
- Symbol symbol = primitives.getArrayLengthSymbol(array.type());
+ assert isUnboxedArrayType(array.getType()): array;
+ Symbol symbol = primitives.getArrayLengthSymbol(array.getType());
Tree[] args = { array };
return gen.mkApply_V(gen.mkRef(pos, symbol), args);
}
/** Generates an unboxed array get operation. */
private Tree genUnboxedArrayGet(int pos, Tree array, Tree index) {
- assert isUnboxedArrayType(array.type()): array;
- Symbol symbol = primitives.getArrayGetSymbol(array.type());
+ assert isUnboxedArrayType(array.getType()): array;
+ Symbol symbol = primitives.getArrayGetSymbol(array.getType());
index = coerce(index, UNBOXED_INT);
Tree[] args = { array, index };
return gen.mkApply_V(gen.mkRef(pos, symbol), args);
@@ -406,10 +406,10 @@ public class Erasure extends GenTransformer implements Modifiers {
/** Generates an unboxed array set operation. */
private Tree genUnboxedArraySet(int pos, Tree array,Tree index,Tree value){
- assert isUnboxedArrayType(array.type()): array;
- Symbol symbol = primitives.getArraySetSymbol(array.type());
+ assert isUnboxedArrayType(array.getType()): array;
+ Symbol symbol = primitives.getArraySetSymbol(array.getType());
index = coerce(index, UNBOXED_INT);
- value = coerce(value, getArrayElementType(array.type()));
+ value = coerce(value, getArrayElementType(array.getType()));
Tree[] args = { array, index, value };
return gen.mkApply_V(gen.mkRef(pos, symbol), args);
}
diff --git a/sources/scalac/transformer/ExplicitOuterClassesPhase.java b/sources/scalac/transformer/ExplicitOuterClassesPhase.java
index e357570cf4..828bedbd07 100644
--- a/sources/scalac/transformer/ExplicitOuterClassesPhase.java
+++ b/sources/scalac/transformer/ExplicitOuterClassesPhase.java
@@ -308,7 +308,7 @@ public class ExplicitOuterClassesPhase extends Phase {
return gen.Ident(tree.pos, symbol);
case TypeTerm():
- Type type = typeTransformer.apply(tree.type());
+ Type type = typeTransformer.apply(tree.getType());
if (context != null) type = context.subst.apply(type);
return gen.TypeTerm(tree.pos, type);
@@ -330,7 +330,7 @@ public class ExplicitOuterClassesPhase extends Phase {
vargs = Tree.cloneArray(1, vargs);
vargs[0] = qualifier;
}
- Type[] types = getOuterTypeArgs(qualifier.type(), symbol);
+ Type[] types = getOuterTypeArgs(qualifier.getType(), symbol);
if (types.length != 0) {
targs = Tree.cloneArray(types.length, targs);
for (int i = 0; i < types.length; i++)
diff --git a/sources/scalac/transformer/TailCall.java b/sources/scalac/transformer/TailCall.java
index 39095ac5d6..dca3874d23 100644
--- a/sources/scalac/transformer/TailCall.java
+++ b/sources/scalac/transformer/TailCall.java
@@ -126,7 +126,7 @@ public class TailCall extends Transformer {
// The LabelDef needs identifiers as parameters.
Ident [] args = to_ident(newVparams[0]);
// Create a new LabelDef with the new body of the function as the rhs
- Tree labelDef = new ExtLabelDef(newLabel,args,newRhs).setType(newRhs.type());
+ Tree labelDef = new ExtLabelDef(newLabel,args,newRhs).setType(newRhs.getType());
// Create a new function node with the LabelDef as the rhs.
return copy.DefDef(tree,tree.symbol(), newTparams,
newVparams, newTpe, labelDef);
@@ -156,7 +156,7 @@ public class TailCall extends Transformer {
Tree[] newArgs = tail_transform(args,false);
// Redirect the call to the LabelDef.
- Tree newTarget = new ExtIdent(state.newLabel).setType(fun.type());
+ Tree newTarget = new ExtIdent(state.newLabel).setType(fun.getType());
// Indicate that we have inserted a tail call.
state.needLabelDef = true;
return copy.Apply(tree,newTarget,newArgs);
@@ -348,13 +348,13 @@ public class TailCall extends Transformer {
switch (tree[i]) {
case AbsTypeDef(int mods, Name name, Tree bound, Tree lobound):
Ident arg = new ExtIdent(tree[i].symbol());
- arg.setType(tree[i].type());
+ arg.setType(tree[i].getType());
ids[i]= arg;
break;
case ValDef(int mods, Name name, Tree tpe, Tree.Empty):
Ident arg = new ExtIdent(tree[i].symbol());
- arg.setType(tree[i].type());
+ arg.setType(tree[i].getType());
ids[i]= arg;
break;
diff --git a/sources/scalac/transformer/matching/CodeFactory.java b/sources/scalac/transformer/matching/CodeFactory.java
index 32af74e511..b42354e430 100644
--- a/sources/scalac/transformer/matching/CodeFactory.java
+++ b/sources/scalac/transformer/matching/CodeFactory.java
@@ -65,14 +65,14 @@ class CodeFactory extends PatternTool {
* the parameter needs to have type attribute `Sequence[<elemType>]'
*/
Tree newIterator( Tree seqObj ) {
- return newIterator( seqObj, getElemType_Sequence( seqObj.type() ));
+ return newIterator( seqObj, getElemType_Sequence( seqObj.getType() ));
}
// EXPERIMENTAL
Tree newRef( Tree init ) {
//System.out.println( "hello:"+refSym().type() );
return gen.New(gen.mkPrimaryConstr(pos, defs.REF_CLASS,
- new Type[] { init.type() },
+ new Type[] { init.getType() },
new Tree[] { init } ));
}
@@ -204,7 +204,7 @@ class CodeFactory extends PatternTool {
Tree newPair( Tree left, Tree right ) {
return gen.New(gen.mkPrimaryConstr(pos, defs.TUPLE_CLASS[2],
- new Type[] { left.type(), right.type() },
+ new Type[] { left.getType(), right.getType() },
new Tree[] { left, right }));
}
diff --git a/sources/scalac/transformer/matching/Label.java b/sources/scalac/transformer/matching/Label.java
index cbad3ac3bf..d04991c5d3 100644
--- a/sources/scalac/transformer/matching/Label.java
+++ b/sources/scalac/transformer/matching/Label.java
@@ -32,7 +32,7 @@ public class Label {
case TreeLabel( Tree pat ):
switch( pat ) {
case Apply( Tree fun, Tree[] args ):
- return pat.type().hashCode() + args.hashCode();
+ return pat.getType().hashCode() + args.hashCode();
}
return pat.hashCode();
case TypeLabel( Type type ):
@@ -102,7 +102,7 @@ public class Label {
case SimpleLabel( Literal lit ):
return lit.toString()+":p"+p;
case TreeLabel( Tree pat ):
- return pat.type()+":p"+p;
+ return pat.getType()+":p"+p;
}
}
diff --git a/sources/scalac/transformer/matching/LeftTracerInScala.java b/sources/scalac/transformer/matching/LeftTracerInScala.java
index 8146daa898..ad10599f15 100644
--- a/sources/scalac/transformer/matching/LeftTracerInScala.java
+++ b/sources/scalac/transformer/matching/LeftTracerInScala.java
@@ -67,11 +67,11 @@ public class LeftTracerInScala extends TracerInScala {
cf.fresh.newName(Name.fromString( helpName )),
owner,
0)
- .setType( defs.LIST_TYPE( pat.type() )) ;
+ .setType( defs.LIST_TYPE( pat.getType() )) ;
Tree varDef = gen.ValDef( helpVar,
gen.mkDefaultValue( cf.pos,
- defs.LIST_TYPE( pat.type() ))
+ defs.LIST_TYPE( pat.getType() ))
//cf.ignoreValue( )
);
helpVarDefs.add( varDef );
@@ -231,7 +231,7 @@ public class LeftTracerInScala extends TracerInScala {
Tree run = callFun( new Tree[] {
gen.Ident( pos, emptyAccSym ),
- cf.newIterator( selector, selector.type() ),
+ cf.newIterator( selector, selector.getType() ),
gen.mkIntLit( cf.pos, 0 ) });
run = gen.ValDef( resultSym, run );
diff --git a/sources/scalac/transformer/matching/PatternMatcher.java b/sources/scalac/transformer/matching/PatternMatcher.java
index 793cc83a7e..ebd38020d7 100644
--- a/sources/scalac/transformer/matching/PatternMatcher.java
+++ b/sources/scalac/transformer/matching/PatternMatcher.java
@@ -510,9 +510,9 @@ public class PatternMatcher extends PatternTool {
*/
target.and = curHeader = mk.Header(pat.pos, seqType, t);
} else {
- Symbol ts = ((ClassSymbol) casted.type().symbol())
+ Symbol ts = ((ClassSymbol) casted.getType().symbol())
.caseFieldAccessor(index);
- Type accType = casted.type().memberType(ts);
+ Type accType = casted.getType().memberType(ts);
Tree accTree = gen.Select(gen.Ident(pat.pos, casted), ts);
switch (accType) {
// scala case accessor
@@ -738,7 +738,7 @@ public class PatternMatcher extends PatternTool {
public Tree intSwitchToTree() {
//print();
int ncases = numCases(root.and);
- Tree matchError = cf.ThrowMatchError(selector.pos, resultVar.type());
+ Tree matchError = cf.ThrowMatchError(selector.pos, resultVar.getType());
// without a case, we return a match error if there is no default case
if (ncases == 0)
return defaultBody(root.and, matchError);
@@ -785,9 +785,9 @@ public class PatternMatcher extends PatternTool {
patNode = patNode.next();
}
if (defaultBody == null)
- defaultBody = cf.ThrowMatchError(selector.pos, resultVar.type());
+ defaultBody = cf.ThrowMatchError(selector.pos, resultVar.getType());
if (mappings == null) {
- return gen.Switch(selector, new int[0], new Tree[0], defaultBody, resultVar.type());
+ return gen.Switch(selector, new int[0], new Tree[0], defaultBody, resultVar.getType());
} else {
int n = mappings.length();
int[] tags = new int[n];
@@ -798,7 +798,7 @@ public class PatternMatcher extends PatternTool {
bodies[n++] = mappings.body;
mappings = mappings.next;
}
- return gen.Switch(selector, tags, bodies, defaultBody, resultVar.type());
+ return gen.Switch(selector, tags, bodies, defaultBody, resultVar.getType());
}
default:
throw new ApplicationError();
@@ -821,13 +821,13 @@ public class PatternMatcher extends PatternTool {
public Tree generalSwitchToTree() {
TreeList ts = new TreeList();
ts.append(gen.ValDef(root.symbol(), selector));
- ts.append(gen.ValDef(resultVar, gen.mkDefaultValue(selector.pos, resultVar.type())));
+ ts.append(gen.ValDef(resultVar, gen.mkDefaultValue(selector.pos, resultVar.getType())));
ts.append(
gen.If(
selector.pos,
toTree(root.and),
gen.Ident(selector.pos, resultVar),
- cf.ThrowMatchError(selector.pos, resultVar.type())));
+ cf.ThrowMatchError(selector.pos, resultVar.getType())));
return gen.mkBlock(selector.pos, ts.toArray());
}
diff --git a/sources/scalac/transformer/matching/SequenceMatcher.java b/sources/scalac/transformer/matching/SequenceMatcher.java
index 7dccfedee8..11deaf4764 100644
--- a/sources/scalac/transformer/matching/SequenceMatcher.java
+++ b/sources/scalac/transformer/matching/SequenceMatcher.java
@@ -35,7 +35,7 @@ public class SequenceMatcher extends PatternTool {
*/
Tree addBinderToBody( Tree pat, Tree body ) {
- Type elementType = cf.getElemType_Sequence( pat.type() );
+ Type elementType = cf.getElemType_Sequence( pat.getType() );
BindingBerrySethi build = new BindingBerrySethi();
NondetWordAutom left = build.automatonFrom( pat, new Integer(0) );
@@ -152,7 +152,7 @@ public class SequenceMatcher extends PatternTool {
this.cf = new CodeFactory( unit, _m.pos );
- Type seqType = pat[ 0 ].type();
+ Type seqType = pat[ 0 ].getType();
elementType = cf.getElemType_Sequence( seqType );
diff --git a/sources/scalac/transformer/matching/TracerInScala.java b/sources/scalac/transformer/matching/TracerInScala.java
index b2ed49069c..61a51fa809 100644
--- a/sources/scalac/transformer/matching/TracerInScala.java
+++ b/sources/scalac/transformer/matching/TracerInScala.java
@@ -54,7 +54,7 @@ public class TracerInScala extends Autom2Scala {
else
return gen.ValDef( realVar, hv );
*/
- if( realVar.type().isSameAs( hv.type())) {
+ if( realVar.type().isSameAs( hv.getType())) {
return gen.ValDef( realVar, hv ); // e.g. x @ _*
}
return gen.ValDef( realVar, cf.SeqList_head( hv ));