equal
deleted
inserted
replaced
644 score = n_score; |
644 score = n_score; |
645 idx = i; // Also keep index in worklist |
645 idx = i; // Also keep index in worklist |
646 } |
646 } |
647 } // End of for all ready nodes in worklist |
647 } // End of for all ready nodes in worklist |
648 |
648 |
649 assert(idx >= 0, "index should be set"); |
649 guarantee(idx >= 0, "index should be set"); |
650 Node *n = worklist[(uint)idx]; // Get the winner |
650 Node *n = worklist[(uint)idx]; // Get the winner |
651 |
651 |
652 worklist.map((uint)idx, worklist.pop()); // Compress worklist |
652 worklist.map((uint)idx, worklist.pop()); // Compress worklist |
653 return n; |
653 return n; |
654 } |
654 } |