don't use count + insert, just do insert + failure. Also, instead of deleting from

the middle of a vector, swap the last element in and pop_back.  Also saves 330 bytes :)


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@82365 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2009-09-20 05:15:12 +00:00
parent 67aead68be
commit b40b7e3faf

View File

@ -1051,14 +1051,17 @@ public:
std::ptr_fun(ShowHidden ? isReallyHidden : isHidden)),
Opts.end());
// Eliminate duplicate entries in table (from enum flags options, f.e.)
// Eliminate duplicate entries in table (from enum flags options, f.e.).
{ // Give OptionSet a scope
SmallPtrSet<Option*, 32> OptionSet;
for (unsigned i = 0; i != Opts.size(); ++i)
if (OptionSet.count(Opts[i]) == 0)
OptionSet.insert(Opts[i]); // Add new entry to set
else
Opts.erase(Opts.begin()+i--); // Erase duplicate
for (unsigned i = 0; i != Opts.size(); ++i) {
if (OptionSet.insert(Opts[i])) // Add new entry to set
continue;
// Erase duplicate.
Opts[i] = Opts.back();
Opts.pop_back();
--i;
}
}
if (ProgramOverview)