Revert "Ints don't have "isEven" anymore."

tests/corelib/set_test.dart

 // Copyright (c) 2011, the Dart project authors.  Please see the AUTHORS file
 // for details. All rights reserved. Use of this source code is governed by a
 // BSD-style license that can be found in the LICENSE file.
 
 library set_test;
 
 import "dart:collection";
 
 void testMain(Set create()) {
   Set set = create();
@@ skipping 60 matching lines @@
   set.forEach(testForEach);
   Expect.equals(10 + 9 + 8 + 7 + 6 + 5 + 4 + 3 + 2 + 1, sum);
 
   sum = 0;
 
   mapped.forEach(testForEach);
   Expect.equals(1 + 2 + 5 + 10 + 17 + 26 + 37 + 50 + 65 + 82, sum);
 
   // Test Set.filter.
   testFilter(int val) {
-    return val % 2 == 0;
+    return val.isEven;
   }
 
   Set filtered = set.where(testFilter).toSet();
 
   Expect.equals(5, filtered.length);
 
   Expect.isTrue(filtered.contains(0));
   Expect.isTrue(filtered.contains(2));
   Expect.isTrue(filtered.contains(4));
   Expect.isTrue(filtered.contains(6));
@@ skipping 46 matching lines @@
   Expect.isTrue(filtered.containsAll(intersection));
   Expect.isTrue(intersection.isSubsetOf(set));
   Expect.isTrue(intersection.isSubsetOf(filtered));
 
   // Test Set.union.
   Set twice = create()..addAll([0, 2, 4, 6, 8, 10, 12, 14]);
   Set thrice = create()..addAll([0, 3, 6, 9, 12, 15]);
   Set union = twice.union(thrice);
   Expect.equals(11, union.length);
   for (int i = 0; i < 16; i++) {
-    Expect.equals((i % 2) == 0 || (i % 3) == 0, union.contains(i));
+    Expect.equals(i.isEven || (i % 3) == 0, union.contains(i));
   }
 
   // Test Set.difference.
   Set difference = twice.difference(thrice);
   Expect.equals(5, difference.length);
   for (int i = 0; i < 16; i++) {
-    Expect.equals((i % 2) == 0 && (i % 3) != 0, difference.contains(i));
+    Expect.equals(i.isEven && (i % 3) != 0, difference.contains(i));
   }
   Expect.isTrue(twice.difference(thrice).difference(twice).isEmpty);
 
   // Test Set.addAll.
   List list = new List.fixedLength(10);
   for (int i = 0; i < 10; i++) {
     list[i] = i + 10;
   }
   set.addAll(list);
   Expect.equals(20, set.length);
@@ skipping 15 matching lines @@
   set.clear();
   Expect.equals(0, set.length);
   set.add(11);
   Expect.equals(1, set.length);
 }
 
 main() {
   testMain(() => new Set());
   testMain(() => new HashSet());
 }