search

chapel-lang / chapel

a Productive Parallel Programming Language
https://chapel-lang.org
Other
1.76k stars 414 forks source link

Should we support a low memory sort option #25169

Open jabraham17 opened 1 month ago

jabraham17 commented 1 month ago

In https://github.com/chapel-lang/chapel/issues/24857#issuecomment-2148585933, we decided to remove the optional keyword argument inPlaceAlgorithm. A value of true for this variable would result in calling a slower sort implementation that would not create extra copies of the array. Removing this option means that there will be no standard way to sort an array without this memory overhead.

Should we provide a way to opt-out of this? For the sake of this issue, I will call this sortLowMem. This extra overload would use a slower, but less memory intensive, sort algorithm

bradcray commented 1 month ago

My answer to this question would be "Yes, we probably should" but also "Maybe we can wait on it until someone requests it / runs into problems with the two-array sort".