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
Very interesting. So for example, one would test a generic algorithm by sending it a function object that would only be callable with a (possibly-const) rvalue, and see whether the algorithm is forwarding up to the point of instantiation? That seems like a good idea.
E.g. given the example above, a library that makes the naive assumption that function objects should be callable through lvalue const references would break for instances of rvalueconstcallable.
Have you considered adding callable types that overload the
operator ()
on combinations of lr-value-ness vs const-ness?E.g.
This would be useful to check whether generic algorithms forward callable objects correctly up to the point they are invoked.
The text was updated successfully, but these errors were encountered: