urlchecker::url_check()

Author: DavisVaughan

NEWS.md

@@ -13,7 +13,7 @@
 # cpp11 0.5.1
 
 * cpp11 now requires R >=4.0.0, in line with the
-  [tidyverse version policy](https://www.tidyverse.org/blog/2019/04/r-version-support/) (#411).
+  [tidyverse version policy](https://tidyverse.org/blog/2019/04/r-version-support/) (#411).
 
 * Because cpp11 now requires R >=4.0.0, a number of previously optional tools
   are now always available, allowing us to remove some dead code. In

README.md

@@ -19,7 +19,7 @@ LinkingTo: cpp11
 ```
 
 Then decorate C++ functions you want to expose to R with `[[cpp11::register]]`.
-*Note that this is a [C++11 attribute](https://en.cppreference.com/w/cpp/language/attributes), not a comment like is used in Rcpp.*
+*Note that this is a [C++11 attribute](https://en.cppreference.com/w/cpp/language/attributes.html), not a comment like is used in Rcpp.*
 
 cpp11 is a header only library with no hard dependencies and does not use a shared library, so it is straightforward and reliable to use in packages without fear of compile-time and run-time mismatches.
 

vignettes/FAQ.Rmd

@@ -153,7 +153,7 @@ is_named(c(x = "foo"))
 
 #### 7. How do I return a `cpp11::writable::logicals` object with only a `FALSE` value?
 
-You need to use [list initialization](https://en.cppreference.com/w/cpp/language/list_initialization) with `{}` to create the object.
+You need to use [list initialization](https://en.cppreference.com/w/cpp/language/list_initialization.html) with `{}` to create the object.
 
 ```{cpp11}
 #include <cpp11.hpp>

vignettes/cpp11.Rmd

@@ -45,7 +45,7 @@ Typical bottlenecks that C++ can address include:
 The aim of this vignette is to discuss only those aspects of C++ and cpp11 that are absolutely necessary to help you eliminate bottlenecks in your code.
 We won't spend much time on advanced features like object-oriented programming or templates because the focus is on writing small, self-contained functions, not big programs.
 A working knowledge of C++ is helpful, but not essential.
-Many good tutorials and references are freely available, including <https://www.learncpp.com/> and <https://en.cppreference.com/w/cpp>.
+Many good tutorials and references are freely available, including <https://www.learncpp.com/> and <https://en.cppreference.com/w/cpp.html>.
 For more advanced topics, the *Effective C++* series by Scott Meyers is a popular choice.
 
 ### Outline
@@ -510,7 +510,7 @@ f("x"_nm = "y", "value"_nm = 1);
 All R objects have attributes, which can be queried and modified with `.attr()`.
 cpp11 also provides `.names()` as an alias for the `names` attribute.
 The following code snippet illustrates these methods.
-Note the use of `{}` [initializer list](https://en.cppreference.com/w/cpp/utility/initializer_list) syntax.
+Note the use of `{}` [initializer list](https://en.cppreference.com/w/cpp.html/utility/initializer_list) syntax.
 This allows you to create an R vector from C++ scalar values:
 
 ```{r attribs, engine = "cpp11"}
@@ -650,7 +650,7 @@ The standard template library (STL) provides a set of extremely useful data stru
 This section will explain some of the most important algorithms and data structures and point you in the right direction to learn more.
 I can't teach you everything you need to know about the STL, but hopefully the examples will show you the power of the STL, and persuade you that it's useful to learn more.
 
-If you need an algorithm or data structure that isn't implemented in STL, one place to look is [boost](https://www.boost.org/doc/).
+If you need an algorithm or data structure that isn't implemented in STL, one place to look is [boost](https://www.boost.org/libraries/).
 Installing boost on your computer is beyond the scope of this vignette, but once you have it installed, you can use boost data structures and algorithms by including the appropriate header file with (e.g.) `#include <boost/array.hpp>`.
 
 ### Using iterators
@@ -736,7 +736,7 @@ local({
 ### Algorithms
 
 The `<algorithm>` header provides a large number of algorithms that work with iterators.
-A good reference is available at <https://en.cppreference.com/w/cpp/algorithm>.
+A good reference is available at <https://en.cppreference.com/w/cpp.html/algorithm>.
 For example, we could write a basic cpp11 version of `findInterval()` that takes two arguments, a vector of values and a vector of breaks, and locates the bin that each x falls into.
 This shows off a few more advanced iterator features.
 Read the code below and see if you can figure out how it works.
@@ -790,7 +790,7 @@ The most important of these data structures are the `vector`, the `unordered_set
 We'll focus on these three in this section, but using the others is similar: they just have different performance trade-offs.
 For example, the `deque` (pronounced "deck") has a very similar interface to vectors but a different underlying implementation that has different performance trade-offs.
 You may want to try it for your problem.
-A good reference for STL data structures is <https://en.cppreference.com/w/cpp/container> --- I recommend you keep it open while working with the STL.
+A good reference for STL data structures is <https://en.cppreference.com/w/cpp.html/container> --- I recommend you keep it open while working with the STL.
 
 cpp11 knows how to convert from many STL data structures to their R equivalents, so you can return them from your functions without explicitly converting to R data structures.
 
@@ -843,7 +843,7 @@ list rle_cpp(doubles x) {
 (An alternative implementation would be to replace `i` with the iterator `lengths.rbegin()` which always points to the last element of the vector.
 You might want to try implementing that.)
 
-Other methods of a vector are described at <https://en.cppreference.com/w/cpp/container/vector>.
+Other methods of a vector are described at <https://en.cppreference.com/w/cpp.html/container/vector>.
 
 ### Sets
 
@@ -854,7 +854,7 @@ Unordered sets can somtimes be much faster (because they use a hash table intern
 Often even if you need an ordered set, you could consider using an unordered set and then sorting the output.
 Benchmarking with your expected dataset is the best way to determine which is fastest for your data.
 Like vectors, sets are templated, so you need to request the appropriate type of set for your purpose: `unordered_set<int>`, `unordered_set<bool>`, etc.
-More details are available at <https://en.cppreference.com/w/cpp/container/set> and <https://en.cppreference.com/w/cpp/container/unordered_set>.
+More details are available at <https://en.cppreference.com/w/cpp.html/container/set> and <https://en.cppreference.com/w/cpp.html/container/unordered_set>.
 
 The following function uses an unordered set to implement an equivalent to `duplicated()` for integer vectors.
 Note the use of `seen.insert(x[i]).second`.

vignettes/internals.Rmd

@@ -108,7 +108,7 @@ The various methods for both functions are defined in [cpp11/as.hpp](https://git
 
 This is definitely the most complex part of the cpp11 code, with extensive use of [template metaprogramming](https://en.wikipedia.org/wiki/Template_metaprogramming).
 In particular the [substitution failure is not an error (SFINAE)](https://en.wikipedia.org/wiki/Substitution_failure_is_not_an_error) technique is used to control overloading of the functions.
-If we could use C++20 a lot of this code would be made simpler with [Concepts](https://en.cppreference.com/w/cpp/language/constraints), but alas.
+If we could use C++20 a lot of this code would be made simpler with [Concepts](https://en.cppreference.com/w/cpp/language/constraints.html), but alas.
 
 The most common C++ types are included in the test suite and should work without issues, as more exotic types are used in real projects additional issues may arise.
 

vignettes/motivations.Rmd

@@ -339,12 +339,12 @@ Concretely cpp11 always uses `Rf_translateCharUTF8()` when obtaining `const char
 C++11 provides a host of new features to the C++ language.
 cpp11 uses a number of these including
 
--   [move semantics](https://en.cppreference.com/w/cpp/language/move_constructor)
--   [type traits](https://en.cppreference.com/w/cpp/header/type_traits)
--   [initializer_list](https://en.cppreference.com/w/cpp/utility/initializer_list)
--   [variadic templates / parameter packs](https://en.cppreference.com/w/cpp/language/parameter_pack)
--   [user defined literals](https://en.cppreference.com/w/cpp/language/user_literal)
--   [user defined attributes](https://en.cppreference.com/w/cpp/language/attributes)
+-   [move semantics](https://en.cppreference.com/w/cpp/language/move_constructor.html)
+-   [type traits](https://en.cppreference.com/w/cpp/header/type_traits.html)
+-   [initializer_list](https://en.cppreference.com/w/cpp/utility/initializer_list.html)
+-   [variadic templates / parameter packs](https://en.cppreference.com/w/cpp/language/parameter_pack.html)
+-   [user defined literals](https://en.cppreference.com/w/cpp/language/user_literal.html)
+-   [user defined attributes](https://en.cppreference.com/w/cpp/language/attributes.html)
 
 ## Simpler implementation {#simpler-implementation}