public void visitIndexed(JCArrayAccess tree) { genExpr(tree.indexed, tree.indexed.type).load(); genExpr(tree.index, syms.intType).load(); result = items.makeIndexedItem(tree.type); }
public void visitIndexed(JCArrayAccess tree) { genExpr(tree.indexed, tree.indexed.type).load(); genExpr(tree.index, syms.intType).load(); result = items.makeIndexedItem(tree.type); }
public void visitIndexed(JCArrayAccess tree) { genExpr(tree.indexed, tree.indexed.type).load(); genExpr(tree.index, syms.intType).load(); result = items.makeIndexedItem(tree.type); }
public void visitIndexed(JCArrayAccess tree) { genExpr(tree.indexed, tree.indexed.type).load(); genExpr(tree.index, syms.intType).load(); result = items.makeIndexedItem(tree.type); }
public void visitNewArray(JCNewArray tree) { if (tree.elems != null) { Type elemtype = types.elemtype(tree.type); loadIntConst(tree.elems.length()); Item arr = makeNewArray(tree.pos(), tree.type, 1); int i = 0; for (List<JCExpression> l = tree.elems; l.nonEmpty(); l = l.tail) { arr.duplicate(); loadIntConst(i); i++; genExpr(l.head, elemtype).load(); items.makeIndexedItem(elemtype).store(); } result = arr; } else { for (List<JCExpression> l = tree.dims; l.nonEmpty(); l = l.tail) { genExpr(l.head, syms.intType).load(); } result = makeNewArray(tree.pos(), tree.type, tree.dims.length()); } } //where
public void visitNewArray(JCNewArray tree) { if (tree.elems != null) { Type elemtype = types.elemtype(tree.type); loadIntConst(tree.elems.length()); Item arr = makeNewArray(tree.pos(), tree.type, 1); int i = 0; for (List<JCExpression> l = tree.elems; l.nonEmpty(); l = l.tail) { arr.duplicate(); loadIntConst(i); i++; genExpr(l.head, elemtype).load(); items.makeIndexedItem(elemtype).store(); } result = arr; } else { for (List<JCExpression> l = tree.dims; l.nonEmpty(); l = l.tail) { genExpr(l.head, syms.intType).load(); } result = makeNewArray(tree.pos(), tree.type, tree.dims.length()); } } //where
public void visitNewArray(JCNewArray tree) { setTypeAnnotationPositions(tree.pos); if (tree.elems != null) { Type elemtype = types.elemtype(tree.type); loadIntConst(tree.elems.length()); Item arr = makeNewArray(tree.pos(), tree.type, 1); int i = 0; for (List<JCExpression> l = tree.elems; l.nonEmpty(); l = l.tail) { arr.duplicate(); loadIntConst(i); i++; genExpr(l.head, elemtype).load(); items.makeIndexedItem(elemtype).store(); } result = arr; } else { for (List<JCExpression> l = tree.dims; l.nonEmpty(); l = l.tail) { genExpr(l.head, syms.intType).load(); } result = makeNewArray(tree.pos(), tree.type, tree.dims.length()); } } //where
public void visitNewArray(JCNewArray tree) { setTypeAnnotationPositions(tree.pos); if (tree.elems != null) { Type elemtype = types.elemtype(tree.type); loadIntConst(tree.elems.length()); Item arr = makeNewArray(tree.pos(), tree.type, 1); int i = 0; for (List<JCExpression> l = tree.elems; l.nonEmpty(); l = l.tail) { arr.duplicate(); loadIntConst(i); i++; genExpr(l.head, elemtype).load(); items.makeIndexedItem(elemtype).store(); } result = arr; } else { for (List<JCExpression> l = tree.dims; l.nonEmpty(); l = l.tail) { genExpr(l.head, syms.intType).load(); } result = makeNewArray(tree.pos(), tree.type, tree.dims.length()); } } //where