|
Dedekind 0.0.0
A structuralist C++23 Module Library
|
One more element into the best K so far, sorted by the rank: inserted after those it does not rank before, so ties keep the walk's order, and the last cut where the list overflows. O(K) on the stack.
More...
Public Member Functions | |
| constexpr AtMost< T, K > | operator() (const AtMost< T, K > &best, const T &x) const |
Public Attributes | |
| Before< Rank, Order > | before |
One more element into the best K so far, sorted by the rank: inserted after those it does not rank before, so ties keep the walk's order, and the last cut where the list overflows. O(K) on the stack.