| Commit message (Collapse) | Author | Age | Files | Lines |
|
|
|
|
| |
Found-by: ubitux
Signed-off-by: Michael Niedermayer <michaelni@gmx.at>
|
|
|
|
|
|
|
| |
compared to qsort this is slower but its stable and doesnt have a O(n^2) worst
case
Signed-off-by: Michael Niedermayer <michaelni@gmx.at>
|
|
|
|
| |
Signed-off-by: Michael Niedermayer <michaelni@gmx.at>
|
|
|
|
| |
Signed-off-by: Michael Niedermayer <michaelni@gmx.at>
|
|
about 2-5 times faster than gnu libcs qsort()
And should be 100% binary identical across platforms.
I will bump the version once the API is certainly stable and
everyone is happy with the API.
Signed-off-by: Michael Niedermayer <michaelni@gmx.at>
|