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

frog/minfrog

 #!/usr/bin/env node
 //  ********** Library dart:core **************
 //  ********** Natives dart:core **************
 function $throw(e) {
   // If e is not a value, we can use V8's captureStackTrace utility method.
   // TODO(jmesserly): capture the stack trace on other JS engines.
   if (e && (typeof e == 'object') && Error.captureStackTrace) {
     // TODO(jmesserly): this will clobber the e.stack property
     Error.captureStackTrace(e, $throw);
   }
@@ skipping 229 matching lines @@
 };
 Object.prototype.isSubtypeOf$1 = function($0) {
   return this.noSuchMethod("isSubtypeOf", [$0]);
 };
 Object.prototype.iterator$0 = function() {
   return this.noSuchMethod("iterator", []);
 };
 Object.prototype.last$0 = function() {
   return this.noSuchMethod("last", []);
 };
+Object.prototype.map$1 = function($0) {
+  return this.noSuchMethod("map", [$0]);
+};
 Object.prototype.markUsed$0 = function() {
   return this.noSuchMethod("markUsed", []);
 };
 Object.prototype.namesInOrder$1 = function($0) {
   return this.noSuchMethod("namesInOrder", [$0]);
 };
 Object.prototype.needsConversion$1 = function($0) {
   return this.noSuchMethod("needsConversion", [$0]);
 };
 Object.prototype.next$0 = function() {
@@ skipping 333 matching lines @@
 ListFactory.prototype.filter$1 = function($0) {
   return this.filter(to$call$1($0));
 };
 ListFactory.prototype.forEach$1 = function($0) {
   return this.forEach(to$call$1($0));
 };
 ListFactory.prototype.indexOf$1 = ListFactory.prototype.indexOf;
 ListFactory.prototype.isEmpty$0 = ListFactory.prototype.isEmpty;
 ListFactory.prototype.iterator$0 = ListFactory.prototype.iterator;
 ListFactory.prototype.last$0 = ListFactory.prototype.last;
+ListFactory.prototype.map$1 = function($0) {
+  return this.map(to$call$1($0));
+};
 ListFactory.prototype.removeLast$0 = ListFactory.prototype.removeLast;
 ListFactory.prototype.some$1 = function($0) {
   return this.some(to$call$1($0));
 };
 ListFactory.prototype.sort$1 = function($0) {
   return this.sort(to$call$2($0));
 };
 ListFactory_E = ListFactory;
 ListFactory_K = ListFactory;
 ListFactory_dart_core_String = ListFactory;
@@ skipping 481 matching lines @@
     $this.add(value);
   }
   );
 }
 HashSetImplementation.prototype.forEach = function(f) {
   this._backingMap.forEach(function _(key, value) {
     f(key);
   }
   );
 }
+HashSetImplementation.prototype.map = function(f) {
+  var result = new HashSetImplementation();
+  this._backingMap.forEach(function _(key, value) {
+    result.add(f(key));
+  }
+  );
+  return result;
+}
 HashSetImplementation.prototype.filter = function(f) {
   var result = new HashSetImplementation();
   this._backingMap.forEach(function _(key, value) {
     if (f(key)) result.add(key);
   }
   );
   return result;
 }
 HashSetImplementation.prototype.every = function(f) {
   var keys = this._backingMap.getKeys();
@@ skipping 19 matching lines @@
   return this.every(to$call$1($0));
 };
 HashSetImplementation.prototype.filter$1 = function($0) {
   return this.filter(to$call$1($0));
 };
 HashSetImplementation.prototype.forEach$1 = function($0) {
   return this.forEach(to$call$1($0));
 };
 HashSetImplementation.prototype.isEmpty$0 = HashSetImplementation.prototype.isEmpty;
 HashSetImplementation.prototype.iterator$0 = HashSetImplementation.prototype.iterator;
+HashSetImplementation.prototype.map$1 = function($0) {
+  return this.map(to$call$1($0));
+};
 HashSetImplementation.prototype.some$1 = function($0) {
   return this.some(to$call$1($0));
 };
 // ********** Code for HashSetImplementation_E **************
 $inherits(HashSetImplementation_E, HashSetImplementation);
 function HashSetImplementation_E() {
   // Initializers done
   this._backingMap = new HashMapImplementation_E$E();
 }
 // ********** Code for HashSetImplementation_Library **************
