38c037c977
Unstable sorting should be slightly faster than stable sorting, and if the vector was built asynchronously then preserving the initial order doesn't matter too much. Continue to use stable sorting where the vector is not built asynchronously, or if the vector is partially sorted (e.g. when new elements are pushed to a sorted vector). |
||
|---|---|---|
| .. | ||
| data | ||
| i18n | ||
| src | ||
| Cargo.toml | ||
| i18n.toml | ||