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
2008-11-04 18:21:29 +00:00
parent 14755a6cea
commit 4bc5627d82
3 changed files with 18 additions and 0 deletions
@@ -41,6 +41,9 @@ public interface Set
    /** Returns true if this set contains the specified element. */
    function contains (o :Object) :Boolean;

+    /** Call the specified function, which accepts an element as an argument. */
+    function forEach (fn :Function) :void;
+
    /** Retuns the number of elements in this set. */
    function size () :int; // @TSC - should this be uint?