fixes #215, removes special case for length

test/codegen/expect/DeltaBlue.js

 dart.library('DeltaBlue', null, /* Imports */[
   'BenchmarkBase',
   'dart/core'
 ], /* Lazy imports */[
 ], function(exports, BenchmarkBase, core) {
   'use strict';
   function main() {
     new DeltaBlue().report();
   }
   dart.fn(main);
@@ skipping 335 matching lines @@
       for (let overridden = c.satisfy(mark); overridden != null; overridden = overridden.satisfy(mark))
         ;
     }
     incrementalRemove(c) {
       let out = c.output();
       c.markUnsatisfied();
       c.removeFromGraph();
       let unsatisfied = this.removePropagateFrom(out);
       let strength = REQUIRED;
       do {
-        for (let i = 0; dart.notNull(i) < dart.notNull(unsatisfied.length); i = dart.notNull(i) + 1) {
+        for (let i = 0; dart.notNull(i) < dart.notNull(unsatisfied[dartx.length]); i = dart.notNull(i) + 1) {
           let u = unsatisfied[dartx.get](i);
           if (dart.equals(u.strength, strength))
             this.incrementalAdd(u);
         }
         strength = strength.nextWeaker();
       } while (!dart.equals(strength, WEAKEST));
     }
     newMark() {
       return this.currentMark = dart.notNull(this.currentMark) + 1;
     }
     makePlan(sources) {
       let mark = this.newMark();
       let plan = new Plan();
       let todo = sources;
-      while (dart.notNull(todo.length) > 0) {
+      while (dart.notNull(todo[dartx.length]) > 0) {
         let c = todo[dartx.removeLast]();
         if (c.output().mark != mark && dart.notNull(c.inputsKnown(mark))) {
           plan.addConstraint(c);
           c.output().mark = mark;
           this.addConstraintsConsumingTo(c.output(), todo);
         }
       }
       return plan;
     }
     extractPlanFromConstraints(constraints) {
       let sources = dart.list([], Constraint);
-      for (let i = 0; dart.notNull(i) < dart.notNull(constraints.length); i = dart.notNull(i) + 1) {
+      for (let i = 0; dart.notNull(i) < dart.notNull(constraints[dartx.length]); i = dart.notNull(i) + 1) {
         let c = constraints[dartx.get](i);
         if (dart.notNull(c.isInput()) && dart.notNull(c.isSatisfied()))
           sources[dartx.add](c);
       }
       return this.makePlan(sources);
     }
     addPropagate(c, mark) {
       let todo = dart.list([c], Constraint);
-      while (dart.notNull(todo.length) > 0) {
+      while (dart.notNull(todo[dartx.length]) > 0) {
         let d = todo[dartx.removeLast]();
         if (d.output().mark == mark) {
           this.incrementalRemove(c);
           return false;
         }
         d.recalculate();
         this.addConstraintsConsumingTo(d.output(), todo);
       }
       return true;
     }
     removePropagateFrom(out) {
       out.determinedBy = null;
       out.walkStrength = WEAKEST;
       out.stay = true;
       let unsatisfied = dart.list([], Constraint);
       let todo = dart.list([out], Variable);
-      while (dart.notNull(todo.length) > 0) {
+      while (dart.notNull(todo[dartx.length]) > 0) {
         let v = todo[dartx.removeLast]();
-        for (let i = 0; dart.notNull(i) < dart.notNull(v.constraints.length); i = dart.notNull(i) + 1) {
+        for (let i = 0; dart.notNull(i) < dart.notNull(v.constraints[dartx.length]); i = dart.notNull(i) + 1) {
           let c = v.constraints[dartx.get](i);
           if (!dart.notNull(c.isSatisfied()))
             unsatisfied[dartx.add](c);
         }
         let determining = v.determinedBy;
-        for (let i = 0; dart.notNull(i) < dart.notNull(v.constraints.length); i = dart.notNull(i) + 1) {
+        for (let i = 0; dart.notNull(i) < dart.notNull(v.constraints[dartx.length]); i = dart.notNull(i) + 1) {
           let next = v.constraints[dartx.get](i);
           if (!dart.equals(next, determining) && dart.notNull(next.isSatisfied())) {
             next.recalculate();
             todo[dartx.add](next.output());
           }
         }
       }
       return unsatisfied;
     }
     addConstraintsConsumingTo(v, coll) {
       let determining = v.determinedBy;
-      for (let i = 0; dart.notNull(i) < dart.notNull(v.constraints.length); i = dart.notNull(i) + 1) {
+      for (let i = 0; dart.notNull(i) < dart.notNull(v.constraints[dartx.length]); i = dart.notNull(i) + 1) {
         let c = v.constraints[dartx.get](i);
         if (!dart.equals(c, determining) && dart.notNull(c.isSatisfied()))
           coll[dartx.add](c);
       }
     }
   }
   dart.setSignature(Planner, {
     methods: () => ({
       incrementalAdd: [dart.void, [Constraint]],
       incrementalRemove: [dart.void, [Constraint]],
       newMark: [core.int, []],
       makePlan: [Plan, [core.List$(Constraint)]],
       extractPlanFromConstraints: [Plan, [core.List$(Constraint)]],
       addPropagate: [core.bool, [Constraint, core.int]],
       removePropagateFrom: [core.List$(Constraint), [Variable]],
       addConstraintsConsumingTo: [dart.void, [Variable, core.List$(Constraint)]]
     })
   });
   class Plan extends core.Object {
     Plan() {
       this.list = dart.list([], Constraint);
     }
     addConstraint(c) {
       this.list[dartx.add](c);
     }
     size() {
-      return this.list.length;
+      return this.list[dartx.length];
     }
     execute() {
-      for (let i = 0; dart.notNull(i) < dart.notNull(this.list.length); i = dart.notNull(i) + 1) {
+      for (let i = 0; dart.notNull(i) < dart.notNull(this.list[dartx.length]); i = dart.notNull(i) + 1) {
         this.list[dartx.get](i).execute();
       }
     }
   }
   dart.setSignature(Plan, {
     methods: () => ({
       addConstraint: [dart.void, [Constraint]],
       size: [core.int, []],
       execute: [dart.void, []]
     })
@@ skipping 87 matching lines @@
   exports.BinaryConstraint = BinaryConstraint;
   exports.ScaleConstraint = ScaleConstraint;
   exports.EqualityConstraint = EqualityConstraint;
   exports.Variable = Variable;
   exports.Planner = Planner;
   exports.Plan = Plan;
   exports.chainTest = chainTest;
   exports.projectionTest = projectionTest;
   exports.change = change;
 });