bernhardmgruber
commented
4 months ago While I can understand the wish for more knowledge on the user side, there is a trade-off here, since promising too much about the implementation's behavior can also lock us out of future algorithmic evolution. Unless the complexity we advertise is pure documentation that we are allowed to break at any time :)
I vaguely remember Andrei Alexandrescu mentioning in a talk that there could be a faster implementation than the common ones for std::binary_search, but they would not fulfill the complexity guarantees of the STL. I couldn't find the talk right now, so it may just be a myth as well.
jrhemstad
Is this a duplicate?
Is this for new documentation, or an update to existing docs?
New
Describe the incorrect/future/missing documentation
As a user of Thrust and CUB algorithms, I often want to know things like:
All of these questions are inter-related and the answer is unique to each algorithm.
To address these questions, I would like for each Thrust and CUB algorithm to have a "Complexity" section similar to what cppreference has:
If this is a correction, please provide a link to the incorrect documentation. If this is a new documentation request, please link to where you have looked.
No response