Fixing analyzer issues in DOM libs.

tools/dom/templates/immutable_list_mixin.darttemplate

   // -- start List<$E> mixins.
   // $E is the element type.
 
   // From Iterable<$E>:
 
   Iterator<$E> get iterator {
     // Note: NodeLists are not fixed size. And most probably length shouldn't
     // be cached in both iterator _and_ forEach method. For now caching it
     // for consistency.
     return new FixedSizeListIterator<$E>(this);
   }
 
 $if DEFINE_LENGTH_AS_NUM_ITEMS
   // SVG Collections expose numberOfItems rather than length.
   int get length => numberOfItems;
 $endif
   dynamic reduce(dynamic initialValue, dynamic combine(dynamic, $E)) {
     return IterableMixinWorkaround.reduce(this, initialValue, combine);
   }
 
 $if DEFINE_CONTAINS
   bool contains($E element) => IterableMixinWorkaround.contains(this, element);
 $else
   // contains() defined by IDL.
 $endif
 
   void forEach(void f($E element)) => IterableMixinWorkaround.forEach(this, f);
 
-  String join([String separator]) => IterableMixinWorkaround.joinList(this, separator);
+  String join([String separator]) =>
+      IterableMixinWorkaround.joinList(this, separator);
 
   List mappedBy(f($E element)) => IterableMixinWorkaround.mappedByList(this, f);
 
-  Iterable<$E> where(bool f($E element)) => IterableMixinWorkaround.where(this, f);
+  Iterable<$E> where(bool f($E element)) =>
+      IterableMixinWorkaround.where(this, f);
 
   bool every(bool f($E element)) => IterableMixinWorkaround.every(this, f);
 
   bool any(bool f($E element)) => IterableMixinWorkaround.any(this, f);
 
   List<$E> toList() => new List<$E>.from(this);
   Set<$E> toSet() => new Set<$E>.from(this);
 
   bool get isEmpty => this.length == 0;
 
@@ skipping 47 matching lines @@
 $endif
 
 $if DEFINE_CLEAR
   void clear() {
     throw new UnsupportedError("Cannot clear immutable List.");
   }
 $else
   // clear() defined by IDL.
 $endif
 
+  List<$E> get reversed =>
+      new ReversedListView<$E>(this, 0, null);
+
   void sort([int compare($E a, $E b)]) {
     throw new UnsupportedError("Cannot sort immutable List.");
   }
 
   int indexOf($E element, [int start = 0]) =>
       Lists.indexOf(this, element, start, this.length);
 
   int lastIndexOf($E element, [int start]) {
     if (start == null) start = length - 1;
     return Lists.lastIndexOf(this, element, start);
   }
 
   $E get first {
     if (this.length > 0) return this[0];
     throw new StateError("No elements");
   }
 
   $E get last {
     if (this.length > 0) return this[this.length - 1];
     throw new StateError("No elements");
   }
 
   $E get single {
     if (length == 1) return this[0];
     if (length == 0) throw new StateError("No elements");
     throw new StateError("More than one element");
   }
 
-  $E min([int compare($E a, $E b)]) => IterableMixinWorkaround.min(this, compare);
+  $E min([int compare($E a, $E b)]) =>
+      IterableMixinWorkaround.min(this, compare);
 
-  $E max([int compare($E a, $E b)]) => IterableMixinWorkaround.max(this, compare);
+  $E max([int compare($E a, $E b)]) =>
+      IterableMixinWorkaround.max(this, compare);
 
   $E removeAt(int pos) {
     throw new UnsupportedError("Cannot remove from immutable List.");
   }
 
   $E removeLast() {
     throw new UnsupportedError("Cannot remove from immutable List.");
   }
 
   void remove(Object object) {
@@ skipping 25 matching lines @@
   }
 
   void insertRange(int start, int rangeLength, [$E initialValue]) {
     throw new UnsupportedError("Cannot insertRange on immutable List.");
   }
 
   List<$E> getRange(int start, int rangeLength) =>
       Lists.getRange(this, start, rangeLength, <$E>[]);
 
   // -- end List<$E> mixins.