summaryrefslogtreecommitdiffstats
path: root/llvm/lib/Support/SourceMgr.cpp
diff options
context:
space:
mode:
authorDavid Majnemer <david.majnemer@gmail.com>2016-08-16 18:48:37 +0000
committerDavid Majnemer <david.majnemer@gmail.com>2016-08-16 18:48:37 +0000
commit00940fb8544767ba5217922c4ba96677aabe9eb3 (patch)
tree72737089d4e35dafc2ea24cd265d127995bfc32b /llvm/lib/Support/SourceMgr.cpp
parentfa0f1e660b1ef34665e7683d8ac8f7dd581ab84b (diff)
downloadbcm5719-llvm-00940fb8544767ba5217922c4ba96677aabe9eb3.tar.gz
bcm5719-llvm-00940fb8544767ba5217922c4ba96677aabe9eb3.zip
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. llvm-svn: 278837
Diffstat (limited to 'llvm/lib/Support/SourceMgr.cpp')
0 files changed, 0 insertions, 0 deletions
OpenPOWER on IntegriCloud