Add XSLTProcessor constructor

client/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 22673 matching lines @@
   Node iterateNext();
 
   Node snapshotItem(int index);
 }
 // 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.
 
 // WARNING: Do not edit - generated code.
 
-interface XSLTProcessor {
+interface XSLTProcessor default _XSLTProcessorFactoryProvider {
+
+  XSLTProcessor();
 
   void clearParameters();
 
   String getParameter(String namespaceURI, String localName);
 
   void importStylesheet(Node stylesheet);
 
   void removeParameter(String namespaceURI, String localName);
 
   void reset();
@@ skipping 739 matching lines @@
 
 class _WebSocketFactoryProvider {
 
   factory WebSocket(String url) native '''return new WebSocket(url);''';
 }
 
 class _XMLHttpRequestFactoryProvider {
 
   factory XMLHttpRequest() native '''return new XMLHttpRequest();''';
 }
+
+class _XSLTProcessorFactoryProvider {
+
+  factory XSLTProcessor() native '''return new XSLTProcessor();''';
+}
 // 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.
 
 // Iterator for arrays with fixed size.
 class _FixedSizeListIterator<T> extends _VariableSizeListIterator<T> {
   _FixedSizeListIterator(List<T> array)
       : super(array),
         _length = array.length;
 
@@ skipping 81 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;
   }
 }