| commit | 52c27383241147457f9da0e24e1c7f39b51d80db | [log] [tgz] |
|---|---|---|
| author | Dan Gohman <gohman@apple.com> | Wed May 26 18:52:00 2010 +0000 |
| committer | Dan Gohman <gohman@apple.com> | Wed May 26 18:52:00 2010 +0000 |
| tree | 428a303382cceacc166d976dcfbbd024164792b0 | |
| parent | b3807452fe0bda108731b735004e6678034baff2 [diff] |
Eliminate the use of PriorityQueue and just use a std::vector, implementing pop with a linear search for a "best" element. The priority queue was a neat idea, but in practice the comparison functions depend on dynamic information. llvm-svn: 104718