Skip to content

Commit

Permalink
Update in-doc release notes
Browse files Browse the repository at this point in the history
  • Loading branch information
Morwenn committed Dec 16, 2021
1 parent 9002866 commit ce9b49e
Show file tree
Hide file tree
Showing 2 changed files with 3 additions and 1 deletion.
2 changes: 2 additions & 0 deletions docs/Miscellaneous-utilities.md
Expand Up @@ -247,6 +247,8 @@ using make_index_range = make_integer_range<std::size_t, Begin, End, Step>;

`size` is a function that can be used to get the size of an iterable. It is equivalent to the C++17 function [`std::size`][std-size] but has an additional tweak so that, if the iterable is not a fixed-size C array and doesn't have a `size` method, it calls `std::distance(std::begin(iter), std::end(iter))` on the iterable. Therefore, this function can also be used for `std::forward_list` as well as some implementations of ranges.

*Changed in version 1.12.1:* `utility::size()` now also works for collections that only provide non-`const` `begin()` and `end()`.

### Sorting network tools

```cpp
Expand Down
2 changes: 1 addition & 1 deletion docs/Sorters.md
Expand Up @@ -325,7 +325,7 @@ This algorithm actually uses a rather big amount of memory but scales better tha

*New in version 1.10.0*

*Changed in version 1.13.0:* `slab_sorter` now works with bidirectional iterators.
*Changed in version 1.12.1:* `slab_sorter` now works with bidirectional iterators.

### `smooth_sorter`

Expand Down

0 comments on commit ce9b49e

Please sign in to comment.