Fix broken pattern links

Author: sftrabbit

common-tasks/algorithms/swap-containers.cpp

@@ -33,7 +33,7 @@ int main()
 //
 // On [14], we use `std::vector`'s `swap` member function to swap the
 // contents all in one shot. Alternatively, [16-17] perform the same
-// operation with the [generic swap pattern](/common-tasks/swap-values.html).
+// operation with the [generic swap pattern](/patterns/swap-values.html).
 // This approach is much faster than `std::swap_ranges`, as it simply
 // swaps over the internal storage in constant time. It also does not
 // require the containers to have the same size. However, after the

common-tasks/classes/rule-of-five.cpp

@@ -96,13 +96,13 @@ class foo
 // **Note**: The copy and move assignment operators in the example code
 // provide only basic exception safety. They may alternatively be
 // implemented with [the copy-and-swap
-// idiom](/common-tasks/copy-and-swap.html), which provides strong
+// idiom](/patterns/copy-and-swap.html), which provides strong
 // exception safety at an optimisation cost.
 //
 // **Note**: We can typically avoid manual memory management and
 // having to write the copy constructor, assignment operator, and
 // destructor entirely by using the
-// [rule of zero](/common-tasks/rule-of-zero.html)
+// [rule of zero](/patterns/rule-of-zero.html)
 
 int main()
 {

common-tasks/input-streams/validate-multiple-reads.cpp

@@ -40,5 +40,5 @@ int main()
 // successful.
 //
 // If you are reading values on multiple lines, consider [reading
-// from the stream line-by-line](/common-tasks/read-line-by-line.html)
+// from the stream line-by-line](/patterns/read-line-by-line.html)
 // and then parsing each line.

common-tasks/memory-management/shared-ownership.cpp

@@ -28,4 +28,4 @@ int main()
 // destroyed.
 //
 // In other cases, you may instead wish to [transfer unique ownership
-// of an object](/common-tasks/unique-ownership.html).
+// of an object](/patterns/unique-ownership.html).

common-tasks/memory-management/unique-ownership.cpp

@@ -32,7 +32,7 @@ int main()
 // function.
 //
 // In other cases, you may instead wish to
-// [share ownership of an object](/common-tasks/shared-ownership.html).
+// [share ownership of an object](/patterns/shared-ownership.html).
 //
 // **Note**: `std::make_unique` was introduced in C++14. For C++11,
 // you can [roll your own implementation](http://stackoverflow.com/a/17902439/150634).

common-tasks/memory-management/use-raii-types.cpp

@@ -29,5 +29,5 @@ int main()
 //
 // Likewise, it is good practice to ensure your own classes also
 // implement the RAII idiom with the
-// [rule of five](/common-tasks/rule-of-five.html)
-// or [rule of zero](/common-tasks/rule-of-zero.html).
+// [rule of five](/patterns/rule-of-five.html)
+// or [rule of zero](/patterns/rule-of-zero.html).

common-tasks/random/choose-random-element.cpp

@@ -20,7 +20,7 @@ int main()
 // On [9], we create a [`std::vector`](cpp/container/vector) from
 // which we want to select a random element.
 //
-// We then effectively [roll a die](/common-tasks/roll-a-die.html)
+// We then effectively [roll a die](/patterns/roll-a-die.html)
 // where the numbers on the die are the indices of elements in the
 // container. That is, we seed the
 // [`std::mt19937`](cpp/numeric/random/mersenne_twister_engine) on

common-tasks/ranges/range-based-algorithms.cpp

@@ -56,7 +56,7 @@ void algorithm(ForwardRange& range)
 //
 // If the iterators are not necessary to implement the algorithm, we
 // may instead be able to use a simple
-// [range-based `for` loop](/common-tasks/range-iteration.html).
+// [range-based `for` loop](/patterns/range-iteration.html).
 
 #include <forward_list>
 

common-tasks/time/fixed-time-step.cpp

@@ -44,6 +44,6 @@ int main()
 // This technique is most commonly used in a loop to ensure that the
 // loop iterates with a fixed time step. Alternatively, if you want to
 // sleep for a fixed amount of time, see the [sleep
-// sample](/common-tasks/sleep.html).
+// sample](/patterns/sleep.html).
 
 void some_complex_work() { }