Typing fixes to eliminate casts/dcalls

tool/input_sdk/lib/collection/iterable.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.
 
 part of dart.collection;
 
 /**
  * This [Iterable] mixin implements all [Iterable] members except `iterator`.
  *
  * All other methods are implemented in terms of `iterator`.
@@ skipping 102 matching lines @@
 
   Iterable<E> skip(int n) {
     return new SkipIterable<E>(this, n);
   }
 
   Iterable<E> skipWhile(bool test(E value)) {
     return new SkipWhileIterable<E>(this, test);
   }
 
   E get first {
-    Iterator it = iterator;
+    Iterator<E> it = iterator;
     if (!it.moveNext()) {
       throw IterableElementError.noElement();
     }
     return it.current;
   }
 
   E get last {
-    Iterator it = iterator;
+    Iterator<E> it = iterator;
     if (!it.moveNext()) {
       throw IterableElementError.noElement();
     }
     E result;
     do {
       result = it.current;
     } while(it.moveNext());
     return result;
   }
 
   E get single {
-    Iterator it = iterator;
+    Iterator<E> it = iterator;
     if (!it.moveNext()) throw IterableElementError.noElement();
     E result = it.current;
     if (it.moveNext()) throw IterableElementError.tooMany();
     return result;
   }
 
   E firstWhere(bool test(E value), { E orElse() }) {
     for (E element in this) {
       if (test(element)) return element;
     }
@@ skipping 127 matching lines @@
   }
 
   List<E> toList({ bool growable: true }) =>
       new List<E>.from(this, growable: growable);
 
   Set<E> toSet() => new Set<E>.from(this);
 
   int get length {
     assert(this is! EfficientLength);
     int count = 0;
-    Iterator it = iterator;
+    Iterator<E> it = iterator;
     while (it.moveNext()) {
       count++;
     }
     return count;
   }
 
   bool get isEmpty => !iterator.moveNext();
 
   bool get isNotEmpty => !isEmpty;
 
   Iterable<E> take(int n) {
     return new TakeIterable<E>(this, n);
   }
 
   Iterable<E> takeWhile(bool test(E value)) {
     return new TakeWhileIterable<E>(this, test);
   }
 
   Iterable<E> skip(int n) {
     return new SkipIterable<E>(this, n);
   }
 
   Iterable<E> skipWhile(bool test(E value)) {
     return new SkipWhileIterable<E>(this, test);
   }
 
   E get first {
-    Iterator it = iterator;
+    Iterator<E> it = iterator;
     if (!it.moveNext()) {
       throw IterableElementError.noElement();
     }
     return it.current;
   }
 
   E get last {
-    Iterator it = iterator;
+    Iterator<E> it = iterator;
     if (!it.moveNext()) {
       throw IterableElementError.noElement();
     }
     E result;
     do {
       result = it.current;
     } while(it.moveNext());
     return result;
   }
 
   E get single {
-    Iterator it = iterator;
+    Iterator<E> it = iterator;
     if (!it.moveNext()) throw IterableElementError.noElement();
     E result = it.current;
     if (it.moveNext()) throw IterableElementError.tooMany();
     return result;
   }
 
   E firstWhere(bool test(E value), { E orElse() }) {
     for (E element in this) {
       if (test(element)) return element;
     }
@@ skipping 241 matching lines @@
         length += ELLIPSIS_SIZE + OVERHEAD;
       }
     }
     if (elision != null) {
       parts.add(elision);
     }
     parts.add(penultimateString);
     parts.add(ultimateString);
   }
 }