Add reduce to Queue.

corelib/src/implementation/queue.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.
 
 
 /**
  * An entry in a doubly linked list. It contains a pointer to the next
  * entry, the previous entry, and the boxed element.
  */
 class DoubleLinkedQueueEntry<E> {
@@ skipping 198 matching lines @@
     Queue other = new Queue();
     DoubleLinkedQueueEntry<E> entry = _sentinel._next;
     while (entry !== _sentinel) {
       DoubleLinkedQueueEntry<E> nextEntry = entry._next;
       other.addLast(f(entry._element));
       entry = nextEntry;
     }
     return other;
   }
 
+  Dynamic reduce(Dynamic initialValue,
+                 Dynamic combine(Dynamic previousValue, E element)) {
+    return Collections.reduce(this, initialValue, combine);
+  }
 
   Queue<E> filter(bool f(E element)) {
     Queue<E> other = new Queue<E>();
     DoubleLinkedQueueEntry<E> entry = _sentinel._next;
     while (entry !== _sentinel) {
       DoubleLinkedQueueEntry<E> nextEntry = entry._next;
       if (f(entry._element)) other.addLast(entry._element);
       entry = nextEntry;
     }
     return other;
@@ skipping 21 matching lines @@
   }
 
   E next() {
     if (!hasNext()) {
       throw const NoMoreElementsException();
     }
     _currentEntry = _currentEntry._next;
     return _currentEntry.element;
   }
 }