DASH  0.3.0
AnyOf.h
1 #ifndef DASH__ALGORITHM__ANY_OF_H__
2 #define DASH__ALGORITHM__ANY_OF_H__
3 
4 #include <dash/iterator/GlobIter.h>
5 #include <dash/algorithm/Find.h>
6 
7 
8 namespace dash {
9 
20 template<
21  typename GlobIter,
22  typename UnaryPredicate >
23 bool any_of(
25  GlobIter first,
27  GlobIter last,
29  UnaryPredicate p)
30 {
31  return find_if(first, last, p) != last;
32 }
33 
34 } // namespace dash
35 
36 #endif // DASH__ALGORITHM__ANY_OF_H__
dash
This class is a simple memory pool which holds allocates elements of size ValueType.
Definition: AllOf.h:8
dash::find_if
GlobIter find_if(GlobIter first, GlobIter last, UnaryPredicate predicate)
Returns an iterator to the first element in the range [first,last) that satisfies the predicate p...
Definition: Find.h:104
dash::first
Returns second operand.
Definition: Operation.h:201
dash::GlobIter
Iterator on Partitioned Global Address Space.
Definition: GlobIter.h:45
dash::any_of
bool any_of(GlobIter first, GlobIter last, UnaryPredicate p)
Check whether any element in the range satisfies predicate p.
Definition: AnyOf.h:23