| commit | 93d343357944beb701d425fc7ef00dd7b0a32bd7 | [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 | 6256b23514069d28abf7cfd910bafbffef38b5ba | |
| parent | f0f1bfe89a8127d5df82256440eddafd892aeb22 [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. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@104718 91177308-0d34-0410-b5e6-96231b3b80d8