Ver Fonte

[libcxx] [test] Replace _LIBCPP_STD_VER with TEST_STD_VER.

This replaces every occurrence of _LIBCPP_STD_VER in the tests with
TEST_STD_VER. Additionally, for every affected
file, #include "test_macros.h" is being added explicitly if it wasn't
already there.

https://reviews.llvm.org/D26294

git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@286007 91177308-0d34-0410-b5e6-96231b3b80d8
Stephan T. Lavavej há 8 anos atrás
pai
commit
e619862dbf
100 ficheiros alterados com 217 adições e 121 exclusões
  1. 2 1
      test/std/containers/associative/map/map.access/iterator.pass.cpp
  2. 2 1
      test/std/containers/associative/map/map.cons/iter_iter_comp_alloc.pass.cpp
  3. 2 1
      test/std/containers/associative/map/map.ops/count.pass.cpp
  4. 3 2
      test/std/containers/associative/map/map.ops/count1.fail.cpp
  5. 3 2
      test/std/containers/associative/map/map.ops/count2.fail.cpp
  6. 3 2
      test/std/containers/associative/map/map.ops/count3.fail.cpp
  7. 2 1
      test/std/containers/associative/map/map.ops/equal_range.pass.cpp
  8. 3 2
      test/std/containers/associative/map/map.ops/equal_range1.fail.cpp
  9. 3 2
      test/std/containers/associative/map/map.ops/equal_range2.fail.cpp
  10. 3 2
      test/std/containers/associative/map/map.ops/equal_range3.fail.cpp
  11. 2 1
      test/std/containers/associative/map/map.ops/find.pass.cpp
  12. 3 2
      test/std/containers/associative/map/map.ops/find1.fail.cpp
  13. 3 2
      test/std/containers/associative/map/map.ops/find2.fail.cpp
  14. 3 2
      test/std/containers/associative/map/map.ops/find3.fail.cpp
  15. 2 1
      test/std/containers/associative/map/map.ops/lower_bound.pass.cpp
  16. 2 1
      test/std/containers/associative/map/map.ops/lower_bound1.fail.cpp
  17. 2 1
      test/std/containers/associative/map/map.ops/lower_bound2.fail.cpp
  18. 2 1
      test/std/containers/associative/map/map.ops/lower_bound3.fail.cpp
  19. 2 1
      test/std/containers/associative/map/map.ops/upper_bound.pass.cpp
  20. 2 1
      test/std/containers/associative/map/map.ops/upper_bound1.fail.cpp
  21. 2 1
      test/std/containers/associative/map/map.ops/upper_bound2.fail.cpp
  22. 2 1
      test/std/containers/associative/map/map.ops/upper_bound3.fail.cpp
  23. 2 1
      test/std/containers/associative/multimap/iterator.pass.cpp
  24. 2 1
      test/std/containers/associative/multimap/multimap.cons/iter_iter.pass.cpp
  25. 2 1
      test/std/containers/associative/multimap/multimap.ops/count.pass.cpp
  26. 3 2
      test/std/containers/associative/multimap/multimap.ops/count1.fail.cpp
  27. 3 2
      test/std/containers/associative/multimap/multimap.ops/count2.fail.cpp
  28. 3 2
      test/std/containers/associative/multimap/multimap.ops/count3.fail.cpp
  29. 2 1
      test/std/containers/associative/multimap/multimap.ops/equal_range.pass.cpp
  30. 3 2
      test/std/containers/associative/multimap/multimap.ops/equal_range1.fail.cpp
  31. 3 2
      test/std/containers/associative/multimap/multimap.ops/equal_range2.fail.cpp
  32. 3 2
      test/std/containers/associative/multimap/multimap.ops/equal_range3.fail.cpp
  33. 2 1
      test/std/containers/associative/multimap/multimap.ops/find.pass.cpp
  34. 3 2
      test/std/containers/associative/multimap/multimap.ops/find1.fail.cpp
  35. 3 2
      test/std/containers/associative/multimap/multimap.ops/find2.fail.cpp
  36. 3 2
      test/std/containers/associative/multimap/multimap.ops/find3.fail.cpp
  37. 2 1
      test/std/containers/associative/multimap/multimap.ops/lower_bound.pass.cpp
  38. 2 1
      test/std/containers/associative/multimap/multimap.ops/lower_bound1.fail.cpp
  39. 2 1
      test/std/containers/associative/multimap/multimap.ops/lower_bound2.fail.cpp
  40. 2 1
      test/std/containers/associative/multimap/multimap.ops/lower_bound3.fail.cpp
  41. 2 1
      test/std/containers/associative/multimap/multimap.ops/upper_bound.pass.cpp
  42. 2 1
      test/std/containers/associative/multimap/multimap.ops/upper_bound1.fail.cpp
  43. 2 1
      test/std/containers/associative/multimap/multimap.ops/upper_bound2.fail.cpp
  44. 2 1
      test/std/containers/associative/multimap/multimap.ops/upper_bound3.fail.cpp
  45. 2 1
      test/std/containers/associative/multiset/count.pass.cpp
  46. 2 1
      test/std/containers/associative/multiset/equal_range.pass.cpp
  47. 2 1
      test/std/containers/associative/multiset/find.pass.cpp
  48. 2 1
      test/std/containers/associative/multiset/iterator.pass.cpp
  49. 2 1
      test/std/containers/associative/multiset/lower_bound.pass.cpp
  50. 2 1
      test/std/containers/associative/multiset/multiset.cons/initializer_list.pass.cpp
  51. 2 1
      test/std/containers/associative/multiset/multiset.cons/iter_iter_alloc.pass.cpp
  52. 2 1
      test/std/containers/associative/multiset/upper_bound.pass.cpp
  53. 2 1
      test/std/containers/associative/set/count.pass.cpp
  54. 2 1
      test/std/containers/associative/set/equal_range.pass.cpp
  55. 2 1
      test/std/containers/associative/set/find.pass.cpp
  56. 2 1
      test/std/containers/associative/set/iterator.pass.cpp
  57. 2 1
      test/std/containers/associative/set/lower_bound.pass.cpp
  58. 2 1
      test/std/containers/associative/set/set.cons/initializer_list_compare_alloc.pass.cpp
  59. 2 1
      test/std/containers/associative/set/set.cons/iter_iter_alloc.pass.cpp
  60. 2 1
      test/std/containers/associative/set/upper_bound.pass.cpp
  61. 3 1
      test/std/containers/sequences/array/iterators.pass.cpp
  62. 4 3
      test/std/containers/sequences/deque/deque.cons/size.pass.cpp
  63. 2 1
      test/std/containers/sequences/deque/iterators.pass.cpp
  64. 2 1
      test/std/containers/sequences/forwardlist/forwardlist.cons/size.pass.cpp
  65. 2 1
      test/std/containers/sequences/forwardlist/forwardlist.iter/iterators.pass.cpp
  66. 2 1
      test/std/containers/sequences/list/iterators.pass.cpp
  67. 3 2
      test/std/containers/sequences/list/list.cons/size_type.pass.cpp
  68. 2 1
      test/std/containers/sequences/vector.bool/iterators.pass.cpp
  69. 2 1
      test/std/containers/sequences/vector/iterators.pass.cpp
  70. 2 1
      test/std/containers/unord/unord.map/iterators.pass.cpp
  71. 2 1
      test/std/containers/unord/unord.map/unord.map.cnstr/init.pass.cpp
  72. 2 1
      test/std/containers/unord/unord.map/unord.map.cnstr/range.pass.cpp
  73. 2 1
      test/std/containers/unord/unord.multimap/iterators.pass.cpp
  74. 1 1
      test/std/containers/unord/unord.multimap/unord.multimap.cnstr/allocator.pass.cpp
  75. 2 1
      test/std/containers/unord/unord.multimap/unord.multimap.cnstr/init.pass.cpp
  76. 2 1
      test/std/containers/unord/unord.multimap/unord.multimap.cnstr/range.pass.cpp
  77. 2 1
      test/std/containers/unord/unord.multiset/iterators.pass.cpp
  78. 1 1
      test/std/containers/unord/unord.multiset/unord.multiset.cnstr/allocator.pass.cpp
  79. 2 1
      test/std/containers/unord/unord.multiset/unord.multiset.cnstr/init.pass.cpp
  80. 2 1
      test/std/containers/unord/unord.multiset/unord.multiset.cnstr/range.pass.cpp
  81. 2 1
      test/std/containers/unord/unord.set/iterators.pass.cpp
  82. 1 1
      test/std/containers/unord/unord.set/unord.set.cnstr/allocator.pass.cpp
  83. 2 1
      test/std/containers/unord/unord.set/unord.set.cnstr/init.pass.cpp
  84. 2 1
      test/std/containers/unord/unord.set/unord.set.cnstr/range.pass.cpp
  85. 3 1
      test/std/experimental/optional/optional.nullops/less_equal.pass.cpp
  86. 1 1
      test/std/experimental/string.view/string.view.access/data.pass.cpp
  87. 1 1
      test/std/experimental/string.view/string.view.access/index.pass.cpp
  88. 1 1
      test/std/experimental/string.view/string.view.capacity/capacity.pass.cpp
  89. 2 1
      test/std/experimental/string.view/string.view.comparison/opeq.string_view.pointer.pass.cpp
  90. 2 1
      test/std/experimental/string.view/string.view.comparison/opeq.string_view.string_view.pass.cpp
  91. 2 1
      test/std/experimental/string.view/string.view.comparison/opge.string_view.pointer.pass.cpp
  92. 2 1
      test/std/experimental/string.view/string.view.comparison/opge.string_view.string_view.pass.cpp
  93. 2 1
      test/std/experimental/string.view/string.view.comparison/opgt.string_view.pointer.pass.cpp
  94. 2 1
      test/std/experimental/string.view/string.view.comparison/opgt.string_view.string_view.pass.cpp
  95. 2 1
      test/std/experimental/string.view/string.view.comparison/ople.string_view.pointer.pass.cpp
  96. 2 1
      test/std/experimental/string.view/string.view.comparison/ople.string_view.string_view.pass.cpp
  97. 2 1
      test/std/experimental/string.view/string.view.comparison/oplt.string_view.pointer.pass.cpp
  98. 2 1
      test/std/experimental/string.view/string.view.comparison/oplt.string_view.string_view.pass.cpp
  99. 2 1
      test/std/experimental/string.view/string.view.comparison/opne.string_view.pointer.pass.cpp
  100. 2 1
      test/std/experimental/string.view/string.view.comparison/opne.string_view.string_view.pass.cpp

+ 2 - 1
test/std/containers/associative/map/map.access/iterator.pass.cpp

@@ -29,6 +29,7 @@
 #include <map>
 #include <cassert>
 
+#include "test_macros.h"
 #include "min_allocator.h"
 
 int main()
@@ -207,7 +208,7 @@ int main()
         }
     }
 #endif
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     { // N3644 testing
         typedef std::map<int, double> C;
         C::iterator ii1{}, ii2{};

+ 2 - 1
test/std/containers/associative/map/map.cons/iter_iter_comp_alloc.pass.cpp

@@ -18,6 +18,7 @@
 #include <map>
 #include <cassert>
 
+#include "test_macros.h"
 #include "../../../test_compare.h"
 #include "test_allocator.h"
 #include "min_allocator.h"
@@ -75,7 +76,7 @@ int main()
     assert(*next(m.begin()) == V(2, 1));
     assert(*next(m.begin(), 2) == V(3, 1));
     }
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
     typedef std::pair<const int, double> V;
     V ar[] =

+ 2 - 1
test/std/containers/associative/map/map.ops/count.pass.cpp

@@ -16,6 +16,7 @@
 #include <map>
 #include <cassert>
 
+#include "test_macros.h"
 #include "min_allocator.h"
 #include "private_constructor.hpp"
 #include "is_transparent.h"
@@ -98,7 +99,7 @@ int main()
     }
     }
 #endif
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
     typedef std::pair<const int, double> V;
     typedef std::map<int, double, std::less <>> M;

+ 3 - 2
test/std/containers/associative/map/map.ops/count1.fail.cpp

@@ -22,9 +22,10 @@
 #include <map>
 #include <cassert>
 
+#include "test_macros.h"
 #include "is_transparent.h"
 
-#if _LIBCPP_STD_VER <= 11
+#if TEST_STD_VER <= 11
 #error "This test requires is C++14 (or later)"
 #else
 
@@ -36,4 +37,4 @@ int main()
     M().count(C2Int{5});
     }
 }
-#endif
+#endif

+ 3 - 2
test/std/containers/associative/map/map.ops/count2.fail.cpp

@@ -22,9 +22,10 @@
 #include <map>
 #include <cassert>
 
+#include "test_macros.h"
 #include "is_transparent.h"
 
-#if _LIBCPP_STD_VER <= 11
+#if TEST_STD_VER <= 11
 #error "This test requires is C++14 (or later)"
 #else
 
@@ -36,4 +37,4 @@ int main()
     M().count(C2Int{5});
     }
 }
-#endif
+#endif

+ 3 - 2
test/std/containers/associative/map/map.ops/count3.fail.cpp

@@ -22,9 +22,10 @@
 #include <map>
 #include <cassert>
 
+#include "test_macros.h"
 #include "is_transparent.h"
 
-#if _LIBCPP_STD_VER <= 11
+#if TEST_STD_VER <= 11
 #error "This test requires is C++14 (or later)"
 #else
 
@@ -36,4 +37,4 @@ int main()
     M().count(C2Int{5});
     }
 }
-#endif
+#endif

+ 2 - 1
test/std/containers/associative/map/map.ops/equal_range.pass.cpp

@@ -17,6 +17,7 @@
 #include <map>
 #include <cassert>
 
+#include "test_macros.h"
 #include "min_allocator.h"
 #include "private_constructor.hpp"
 #include "is_transparent.h"
@@ -297,7 +298,7 @@ int main()
     }
     }
 #endif
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
     typedef std::pair<const int, double> V;
     typedef std::map<int, double, std::less<>> M;

+ 3 - 2
test/std/containers/associative/map/map.ops/equal_range1.fail.cpp

@@ -22,9 +22,10 @@
 #include <map>
 #include <cassert>
 
+#include "test_macros.h"
 #include "is_transparent.h"
 
-#if _LIBCPP_STD_VER <= 11
+#if TEST_STD_VER <= 11
 #error "This test requires is C++14 (or later)"
 #else
 
@@ -36,4 +37,4 @@ int main()
     M().equal_range(C2Int{5});
     }
 }
-#endif
+#endif

+ 3 - 2
test/std/containers/associative/map/map.ops/equal_range2.fail.cpp

@@ -22,9 +22,10 @@
 #include <map>
 #include <cassert>
 
+#include "test_macros.h"
 #include "is_transparent.h"
 
-#if _LIBCPP_STD_VER <= 11
+#if TEST_STD_VER <= 11
 #error "This test requires is C++14 (or later)"
 #else
 
@@ -36,4 +37,4 @@ int main()
     M().equal_range(C2Int{5});
     }
 }
-#endif
+#endif

+ 3 - 2
test/std/containers/associative/map/map.ops/equal_range3.fail.cpp

@@ -22,9 +22,10 @@
 #include <map>
 #include <cassert>
 
+#include "test_macros.h"
 #include "is_transparent.h"
 
-#if _LIBCPP_STD_VER <= 11
+#if TEST_STD_VER <= 11
 #error "This test requires is C++14 (or later)"
 #else
 
@@ -36,4 +37,4 @@ int main()
     M().equal_range(C2Int{5});
     }
 }
-#endif
+#endif

+ 2 - 1
test/std/containers/associative/map/map.ops/find.pass.cpp

@@ -17,6 +17,7 @@
 #include <map>
 #include <cassert>
 
+#include "test_macros.h"
 #include "min_allocator.h"
 #include "private_constructor.hpp"
 #include "is_transparent.h"
@@ -165,7 +166,7 @@ int main()
     }
     }
 #endif
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
     typedef std::pair<const int, double> V;
     typedef std::map<int, double, std::less<>> M;

+ 3 - 2
test/std/containers/associative/map/map.ops/find1.fail.cpp

@@ -22,9 +22,10 @@
 #include <map>
 #include <cassert>
 
+#include "test_macros.h"
 #include "is_transparent.h"
 
-#if _LIBCPP_STD_VER <= 11
+#if TEST_STD_VER <= 11
 #error "This test requires is C++14 (or later)"
 #else
 
@@ -36,4 +37,4 @@ int main()
     M().find(C2Int{5});
     }
 }
-#endif
+#endif

+ 3 - 2
test/std/containers/associative/map/map.ops/find2.fail.cpp

@@ -22,9 +22,10 @@
 #include <map>
 #include <cassert>
 
+#include "test_macros.h"
 #include "is_transparent.h"
 
-#if _LIBCPP_STD_VER <= 11
+#if TEST_STD_VER <= 11
 #error "This test requires is C++14 (or later)"
 #else
 
@@ -36,4 +37,4 @@ int main()
     M().find(C2Int{5});
     }
 }
-#endif
+#endif

+ 3 - 2
test/std/containers/associative/map/map.ops/find3.fail.cpp

@@ -22,9 +22,10 @@
 #include <map>
 #include <cassert>
 
+#include "test_macros.h"
 #include "is_transparent.h"
 
-#if _LIBCPP_STD_VER <= 11
+#if TEST_STD_VER <= 11
 #error "This test requires is C++14 (or later)"
 #else
 
@@ -36,4 +37,4 @@ int main()
     M().find(C2Int{5});
     }
 }
-#endif
+#endif

+ 2 - 1
test/std/containers/associative/map/map.ops/lower_bound.pass.cpp

@@ -17,6 +17,7 @@
 #include <map>
 #include <cassert>
 
+#include "test_macros.h"
 #include "min_allocator.h"
 #include "private_constructor.hpp"
 #include "is_transparent.h"
@@ -229,7 +230,7 @@ int main()
     }
     }
 #endif
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
     typedef std::pair<const int, double> V;
     typedef std::map<int, double, std::less <>> M;

+ 2 - 1
test/std/containers/associative/map/map.ops/lower_bound1.fail.cpp

@@ -22,9 +22,10 @@
 #include <map>
 #include <cassert>
 
+#include "test_macros.h"
 #include "is_transparent.h"
 
-#if _LIBCPP_STD_VER <= 11
+#if TEST_STD_VER <= 11
 #error "This test requires is C++14 (or later)"
 #else
 

+ 2 - 1
test/std/containers/associative/map/map.ops/lower_bound2.fail.cpp

@@ -22,9 +22,10 @@
 #include <map>
 #include <cassert>
 
+#include "test_macros.h"
 #include "is_transparent.h"
 
-#if _LIBCPP_STD_VER <= 11
+#if TEST_STD_VER <= 11
 #error "This test requires is C++14 (or later)"
 #else
 

+ 2 - 1
test/std/containers/associative/map/map.ops/lower_bound3.fail.cpp

@@ -22,9 +22,10 @@
 #include <map>
 #include <cassert>
 
+#include "test_macros.h"
 #include "is_transparent.h"
 
-#if _LIBCPP_STD_VER <= 11
+#if TEST_STD_VER <= 11
 #error "This test requires is C++14 (or later)"
 #else
 

+ 2 - 1
test/std/containers/associative/map/map.ops/upper_bound.pass.cpp

@@ -17,6 +17,7 @@
 #include <map>
 #include <cassert>
 
+#include "test_macros.h"
 #include "min_allocator.h"
 #include "private_constructor.hpp"
 
@@ -228,7 +229,7 @@ int main()
     }
     }
 #endif
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
     typedef std::pair<const int, double> V;
     typedef std::map<int, double, std::less<>> M;

+ 2 - 1
test/std/containers/associative/map/map.ops/upper_bound1.fail.cpp

@@ -22,9 +22,10 @@
 #include <map>
 #include <cassert>
 
+#include "test_macros.h"
 #include "is_transparent.h"
 
-#if _LIBCPP_STD_VER <= 11
+#if TEST_STD_VER <= 11
 #error "This test requires is C++14 (or later)"
 #else
 

+ 2 - 1
test/std/containers/associative/map/map.ops/upper_bound2.fail.cpp

@@ -22,9 +22,10 @@
 #include <map>
 #include <cassert>
 
+#include "test_macros.h"
 #include "is_transparent.h"
 
-#if _LIBCPP_STD_VER <= 11
+#if TEST_STD_VER <= 11
 #error "This test requires is C++14 (or later)"
 #else
 

+ 2 - 1
test/std/containers/associative/map/map.ops/upper_bound3.fail.cpp

@@ -22,9 +22,10 @@
 #include <map>
 #include <cassert>
 
+#include "test_macros.h"
 #include "is_transparent.h"
 
-#if _LIBCPP_STD_VER <= 11
+#if TEST_STD_VER <= 11
 #error "This test requires is C++14 (or later)"
 #else
 

+ 2 - 1
test/std/containers/associative/multimap/iterator.pass.cpp

@@ -29,6 +29,7 @@
 #include <map>
 #include <cassert>
 
+#include "test_macros.h"
 #include "min_allocator.h"
 
 int main()
@@ -211,7 +212,7 @@ int main()
             }
     }
 #endif
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     { // N3644 testing
         typedef std::multimap<int, double> C;
         C::iterator ii1{}, ii2{};

+ 2 - 1
test/std/containers/associative/multimap/multimap.cons/iter_iter.pass.cpp

@@ -17,6 +17,7 @@
 #include <map>
 #include <cassert>
 
+#include "test_macros.h"
 #include "min_allocator.h"
 
 int main()
@@ -76,7 +77,7 @@ int main()
     assert(*next(m.begin(), 7) == V(3, 1.5));
     assert(*next(m.begin(), 8) == V(3, 2));
     }
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
     typedef std::pair<const int, double> V;
     V ar[] =

+ 2 - 1
test/std/containers/associative/multimap/multimap.ops/count.pass.cpp

@@ -16,6 +16,7 @@
 #include <map>
 #include <cassert>
 
+#include "test_macros.h"
 #include "min_allocator.h"
 #include "private_constructor.hpp"
 #include "is_transparent.h"
@@ -92,7 +93,7 @@ int main()
     }
 #endif
 
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
     typedef std::multimap<int, double, std::less<>> M;
     typedef M::size_type R;

+ 3 - 2
test/std/containers/associative/multimap/multimap.ops/count1.fail.cpp

@@ -22,9 +22,10 @@
 #include <map>
 #include <cassert>
 
+#include "test_macros.h"
 #include "is_transparent.h"
 
-#if _LIBCPP_STD_VER <= 11
+#if TEST_STD_VER <= 11
 #error "This test requires is C++14 (or later)"
 #else
 
@@ -34,4 +35,4 @@ int main()
 
     M().count(C2Int{5});
 }
-#endif
+#endif

+ 3 - 2
test/std/containers/associative/multimap/multimap.ops/count2.fail.cpp

@@ -22,9 +22,10 @@
 #include <map>
 #include <cassert>
 
+#include "test_macros.h"
 #include "is_transparent.h"
 
-#if _LIBCPP_STD_VER <= 11
+#if TEST_STD_VER <= 11
 #error "This test requires is C++14 (or later)"
 #else
 
@@ -34,4 +35,4 @@ int main()
 
     M().count(C2Int{5});
 }
-#endif
+#endif

+ 3 - 2
test/std/containers/associative/multimap/multimap.ops/count3.fail.cpp

@@ -22,9 +22,10 @@
 #include <map>
 #include <cassert>
 
+#include "test_macros.h"
 #include "is_transparent.h"
 
-#if _LIBCPP_STD_VER <= 11
+#if TEST_STD_VER <= 11
 #error "This test requires is C++14 (or later)"
 #else
 
@@ -34,4 +35,4 @@ int main()
 
     M().count(C2Int{5});
 }
-#endif
+#endif

+ 2 - 1
test/std/containers/associative/multimap/multimap.ops/equal_range.pass.cpp

@@ -17,6 +17,7 @@
 #include <map>
 #include <cassert>
 
+#include "test_macros.h"
 #include "min_allocator.h"
 #include "private_constructor.hpp"
 #include "is_transparent.h"
@@ -180,7 +181,7 @@ int main()
     }
     }
 #endif
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
     typedef std::pair<const int, double> V;
     typedef std::multimap<int, double, std::less<>> M;

+ 3 - 2
test/std/containers/associative/multimap/multimap.ops/equal_range1.fail.cpp

@@ -22,9 +22,10 @@
 #include <map>
 #include <cassert>
 
+#include "test_macros.h"
 #include "is_transparent.h"
 
-#if _LIBCPP_STD_VER <= 11
+#if TEST_STD_VER <= 11
 #error "This test requires is C++14 (or later)"
 #else
 
@@ -34,4 +35,4 @@ int main()
 
     M().equal_range(C2Int{5});
 }
-#endif
+#endif

+ 3 - 2
test/std/containers/associative/multimap/multimap.ops/equal_range2.fail.cpp

@@ -22,9 +22,10 @@
 #include <map>
 #include <cassert>
 
+#include "test_macros.h"
 #include "is_transparent.h"
 
-#if _LIBCPP_STD_VER <= 11
+#if TEST_STD_VER <= 11
 #error "This test requires is C++14 (or later)"
 #else
 
@@ -36,4 +37,4 @@ int main()
     M().equal_range(C2Int{5});
     }
 }
-#endif
+#endif

+ 3 - 2
test/std/containers/associative/multimap/multimap.ops/equal_range3.fail.cpp

@@ -22,9 +22,10 @@
 #include <map>
 #include <cassert>
 
+#include "test_macros.h"
 #include "is_transparent.h"
 
-#if _LIBCPP_STD_VER <= 11
+#if TEST_STD_VER <= 11
 #error "This test requires is C++14 (or later)"
 #else
 
@@ -36,4 +37,4 @@ int main()
     M().equal_range(C2Int{5});
     }
 }
-#endif
+#endif

+ 2 - 1
test/std/containers/associative/multimap/multimap.ops/find.pass.cpp

@@ -17,6 +17,7 @@
 #include <map>
 #include <cassert>
 
+#include "test_macros.h"
 #include "min_allocator.h"
 #include "private_constructor.hpp"
 #include "is_transparent.h"
@@ -144,7 +145,7 @@ int main()
     }
     }
 #endif
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
     typedef std::pair<const int, double> V;
     typedef std::multimap<int, double, std::less<>> M;

+ 3 - 2
test/std/containers/associative/multimap/multimap.ops/find1.fail.cpp

@@ -22,9 +22,10 @@
 #include <map>
 #include <cassert>
 
+#include "test_macros.h"
 #include "is_transparent.h"
 
-#if _LIBCPP_STD_VER <= 11
+#if TEST_STD_VER <= 11
 #error "This test requires is C++14 (or later)"
 #else
 
@@ -36,4 +37,4 @@ int main()
     M().find(C2Int{5});
     }
 }
-#endif
+#endif

+ 3 - 2
test/std/containers/associative/multimap/multimap.ops/find2.fail.cpp

@@ -22,9 +22,10 @@
 #include <map>
 #include <cassert>
 
+#include "test_macros.h"
 #include "is_transparent.h"
 
-#if _LIBCPP_STD_VER <= 11
+#if TEST_STD_VER <= 11
 #error "This test requires is C++14 (or later)"
 #else
 
@@ -36,4 +37,4 @@ int main()
     M().find(C2Int{5});
     }
 }
-#endif
+#endif

+ 3 - 2
test/std/containers/associative/multimap/multimap.ops/find3.fail.cpp

@@ -22,9 +22,10 @@
 #include <map>
 #include <cassert>
 
+#include "test_macros.h"
 #include "is_transparent.h"
 
-#if _LIBCPP_STD_VER <= 11
+#if TEST_STD_VER <= 11
 #error "This test requires is C++14 (or later)"
 #else
 
@@ -36,4 +37,4 @@ int main()
     M().find(C2Int{5});
     }
 }
-#endif
+#endif

+ 2 - 1
test/std/containers/associative/multimap/multimap.ops/lower_bound.pass.cpp

@@ -17,6 +17,7 @@
 #include <map>
 #include <cassert>
 
+#include "test_macros.h"
 #include "min_allocator.h"
 #include "private_constructor.hpp"
 #include "is_transparent.h"
@@ -152,7 +153,7 @@ int main()
     }
     }
 #endif
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
     typedef std::pair<const int, double> V;
     typedef std::multimap<int, double, std::less<>> M;

+ 2 - 1
test/std/containers/associative/multimap/multimap.ops/lower_bound1.fail.cpp

@@ -22,9 +22,10 @@
 #include <map>
 #include <cassert>
 
+#include "test_macros.h"
 #include "is_transparent.h"
 
-#if _LIBCPP_STD_VER <= 11
+#if TEST_STD_VER <= 11
 #error "This test requires is C++14 (or later)"
 #else
 

+ 2 - 1
test/std/containers/associative/multimap/multimap.ops/lower_bound2.fail.cpp

@@ -22,9 +22,10 @@
 #include <map>
 #include <cassert>
 
+#include "test_macros.h"
 #include "is_transparent.h"
 
-#if _LIBCPP_STD_VER <= 11
+#if TEST_STD_VER <= 11
 #error "This test requires is C++14 (or later)"
 #else
 

+ 2 - 1
test/std/containers/associative/multimap/multimap.ops/lower_bound3.fail.cpp

@@ -22,9 +22,10 @@
 #include <map>
 #include <cassert>
 
+#include "test_macros.h"
 #include "is_transparent.h"
 
-#if _LIBCPP_STD_VER <= 11
+#if TEST_STD_VER <= 11
 #error "This test requires is C++14 (or later)"
 #else
 

+ 2 - 1
test/std/containers/associative/multimap/multimap.ops/upper_bound.pass.cpp

@@ -17,6 +17,7 @@
 #include <map>
 #include <cassert>
 
+#include "test_macros.h"
 #include "min_allocator.h"
 #include "private_constructor.hpp"
 #include "is_transparent.h"
@@ -152,7 +153,7 @@ int main()
     }
     }
 #endif
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
     typedef std::pair<const int, double> V;
     typedef std::multimap<int, double, std::less<>> M;

+ 2 - 1
test/std/containers/associative/multimap/multimap.ops/upper_bound1.fail.cpp

@@ -22,9 +22,10 @@
 #include <map>
 #include <cassert>
 
+#include "test_macros.h"
 #include "is_transparent.h"
 
-#if _LIBCPP_STD_VER <= 11
+#if TEST_STD_VER <= 11
 #error "This test requires is C++14 (or later)"
 #else
 

+ 2 - 1
test/std/containers/associative/multimap/multimap.ops/upper_bound2.fail.cpp

@@ -22,9 +22,10 @@
 #include <map>
 #include <cassert>
 
+#include "test_macros.h"
 #include "is_transparent.h"
 
-#if _LIBCPP_STD_VER <= 11
+#if TEST_STD_VER <= 11
 #error "This test requires is C++14 (or later)"
 #else
 

+ 2 - 1
test/std/containers/associative/multimap/multimap.ops/upper_bound3.fail.cpp

@@ -22,9 +22,10 @@
 #include <map>
 #include <cassert>
 
+#include "test_macros.h"
 #include "is_transparent.h"
 
-#if _LIBCPP_STD_VER <= 11
+#if TEST_STD_VER <= 11
 #error "This test requires is C++14 (or later)"
 #else
 

+ 2 - 1
test/std/containers/associative/multiset/count.pass.cpp

@@ -16,6 +16,7 @@
 #include <set>
 #include <cassert>
 
+#include "test_macros.h"
 #include "min_allocator.h"
 #include "private_constructor.hpp"
 
@@ -91,7 +92,7 @@ int main()
     }
     }
 #endif
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
     typedef int V;
     typedef std::multiset<int, std::less<>> M;

+ 2 - 1
test/std/containers/associative/multiset/equal_range.pass.cpp

@@ -17,6 +17,7 @@
 #include <set>
 #include <cassert>
 
+#include "test_macros.h"
 #include "min_allocator.h"
 #include "private_constructor.hpp"
 
@@ -180,7 +181,7 @@ int main()
     }
     }
 #endif
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
     typedef int V;
     typedef std::multiset<V, std::less<>> M;

+ 2 - 1
test/std/containers/associative/multiset/find.pass.cpp

@@ -17,6 +17,7 @@
 #include <set>
 #include <cassert>
 
+#include "test_macros.h"
 #include "min_allocator.h"
 #include "private_constructor.hpp"
 
@@ -164,7 +165,7 @@ int main()
         }
     }
 #endif
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
     typedef int V;
     typedef std::multiset<V, std::less<>> M;

+ 2 - 1
test/std/containers/associative/multiset/iterator.pass.cpp

@@ -29,6 +29,7 @@
 #include <set>
 #include <cassert>
 
+#include "test_macros.h"
 #include "min_allocator.h"
 
 int main()
@@ -195,7 +196,7 @@ int main()
                 assert(*i == j);
     }
 #endif
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     { // N3644 testing
         typedef std::multiset<int> C;
         C::iterator ii1{}, ii2{};

+ 2 - 1
test/std/containers/associative/multiset/lower_bound.pass.cpp

@@ -17,6 +17,7 @@
 #include <set>
 #include <cassert>
 
+#include "test_macros.h"
 #include "min_allocator.h"
 #include "private_constructor.hpp"
 
@@ -152,7 +153,7 @@ int main()
         }
     }
 #endif
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
     typedef int V;
     typedef std::multiset<V, std::less<>> M;

+ 2 - 1
test/std/containers/associative/multiset/multiset.cons/initializer_list.pass.cpp

@@ -16,6 +16,7 @@
 #include <set>
 #include <cassert>
 
+#include "test_macros.h"
 #include "min_allocator.h"
 
 int main()
@@ -51,7 +52,7 @@ int main()
     assert(*++i == V(5));
     assert(*++i == V(6));
     }
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
     typedef std::multiset<int, std::less<int>, min_allocator<int>> C;
     typedef C::value_type V;

+ 2 - 1
test/std/containers/associative/multiset/multiset.cons/iter_iter_alloc.pass.cpp

@@ -18,6 +18,7 @@
 #include <set>
 #include <cassert>
 
+#include "test_macros.h"
 #include "test_iterators.h"
 #include "../../../test_compare.h"
 #include "test_allocator.h"
@@ -57,7 +58,7 @@ int main()
     assert(*next(m.begin(), 7) == 3);
     assert(*next(m.begin(), 8) == 3);
     }
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
     typedef int V;
     V ar[] =

+ 2 - 1
test/std/containers/associative/multiset/upper_bound.pass.cpp

@@ -17,6 +17,7 @@
 #include <set>
 #include <cassert>
 
+#include "test_macros.h"
 #include "min_allocator.h"
 #include "private_constructor.hpp"
 
@@ -152,7 +153,7 @@ int main()
     }
     }
 #endif
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
     typedef int V;
     typedef std::multiset<V, std::less<>> M;

+ 2 - 1
test/std/containers/associative/set/count.pass.cpp

@@ -16,6 +16,7 @@
 #include <set>
 #include <cassert>
 
+#include "test_macros.h"
 #include "min_allocator.h"
 #include "private_constructor.hpp"
 
@@ -93,7 +94,7 @@ int main()
         assert(r == 0);
     }
 #endif
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
         typedef int V;
         typedef std::set<int, std::less<>> M;

+ 2 - 1
test/std/containers/associative/set/equal_range.pass.cpp

@@ -17,6 +17,7 @@
 #include <set>
 #include <cassert>
 
+#include "test_macros.h"
 #include "min_allocator.h"
 #include "private_constructor.hpp"
 
@@ -228,7 +229,7 @@ int main()
     assert(r.second == next(m.begin(), 8));
     }
 #endif
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
     typedef int V;
     typedef std::set<V, std::less<>> M;

+ 2 - 1
test/std/containers/associative/set/find.pass.cpp

@@ -17,6 +17,7 @@
 #include <set>
 #include <cassert>
 
+#include "test_macros.h"
 #include "min_allocator.h"
 #include "private_constructor.hpp"
 
@@ -164,7 +165,7 @@ int main()
     }
     }
 #endif
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
     typedef int V;
     typedef std::set<V, std::less<>> M;

+ 2 - 1
test/std/containers/associative/set/iterator.pass.cpp

@@ -29,6 +29,7 @@
 #include <set>
 #include <cassert>
 
+#include "test_macros.h"
 #include "min_allocator.h"
 
 int main()
@@ -191,7 +192,7 @@ int main()
             assert(*i == j);
     }
 #endif
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     { // N3644 testing
         typedef std::set<int> C;
         C::iterator ii1{}, ii2{};

+ 2 - 1
test/std/containers/associative/set/lower_bound.pass.cpp

@@ -17,6 +17,7 @@
 #include <set>
 #include <cassert>
 
+#include "test_macros.h"
 #include "min_allocator.h"
 #include "private_constructor.hpp"
 
@@ -228,7 +229,7 @@ int main()
     }
     }
 #endif
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
     typedef int V;
     typedef std::set<V, std::less<>> M;

+ 2 - 1
test/std/containers/associative/set/set.cons/initializer_list_compare_alloc.pass.cpp

@@ -16,6 +16,7 @@
 
 #include <set>
 #include <cassert>
+#include "test_macros.h"
 #include "../../../test_compare.h"
 #include "test_allocator.h"
 
@@ -40,7 +41,7 @@ int main()
     assert(m.key_comp() == Cmp(10));
     assert(m.get_allocator() == A(4));
     }
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
     typedef test_compare<std::less<int> > Cmp;
     typedef test_allocator<int> A;

+ 2 - 1
test/std/containers/associative/set/set.cons/iter_iter_alloc.pass.cpp

@@ -22,6 +22,7 @@
 #include <set>
 #include <cassert>
 
+#include "test_macros.h"
 #include "test_iterators.h"
 #include "../../../test_compare.h"
 #include "test_allocator.h"
@@ -55,7 +56,7 @@ int main()
     assert(*next(m.begin()) == 2);
     assert(*next(m.begin(), 2) == 3);
     }
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
     typedef int V;
     V ar[] =

+ 2 - 1
test/std/containers/associative/set/upper_bound.pass.cpp

@@ -17,6 +17,7 @@
 #include <set>
 #include <cassert>
 
+#include "test_macros.h"
 #include "min_allocator.h"
 #include "private_constructor.hpp"
 
@@ -228,7 +229,7 @@ int main()
     }
     }
 #endif
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
     typedef int V;
     typedef std::set<V, std::less<>> M;

+ 3 - 1
test/std/containers/sequences/array/iterators.pass.cpp

@@ -15,6 +15,8 @@
 #include <iterator>
 #include <cassert>
 
+#include "test_macros.h"
+
 int main()
 {
     {
@@ -36,7 +38,7 @@ int main()
     assert(i == j);
     }
 
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     { // N3644 testing
         {
         typedef std::array<int, 5> C;

+ 4 - 3
test/std/containers/sequences/deque/deque.cons/size.pass.cpp

@@ -14,6 +14,7 @@
 #include <deque>
 #include <cassert>
 
+#include "test_macros.h"
 #include "test_allocator.h"
 #include "DefaultOnly.h"
 #include "min_allocator.h"
@@ -22,7 +23,7 @@ template <class T, class Allocator>
 void
 test2(unsigned n)
 {
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     typedef std::deque<T, Allocator> C;
     typedef typename C::const_iterator const_iterator;
     assert(DefaultOnly::count == 0);
@@ -64,7 +65,7 @@ template <class T, class Allocator>
 void
 test3(unsigned n, Allocator const &alloc = Allocator())
 {
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     typedef std::deque<T, Allocator> C;
     typedef typename C::const_iterator const_iterator;
     {
@@ -104,7 +105,7 @@ int main()
     test<DefaultOnly, min_allocator<DefaultOnly> >(4095);
 #endif
 
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     test3<DefaultOnly, std::allocator<DefaultOnly>> (1023);
     test3<int, std::allocator<int>>(1);
     test3<int, min_allocator<int>> (3);

+ 2 - 1
test/std/containers/sequences/deque/iterators.pass.cpp

@@ -20,6 +20,7 @@
 #include <iterator>
 #include <cassert>
 
+#include "test_macros.h"
 #include "min_allocator.h"
 
 int main()
@@ -44,7 +45,7 @@ int main()
     assert(i == j);
     }
 #endif
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     { // N3644 testing
         std::deque<int>::iterator ii1{}, ii2{};
         std::deque<int>::iterator ii4 = ii1;

+ 2 - 1
test/std/containers/sequences/forwardlist/forwardlist.cons/size.pass.cpp

@@ -15,13 +15,14 @@
 #include <forward_list>
 #include <cassert>
 
+#include "test_macros.h"
 #include "DefaultOnly.h"
 #include "min_allocator.h"
 
 template <class T, class Allocator>
 void check_allocator(unsigned n, Allocator const &alloc = Allocator())
 {
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     typedef std::forward_list<T, Allocator> C;
     C d(n, alloc);
     assert(d.get_allocator() == alloc);

+ 2 - 1
test/std/containers/sequences/forwardlist/forwardlist.iter/iterators.pass.cpp

@@ -20,6 +20,7 @@
 #include <cassert>
 #include <iterator>
 
+#include "test_macros.h"
 #include "min_allocator.h"
 
 int main()
@@ -120,7 +121,7 @@ int main()
         C::const_iterator j;
     }
 #endif
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     { // N3644 testing
         std::forward_list<int>::iterator ii1{}, ii2{};
         std::forward_list<int>::iterator ii4 = ii1;

+ 2 - 1
test/std/containers/sequences/list/iterators.pass.cpp

@@ -20,6 +20,7 @@
 #include <cassert>
 #include <iterator>
 
+#include "test_macros.h"
 #include "min_allocator.h"
 
 struct A
@@ -135,7 +136,7 @@ int main()
         assert(j->first == 3);
     }
 #endif
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
         std::list<int> c;
         std::list<int>::iterator ii1{}, ii2{};

+ 3 - 2
test/std/containers/sequences/list/list.cons/size_type.pass.cpp

@@ -13,6 +13,7 @@
 
 #include <list>
 #include <cassert>
+#include "test_macros.h"
 #include "DefaultOnly.h"
 #include "test_allocator.h"
 #include "min_allocator.h"
@@ -21,7 +22,7 @@ template <class T, class Allocator>
 void
 test3(unsigned n, Allocator const &alloc = Allocator())
 {
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     typedef std::list<T, Allocator> C;
     typedef typename C::const_iterator const_iterator;
     {
@@ -59,7 +60,7 @@ int main()
         ++i;
         assert(*i == 0);
     }
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
         typedef std::list<int, min_allocator<int> > C;
         C l(3, min_allocator<int> ());

+ 2 - 1
test/std/containers/sequences/vector.bool/iterators.pass.cpp

@@ -20,6 +20,7 @@
 #include <cassert>
 #include <iterator>
 
+#include "test_macros.h"
 #include "min_allocator.h"
 
 int main()
@@ -94,7 +95,7 @@ int main()
         C::const_iterator j;
     }
 #endif
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     { // N3644 testing
         std::vector<bool>::iterator ii1{}, ii2{};
         std::vector<bool>::iterator ii4 = ii1;

+ 2 - 1
test/std/containers/sequences/vector/iterators.pass.cpp

@@ -20,6 +20,7 @@
 #include <cassert>
 #include <iterator>
 
+#include "test_macros.h"
 #include "min_allocator.h"
 
 struct A
@@ -135,7 +136,7 @@ int main()
         assert(j->first == 3);
     }
 #endif
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     { // N3644 testing
         typedef std::vector<int> C;
         C::iterator ii1{}, ii2{};

+ 2 - 1
test/std/containers/unord/unord.map/iterators.pass.cpp

@@ -24,6 +24,7 @@
 #include <string>
 #include <cassert>
 
+#include "test_macros.h"
 #include "min_allocator.h"
 
 int main()
@@ -108,7 +109,7 @@ int main()
         C::const_iterator i;
     }
 #endif
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     { // N3644 testing
         typedef std::unordered_map<int,double> C;
         C::iterator ii1{}, ii2{};

+ 2 - 1
test/std/containers/unord/unord.map/unord.map.cnstr/init.pass.cpp

@@ -20,6 +20,7 @@
 #include <cassert>
 #include <cfloat>
 
+#include "test_macros.h"
 #include "../../../test_compare.h"
 #include "../../../test_hash.h"
 #include "test_allocator.h"
@@ -91,7 +92,7 @@ int main()
         assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
         assert(c.max_load_factor() == 1);
     }
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
         typedef std::pair<int, std::string> P;
         typedef test_allocator<std::pair<const int, std::string>> A;

+ 2 - 1
test/std/containers/unord/unord.map/unord.map.cnstr/range.pass.cpp

@@ -21,6 +21,7 @@
 #include <cassert>
 #include <cfloat>
 
+#include "test_macros.h"
 #include "test_iterators.h"
 #include "../../../NotConstructible.h"
 #include "../../../test_compare.h"
@@ -97,7 +98,7 @@ int main()
         assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
         assert(c.max_load_factor() == 1);
     }
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
         typedef std::pair<int, std::string> P;
         typedef test_allocator<std::pair<const int, std::string>> A;

+ 2 - 1
test/std/containers/unord/unord.multimap/iterators.pass.cpp

@@ -24,6 +24,7 @@
 #include <string>
 #include <cassert>
 
+#include "test_macros.h"
 #include "min_allocator.h"
 
 int main()
@@ -114,7 +115,7 @@ int main()
         C::const_iterator i;
     }
 #endif
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     { // N3644 testing
         typedef std::unordered_multimap<int,double> C;
         C::iterator ii1{}, ii2{};

+ 1 - 1
test/std/containers/unord/unord.multimap/unord.multimap.cnstr/allocator.pass.cpp

@@ -84,7 +84,7 @@ int main()
         assert(c.load_factor() == 0);
         assert(c.max_load_factor() == 1);
     }
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
         typedef NotConstructible T;
         typedef test_allocator<std::pair<const T, T>> A;

+ 2 - 1
test/std/containers/unord/unord.multimap/unord.multimap.cnstr/init.pass.cpp

@@ -20,6 +20,7 @@
 #include <cassert>
 #include <cfloat>
 
+#include "test_macros.h"
 #include "../../../test_compare.h"
 #include "../../../test_hash.h"
 #include "test_allocator.h"
@@ -135,7 +136,7 @@ int main()
         assert(c.key_eq() == test_compare<std::equal_to<int> >());
         assert((c.get_allocator() == min_allocator<std::pair<const int, std::string> >()));
     }
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
         typedef std::pair<int, std::string> P;
         typedef test_allocator<std::pair<const int, std::string>> A;

+ 2 - 1
test/std/containers/unord/unord.multimap/unord.multimap.cnstr/range.pass.cpp

@@ -21,6 +21,7 @@
 #include <cassert>
 #include <cfloat>
 
+#include "test_macros.h"
 #include "test_iterators.h"
 #include "../../../NotConstructible.h"
 #include "../../../test_compare.h"
@@ -141,7 +142,7 @@ int main()
         assert(c.key_eq() == test_compare<std::equal_to<int> >());
         assert((c.get_allocator() == min_allocator<std::pair<const int, std::string> >()));
     }
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
         typedef std::pair<int, std::string> P;
         typedef test_allocator<std::pair<const int, std::string>> A;

+ 2 - 1
test/std/containers/unord/unord.multiset/iterators.pass.cpp

@@ -23,6 +23,7 @@
 #include <unordered_set>
 #include <cassert>
 
+#include "test_macros.h"
 #include "min_allocator.h"
 
 int main()
@@ -107,7 +108,7 @@ int main()
         C::const_iterator i;
     }
 #endif
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     { // N3644 testing
         typedef std::unordered_multiset<int> C;
         C::iterator ii1{}, ii2{};

+ 1 - 1
test/std/containers/unord/unord.multiset/unord.multiset.cnstr/allocator.pass.cpp

@@ -62,7 +62,7 @@ int main()
         assert(c.load_factor() == 0);
         assert(c.max_load_factor() == 1);
     }
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
         typedef NotConstructible T;
         typedef test_hash<std::hash<T>> HF;

+ 2 - 1
test/std/containers/unord/unord.multiset/unord.multiset.cnstr/init.pass.cpp

@@ -19,6 +19,7 @@
 #include <cassert>
 #include <cfloat>
 
+#include "test_macros.h"
 #include "../../../test_compare.h"
 #include "../../../test_hash.h"
 #include "test_allocator.h"
@@ -88,7 +89,7 @@ int main()
         assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
         assert(c.max_load_factor() == 1);
     }
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
         typedef int T;
         typedef test_hash<std::hash<T>> HF;

+ 2 - 1
test/std/containers/unord/unord.multiset/unord.multiset.cnstr/range.pass.cpp

@@ -20,6 +20,7 @@
 #include <cassert>
 #include <cfloat>
 
+#include "test_macros.h"
 #include "test_iterators.h"
 #include "../../../test_compare.h"
 #include "../../../test_hash.h"
@@ -93,7 +94,7 @@ int main()
         assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
         assert(c.max_load_factor() == 1);
     }
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
         typedef int T;
         typedef test_hash<std::hash<T>> HF;

+ 2 - 1
test/std/containers/unord/unord.set/iterators.pass.cpp

@@ -23,6 +23,7 @@
 #include <unordered_set>
 #include <cassert>
 
+#include "test_macros.h"
 #include "min_allocator.h"
 
 int main()
@@ -107,7 +108,7 @@ int main()
         C::const_iterator i;
     }
 #endif
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     { // N3644 testing
         typedef std::unordered_set<int> C;
         C::iterator ii1{}, ii2{};

+ 1 - 1
test/std/containers/unord/unord.set/unord.set.cnstr/allocator.pass.cpp

@@ -62,7 +62,7 @@ int main()
         assert(c.load_factor() == 0);
         assert(c.max_load_factor() == 1);
     }
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
         typedef NotConstructible T;
         typedef test_hash<std::hash<T>> HF;

+ 2 - 1
test/std/containers/unord/unord.set/unord.set.cnstr/init.pass.cpp

@@ -19,6 +19,7 @@
 #include <cassert>
 #include <cfloat>
 
+#include "test_macros.h"
 #include "../../../test_compare.h"
 #include "../../../test_hash.h"
 #include "test_allocator.h"
@@ -88,7 +89,7 @@ int main()
         assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
         assert(c.max_load_factor() == 1);
     }
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
         typedef int T;
         typedef test_hash<std::hash<T>> HF;

+ 2 - 1
test/std/containers/unord/unord.set/unord.set.cnstr/range.pass.cpp

@@ -20,6 +20,7 @@
 #include <cassert>
 #include <cfloat>
 
+#include "test_macros.h"
 #include "test_iterators.h"
 #include "../../../test_compare.h"
 #include "../../../test_hash.h"
@@ -93,7 +94,7 @@ int main()
         assert(fabs(c.load_factor() - (float)c.size()/c.bucket_count()) < FLT_EPSILON);
         assert(c.max_load_factor() == 1);
     }
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
         typedef int T;
         typedef test_hash<std::hash<T>> HF;

+ 3 - 1
test/std/experimental/optional/optional.nullops/less_equal.pass.cpp

@@ -15,9 +15,11 @@
 
 #include <experimental/optional>
 
+#include "test_macros.h"
+
 int main()
 {
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     using std::experimental::optional;
     using std::experimental::nullopt_t;
     using std::experimental::nullopt;

+ 1 - 1
test/std/experimental/string.view/string.view.access/data.pass.cpp

@@ -39,7 +39,7 @@ int main () {
     test ( U"a", 1 );
 #endif
 
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
     constexpr const char *s = "ABC";
     constexpr std::experimental::basic_string_view<char> sv( s, 2 );

+ 1 - 1
test/std/experimental/string.view/string.view.access/index.pass.cpp

@@ -42,7 +42,7 @@ int main () {
     test ( U"a", 1 );
 #endif
 
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
     constexpr std::experimental::basic_string_view<char> sv ( "ABC", 2 );
     static_assert ( sv.length() ==  2,  "" );

+ 1 - 1
test/std/experimental/string.view/string.view.capacity/capacity.pass.cpp

@@ -23,7 +23,7 @@
 
 template<typename SV>
 void test1 () {
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
     constexpr SV sv1;
     static_assert ( sv1.size() == 0, "" );

+ 2 - 1
test/std/experimental/string.view/string.view.comparison/opeq.string_view.pointer.pass.cpp

@@ -17,6 +17,7 @@
 #include <experimental/string_view>
 #include <cassert>
 
+#include "test_macros.h"
 #include "constexpr_char_traits.hpp"
 
 template <class S>
@@ -49,7 +50,7 @@ int main()
     test(S("abcdefghijklmnopqrst"), "abcdefghijklmnopqrst", true);
     }
 
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
     typedef std::experimental::basic_string_view<char, constexpr_char_traits<char>> SV;
     constexpr SV  sv1;

+ 2 - 1
test/std/experimental/string.view/string.view.comparison/opeq.string_view.string_view.pass.cpp

@@ -16,6 +16,7 @@
 #include <experimental/string_view>
 #include <cassert>
 
+#include "test_macros.h"
 #include "constexpr_char_traits.hpp"
 
 template <class S>
@@ -48,7 +49,7 @@ int main()
     test(S("abcdefghijklmnopqrst"), S("abcdefghijklmnopqrst"), true);
     }
 
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
     typedef std::experimental::basic_string_view<char, constexpr_char_traits<char>> SV;
     constexpr SV  sv1;

+ 2 - 1
test/std/experimental/string.view/string.view.comparison/opge.string_view.pointer.pass.cpp

@@ -17,6 +17,7 @@
 #include <experimental/string_view>
 #include <cassert>
 
+#include "test_macros.h"
 #include "constexpr_char_traits.hpp"
 
 template <class S>
@@ -49,7 +50,7 @@ int main()
     test("abcdefghijklmnopqrst", S("abcdefghijklmnopqrst"), true, true);
     }
 
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
     typedef std::experimental::basic_string_view<char, constexpr_char_traits<char>> SV;
     constexpr SV  sv1;

+ 2 - 1
test/std/experimental/string.view/string.view.comparison/opge.string_view.string_view.pass.cpp

@@ -16,6 +16,7 @@
 #include <experimental/string_view>
 #include <cassert>
 
+#include "test_macros.h"
 #include "constexpr_char_traits.hpp"
 
 template <class S>
@@ -48,7 +49,7 @@ int main()
     test(S("abcdefghijklmnopqrst"), S("abcdefghijklmnopqrst"), true, true);
     }
 
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
     typedef std::experimental::basic_string_view<char, constexpr_char_traits<char>> SV;
     constexpr SV  sv1;

+ 2 - 1
test/std/experimental/string.view/string.view.comparison/opgt.string_view.pointer.pass.cpp

@@ -17,6 +17,7 @@
 #include <experimental/string_view>
 #include <cassert>
 
+#include "test_macros.h"
 #include "constexpr_char_traits.hpp"
 
 template <class S>
@@ -49,7 +50,7 @@ int main()
     test("abcdefghijklmnopqrst", S("abcdefghijklmnopqrst"), false, false);
     }
 
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
     typedef std::experimental::basic_string_view<char, constexpr_char_traits<char>> SV;
     constexpr SV  sv1;

+ 2 - 1
test/std/experimental/string.view/string.view.comparison/opgt.string_view.string_view.pass.cpp

@@ -16,6 +16,7 @@
 #include <experimental/string_view>
 #include <cassert>
 
+#include "test_macros.h"
 #include "constexpr_char_traits.hpp"
 
 template <class S>
@@ -48,7 +49,7 @@ int main()
     test(S("abcdefghijklmnopqrst"), S("abcdefghijklmnopqrst"), false, false);
     }
 
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
     typedef std::experimental::basic_string_view<char, constexpr_char_traits<char>> SV;
     constexpr SV  sv1;

+ 2 - 1
test/std/experimental/string.view/string.view.comparison/ople.string_view.pointer.pass.cpp

@@ -17,6 +17,7 @@
 #include <experimental/string_view>
 #include <cassert>
 
+#include "test_macros.h"
 #include "constexpr_char_traits.hpp"
 
 template <class S>
@@ -49,7 +50,7 @@ int main()
     test("abcdefghijklmnopqrst", S("abcdefghijklmnopqrst"), true, true);
     }
 
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
     typedef std::experimental::basic_string_view<char, constexpr_char_traits<char>> SV;
     constexpr SV  sv1;

+ 2 - 1
test/std/experimental/string.view/string.view.comparison/ople.string_view.string_view.pass.cpp

@@ -16,6 +16,7 @@
 #include <experimental/string_view>
 #include <cassert>
 
+#include "test_macros.h"
 #include "constexpr_char_traits.hpp"
 
 template <class S>
@@ -48,7 +49,7 @@ int main()
     test(S("abcdefghijklmnopqrst"), S("abcdefghijklmnopqrst"), true, true);
     }
 
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
     typedef std::experimental::basic_string_view<char, constexpr_char_traits<char>> SV;
     constexpr SV  sv1;

+ 2 - 1
test/std/experimental/string.view/string.view.comparison/oplt.string_view.pointer.pass.cpp

@@ -17,6 +17,7 @@
 #include <experimental/string_view>
 #include <cassert>
 
+#include "test_macros.h"
 #include "constexpr_char_traits.hpp"
 
 template <class S>
@@ -49,7 +50,7 @@ int main()
     test("abcdefghijklmnopqrst", S("abcdefghijklmnopqrst"), false, false);
     }
 
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
     typedef std::experimental::basic_string_view<char, constexpr_char_traits<char>> SV;
     constexpr SV  sv1;

+ 2 - 1
test/std/experimental/string.view/string.view.comparison/oplt.string_view.string_view.pass.cpp

@@ -16,6 +16,7 @@
 #include <experimental/string_view>
 #include <cassert>
 
+#include "test_macros.h"
 #include "constexpr_char_traits.hpp"
 
 template <class S>
@@ -48,7 +49,7 @@ int main()
     test(S("abcdefghijklmnopqrst"), S("abcdefghijklmnopqrst"), false, false);
     }
 
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
     typedef std::experimental::basic_string_view<char, constexpr_char_traits<char>> SV;
     constexpr SV  sv1;

+ 2 - 1
test/std/experimental/string.view/string.view.comparison/opne.string_view.pointer.pass.cpp

@@ -17,6 +17,7 @@
 #include <experimental/string_view>
 #include <cassert>
 
+#include "test_macros.h"
 #include "constexpr_char_traits.hpp"
 
 template <class S>
@@ -49,7 +50,7 @@ int main()
     test(S("abcdefghijklmnopqrst"), "abcdefghijklmnopqrst", false);
     }
 
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
     typedef std::experimental::basic_string_view<char, constexpr_char_traits<char>> SV;
     constexpr SV  sv1;

+ 2 - 1
test/std/experimental/string.view/string.view.comparison/opne.string_view.string_view.pass.cpp

@@ -16,6 +16,7 @@
 #include <experimental/string_view>
 #include <cassert>
 
+#include "test_macros.h"
 #include "constexpr_char_traits.hpp"
 
 template <class S>
@@ -48,7 +49,7 @@ int main()
     test(S("abcdefghijklmnopqrst"), S("abcdefghijklmnopqrst"), false);
     }
 
-#if _LIBCPP_STD_VER > 11
+#if TEST_STD_VER > 11
     {
     typedef std::experimental::basic_string_view<char, constexpr_char_traits<char>> SV;
     constexpr SV  sv1;

Alguns ficheiros não foram mostrados porque muitos ficheiros mudaram neste diff