[comparisons.three.way,func.search] Add namespace around class definition

Author: jensmaurer

source/utilities.tex

@@ -10549,12 +10549,14 @@
 
 \indexlibraryglobal{compare_three_way}%
 \begin{codeblock}
-struct compare_three_way {
-  template<class T, class U>
-    constexpr auto operator()(T&& t, U&& u) const;
+namespace std {
+  struct compare_three_way {
+    template<class T, class U>
+      constexpr auto operator()(T&& t, U&& u) const;
 
-  using is_transparent = @\unspec@;
-};
+    using is_transparent = @\unspec@;
+  };
+}
 \end{codeblock}
 
 \begin{itemdecl}
@@ -12387,7 +12389,8 @@
 
 \indexlibraryglobal{default_searcher}%
 \begin{codeblock}
-template<class ForwardIterator1, class BinaryPredicate = equal_to<>>
+namespace std {
+  template<class ForwardIterator1, class BinaryPredicate = equal_to<>>
   class default_searcher {
   public:
     constexpr default_searcher(ForwardIterator1 pat_first, ForwardIterator1 pat_last,
@@ -12402,6 +12405,7 @@
     ForwardIterator1 pat_last_;         // \expos
     BinaryPredicate pred_;              // \expos
   };
+}
 \end{codeblock}
 
 \indexlibraryctor{default_searcher}%
@@ -12446,9 +12450,10 @@
 
 \indexlibraryglobal{boyer_moore_searcher}%
 \begin{codeblock}
-template<class RandomAccessIterator1,
-         class Hash = hash<typename iterator_traits<RandomAccessIterator1>::value_type>,
-         class BinaryPredicate = equal_to<>>
+namespace std {
+  template<class RandomAccessIterator1,
+           class Hash = hash<typename iterator_traits<RandomAccessIterator1>::value_type>,
+           class BinaryPredicate = equal_to<>>
   class boyer_moore_searcher {
   public:
     boyer_moore_searcher(RandomAccessIterator1 pat_first,
@@ -12466,6 +12471,7 @@
     Hash hash_;                         // \expos
     BinaryPredicate pred_;              // \expos
   };
+}
 \end{codeblock}
 
 \indexlibraryctor{boyer_moore_searcher}%
@@ -12545,9 +12551,10 @@
 
 \indexlibraryglobal{boyer_moore_horspool_searcher}%
 \begin{codeblock}
-template<class RandomAccessIterator1,
-         class Hash = hash<typename iterator_traits<RandomAccessIterator1>::value_type>,
-         class BinaryPredicate = equal_to<>>
+namespace std {
+  template<class RandomAccessIterator1,
+           class Hash = hash<typename iterator_traits<RandomAccessIterator1>::value_type>,
+           class BinaryPredicate = equal_to<>>
   class boyer_moore_horspool_searcher {
   public:
     boyer_moore_horspool_searcher(RandomAccessIterator1 pat_first,
@@ -12565,6 +12572,7 @@
     Hash hash_;                         // \expos
     BinaryPredicate pred_;              // \expos
   };
+}
 \end{codeblock}
 
 \indexlibraryctor{boyer_moore_horspool_searcher}%