Please sign in to comment.
Make Map/Hash.sort about 11x faster
- instead of first generating a list of Pairs and sort on .key - create native str array of keys and sort that - then create Pairs on a new iterator on the native str array of keys - this delays the creation of Pairs until they're really needed - the removes the need unpack each pair to be able to sort - prevents unneeded Pairs from being created, e.g. %h.sort.head(100) - keep old logic for object hashes for now
- Loading branch information...
Showing with 65 additions and 6 deletions.