BTreeMap: Explore making node loading less expensive

Open
#166 0 comments 0 reactions 0 assignees View on GitHub

Nobody has claimed this yet.

Assessment

Difficulty
5/5
Estimated time
Over a week
Newbie friendliness
25/100
Issue type
Refactor
Clarity
Needs clarification
Activity status
Stale
Tech stack
rust

Research direction

Start by reviewing the BTreeMap node-loading path and the related forum post linked in the issue. Clarify which optimization to pursue and define completion around an agreed approach with measured evidence that node loading is less expensive.

Written by the indexing model from the issue text.

Description

Loading is a relatively expensive operation, and improving it can lead to significant gains in performance. Caching is an obvious way to make loading a node cheaper. Maybe there are other options worth exploring too.

Related forum post:
https://forum.dfinity.org/t/is-there-any-way-to-mutate-the-value-inside-ic-stable-structures-btreemap/

Dominant language
Rust
Stars
111
Forks
39
PR merge metrics
No merged PRs in 30d

Contributor guide

Open the contributing guide

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

More from dfinity/stable-structures

All issues in dfinity/stable-structures

Similar issues

More Rust issues

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.