Cheap, mostly strict, stable sorting.
authorAndreas Neustifter <astifter-llvm@gmx.at>
Wed, 2 Dec 2009 15:57:15 +0000 (15:57 +0000)
committerAndreas Neustifter <astifter-llvm@gmx.at>
Wed, 2 Dec 2009 15:57:15 +0000 (15:57 +0000)
commit059a983531dd13618fc671c70a175bdb4e87ec47
treeefff68668526b2d045cf642f037868142b1d407f
parent0fea11a8055d179655b9d862f0b2acb93a728114
Cheap, mostly strict, stable sorting.

This is necessary for tests so the results are comparable.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@90320 91177308-0d34-0410-b5e6-96231b3b80d8
lib/Transforms/Instrumentation/MaximumSpanningTree.h