(C++11) の前にスペースを入れた

以下のコマンドを用い、細かい部分は手で修正した。
    find . -type f | grep -v .git | xargs perl -i -ple 's/([^ ])\(C\+\+11\)/$1 (C++11)/g'

reference/algorithm/all_of.md

@@ -1,4 +1,4 @@
-#all_of(C++11)
+#all_of (C++11)
 ```cpp
 namespace std {
   template <class InputIterator, class Predicate>

reference/algorithm/any_of.md

@@ -1,4 +1,4 @@
-#any_of(C++11)
+#any_of (C++11)
 ```cpp
 namespace std {
   template <class InputIterator, class Predicate>

reference/algorithm/copy_if.md

@@ -1,4 +1,4 @@
-#copy_if(C++11)
+#copy_if (C++11)
 ```cpp
 namespace std {
   template <class InputIterator, class OutputIterator, class Predicate>

reference/algorithm/copy_n.md

@@ -1,4 +1,4 @@
-#copy_n(C++11)
+#copy_n (C++11)
 
 ```cpp
 namespace std {

reference/algorithm/find_if_not.md

@@ -1,4 +1,4 @@
-#find_if_not(C++11)
+#find_if_not (C++11)
 ```cpp
 namespace std {
   template<class InputIterator, class Predicate>

reference/algorithm/is_heap.md

@@ -1,4 +1,4 @@
-#is_heap(C++11)
+#is_heap (C++11)
 ```cpp
 namespace std {
   template <class RandomAccessIterator>

reference/algorithm/is_heap_until.md

@@ -1,4 +1,4 @@
-#is_heap_until(C++11)
+#is_heap_until (C++11)
 ```cpp
 namespace std {
   template <class RandomAccessIterator>

reference/algorithm/is_partitioned.md

@@ -1,4 +1,4 @@
-#is_partitioned(C++11)
+#is_partitioned (C++11)
 ```cpp
 namespace std {
   template <class InputIterator, class Predicate>

reference/algorithm/is_permutation.md

@@ -1,4 +1,4 @@
-#is_permutation(C++11)
+#is_permutation (C++11)
 ```cpp
 namespace std {
   template <class ForwardIterator1, class ForwardIterator2>

reference/algorithm/is_sorted.md

@@ -1,4 +1,4 @@
-#is_sorted(C++11)
+#is_sorted (C++11)
 
 ##概要
 与えられた範囲がソート済みか判定する。

reference/algorithm/is_sorted_until.md

@@ -1,4 +1,4 @@
-#is_sorted_until(C++11)
+#is_sorted_until (C++11)
 ```cpp
 namespace std {
   template <class ForwardIterator>

reference/algorithm/minmax.md

@@ -1,4 +1,4 @@
-#minmax(C++11)
+#minmax (C++11)
 ```cpp
 namespace std {
   template <class T>

reference/algorithm/minmax_element.md

@@ -1,4 +1,4 @@
-#minmax_element(C++11)
+#minmax_element (C++11)
 ```cpp
 namespace std {
 

reference/algorithm/move.md

@@ -1,4 +1,4 @@
-#move(C++11)
+#move (C++11)
 
 ```cpp
 namespace std {

reference/algorithm/move_backward.md

@@ -1,4 +1,4 @@
-#move_backward(C++11)
+#move_backward (C++11)
 ```cpp
 namespace std {
   template<class BidirectionalIterator1, class BidirectionalIterator2>

reference/algorithm/none_of.md

@@ -1,4 +1,4 @@
-#none_of(C++11)
+#none_of (C++11)
 ```cpp
 namespace std {
   template <class InputIterator, class Predicate>

reference/algorithm/partition_copy.md

@@ -1,4 +1,4 @@
-#partition_copy(C++11)
+#partition_copy (C++11)
 ```cpp
 namespace std {
   template <class InputIterator, class OutputIterator1, class OutputIterator2, class Predicate>

reference/algorithm/partition_point.md

@@ -1,4 +1,4 @@
-#partition_point(C++11)
+#partition_point (C++11)
 ```cpp
 namespace std {
   template <class ForwardIterator, class Predicate>

reference/algorithm/shuffle.md

@@ -1,4 +1,4 @@
-#shuffle(C++11)
+#shuffle (C++11)
 
 ```cpp
 namespace std {

reference/array.md

@@ -1,4 +1,4 @@
-#array(C++11)
+#array (C++11)
 ```cpp
 namespace std {
   template <class T, size_t N>

reference/array/array.md

@@ -1,4 +1,4 @@
-#初期化(C++11)
+#初期化 (C++11)
 ```cpp
 namespace std {
   template <class T, size_t N >

reference/array/at.md

@@ -1,4 +1,4 @@
-#at(C++11)
+#at (C++11)
 ```cpp
 const_reference at(size_type n) const;
 reference at(size_type n);

reference/array/back.md

@@ -1,4 +1,4 @@
-#back(C++11)
+#back (C++11)
 ```cpp
 reference back();
 const_reference back() const;

reference/array/begin.md

@@ -1,4 +1,4 @@
-#begin(C++11)
+#begin (C++11)
 ```cpp
 iterator begin() noexcept;
 const_iterator begin() const noexcept;

reference/array/cbegin.md

@@ -1,4 +1,4 @@
-#cbegin(C++11)
+#cbegin (C++11)
 ```cpp
 const_iterator cbegin() const noexcept;
 ```

reference/array/cend.md

@@ -1,4 +1,4 @@
-#cend(C++11)
+#cend (C++11)
 ```cpp
 const_iterator cend() const noexcept;
 ```

reference/array/crbegin.md

@@ -1,4 +1,4 @@
-#crbegin(C++11)
+#crbegin (C++11)
 ```cpp
 const_reverse_iterator crbegin() const noexcept;
 ```

reference/array/crend.md

@@ -1,4 +1,4 @@
-#crend(C++11)
+#crend (C++11)
 ```cpp
 const_reverse_iterator crend() const noexcept;
 ```

reference/array/data.md

@@ -1,4 +1,4 @@
-#data(C++11)
+#data (C++11)
 ```cpp
 T* data() noexcept;
 const T* data() const noexcept;

reference/array/empty.md

@@ -1,4 +1,4 @@
-#empty(C++11)
+#empty (C++11)
 ```cpp
 constexpr bool empty() noexcept;
 ```

reference/array/end.md

@@ -1,4 +1,4 @@
-#end(C++11)
+#end (C++11)
 ```cpp
 iterator end() noexcept;
 const_iterator end() const noexcept;

reference/array/fill.md

@@ -1,4 +1,4 @@
-#fill(C++11)
+#fill (C++11)
 ```cpp
 void fill(const T& u);
 ```

reference/array/front.md

@@ -1,4 +1,4 @@
-#front(C++11)
+#front (C++11)
 ```cpp
 reference front();
 const_reference front() const;

reference/array/get.md

@@ -1,4 +1,4 @@
-#get(C++11)
+#get (C++11)
 ```cpp
 namespace std {
   template <size_t I, class T, size_t N>

reference/array/greater.md

@@ -1,4 +1,4 @@
-#operator>(C++11)
+#operator> (C++11)
 ```cpp
 namespace std {
   template <class T, size_t N>

reference/array/greater_equal.md

@@ -1,4 +1,4 @@
-#operator>=(C++11)
+#operator>= (C++11)
 ```cpp
 namespace std {
   template <class T, size_t N>

reference/array/less.md

@@ -1,4 +1,4 @@
-#operator<(C++11)
+#operator< (C++11)
 ```cpp
 namespace std {
   template <class T, size_t N>

reference/array/less_equal.md

@@ -1,4 +1,4 @@
-#operator<=(C++11)
+#operator<= (C++11)
 ```cpp
 namespace std {
   template <class T, size_t N>

reference/array/max_size.md

@@ -1,4 +1,4 @@
-#max_size(C++11)
+#max_size (C++11)
 ```cpp
 constexpr size_type max_size() noexcept;
 ```

reference/array/not_equal.md

@@ -1,4 +1,4 @@
-#operator!=(C++11)
+#operator!= (C++11)
 ```cpp
 namespace std {
   template <class T, size_t N>

reference/array/op_at.md

@@ -1,4 +1,4 @@
-#operator[](C++11)
+#operator[] (C++11)
 ```cpp
 reference operator[](size_type n);
 const_reference operator[](size_type n) const;

reference/array/op_equal.md

@@ -1,4 +1,4 @@
-#operator==(C++11)
+#operator== (C++11)
 ```cpp
 namespace std {
   template <class T, size_t N>

reference/array/rbegin.md

@@ -1,4 +1,4 @@
-#rbegin(C++11)
+#rbegin (C++11)
 ```cpp
 reverse_iterator rbegin() noexcept;
 const_reverse_iterator rbegin() const noexcept;

reference/array/rend.md

@@ -1,4 +1,4 @@
-#rend(C++11)
+#rend (C++11)
 ```cpp
 reverse_iterator rend() noexcept;
 const_reverse_iterator rend() const noexcept;

reference/array/size.md

@@ -1,4 +1,4 @@
-#size(C++11)
+#size (C++11)
 ```cpp
 constexpr size_type size() noexcept;
 ```

reference/array/swap.md

@@ -1,4 +1,4 @@
-#swap(C++11)
+#swap (C++11)
 ```cpp
 void swap(array& other) noexcept(noexcept(swap(declval<T&>(), declval<T&>())));
 ```

reference/array/swap_free.md

@@ -1,4 +1,4 @@
-#swap(非メンバ関数)(C++11)
+#swap(非メンバ関数) (C++11)
 ```cpp
 namespace std {
   template <class T, size_t N>

reference/array/tuple_element.md

@@ -1,4 +1,4 @@
-#tuple_element(C++11)
+#tuple_element (C++11)
 ```cpp
 namespace std {
   template <size_t I, class T> class tuple_element; // 先行宣言

reference/array/tuple_size.md

@@ -1,4 +1,4 @@
-#tuple_size(C++11)
+#tuple_size (C++11)
 ```cpp
 namespace std {
   template <class T> class tuple_size; // 先行宣言

reference/atomic.md

@@ -1,4 +1,4 @@
-#atomic(C++11)
+#atomic (C++11)
 `<atomic>`ヘッダでは、アトミック操作(atomic operation ： 不可分操作とも呼ばれる)のライブラリを提供する。
 
 アトミック操作は、スレッド間でデータをやり取りするための最も基本的な同期プリミティブであり、

reference/atomic/atomic.md

@@ -1,4 +1,4 @@
-#atomic(C++11)
+#atomic (C++11)
 ```cpp
 namespace std {
   template<class T> struct atomic;

reference/atomic/atomic/atomic.md

@@ -1,4 +1,4 @@
-#コンストラクタ(C++11)
+#コンストラクタ (C++11)
 ```cpp
 atomic() noexcept = default;
 constexpr atomic(T desired) noexcept;

reference/atomic/atomic/compare_exchange_strong.md

@@ -1,4 +1,4 @@
-#compare_exchange_strong(C++11)
+#compare_exchange_strong (C++11)
 ```cpp
 bool compare_exchange_strong(T& expected, T desired, memory_order success, memory_order failure) volatile noexcept;
 bool compare_exchange_strong(T& expected, T desired, memory_order success, memory_order failure) noexcept;

reference/atomic/atomic/compare_exchange_weak.md

@@ -1,4 +1,4 @@
-#compare_exchange_weak(C++11)
+#compare_exchange_weak (C++11)
 ```cpp
 bool compare_exchange_weak(T& expected, T desired, memory_order success, memory_order failure) volatile noexcept;
 bool compare_exchange_weak(T& expected, T desired, memory_order success, memory_order failure) noexcept;

reference/atomic/atomic/exchange.md

@@ -1,4 +1,4 @@
-#exchange(C++11)
+#exchange (C++11)
 ```cpp
 T exchange(T desired, memory_order order = memory_order_seq_cst) volatile noexcept;
 T exchange(T desired, memory_order order = memory_order_seq_cst) noexcept;

reference/atomic/atomic/fetch_add.md

@@ -1,4 +1,4 @@
-#fetch_add(C++11)
+#fetch_add (C++11)
 ```cpp
 T fetch_add(T operand, memory_order order = memory_order_seq_cst) volatile noexcept;
 T fetch_add(T operand, memory_order order = memory_order_seq_cst) noexcept;

reference/atomic/atomic/fetch_and.md

@@ -1,4 +1,4 @@
-#fetch_and(C++11)
+#fetch_and (C++11)
 ```cpp
 T fetch_and(T operand, memory_order order = memory_order_seq_cst) volatile noexcept;
 T fetch_and(T operand, memory_order order = memory_order_seq_cst) noexcept;

reference/atomic/atomic/fetch_or.md

@@ -1,4 +1,4 @@
-#fetch_or(C++11)
+#fetch_or (C++11)
 ```cpp
 T fetch_or(T operand, memory_order order = memory_order_seq_cst) volatile noexcept;
 T fetch_or(T operand, memory_order order = memory_order_seq_cst) noexcept;

reference/atomic/atomic/fetch_sub.md

@@ -1,4 +1,4 @@
-#fetch_sub(C++11)
+#fetch_sub (C++11)
 ```cpp
 T fetch_sub(T operand, memory_order order = memory_order_seq_cst) volatile noexcept;
 T fetch_sub(T operand, memory_order order = memory_order_seq_cst) noexcept;

reference/atomic/atomic/fetch_xor.md

@@ -1,4 +1,4 @@
-#fetch_xor(C++11)
+#fetch_xor (C++11)
 ```cpp
 T fetch_xor(T operand, memory_order order = memory_order_seq_cst) volatile noexcept;
 T fetch_xor(T operand, memory_order order = memory_order_seq_cst) noexcept;

reference/atomic/atomic/is_lock_free.md

@@ -1,4 +1,4 @@
-#is_lock_free(C++11)
+#is_lock_free (C++11)
 ```cpp
 bool is_lock_free() const volatile noexcept;
 bool is_lock_free() const noexcept;

reference/atomic/atomic/load.md

@@ -1,4 +1,4 @@
-#load(C++11)
+#load (C++11)
 ```cpp
 T load(memory_order order = memory_order_seq_cst) const volatile noexcept;
 T load(memory_order order = memory_order_seq_cst) const noexcept;

reference/atomic/atomic/op_and_assign.md

@@ -1,4 +1,4 @@
-#operator&=(C++11)
+#operator&= (C++11)
 ```cpp
 T operator&=(T operand) volatile noexcept;
 T operator&=(T operand) noexcept;

reference/atomic/atomic/op_assign.md

@@ -1,4 +1,4 @@
-#代入演算子(C++11)
+#代入演算子 (C++11)
 ```cpp
 atomic& operator=(const atomic&) = delete;
 atomic& operator=(const atomic&) volatile = delete;

reference/atomic/atomic/op_decrement.md

@@ -1,4 +1,4 @@
-#operator--(C++11)
+#operator-- (C++11)
 ```cpp
 T operator--() volatile noexcept;
 T operator--() noexcept;

reference/atomic/atomic/op_increment.md

@@ -1,4 +1,4 @@
-#operator++(C++11)
+#operator++ (C++11)
 ```cpp
 T operator++() volatile noexcept;
 T operator++() noexcept;