fix all instances of "the the"

pkg/compiler/lib/src/cps_ir/loop_hierarchy.dart

 // Copyright (c) 2015, 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.
 
 library dart2js.cps_ir.loop_hierarchy;
 
 import 'cps_ir_nodes.dart';
 import 'cps_fragment.dart';
 
 /// Determines the effective nesting of loops.
@@ skipping 116 matching lines @@
           loopTarget[node.falseContinuation]);
     } else if (node == null) {
       // If the code ends abruptly, use the exit loop provided in [update].
       target = _exitLoop;
     } else {
       assert(node is Unreachable || node is Throw || node == null);
     }
     return _markInnerLoop(target, catchLoop);
   }
 
-  /// Returns the the innermost loop that effectively encloses both
+  /// Returns the innermost loop that effectively encloses both
   /// c1 and c2 (or `null` if there is no such loop).
   Continuation lowestCommonAncestor(Continuation c1, Continuation c2) {
     int d1 = getDepth(c1), d2 = getDepth(c2);
     while (c1 != c2) {
       if (d1 <= d2) {
         c2 = getEnclosingLoop(c2);
         d2 = getDepth(c2);
       } else {
         c1 = getEnclosingLoop(c1);
         d1 = getDepth(c1);
@@ skipping 18 matching lines @@
   /// surrounding the inserted fragment.
   void update(CpsFragment fragment,
       {Continuation exitLoop, Continuation catchLoop}) {
     if (fragment.isEmpty) return;
     _exitLoop = exitLoop;
     _currentDepth = getDepth(exitLoop);
     _processBlock(fragment.root, catchLoop);
     _exitLoop = null;
   }
 }