clayborg added a comment. Sorry missed your first note about perf. This has to be able to handle any number of strings efficiently and growing buckets is probably needed. How many buckets are you starting with here? The design probably shouldn't take up gobs of memory if it just has a few strings as well.
Do we really need to use a homegrown hash table here? Can we not leverage std::unordered_map or some other hash table in LLVM here? Repository: rL LLVM https://reviews.llvm.org/D32832 _______________________________________________ lldb-commits mailing list lldb-commits@lists.llvm.org http://lists.llvm.org/cgi-bin/mailman/listinfo/lldb-commits
