diff --git a/docs/Miscellaneous-utilities.md b/docs/Miscellaneous-utilities.md index f975f2c9..d1b8781f 100644 --- a/docs/Miscellaneous-utilities.md +++ b/docs/Miscellaneous-utilities.md @@ -247,6 +247,8 @@ using make_index_range = make_integer_range; `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 diff --git a/docs/Sorters.md b/docs/Sorters.md index 7698fb78..e78f90de 100644 --- a/docs/Sorters.md +++ b/docs/Sorters.md @@ -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`