| commit | 6bd5c84e0b147a7dbfd1a06514980f2798648f0d | [log] [tgz] |
|---|---|---|
| author | David Majnemer <david.majnemer@gmail.com> | Mon Aug 15 00:13:04 2016 +0000 |
| committer | David Majnemer <david.majnemer@gmail.com> | Mon Aug 15 00:13:04 2016 +0000 |
| tree | 78d93ed59806f2ccc9b7b1eef98f6ed84ae5957f | |
| parent | b3d14d2afdff8afd6de064f91c25cc04bebcca1f [diff] |
[ScopedNoAliasAA] Remove an unneccesary set We are trying to prove that one group of operands is a subset of another. We did this by populating two Sets and determining that every element within one was inside the other. However, this is unnecessary. We can simply construct a single set and test if each operand is within it. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@278641 91177308-0d34-0410-b5e6-96231b3b80d8