Skip to content
Commit 1e9b7330 authored by Sergey Pupyrev's avatar Sergey Pupyrev Committed by Maksim Panchenko
Browse files

a new version of hfsort+

Summary:
A faster and better version of function reordering:
- fixed a bug when some computed probabilities were negative;
- changed an O(n^2) loop to a priority queue to find a candidate of chains to merge

(cherry picked from FBD24571208)
parent 6401af89
Loading
Loading
Loading
Loading
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment