Optimize heapsort The new implementation is about 10% faster than the previous one(sorting random 1000 items). |
||
|---|---|---|
| .. | ||
| iter | ||
| ascii.rs | ||
| cmp.rs | ||
| index.rs | ||
| iter.rs | ||
| memchr.rs | ||
| mod.rs | ||
| raw.rs | ||
| rotate.rs | ||
| sort.rs | ||
| specialize.rs | ||
Optimize heapsort The new implementation is about 10% faster than the previous one(sorting random 1000 items). |
||
|---|---|---|
| .. | ||
| iter | ||
| ascii.rs | ||
| cmp.rs | ||
| index.rs | ||
| iter.rs | ||
| memchr.rs | ||
| mod.rs | ||
| raw.rs | ||
| rotate.rs | ||
| sort.rs | ||
| specialize.rs | ||