Revert "Rework Element constructors"

lib/dom/frog/dom_frog.dart

 #library('dom');
 
 // Copyright (c) 2011, 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.
 
 // DO NOT EDIT
 // Auto-generated Dart DOM library.
 
 
@@ skipping 1204 matching lines @@
   List<String> getRange(int start, int rangeLength) =>
       _Lists.getRange(this, start, rangeLength, <String>[]);
 
   // -- end List<String> mixins.
 
   bool contains(String string) native;
 
   String item(int index) native;
 }
 
-class _DOMStringMapJs extends _DOMTypeJs implements DOMStringMap native "*DOMStringMap" {
-}
-
 class _DOMTokenListJs extends _DOMTypeJs implements DOMTokenList native "*DOMTokenList" {
 
   final int length;
 
   void add(String token) native;
 
   bool contains(String token) native;
 
   String item(int index) native;
 
@@ skipping 12515 matching lines @@
   bool contains(String string);
 
   String item(int index);
 }
 // 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.
 
 // WARNING: Do not edit - generated code.
 
-interface DOMStringMap {
-}
-// 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.
-
-// WARNING: Do not edit - generated code.
-
 interface DOMTokenList {
 
   final int length;
 
   void add(String token);
 
   bool contains(String token);
 
   String item(int index);
 
@@ skipping 11584 matching lines @@
     if (length < 0) throw new IllegalArgumentException('length');
     if (start < 0) throw new IndexOutOfRangeException(start);
     int end = start + length;
     if (end > a.length) throw new IndexOutOfRangeException(end);
     for (int i = start; i < end; i++) {
       accumulator.add(a[i]);
     }
     return accumulator;
   }
 }