Lang Hames ec97f95442 Change the PBQP graph adjacency list structure from std::set to std::vector. ... The edge data structure (EdgeEntry) now holds the indices of its entries in the adjacency lists of the nodes it connects. This trades a little ugliness for faster insertion/removal, which is now O(1) with a cheap constant factor. All of this is implementation detail within the PBQP graph, the external API remains unchanged. Individual register allocations are likely to change, since the adjacency lists will now be ordered differently (or rather, will now be unordered). This shouldn't affect the average quality of allocations however. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@204841 91177308-0d34-0410-b5e6-96231b3b80d8		2014-03-26 18:58:00 +00:00
..
llvm	Change the PBQP graph adjacency list structure from std::set to std::vector.	2014-03-26 18:58:00 +00:00
llvm-c	llvm-c: expose unnamedaddr field of globals	2014-03-10 19:24:35 +00:00