[libcxx-commits] [libcxx] [libcxx] Optimize std::generate for segmented iterators (PR #163006)

[Connector Switch via libcxx-commits]

================
@@ -68,9 +68,9 @@ Improvements and New Features
   reduced debug information.
 
 - The performance of ``std::find`` has been improved by up to 2x for integral types
-- The ``std::distance`` and ``std::ranges::distance`` algorithms have been optimized for segmented iterators (e.g.,
-  ``std::join_view`` iterators), reducing the complexity from ``O(n)`` to ``O(n / segment_size)``. Benchmarks show
-  performance improvements of over 1600x in favorable cases with large segment sizes (e.g., 1024).
+- The ``std::distance``, ``std::ranges::distance`` and ``std::generate`` algorithms have been optimized for segmented
----------------
c8ef wrote:

```
- The ``std::generate`` algorithm has been optimized for segmented iterators, resulting in a performance improvement for
  ``std::deque<short>`` and ``std::join_view<vector<vector<short>>>`` iterators.
```

Is above entry OK?

https://github.com/llvm/llvm-project/pull/163006