From 658436d8a0181db7bd7dee7ea48ca0b235397d4a Mon Sep 17 00:00:00 2001 From: Enrico Seiler Date: Sat, 15 Aug 2020 16:46:18 +0200 Subject: [PATCH] [DOC] Fix broken cppreference links --- include/seqan3/alphabet/composite/alphabet_variant.hpp | 2 +- include/seqan3/argument_parser/argument_parser.hpp | 4 ++-- include/seqan3/core/concept/core_language.hpp | 4 ++-- include/seqan3/io/detail/ignore_output_iterator.hpp | 2 +- include/seqan3/io/detail/out_file_iterator.hpp | 2 +- include/seqan3/range/container/aligned_allocator.hpp | 2 +- include/seqan3/range/container/concept.hpp | 6 +++--- include/seqan3/range/decorator/gap_decorator.hpp | 4 ++-- 8 files changed, 13 insertions(+), 13 deletions(-) diff --git a/include/seqan3/alphabet/composite/alphabet_variant.hpp b/include/seqan3/alphabet/composite/alphabet_variant.hpp index 5e6c70cebc..08a5a2eab7 100644 --- a/include/seqan3/alphabet/composite/alphabet_variant.hpp +++ b/include/seqan3/alphabet/composite/alphabet_variant.hpp @@ -81,7 +81,7 @@ namespace seqan3 * * The alphabet_variant represents the union of two or more alternative alphabets (e.g. the * four letter DNA alternative + the gap alternative). It behaves similar to a - * [variant](https://en.cppreference.com/w/cpp/language/variant) or std::variant, but it preserves the + * [variant](https://en.cppreference.com/w/cpp/utility/variant) or std::variant, but it preserves the * seqan3::alphabet. * * Short description: diff --git a/include/seqan3/argument_parser/argument_parser.hpp b/include/seqan3/argument_parser/argument_parser.hpp index f3e754639f..d0b8883eb4 100644 --- a/include/seqan3/argument_parser/argument_parser.hpp +++ b/include/seqan3/argument_parser/argument_parser.hpp @@ -215,7 +215,7 @@ class argument_parser * If option_type is a container, its value type must have the * formatted input function (exception: std::string is not * regarded as a container). - * See FormattedInputFunction . + * See FormattedInputFunction . * \tparam validator_type The type of validator to be applied to the option * value. Must model seqan3::validator. * @@ -277,7 +277,7 @@ class argument_parser * If option_type is a container, its value type must have the * formatted input function (exception: std::string is not * regarded as a container). - * See FormattedInputFunction . + * See FormattedInputFunction . * \tparam validator_type The type of validator to be applied to the option * value. Must model seqan3::validator. * diff --git a/include/seqan3/core/concept/core_language.hpp b/include/seqan3/core/concept/core_language.hpp index 4bd89d482f..90c74444f0 100644 --- a/include/seqan3/core/concept/core_language.hpp +++ b/include/seqan3/core/concept/core_language.hpp @@ -161,7 +161,7 @@ SEQAN3_CONCEPT trivially_copyable = std::copyable && std::is_trivially_copyab * \brief A type that satisfies seqan3::trivially_copyable and seqan3::trivially_destructible. * \extends seqan3::trivially_copyable * \extends seqan3::trivially_destructible - * \sa https://en.cppreference.com/w/cpp/experimental/ranges/concepts/copyable + * \sa https://en.cppreference.com/w/cpp/types/is_trivial */ //!\cond template @@ -170,7 +170,7 @@ SEQAN3_CONCEPT trivial = trivially_copyable && trivially_destructible && s /*!\interface seqan3::standard_layout * \brief Resolves to std::is_standard_layout_v. - * \sa https://en.cppreference.com/w/cpp/named_req/standard_layoutType + * \sa https://en.cppreference.com/w/cpp/types/is_standard_layout */ //!\cond template diff --git a/include/seqan3/io/detail/ignore_output_iterator.hpp b/include/seqan3/io/detail/ignore_output_iterator.hpp index 35d1c7ffea..d830c1824a 100644 --- a/include/seqan3/io/detail/ignore_output_iterator.hpp +++ b/include/seqan3/io/detail/ignore_output_iterator.hpp @@ -33,7 +33,7 @@ class ignore_output_iterator /*!\name Member types * \{ * \brief Associated types are void for output iterators, see also - * [output iterator concept](https://en.cppreference.com/w/cpp/concept/output_iterator). + * [output iterator concept](https://en.cppreference.com/w/cpp/iterator/output_iterator). */ //!\brief The value type (void). diff --git a/include/seqan3/io/detail/out_file_iterator.hpp b/include/seqan3/io/detail/out_file_iterator.hpp index 091285a5d6..874efbc1dd 100644 --- a/include/seqan3/io/detail/out_file_iterator.hpp +++ b/include/seqan3/io/detail/out_file_iterator.hpp @@ -36,7 +36,7 @@ namespace seqan3::detail * std::default_sentinel always return false (there is no end in an output file). * * If any of these characteristics seem unusual to you, please refer to the [standard library's - * documentation on output iterators](https://en.cppreference.com/w/cpp/concept/output_iterator). + * documentation on output iterators](https://en.cppreference.com/w/cpp/iterator/output_iterator). * * This class template differs from std::back_insert_iterator only in that it performs * no checks itself on the assigned values and that it allows comparisons against diff --git a/include/seqan3/range/container/aligned_allocator.hpp b/include/seqan3/range/container/aligned_allocator.hpp index e1f66c5a40..d0f0e5da66 100644 --- a/include/seqan3/range/container/aligned_allocator.hpp +++ b/include/seqan3/range/container/aligned_allocator.hpp @@ -62,7 +62,7 @@ namespace seqan3 * As you can see, in the case of the aligned_allocator it is guaranteed that the * first element in the vector starts at offset 0. * - * \see https://en.cppreference.com/w/cpp/concept/Allocator + * \see https://en.cppreference.com/w/cpp/named_req/Allocator * \see https://en.cppreference.com/w/cpp/memory/c/aligned_alloc */ template diff --git a/include/seqan3/range/container/concept.hpp b/include/seqan3/range/container/concept.hpp index 0ddb8ed552..cee6ba4e55 100644 --- a/include/seqan3/range/container/concept.hpp +++ b/include/seqan3/range/container/concept.hpp @@ -69,7 +69,7 @@ namespace seqan3 * \extends seqan3::const_iterable_range * \brief The (most general) container concept as defined by the standard library. * \details - * The container concept is modelled as in the [STL](https://en.cppreference.com/w/cpp/concept/Container), but + * The container concept is modelled as in the [STL](https://en.cppreference.com/w/cpp/named_req/Container), but * additionally requires std::swap() to be implemented. * * \attention @@ -135,7 +135,7 @@ SEQAN3_CONCEPT container = requires (type val, type val2, type const cval, typen * * Includes constraints on constructors, `assign()`, `.insert()`, `.erase()`, `.push_back()`, `.pop_back`, `.clear()`, * `.size()`, `front()` and `.back()` member functions with corresponding signatures. Models the subset of the - * [STL SequenceConcept](https://en.cppreference.com/w/cpp/concept/SequenceConcept) that is supported + * [STL SequenceConcept](https://en.cppreference.com/w/cpp/named_req/SequenceContainer) that is supported * by `std::list`, `std::vector`, `std::deque`, `std::basic_string`. * * \attention @@ -198,7 +198,7 @@ SEQAN3_CONCEPT sequence_container = requires (type val, type val2, type const cv * \brief A more refined container concept than seqan3::sequence_container. * * Adds requirements for `.at()`, `.resize()` and the subscript operator `[]`. Models the subset of the - * [STL SequenceConcept](https://en.cppreference.com/w/cpp/concept/SequenceConcept) that is supported + * [STL SequenceConcept](https://en.cppreference.com/w/cpp/named_req/SequenceContainer) that is supported * by `std::vector`, `std::deque` and `std::basic_string`. * * \attention diff --git a/include/seqan3/range/decorator/gap_decorator.hpp b/include/seqan3/range/decorator/gap_decorator.hpp index 19d19b36d7..99f9507313 100644 --- a/include/seqan3/range/decorator/gap_decorator.hpp +++ b/include/seqan3/range/decorator/gap_decorator.hpp @@ -71,7 +71,7 @@ namespace seqan3 * ### The seqan3::gap_decorator::iterator type * * \attention The iterator of the seqan3::gap_decorator does not model the - * [Cpp17BidirectionalIterator](https://en.cppreference.com/w/cpp/named_req/BidirectionalIterator) + * [Cpp17BidirectionalIterator](https://en.cppreference.com/w/cpp/iterator/bidirectional_iterator) * requirements of the STL because dereferencing the iterator returns a proxy and no operator-> is provided. * It does model the C++20 std::bidirectional_iterator. * @@ -582,7 +582,7 @@ gap_decorator(urng_t range) -> gap_decorator; * \details * * This iterator returns values when dereferenced, not references, i.e. it does not satisfy the semantic - * requirements of [Cpp17BidirectionalIterator](https://en.cppreference.com/w/cpp/named_req/bidirectional_iterator). + * requirements of [Cpp17BidirectionalIterator](https://en.cppreference.com/w/cpp/iterator/bidirectional_iterator). * It does model the C++20 std::bidirectional_iterator. In addition, it offers all interfaces of a standard * std::random_access_iterator except the iterator category which is defined as std::bidirectional_iterator_tag, * because the complexity of the iterator is logarithmic and not constant. However, all interfaces inside the