6 ms·
> But even with that constraint ... std::rotate allocates memory! It'll throw std::bad_alloc when it can't. This feels kinda crazy. Is there a reason why this
by SkiFire13 9mo ago
> But even with that constraint ... std::rotate allocates memory! It'll throw std::bad_alloc when it can't.
This feels kinda crazy. Is there a reason why this is the case?
- quuxplusone 9mo agoThat's only for the parallel overload. The ordinary sequential overload doesn't allocate: the only three ordinary STL algorithms that allocate are stable_sort, stable_partition, and (ironically) inplace_merge.