Should resolve infinite recursion with SortedHashMap.

Tip from the pros: when you change a class, you might want to check
the subclasses for possible problems with that change.
:P


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

src/as/com/threerings/util/HashMap.as

@@ -216,7 +216,7 @@ public class HashMap
     public function keys () :Array
     {
         var keys :Array = [];
-        forEach(function (k :*, v :*) :void {
+        forEach0(function (k :*, v :*) :void {
             keys.push(k);
         });
         return keys;
@@ -226,7 +226,7 @@ public class HashMap
     public function values () :Array
     {
         var vals :Array = [];
-        forEach(function (k :*, v :*) :void {
+        forEach0(function (k :*, v :*) :void {
             vals.push(v);
         });
         return vals;
@@ -234,6 +234,15 @@ public class HashMap
 
     /** @inheritDoc */
     public function forEach (fn :Function) :void
+    {
+        forEach0(fn);
+    }
+
+    /**
+     * Internal forEach.
+     * @private
+     */
+    protected function forEach0 (fn :Function) :void
     {
         if (_simpleData != null) {
             for (var key :Object in _simpleData) {