Updating doc links to cppreference.com

thrust/adjacent_difference.h

@@ -51,11 +51,11 @@ namespace thrust
  *  \return The iterator <tt>result + (last - first)</tt>
  *
  *  \tparam DerivedPolicy The name of the derived execution policy.
- *  \tparam InputIterator is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>,
+ *  \tparam InputIterator is a model of <a href="https://en.cppreference.com/w/cpp/iterator/input_iterator">Input Iterator</a>,
  *          and \c x and \c y are objects of \p InputIterator's \c value_type, then \c x - \c is defined,
  *          and \p InputIterator's \c value_type is convertible to a type in \p OutputIterator's set of \c value_types,
  *          and the return type of <tt>x - y</tt> is convertible to a type in \p OutputIterator's set of \c value_types.
- *  \tparam OutputIterator is a model of <a href="http://www.sgi.com/tech/stl/OutputIterator.html">Output Iterator</a>.
+ *  \tparam OutputIterator is a model of <a href="https://en.cppreference.com/w/cpp/iterator/output_iterator">Output Iterator</a>.
  *
  *  \remark Note that \p result is permitted to be the same iterator as \p first. This is
  *          useful for computing differences "in place".
@@ -77,7 +77,7 @@ namespace thrust
  *  // d_result is now [1, 1, -1, 1, -1, 1, -1, 1]
  *  \endcode
  *
- *  \see http://www.sgi.com/tech/stl/adjacent_difference.html
+ *  \see https://en.cppreference.com/w/cpp/algorithm/adjacent_difference
  *  \see inclusive_scan
  */
 template<typename DerivedPolicy, typename InputIterator, typename OutputIterator>
@@ -105,10 +105,10 @@ OutputIterator adjacent_difference(const thrust::detail::execution_policy_base<D
  *  \return The iterator <tt>result + (last - first)</tt>
  *
  *  \tparam DerivedPolicy The name of the derived execution policy.
- *  \tparam InputIterator is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>,
+ *  \tparam InputIterator is a model of <a href="https://en.cppreference.com/w/cpp/iterator/input_iterator">Input Iterator</a>,
  *          and \p InputIterator's \c value_type is convertible to \p BinaryFunction's \c first_argument_type and \c second_argument_type,
  *          and \p InputIterator's \c value_type is convertible to a type in \p OutputIterator's set of \c value_types.
- *  \tparam OutputIterator is a model of <a href="http://www.sgi.com/tech/stl/OutputIterator.html">Output Iterator</a>.
+ *  \tparam OutputIterator is a model of <a href="https://en.cppreference.com/w/cpp/iterator/output_iterator">Output Iterator</a>.
  *  \tparam BinaryFunction's \c result_type is convertible to a type in \p OutputIterator's set of \c value_types.
  *
  *  \remark Note that \p result is permitted to be the same iterator as \p first. This is
@@ -132,7 +132,7 @@ OutputIterator adjacent_difference(const thrust::detail::execution_policy_base<D
  *  // d_result is now [1, 3, 3, 3, 3, 3, 3, 3]
  *  \endcode
  *
- *  \see http://www.sgi.com/tech/stl/adjacent_difference.html
+ *  \see https://en.cppreference.com/w/cpp/algorithm/adjacent_difference
  *  \see inclusive_scan
  */
 template<typename DerivedPolicy, typename InputIterator, typename OutputIterator, typename BinaryFunction>
@@ -156,11 +156,11 @@ OutputIterator adjacent_difference(const thrust::detail::execution_policy_base<D
  *  \param result The beginning of the output range.
  *  \return The iterator <tt>result + (last - first)</tt>
  *
- *  \tparam InputIterator is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>,
+ *  \tparam InputIterator is a model of <a href="https://en.cppreference.com/w/cpp/iterator/input_iterator">Input Iterator</a>,
  *          and \c x and \c y are objects of \p InputIterator's \c value_type, then \c x - \c is defined,
  *          and \p InputIterator's \c value_type is convertible to a type in \p OutputIterator's set of \c value_types,
  *          and the return type of <tt>x - y</tt> is convertible to a type in \p OutputIterator's set of \c value_types.
- *  \tparam OutputIterator is a model of <a href="http://www.sgi.com/tech/stl/OutputIterator.html">Output Iterator</a>.
+ *  \tparam OutputIterator is a model of <a href="https://en.cppreference.com/w/cpp/iterator/output_iterator">Output Iterator</a>.
  *
  *  \remark Note that \p result is permitted to be the same iterator as \p first. This is
  *          useful for computing differences "in place".
@@ -181,7 +181,7 @@ OutputIterator adjacent_difference(const thrust::detail::execution_policy_base<D
  *  // d_result is now [1, 1, -1, 1, -1, 1, -1, 1]
  *  \endcode
  *
- *  \see http://www.sgi.com/tech/stl/adjacent_difference.html
+ *  \see https://en.cppreference.com/w/cpp/algorithm/adjacent_difference
  *  \see inclusive_scan
  */
 template <typename InputIterator, typename OutputIterator>
@@ -203,10 +203,10 @@ OutputIterator adjacent_difference(InputIterator first, InputIterator last,
  *  \param binary_op The binary function used to compute differences.
  *  \return The iterator <tt>result + (last - first)</tt>
  *
- *  \tparam InputIterator is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>,
+ *  \tparam InputIterator is a model of <a href="https://en.cppreference.com/w/cpp/iterator/input_iterator">Input Iterator</a>,
  *          and \p InputIterator's \c value_type is convertible to \p BinaryFunction's \c first_argument_type and \c second_argument_type,
  *          and \p InputIterator's \c value_type is convertible to a type in \p OutputIterator's set of \c value_types.
- *  \tparam OutputIterator is a model of <a href="http://www.sgi.com/tech/stl/OutputIterator.html">Output Iterator</a>.
+ *  \tparam OutputIterator is a model of <a href="https://en.cppreference.com/w/cpp/iterator/output_iterator">Output Iterator</a>.
  *  \tparam BinaryFunction's \c result_type is convertible to a type in \p OutputIterator's set of \c value_types.
  *
  *  \remark Note that \p result is permitted to be the same iterator as \p first. This is
@@ -229,7 +229,7 @@ OutputIterator adjacent_difference(InputIterator first, InputIterator last,
  *  // d_result is now [1, 3, 3, 3, 3, 3, 3, 3]
  *  \endcode
  *
- *  \see http://www.sgi.com/tech/stl/adjacent_difference.html
+ *  \see https://en.cppreference.com/w/cpp/algorithm/adjacent_difference
  *  \see inclusive_scan
  */
 template <typename InputIterator, typename OutputIterator, typename BinaryFunction>

thrust/advance.h

@@ -38,7 +38,7 @@ namespace thrust
  *  \param i The iterator to be advanced.
  *  \param n The distance by which to advance the iterator.
  *
- *  \tparam InputIterator is a model of <a href="http://www.sgi.com/tech/stl/InputIterator.html">Input Iterator</a>.
+ *  \tparam InputIterator is a model of <a href="https://en.cppreference.com/w/cpp/iterator/input_iterator">Input Iterator</a>.
  *  \tparam Distance is an integral type that is convertible to \p InputIterator's distance type.
  *
  *  \pre \p n shall be negative only for bidirectional and random access iterators.
@@ -58,7 +58,7 @@ namespace thrust
  *  // iter - vec.begin() == 7
  *  \endcode
  *
- *  \see http://www.sgi.com/tech/stl/advance.html
+ *  \see https://en.cppreference.com/w/cpp/iterator/advance
  */
 template <typename InputIterator, typename Distance>
 __host__ __device__