================
@@ -133,17 +139,21 @@ struct InfoTreeNode {
// * The same key can appear multiple times
std::unique_ptr<llvm::SmallVector<InfoTreeNode, 8>> Children;
+ std::map<DeviceInfo, size_t> DeviceInfoMap;
----------------
jhuber6 wrote:
Do these need to be sorted? Otherwise a dense map is more efficient.
https://github.com/llvm/llvm-project/pull/147317
_______________________________________________
llvm-branch-commits mailing list
llvm-branch-commits@lists.llvm.org
https://lists.llvm.org/cgi-bin/mailman/listinfo/llvm-branch-commits
