Embrase the dual GitHub/Codeberg nature of the project

Author: Morwenn

README.md

@@ -1,6 +1,6 @@
 ![cpp-sort logo](docs/images/cpp-sort-logo.svg)
 
-[![Latest Release](https://img.shields.io/badge/release-2.0.0-blue.svg)](https://github.com/Morwenn/cpp-sort/releases/tag/v2.0.0)
+[![Latest Release](https://img.shields.io/badge/release-2.0.0-blue.svg)](https://codeberg.org/Morwenn/cpp-sort/releases/tag/v2.0.0)
 [![Conan Package](https://img.shields.io/badge/conan-cpp--sort%2F2.0.0-blue.svg)](https://conan.io/center/recipes/cpp-sort?version=2.0.0)
 [![Code Coverage](https://codecov.io/gh/Morwenn/cpp-sort/branch/2.x.y-develop/graph/badge.svg)](https://codecov.io/gh/Morwenn/cpp-sort)
 [![Pitchfork Layout](https://img.shields.io/badge/standard-PFL-orange.svg)](https://github.com/vector-of-bool/pitchfork)
@@ -41,11 +41,11 @@ anything to be backported._
 
 **cpp-sort** provides a full set of sorting-related features. Here are the main building blocks
 of the library:
-* Every sorting algorithm exists as a function object called a [sorter](https://github.com/Morwenn/cpp-sort/wiki/Sorters)
-* Sorters can be wrapped in [sorter adapters](https://github.com/Morwenn/cpp-sort/wiki/Sorter-adapters) to augment their behaviour
-* The library provides a [sorter facade](https://github.com/Morwenn/cpp-sort/wiki/Sorter-facade) to easily build sorters
-* [Fixed-size sorters](https://github.com/Morwenn/cpp-sort/wiki/Fixed-size-sorters) can be used to efficiently sort tiny fixed-size collections
-* [Measures of disorder](https://github.com/Morwenn/cpp-sort/wiki/Measures-of-disorder) can be used to evaluate the disorder in a collection
+* Every sorting algorithm exists as a function object called a [sorter][sorters]
+* Sorters can be wrapped in [sorter adapters][sorter-adapters] to augment their behaviour
+* The library provides a [sorter facade][sorter-facade] to easily build sorters
+* [Fixed-size sorters][fixed-size-sorters] can be used to efficiently sort tiny fixed-size collections
+* [Measures of disorder][measures-of-disorder] can be used to evaluate the disorder in a collection
 
 Here is a more complete example of what can be done with the library:
 
@@ -97,7 +97,7 @@ some interesting guarantees (ideas often taken from the Ranges TS):
 * Sorters are function objects: they can directly be passed as "overload sets" to other functions
 
 You can read more about all the available tools and find some tutorials about using
-and extending **cpp-sort** in [the wiki](https://github.com/Morwenn/cpp-sort/wiki).
+and extending **cpp-sort** in [the wiki][cpp-sort-wiki].
 
 # Benchmarks
 
@@ -150,7 +150,7 @@ You can read more about those [in the wiki][tooling].
 > piece.*
 > — Jarod Kintz, $3.33
 
-Even though some parts of the library are [original research](https://github.com/Morwenn/cpp-sort/wiki/Original-research)
+Even though some parts of the library are [original research][original-research]
 and some others correspond to custom and rather naive implementations of standard
 sorting algorithms, **cpp-sort** also reuses a great deal of code and ideas from
 open-source projects, often altered to integrate seamlessly into the library. Here
@@ -175,12 +175,11 @@ module](https://www.boost.org/doc/libs/1_80_0/libs/sort/doc/html/index.html).
 in [Boost.Sort](https://www.boost.org/doc/libs/1_80_0/libs/sort/doc/html/index.html).
 by Francisco Jose Tapia.
 
-* [`utility::as_function`](https://github.com/Morwenn/cpp-sort/wiki/Miscellaneous-utilities#as_function),
-and several projection-enhanced helper algorithms come from Eric Niebler's [Range
-v3](https://github.com/ericniebler/range-v3) library. Several ideas such as proxy
-iterators, customization points and projections, as well as a few other utility
-functions also come from that library or from the related articles and standard
-C++ proposals.
+* [`utility::as_function`][utility-as-function], and several projection-enhanced helper
+algorithms come from Eric Niebler's [Range v3](https://github.com/ericniebler/range-v3)
+library. Several ideas such as proxy iterators, customization points and projections,
+as well as a few other utility functions also come from that library or from the related
+articles and standard C++ proposals.
 
 * The algorithm used by `ska_sorter` comes from Malte Skarupke's [implementation](https://github.com/skarupke/ska_sort)
 of his own [ska_sort](https://probablydance.com/2016/12/27/i-wrote-a-faster-sorting-algorithm/) algorithm.
@@ -248,9 +247,17 @@ developed by Thøger Rivera-Thorsen.
 
 
   [adaptive-sort]: https://en.wikipedia.org/wiki/Adaptive_sort
-  [benchmarks]: https://github.com/Morwenn/cpp-sort/wiki/Benchmarks
-  [changelog]: https://github.com/Morwenn/cpp-sort/wiki/Changelog
-  [drop-merge-adapter]: https://github.com/Morwenn/cpp-sort/wiki/Sorter-adapters#drop_merge_adapter
-  [heap-sorter]: https://github.com/Morwenn/cpp-sort/wiki/Sorters#heap_sorter
-  [split-adapter]: https://github.com/Morwenn/cpp-sort/wiki/Sorter-adapters#split_adapter
-  [tooling]: https://github.com/Morwenn/cpp-sort/wiki/Tooling
+  [benchmarks]: https://codeberg.org/Morwenn/cpp-sort/wiki/Benchmarks
+  [changelog]: https://codeberg.org/Morwenn/cpp-sort/wiki/Changelog
+  [cpp-sort-wiki]: https://codeberg.org/Morwenn/cpp-sort/wiki
+  [drop-merge-adapter]: https://codeberg.org/Morwenn/cpp-sort/wiki/Sorter-adapters#drop_merge_adapter
+  [fixed-size-sorters]: https://codeberg.org/Morwenn/cpp-sort/wiki/Fixed-size-sorters
+  [heap-sorter]: https://codeberg.org/Morwenn/cpp-sort/wiki/Sorters#heap_sorter
+  [measures-of-disorder]: https://codeberg.org/Morwenn/cpp-sort/wiki/Measures-of-disorder
+  [original-research]: https://codeberg.org/Morwenn/cpp-sort/wiki/Original-research
+  [sorter-adapters]: https://codeberg.org/Morwenn/cpp-sort/wiki/Sorter-adapters
+  [sorter-facade]: https://codeberg.org/Morwenn/cpp-sort/wiki/Sorter-facade
+  [sorters]: https://codeberg.org/Morwenn/cpp-sort/wiki/Sorters
+  [split-adapter]: https://codeberg.org/Morwenn/cpp-sort/wiki/Sorter-adapters#split_adapter
+  [tooling]: https://codeberg.org/Morwenn/cpp-sort/wiki/Tooling
+  [utility-as-function]: https://codeberg.org/Morwenn/cpp-sort/wiki/Miscellaneous-utilities#as_function

conanfile.py

@@ -19,7 +19,7 @@ class CppSortConan(ConanFile):
     version = "2.0.0"
     description = "Sorting algorithms & related tools"
     license = "MIT"
-    url = "https://github.com/Morwenn/cpp-sort"
+    url = "https://codeberg.org/Morwenn/cpp-sort"
     homepage = url
     topics = "cpp-sort", "sorting", "algorithms"
     author = "Morwenn <morwenn29@hotmail.fr>"

docs/Changelog.md

@@ -40,7 +40,7 @@ When compiled with C++20, **cpp-sort** might gain a few additional features depe
   [branchless-traits]: Miscellaneous-utilities.md#branchless-traits
   [counting-sorter]: Sorters.md#counting_sorter
   [cpp-sort-function-objects]: Miscellaneous-utilities.md#miscellaneous-function-objects
-  [cpp-sort-releases]: https://github.com/Morwenn/cpp-sort/releases
+  [cpp-sort-releases]: https://codeberg.org/Morwenn/cpp-sort/releases
   [feature-test-macros]: https://wg21.link/SD6
   [pdq-sorter]: Sorters.md#pdq_sorter
   [ska-sorter]: Sorters.md#ska_sorter

docs/Quickstart.md

@@ -228,5 +228,5 @@ The previous sections describe some of the main tools provided by **cpp-sort** b
   [std-searchers]: https://en.cppreference.com/w/cpp/utility/functional#Searchers
   [std-sort]: https://en.cppreference.com/w/cpp/algorithm/sort
   [tooling]: Tooling.md
-  [utility-apply-permutation]: https://github.com/Morwenn/cpp-sort/wiki/Miscellaneous-utilities#apply_permutation
-  [utility-sorted-indices]: https://github.com/Morwenn/cpp-sort/wiki/Miscellaneous-utilities#sorted_indices
+  [utility-apply-permutation]: Miscellaneous-utilities.md#apply_permutation
+  [utility-sorted-indices]: Miscellaneous-utilities.md#sorted_indices

docs/Sorter-facade.md

@@ -45,7 +45,7 @@ The return type `Ret` can either match that of the sorter, or be `void`, in whic
 
 Note that the function pointer conversion syntax above is made up, but it allows to clearly highlight what it does while hiding the `typedef`s needed for the syntax to be valid. In these signatures, `Ret` is the [`std::result_of_t`][std-result-of] of the sorter called with the parameters. The actual implementation is more verbose and redundant, but it allows to transform a sorter into a function pointer corresponding to any valid overload of `operator()`.
 
-***WARNING:** conversion to function pointers does not work with MSVC ([issue #185][issue-185]).*
+***WARNING:** conversion to function pointers does not work with MSVC ([issue github#185][issue-185]).*
 
 ## `operator()`
 

docs/Sorters.md

@@ -465,7 +465,6 @@ struct spread_sorter:
   [heap-sorter]: Sorters.md#heap_sorter
   [insertion-sort]: https://en.wikipedia.org/wiki/Insertion_sort
   [introselect]: https://en.wikipedia.org/wiki/Introselect
-  [issue-168]: https://github.com/Morwenn/cpp-sort/issues/168
   [measures-of-disorder]: Measures-of-disorder.md
   [median-of-medians]: https://en.wikipedia.org/wiki/Median_of_medians
   [merge-sort]: https://en.wikipedia.org/wiki/Merge_sort

docs/Writing-a-bubble_sorter.md

@@ -286,7 +286,7 @@ Generic agorithms are good, more generic algorithms are sometimes better. The cu
 
 C++20 ranges introduce the notion of ["proxy iterators"][proxy-iterators], which are basically iterators that can't yield a proper reference to the object they point to, but instead yield a proxy object acting as a reference. In order to handle such iterators, C++20 introduces the *customization point objects* [`std::ranges::iter_move`][std-iter-move] and [`std::ranges::iter_swap`][std-iter-swap] which should be used instead of `std::move(*it)` and `std::iter_swap(it1, it2)` in generic algorithms that aim to support proxy iterators.
 
-**cpp-sort** being a C++17 library, it can't rely on these CPOs and provides the utility functions [`utility::iter_move` and `utility::iter_swap`][utility-iter-move] to replace them. They are a bit cruder than their standard equivalents: you have to import them into the current namespace and perform an unqualified call, *à la* `std::swap`. Moreover, they are currently not compatible with their C++20 counterparts yet for legacy reasons (see [issue 223][issue-223]).
+**cpp-sort** being a C++17 library, it can't rely on these CPOs and provides the utility functions [`utility::iter_move` and `utility::iter_swap`][utility-iter-move] to replace them. They are a bit cruder than their standard equivalents: you have to import them into the current namespace and perform an unqualified call, *à la* `std::swap`. Moreover, they are currently not compatible with their C++20 counterparts yet for legacy reasons (see [issue github#223][issue-223]).
 
 ```cpp
 template<typename ForwardIterator, typename Compare>

docs/Writing-a-randomizing_adapter.md

@@ -72,7 +72,7 @@ When possible, a proper *sorter adapter* is expected to be callable with the sam
 
 ## Returned value
 
-There is currently no strict rule about what a *sorter adapter* should return (this is actually a [open design issue][issue-134]), though the general wisdom is that an adapter should transparently provide as many features as the sorter it adapts when it reasonably can. The idea is that replacing the sorter by its wrapped counterpart should be easy.
+There is no strict rule about what a *sorter adapter* should return. The general wisdom is that an adapter should transparently provide as many features as the *sorter* it adapts when it reasonably can unless it has good reasons to to otherwise. The idea is that replacing the sorter by its wrapped counterpart should be easy.
 
 We don't have a specific use for the return channel of `randomizing_adapter` and it is simple to make it transitively return whatever the wrapped sorter returns - and even convenient -, so I decided to do just that.
 
@@ -142,7 +142,6 @@ The full implementation can be found in the `examples` folder.
   [ctad]: https://en.cppreference.com/w/cpp/language/class_template_argument_deduction
   [golden-tests]: https://en.wikipedia.org/wiki/Characterization_test
   [hyrums-law]: https://www.hyrumslaw.com/
-  [issue-134]: https://github.com/Morwenn/cpp-sort/issues/134
   [iterator-category]: https://en.cppreference.com/w/cpp/iterator
   [proxy-iterators]: https://wg21.link/P0022
   [quick-sorter]: Sorters.md#quick_sorter

include/cpp-sort/detail/quick_merge_sort.h

@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 2018-2025 Morwenn
+ * Copyright (c) 2018-2026 Morwenn
  * SPDX-License-Identifier: MIT
  */
 #ifndef CPPSORT_DETAIL_QUICK_MERGE_SORT_H_
@@ -138,7 +138,7 @@ namespace cppsort::detail
             internal_mergesort(first, pivot, size_left, pivot, compare, projection);
 
             if (std::is_base_of_v<std::random_access_iterator_tag, iterator_category_t<ForwardIterator>>) {
-                // Avoid weird codegen bug with MinGW-w64 (see GitHub issue #151)
+                // Avoid weird codegen bug with MinGW-w64 (see issue github#151)
                 std::advance(first, size_left);
             } else {
                 first = pivot;

tools/release_template.md

@@ -46,5 +46,5 @@ Miscellaneous:
 I didn't manage to fix every bug I could find since the previous release, so you might want to check the [list of known bugs][known-bugs].
 
 
-  [deprecation-warnings]: https://github.com/Morwenn/cpp-sort/wiki#deprecation-warnings
+  [deprecation-warnings]: https://codeberg.org/Morwenn/cpp-sort/wiki#deprecation-warnings
   [known-bugs]: https://github.com/Morwenn/cpp-sort/issues?q=is%3Aissue+is%3Aopen+label%3Abug