On Thu, Jun 9, 2011 at 6:18 PM, Kaelyn Uhrain <[email protected]> wrote:
> Quick question about doing this: would it be more cost effective to use a > std::multimap to allow iterating through the namespaces in ascending order > of NNS length and exiting the loop once NNS length + edit distance are worse > than the best, or to use an llvm::SmallVector instead and always looping > over all of the namespaces, but skipping the lookup if (NNS length + ED) is > too long? Iterating over a std::map or std::multimap is rather slow. Why can't we just keep the SmallVector sorted by the NNS length?
_______________________________________________ cfe-commits mailing list [email protected] http://lists.cs.uiuc.edu/mailman/listinfo/cfe-commits
