Added method map to Collection interface and all its implementations (except classes generated fr...

corelib/src/implementation/queue.dart

 // 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.
 
 
 /**
  * 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 187 matching lines @@
   bool some(bool f(E element)) {
     DoubleLinkedQueueEntry<E> entry = _sentinel._next;
     while (entry !== _sentinel) {
       DoubleLinkedQueueEntry<E> nextEntry = entry._next;
       if (f(entry._element)) return true;
       entry = nextEntry;
     }
     return false;
   }
 
+  Queue map(f(E element)) {
+    Queue<E> other = new Queue();

[ahe, 2012/01/05 22:36:54]

Remove <E>.

+    DoubleLinkedQueueEntry<E> entry = _sentinel._next;
+    while (entry !== _sentinel) {
+      DoubleLinkedQueueEntry<E> nextEntry = entry._next;
+      other.addLast(f(entry._element));
+      entry = nextEntry;
+    }
+    return other;
+  }
+
+
   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 16 matching lines @@
   }
 
   E next() {
     if (!hasNext()) {
       throw const NoMoreElementsException();
     }
     _currentEntry = _currentEntry._next;
     return _currentEntry.element;
   }
 }