Stoppp using trippple consonants

pkg/front_end/testcases/DeltaBlue.dart

 // Copyright 2011 Google Inc. All Rights Reserved.
 // Copyright 1996 John Maloney and Mario Wolczko
 //
 // This file is part of GNU Smalltalk.
 //
 // GNU Smalltalk 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, or (at your option) any later version.
 //
 // GNU Smalltalk is distributed in the hope that it will be useful, but WITHOUT
@@ skipping 612 matching lines @@
 
 /**
  * This is the standard DeltaBlue benchmark. A long chain of equality
  * constraints is constructed with a stay constraint on one end. An
  * edit constraint is then added to the opposite end and the time is
  * measured for adding and removing this constraint, and extracting
  * and executing a constraint satisfaction plan. There are two cases.
  * In case 1, the added constraint is stronger than the stay
  * constraint and values must propagate down the entire length of the
  * chain. In case 2, the added constraint is weaker than the stay
- * constraint so it cannot be accomodated. The cost in this case is,
+ * constraint so it cannot be accommodated. The cost in this case is,
  * of course, very low. Typical situations lie somewhere between these
  * two extremes.
  */
 void chainTest(int n) {
   planner = new Planner();
   Variable prev = null, first = null, last = null;
   // Build chain of n equality constraints.
   for (int i = 0; i <= n; i++) {
     Variable v = new Variable("v$i", 0);
     if (prev != null) new EqualityConstraint(prev, v, REQUIRED);
@@ skipping 52 matching lines @@
   EditConstraint edit = new EditConstraint(v, PREFERRED);
   Plan plan = planner.extractPlanFromConstraints(<EditConstraint>[edit]);
   for (int i = 0; i < 10; i++) {
     v.value = newValue;
     plan.execute();
   }
   edit.destroyConstraint();
 }
 
 Planner planner;