@@ skipping 312 matching lines @@
 }
 DoubleLinkedQueue.prototype.some = function(f) {
   var entry = this._sentinel._next;
   while (entry !== this._sentinel) {
     var nextEntry = entry._next;
     if (f(entry._element)) return true;
     entry = nextEntry;
   }
   return false;
 }
+DoubleLinkedQueue.prototype.map = function(f) {
+  var other = new DoubleLinkedQueue();
+  var entry = this._sentinel._next;
+  while (entry !== this._sentinel) {
+    var nextEntry = entry._next;
+    other.addLast(f(entry._element));
+    entry = nextEntry;
+  }
+  return other;
+}
 DoubleLinkedQueue.prototype.filter = function(f) {
   var other = new DoubleLinkedQueue();
   var entry = this._sentinel._next;
   while (entry !== this._sentinel) {
     var nextEntry = entry._next;
     if (f(entry._element)) other.addLast(entry._element);
     entry = nextEntry;
   }
   return other;
 }
 DoubleLinkedQueue.prototype.iterator = function() {
   return new _DoubleLinkedQueueIterator_E(this._sentinel);
 }
 DoubleLinkedQueue.prototype.add$1 = DoubleLinkedQueue.prototype.add;
 DoubleLinkedQueue.prototype.addAll$1 = DoubleLinkedQueue.prototype.addAll;
 DoubleLinkedQueue.prototype.every$1 = function($0) {
   return this.every(to$call$1($0));
 };
 DoubleLinkedQueue.prototype.filter$1 = function($0) {
   return this.filter(to$call$1($0));
 };
 DoubleLinkedQueue.prototype.forEach$1 = function($0) {
   return this.forEach(to$call$1($0));
 };
 DoubleLinkedQueue.prototype.isEmpty$0 = DoubleLinkedQueue.prototype.isEmpty;
 DoubleLinkedQueue.prototype.iterator$0 = DoubleLinkedQueue.prototype.iterator;
 DoubleLinkedQueue.prototype.last$0 = DoubleLinkedQueue.prototype.last;
+DoubleLinkedQueue.prototype.map$1 = function($0) {
+  return this.map(to$call$1($0));
+};
 DoubleLinkedQueue.prototype.removeLast$0 = DoubleLinkedQueue.prototype.removeLast;
 DoubleLinkedQueue.prototype.some$1 = function($0) {
   return this.some(to$call$1($0));
 };
 // ********** Code for DoubleLinkedQueue_E **************
 $inherits(DoubleLinkedQueue_E, DoubleLinkedQueue);
 function DoubleLinkedQueue_E() {}
 // ********** Code for DoubleLinkedQueue_KeyValuePair_K$V **************
 $inherits(DoubleLinkedQueue_KeyValuePair_K$V, DoubleLinkedQueue);
 function DoubleLinkedQueue_KeyValuePair_K$V() {
@@ skipping 238 matching lines @@
   }
   return true;
 }
 Collections.filter = function(source, destination, f) {
   for (var $$i = source.iterator(); $$i.hasNext$0(); ) {
     var e = $$i.next$0();
     if (f(e)) destination.add(e);
   }
   return destination;
 }
+Collections.map = function(source, destination, f) {
+  for (var $$i = source.iterator(); $$i.hasNext$0(); ) {
+    var e = $$i.next$0();
+    destination.add(f(e));
+  }
+  return destination;
+}
 // ********** Code for _Worker **************
 // ********** Code for _ArgumentMismatchException **************
 $inherits(_ArgumentMismatchException, ClosureArgumentMismatchException);
 function _ArgumentMismatchException(_message) {
   this._dart_coreimpl_message = _message;
   // Initializers done
   ClosureArgumentMismatchException.call(this);
 }
 _ArgumentMismatchException.prototype.toString = function() {
   return ("Closure argument mismatch: " + this._dart_coreimpl_message);
@@ skipping 12019 matching lines @@
   $globals._RED_COLOR = '\u001b[31m';
 }
 var const$1 = new EmptyQueueException()/*const EmptyQueueException()*/;
 var const$126 = new IllegalAccessException()/*const IllegalAccessException()*/;
 var const$127 = ImmutableList.ImmutableList$from$factory([])/*const []*/;
 var const$2 = new _DeletedKeySentinel()/*const _DeletedKeySentinel()*/;
 var const$7 = new NoMoreElementsException()/*const NoMoreElementsException()*/;
 var $globals = {};
 $static_init();
 main();