Switch the SetVector::remove_if implementation to use partition which

preserves the values of the relocated entries, unlikely remove_if. This
allows walking them and erasing them.

Also flesh out the predicate we are using for this to support the
various constraints actually imposed on a UnaryPredicate -- without this
we can't compose it with std::not1.

Thanks to Sean Silva for the review here and noticing the issue with
std::remove_if.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@165073 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chandler Carruth 2012-10-03 00:03:00 +00:00
parent 2b87e06d26
commit 75eac5f0eb
2 changed files with 6 additions and 3 deletions

View File

@ -141,8 +141,9 @@ public:
/// \returns true if any element is removed.
template <typename UnaryPredicate>
bool remove_if(UnaryPredicate P) {
typename vector_type::iterator B = std::remove_if(vector_.begin(),
vector_.end(), P),
typename vector_type::iterator B = std::partition(vector_.begin(),
vector_.end(),
std::not1(P)),
E = vector_.end();
if (B == E)
return false;

View File

@ -3273,8 +3273,10 @@ namespace {
const SetType &Set;
public:
typedef AllocaInst *argument_type;
IsAllocaInSet(const SetType &Set) : Set(Set) {}
bool operator()(AllocaInst *AI) { return Set.count(AI); }
bool operator()(AllocaInst *AI) const { return Set.count(AI); }
};
}