feat: immutable sort

[hg-pyun]

Suggestion

Since the sort of an array refers to a reference, the original array changes. Usually, functional programming treats an array in an immutable way.

The sort function of fxts does not support immutable.

As 'toSorted' is added as a new method of array, it would be good to support 'toSorted' in fxts. After implementing internally, if 'native to Sorted' compatibility is guaranteed, it would be better to replace the internal implementation then.

Reference

• Array.prototype.toSorted()

[hg-pyun]

I will take it.

[jin-Pro]

I want to develop a toSorted method.

I think I should develop it using the heap data structure.

Do you agree with this idea?

[hg-pyun]

Sorry for the late reply. Due to personal work, I’m unable to continue with this ticket at the moment. If it’s alright with you, could you take over? Please include @hg-pyun and @ppeeou in the code review. Thank you.

[ppeeou]

@jin-Pro

Thank you for your interest in fxts.

I’m curious about your reason for choosing a heap. A heap is an unstable sort, meaning that if there are elements with the same value, their initial order may not be preserved after sorting.

For the toSorted spec, please refer to the polyfill in this link.

The sort method uses Array.prototype.sort here, which is known to be implemented with timSort.

How about implementing it with timSort?

[jin-Pro]

I'm sorry to my answer is too late.

I �failed to consider heap is an unstable sort.
I thought that if I use min heap, It will operate lazily by executing operations when extracting the value of the iterator.

but, I agree with your suggestion of timSort.
This is because Array.prototype.toSorted and Array.prototype.sort use timSort.
so, I will use 'timSort' when I develop 'toSorted'.

thank you