Use Util.adapt(). Look at this functional programming masterpiece.

I'm not sure how much actual utility is here, and how much I just like the
gee-whiz factor.


git-svn-id: svn+ssh://src.earth.threerings.net/narya/trunk@5731 542714f4-19e9-0310-aa3c-eee0fc999fb1

src/as/com/threerings/util/SortedHashMap.as

@@ -70,9 +70,7 @@ public class SortedHashMap extends HashMap
     override public function values () :Array
     {
         // not very optimal, we need to look up each value from the sorted keys.
-        return keys().map(function (key :Object, ... rest) :Object {
-            return get(key);
-        });
+        return keys().map(Util.adapt(get));
     }
 
     override public function forEach (fn :Function) :void