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
Sorting a MutRrbt "inplace" is a very common process in my project.
What is the "best practice" for sorting a MutRrbt data structure (before making it immutable())?
Should something simple like the following snippet directly be included in MutRrbt or can this be done in a more "clever" way?
This question deserves careful thought and I'm busy with holiday stuff right now. The quick answer is that if you don't have duplicates, use the PersistentTreeSet or sortedSet() instead of an RRB-Tree.
Otherwise, your solution looks correct. That's the right place to start. We can try to improve efficiency later.
Sorting a
MutRrbt
"inplace" is a very common process in my project.What is the "best practice" for sorting a
MutRrbt
data structure (before making itimmutable()
)?Should something simple like the following snippet directly be included in
MutRrbt
or can this be done in a more "clever" way?The text was updated successfully, but these errors were encountered: