You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
You can also convert the span iterators to pointers and compare those, so that any debug checking on the iterators doesn't complain about iterators to different ranges.
You can also convert the span iterators to pointers and compare those, so that any debug checking on the iterators doesn't complain about iterators to different ranges.
Thanks a lot, maybe I'll go back to the original unconstrained algorithms, since such convertion needs care of subspan's past the end iterator.
Suppose I'm writing an insertion sort
It's wrong since
insert_pos
,sp.first(i).end()
andsp.begin()
are from three differentspan
objects.#1157 suggest to do this with ranges.
But four years since that issue, clang still cannot compile it. llvm/llvm-project#52696 says it's fixed, while actually it just do not compile.
So what are we supposed to do? Just sit down and wait for clang 15 to fix it?
The text was updated successfully, but these errors were encountered: