Is it possible to sort vector by using std::sort or somehow else?
It is possible. You can do it the same way as sorting anything else: By defining a function to compare two std::any with strict total order.
any_cast<decltype(lhs.type())>(lhs)
This won't work. std::any::type returns std::type_info, and unless you store an object of type std::type_info in std::any, the std::any_cast will fail.
There are many ways to order objects of heterogeneous types.
A relatively simple way is to primarily order by the type of the object. A caveat here is that the order of types is not portable across systems:
Then, objects of same type that are orderable may be further ordered, but that feature may have to be limited to a small set of types as if you were using std::variant.
发布评论
评论（1）
这是可能的。您可以采用与排序任何其他内容相同的方式来完成此操作：通过定义一个函数来比较两个具有严格总顺序的
std::any。这行不通。
std::any::type返回std::type_info，除非您在中存储时，std::type_info类型的对象std::anystd::any_cast将失败。有多种方法可以对异构类型的对象进行排序。
一个相对简单的方法是主要按对象的类型排序。这里需要注意的是，类型的顺序不可跨系统移植：
然后，可排序的相同类型的对象可能会进一步排序，但该功能可能必须仅限于一小组类型，就像您使用
std::变体。It is possible. You can do it the same way as sorting anything else: By defining a function to compare two
std::anywith strict total order.This won't work.
std::any::typereturnsstd::type_info, and unless you store an object of typestd::type_infoinstd::any, thestd::any_castwill fail.There are many ways to order objects of heterogeneous types.
A relatively simple way is to primarily order by the type of the object. A caveat here is that the order of types is not portable across systems:
Then, objects of same type that are orderable may be further ordered, but that feature may have to be limited to a small set of types as if you were using
std::variant.