David Majnemer 662809578e Make MDNode::intersect faster than O(n * m)
It is pretty easy to get it down to O(nlogn + mlogm).  This
implementation has the added benefit of automatically deduplicating
entries between the two sets.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@278837 91177308-0d34-0410-b5e6-96231b3b80d8
2016-08-16 18:48:37 +00:00
..
2016-01-26 21:29:08 +00:00
2016-03-01 21:29:33 +00:00