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
A sort function is a good feature, however a purely lazy sort would defeat the purpose of being lazy, since a sort requires at least one cycle through all elements, materializing them. If they aren't cached, the performance can be much much worse than eager algorithms. However an inferred sort would be an interesting feature, having the sort only be executed when the iterator is materialized.
Just a suggestion for a method that could be implemented with this lib, once it would be useful to me: sort.
If you like the suggestion, I could work on it (with your help, of course).
The text was updated successfully, but these errors were encountered: