<commit_before>`cppsort::sort`
===============

`cppsort::sort` has two overloads. One which takes a [sorter](doc/sorters.md) to
sort the given iterable, and another one which uses the library's `cppsort::default_sorter`
instead:

```cpp 
template<
    typename RandomAccessIterable,
    typename Sorter,
    typename Compare = std::less<>
>
auto sort(RandomAccessIterable& iterable, const Sorter& sorter, Compare compare={})
    -> void;
```

This overload takes a `RandomAccessIterable` collection and sorts it in-place in
ascending order. The function uses `std::less<>` to compare the elements, unless
specified otherwise, and uses the given sorter to sort them.

```cpp
template<
    typename RandomAccessIterable,
    typename Compare = std::less<>
>
auto sort(RandomAccessIterable& iterable, Compare compare={})
    -> void;
```

This overload takes a `RandomAccessIterable` collection and sorts it in-place in
ascending order. The function uses `std::less<>` to compare the elements unless
specified otherwise, and uses `cppsort::default_sorter` to sort them.

Note that this overload does not appear in the overload set if `Compare` statifies<commit_msg>Fix broken link in doc.<commit_after>`cppsort::sort`
===============

`cppsort::sort` has two overloads. One which takes a [sorter](sorters.md) to sort
the given iterable, and another one which uses the library's `cppsort::default_sorter`
instead:

```cpp 
template<
    typename RandomAccessIterable,
    typename Sorter,
    typename Compare = std::less<>
>
auto sort(RandomAccessIterable& iterable, const Sorter& sorter, Compare compare={})
    -> void;
```

This overload takes a `RandomAccessIterable` collection and sorts it in-place in
ascending order. The function uses `std::less<>` to compare the elements, unless
specified otherwise, and uses the given sorter to sort them.

```cpp
template<
    typename RandomAccessIterable,
    typename Compare = std::less<>
>
auto sort(RandomAccessIterable& iterable, Compare compare={})
    -> void;
```

This overload takes a `RandomAccessIterable` collection and sorts it in-place in
ascending order. The function uses `std::less<>` to compare the elements unless
specified otherwise, and uses `cppsort::default_sorter` to sort them.

Note that this overload does not appear in the overload set if `Compare` statifies
{'fraction_non_alphanumeric': 0.10463121783876501, 'fraction_numerical': 0.0, 'mean_word_length': 5.221333333333333, 'pattern_counts': {'":': 0, '<': 15, '<?xml version=': 0, '>': 19, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '2517026', 'n_tokens_mistral': 677, 'n_tokens_neox': 630, 'n_words': 265}