Let's have Set implement forEach, like Map does.

git-svn-id: svn+ssh://src.earth.threerings.net/narya/trunk@5500 542714f4-19e9-0310-aa3c-eee0fc999fb1
This commit is contained in:
Par Winzell
2008-11-04 18:21:29 +00:00
parent 14755a6cea
commit 4bc5627d82
3 changed files with 18 additions and 0 deletions
+7
View File
@@ -76,6 +76,13 @@ public class HashSet
return (_hashMap.containsKey(o));
}
public function forEach (fn :Function) :void
{
_hashMap.forEach(function (key :Object, val :Object) :void {
fn(key);
});
}
public function size () :int
{
return (_hashMap.size());