Make first and last getters.

lib/compiler/implementation/ssa/codegen.dart

 // Copyright (c) 2012, the Dart project authors.  Please see the AUTHORS file
 // for details. All rights reserved. Use of this source code is governed by a
 // BSD-style license that can be found in the LICENSE file.
 
 class SsaCodeGeneratorTask extends CompilerTask {
 
   final JavaScriptBackend backend;
 
   SsaCodeGeneratorTask(JavaScriptBackend backend)
       : this.backend = backend,
@@ skipping 333 matching lines @@
       attachLocation(expression, instruction);
     }
     expressionStack.add(expression);
   }
 
   js.Expression pop() {
     return expressionStack.removeLast();
   }
 
   attachLocationToLast(HInstruction instruction) {
-    attachLocation(expressionStack.last(), instruction);
+    attachLocation(expressionStack.last, instruction);
   }
 
   js.Node attachLocation(js.Node jsNode, HInstruction instruction) {
     jsNode.sourcePosition = instruction.sourcePosition;
     return jsNode;
   }
 
   js.Node attachLocationRange(js.Node jsNode,
                               SourceFileLocation sourcePosition,
                               SourceFileLocation endSourcePosition) {
@@ skipping 2321 matching lines @@
     String label = 'L${labelId++}';
     labels.addLast(label);
     return label;
   }
 
   String popLabel() {
     return labels.removeLast();
   }
 
   String currentLabel() {
-    return labels.last();
+    return labels.last;
   }
 
   js.VariableUse generateStateUse()
       => new js.VariableUse(variableNames.stateName);
 
   HBasicBlock beginGraph(HGraph graph) {
     propagator = new SsaBailoutPropagator(compiler, generateAtUseSite);
     propagator.visitGraph(graph);
     // TODO(ngeoffray): We could avoid generating the state at the
     // call site for non-complex bailout methods.
@@ skipping 108 matching lines @@
       i++;
     }
     setupBlock.statements.add(new js.Break(null));
     js.Case setupClause =
         new js.Case(new js.LiteralNumber('${node.state}'), setupBlock);
     (setup as js.Switch).cases.add(setupClause);
   }
 
   void startBailoutCase(List<HBailoutTarget> bailouts1,
                         [List<HBailoutTarget> bailouts2 = const []]) {
-    if (!defaultClauseUsedInBailoutStack.last() &&
+    if (!defaultClauseUsedInBailoutStack.last &&
         bailouts1.length + bailouts2.length >= 2) {
       currentContainer = new js.Block.empty();
       currentBailoutSwitch.cases.add(new js.Default(currentContainer));
       int len = defaultClauseUsedInBailoutStack.length;
       defaultClauseUsedInBailoutStack[len - 1] = true;
     } else {
       _handleBailoutCase(bailouts1);
       _handleBailoutCase(bailouts2);
-      currentContainer = currentBailoutSwitch.cases.last().body;
+      currentContainer = currentBailoutSwitch.cases.last.body;
     }
   }
 
   void _handleBailoutCase(List<HBailoutTarget> targets) {
     for (int i = 0, len = targets.length; i < len; i++) {
       js.LiteralNumber expr = new js.LiteralNumber('${targets[i].state}');
       currentBailoutSwitch.cases.add(new js.Case(expr, new js.Block.empty()));
     }
   }
 
@@ skipping 145 matching lines @@
   if (leftType.canBeNull() && rightType.canBeNull()) {
     if (left.isConstantNull() || right.isConstantNull() ||
         (leftType.isPrimitive() && leftType == rightType)) {
       return '==';
     }
     return null;
   } else {
     return '===';
   }
 }