You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
With the .Sort() method being depreciated there are a couple of rare cases where applying a sort immediately is desired because the properties used in the comparison do not exist downstream.
example:
changeSet
.Sort(complexSortComparer) //Sorts on input data type
.DistinctValues(x => x.Name) //DistinctValues is transforming to Name data type
.Bind(out names); //List of names is sorted
Changing the call chain to use SortAndBind() is not possible in this scenario.
The second scenario is pretty compelling to me, as a potential performance improvement for not duplicating sort work. However, I also proposed in the thread that the performance of .Sort() is so poor that one instance of .Sort() might actually NOT be more efficient thant two instances of .SortAndBind(). Now, I'm curious to benchmark it.
Describe the functionality desired 🐞
With the .Sort() method being depreciated there are a couple of rare cases where applying a sort immediately is desired because the properties used in the comparison do not exist downstream.
example:
Changing the call chain to use SortAndBind() is not possible in this scenario.
I had a conversation on Slack about this topic:
https://reactivex.slack.com/archives/C4LF8S19N/p1733511277945719
The steps the functionality will provide
Considerations
SortAndBind
The text was updated successfully, but these errors were encountered: