Merge pull request #438 from dsimcha/anyAll

Add all to std.algorithm and alias canFind to any for consistency with s...

std/algorithm.d

@@ -7782,14 +7782,22 @@ unittest
     }
 }
 
-// canFind
+/**
+Forwards to $(D any) for backwards compatibility.
+
+$(RED Scheduled for deprecation in August 2012. Please use $(D any) instead.)
+*/
+bool canFind(alias pred, Range)(Range range)
+{
+    return any!pred(range);
+}
+
 /**
 Returns $(D true) if and only if a value $(D v) satisfying the
 predicate $(D pred) can be found in the forward range $(D
 range). Performs $(BIGOH r.length) evaluations of $(D pred).
  */
-
+bool any(alias pred, Range)(Range range)
-bool canFind(alias pred, Range)(Range range)
 if (is(typeof(find!pred(range))))
 {
     return !find!pred(range).empty;
@@ -7801,6 +7809,29 @@ unittest
         writeln("unittest @", __FILE__, ":", __LINE__, " done.");
     auto a = [ 1, 2, 0, 4 ];
     assert(canFind!"a == 2"(a));
+    assert(any!"a == 2"(a));
+}
+
+/**
+Returns $(D true) if and only if all values in $(D range) satisfy the 
+predicate $(D pred).  Performs $(BIGOH r.length) evaluations of $(D pred).
+
+Examples:
+---
+assert(all!"a & 1"([1, 3, 5, 7, 9]));
+assert(!all!"a & 1"([1, 2, 3, 5, 7, 9]));
+---
+*/
+bool all(alias pred, R)(R range)
+if(isInputRange!R && is(typeof(unaryFun!pred(range.front))))
+{
+    return find!(not!(unaryFun!pred))(range).empty;
+}
+
+unittest
+{
+    assert(all!"a & 1"([1, 3, 5, 7, 9]));
+    assert(!all!"a & 1"([1, 2, 3, 5, 7, 9]));
 }
 
 // Scheduled for deprecation.  Use std.range.SortedRange.canFind.