Update the V8 benchmark suite with the following fixes:...

benchmarks/deltablue.js

 // Copyright 2008 the V8 project authors. All rights reserved.
 // Copyright 1996 John Maloney and Mario Wolczko.
 
 // This program is free software; you can redistribute it and/or modify
 // it under the terms of the GNU General Public License as published by
 // the Free Software Foundation; either version 2 of the License, or
 // (at your option) any later version.
 //
 // This program is distributed in the hope that it will be useful,
 // but WITHOUT ANY WARRANTY; without even the implied warranty of
 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 // GNU General Public License for more details.
 //
 // You should have received a copy of the GNU General Public License
 // along with this program; if not, write to the Free Software
 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 
 
 // This implementation of the DeltaBlue benchmark is derived
 // from the Smalltalk implementation by John Maloney and Mario
 // Wolczko. Some parts have been translated directly, whereas
 // others have been modified more aggresively to make it feel
 // more like a JavaScript program.
 
 
-var DeltaBlue = new BenchmarkSuite('DeltaBlue', 71104, [
+var DeltaBlue = new BenchmarkSuite('DeltaBlue', 30282, [
   new Benchmark('DeltaBlue', deltaBlue)
 ]);
 
 
 /**
- * A JavaScript implementation of the DeltaBlue constrain-solving
+ * A JavaScript implementation of the DeltaBlue constraint-solving
  * algorithm, as described in:
  *
  * "The DeltaBlue Algorithm: An Incremental Constraint Hierarchy Solver"
  *   Bjorn N. Freeman-Benson and John Maloney
  *   January 1990 Communications of the ACM,
  *   also available as University of Washington TR 89-08-06.
  *
  * Beware: this benchmark is written in a grotesque style where
  * the constraint model is built by side-effects from constructors.
  * I've kept it this way to avoid deviating too much from the original
@@ skipping 299 matching lines @@
   BinaryConstraint.superConstructor.call(this, strength);
   this.v1 = var1;
   this.v2 = var2;
   this.direction = Direction.NONE;
   this.addConstraint();
 }
 
 BinaryConstraint.inheritsFrom(Constraint);
 
 /**
- * Decides if this constratint can be satisfied and which way it
+ * Decides if this constraint can be satisfied and which way it
  * should flow based on the relative strength of the variables related,
  * and record that decision.
  */
 BinaryConstraint.prototype.chooseMethod = function (mark) {
   if (this.v1.mark == mark) {
-    this.direction = (this.v1.mark != mark && Strength.stronger(this.strength, this.v2.walkStrength))
+    this.direction = (this.v2.mark != mark && Strength.stronger(this.strength, this.v2.walkStrength))
       ? Direction.FORWARD
       : Direction.NONE;
   }
   if (this.v2.mark == mark) {
     this.direction = (this.v1.mark != mark && Strength.stronger(this.strength, this.v1.walkStrength))
       ? Direction.BACKWARD
       : Direction.NONE;
   }
   if (Strength.weaker(this.v1.walkStrength, this.v2.walkStrength)) {
     this.direction = Strength.stronger(this.strength, this.v1.walkStrength)
@@ skipping 502 matching lines @@
   edit.destroyConstraint();
 }
 
 // Global variable holding the current planner.
 var planner = null;
 
 function deltaBlue() {
   chainTest(100);
   projectionTest(100);
 }