111 void GreedyClusterAlgorithm::EdgeTy::print(raw_ostream &OS) const {  in print()
115 size_t GreedyClusterAlgorithm::EdgeHash::operator()(const EdgeTy &E) const {  in operator ()()
120 bool GreedyClusterAlgorithm::EdgeEqual::operator()(const EdgeTy &A,  in operator ()()
121                                                    const EdgeTy &B) const {  in operator ()()
135   std::vector<EdgeTy> Queue;  in clusterBasicBlocks()
154       Queue.emplace_back(EdgeTy(BB, I, BI->Count));  in clusterBasicBlocks()
163     EdgeTy E = Queue.back();  in clusterBasicBlocks()
230 void PHGreedyClusterAlgorithm::initQueue(std::vector<EdgeTy> &Queue,  in initQueue()
233   auto Comp = [&BF](const EdgeTy &A, const EdgeTy &B) {  in initQueue()
250 void PHGreedyClusterAlgorithm::adjustQueue(std::vector<EdgeTy> &Queue,  in adjustQueue()
258                                                      const EdgeTy &E) const {  in areClustersCompatible()
263     const EdgeTy &E, const BinaryFunction &BF) const {  in calculateWeight()
309 void MinBranchGreedyClusterAlgorithm::initQueue(std::vector<EdgeTy> &Queue,  in initQueue()
312   for (const EdgeTy &E : Queue)  in initQueue()
319 void MinBranchGreedyClusterAlgorithm::adjustQueue(std::vector<EdgeTy> &Queue,  in adjustQueue()
322   auto Comp = [&](const EdgeTy &A, const EdgeTy &B) {  in adjustQueue()
337   std::vector<EdgeTy> NewQueue;  in adjustQueue()
338   for (const EdgeTy &E : Queue) {  in adjustQueue()
368         auto WI = Weight.find(EdgeTy(SrcBB, SuccBB, 0));  in adjustQueue()
375         auto WI = Weight.find(EdgeTy(PredBB, DstBB, 0));  in adjustQueue()
393     const ClusterTy &Front, const ClusterTy &Back, const EdgeTy &E) const {  in areClustersCompatible()