Richard Smith 
							
						 
					 
					
						
						
							
						
						75dd7f0c4a 
					 
					
						
						
							
							MaximumSpanningTree::EdgeWeightCompare: Make this comparator actually be a  
						
						... 
						
						
						
						strict weak ordering, and don't pass possibly-null pointers to dyn_cast.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@162314  91177308-0d34-0410-b5e6-96231b3b80d8 
						
						
					 
					
						2012-08-21 21:03:40 +00:00 
						 
				 
			
				
					
						
							
							
								Nick Lewycky 
							
						 
					 
					
						
						
							
						
						06d2b4223f 
					 
					
						
						
							
							Fix typos. Adjust some whitespace for style. No functionality change.  
						
						... 
						
						
						
						git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@128924  91177308-0d34-0410-b5e6-96231b3b80d8 
						
						
					 
					
						2011-04-05 20:39:27 +00:00 
						 
				 
			
				
					
						
							
							
								Andreas Neustifter 
							
						 
					 
					
						
						
							
						
						059a983531 
					 
					
						
						
							
							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 
						
						
					 
					
						2009-12-02 15:57:15 +00:00 
						 
				 
			
				
					
						
							
							
								Andreas Neustifter 
							
						 
					 
					
						
						
							
						
						ed1ac4ae8e 
					 
					
						
						
							
							Converted MaximumSpanningTree algorithm to a generic template, this could go  
						
						... 
						
						
						
						into llvm/ADT.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@81001  91177308-0d34-0410-b5e6-96231b3b80d8 
						
						
					 
					
						2009-09-04 12:34:44 +00:00 
						 
				 
			
				
					
						
							
							
								Andreas Neustifter 
							
						 
					 
					
						
						
							
						
						3985943871 
					 
					
						
						
							
							Code Cleanup.  
						
						... 
						
						
						
						Removed inverted flag form MaximumSpanningTree, also do not handle so much
information to MaximumSpanningTree.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@80911  91177308-0d34-0410-b5e6-96231b3b80d8 
						
						
					 
					
						2009-09-03 08:52:52 +00:00 
						 
				 
			
				
					
						
							
							
								Benjamin Kramer 
							
						 
					 
					
						
						
							
						
						ac6f73a2e7 
					 
					
						
						
							
							Inline empty destructor.  
						
						... 
						
						
						
						git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@80431  91177308-0d34-0410-b5e6-96231b3b80d8 
						
						
					 
					
						2009-08-29 13:38:21 +00:00 
						 
				 
			
				
					
						
							
							
								Bill Wendling 
							
						 
					 
					
						
						
							
						
						d1e1d39b85 
					 
					
						
						
							
							Fix warning about non-virtual destructor.  
						
						... 
						
						
						
						git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@80429  91177308-0d34-0410-b5e6-96231b3b80d8 
						
						
					 
					
						2009-08-29 12:31:38 +00:00 
						 
				 
			
				
					
						
							
							
								Andreas Neustifter 
							
						 
					 
					
						
						
							
						
						6ef116d9dc 
					 
					
						
						
							
							Preparation for Optimal Edge Profiling:  
						
						... 
						
						
						
						This implements the maximum spanning tree algorithm on CFGs according to
weights given by the ProfileEstimator. This is then used to implement Optimal
Edge Profiling.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@80358  91177308-0d34-0410-b5e6-96231b3b80d8 
						
						
					 
					
						2009-08-28 11:28:24 +00:00