is_partitioned.pass.cpp 1.9 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758
  1. //===----------------------------------------------------------------------===//
  2. //
  3. // The LLVM Compiler Infrastructure
  4. //
  5. // This file is distributed under the University of Illinois Open Source
  6. // License. See LICENSE.TXT for details.
  7. //
  8. //===----------------------------------------------------------------------===//
  9. // <algorithm>
  10. // template <class InputIterator, class Predicate>
  11. // bool
  12. // is_partitioned(InputIterator first, InputIterator last, Predicate pred);
  13. #include <algorithm>
  14. #include <cassert>
  15. #include "../../iterators.h"
  16. struct is_odd
  17. {
  18. bool operator()(const int& i) const {return i & 1;}
  19. };
  20. int main()
  21. {
  22. {
  23. const int ia[] = {1, 2, 3, 4, 5, 6};
  24. assert(!std::is_partitioned(input_iterator<const int*>(std::begin(ia)),
  25. input_iterator<const int*>(std::end(ia)),
  26. is_odd()));
  27. }
  28. {
  29. const int ia[] = {1, 3, 5, 2, 4, 6};
  30. assert( std::is_partitioned(input_iterator<const int*>(std::begin(ia)),
  31. input_iterator<const int*>(std::end(ia)),
  32. is_odd()));
  33. }
  34. {
  35. const int ia[] = {2, 4, 6, 1, 3, 5};
  36. assert(!std::is_partitioned(input_iterator<const int*>(std::begin(ia)),
  37. input_iterator<const int*>(std::end(ia)),
  38. is_odd()));
  39. }
  40. {
  41. const int ia[] = {1, 3, 5, 2, 4, 6, 7};
  42. assert(!std::is_partitioned(input_iterator<const int*>(std::begin(ia)),
  43. input_iterator<const int*>(std::end(ia)),
  44. is_odd()));
  45. }
  46. {
  47. const int ia[] = {1, 3, 5, 2, 4, 6, 7};
  48. assert( std::is_partitioned(input_iterator<const int*>(std::begin(ia)),
  49. input_iterator<const int*>(std::begin(ia)),
  50. is_odd()));
  51. }
  52. }