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
{{ message }}
This repository has been archived by the owner on Feb 3, 2025. It is now read-only.
Right now we use a HashMap for our in memory storage. It may be more efficient to change to a BTreeMap, this way things like scan_prefix are much more efficient. However it has the tradeoff of being O(log(n)) for insertions, we would probably want to bench mark it which may be hard.
The text was updated successfully, but these errors were encountered:
Sign up for freeto subscribe to this conversation on GitHub.
Already have an account?
Sign in.
Right now we use a
HashMap
for our in memory storage. It may be more efficient to change to aBTreeMap
, this way things likescan_prefix
are much more efficient. However it has the tradeoff of being O(log(n)) for insertions, we would probably want to bench mark it which may be hard.The text was updated successfully, but these errors were encountered: