Page MenuHomePhabricator

Add a traversal method for the radix tree
ClosedPublic

Authored by Fabien on May 5 2022, 15:06.

Details

Reviewers
sdulfari
Group Reviewers
Restricted Project
Commits
rABCf9e31f734c34: Add a traversal method for the radix tree
Summary

This method applies a callback to each Leaf in the ascending key order.

It is expected to be used for several purposes:

  • With compact proof requests to compute the short ids
  • With the mempool to fill the getblocktemplate
Test Plan
ninja check

Diff Detail

Repository
rABC Bitcoin ABC
Branch
avalanche_radix_tree_traversal
Lint
Lint Passed
Unit
No Test Coverage
Build Status
Buildable 18960
Build 37685: Build Diffbuild-diff · lint-circular-dependencies · build-debug · build-without-wallet · build-clang · build-clang-tidy
Build 37684: arc lint + arc unit

Event Timeline

Fabien requested review of this revision.May 5 2022, 15:06
sdulfari requested changes to this revision.May 5 2022, 16:42
sdulfari added a subscriber: sdulfari.

A quick mention of what you intend to do with this would be helpful since it's not currently used except for its own test.

src/radix.h
140 ↗(On Diff #33406)

public is redundant here

This revision now requires changes to proceed.May 5 2022, 16:42

Remove redundant public and expand the summary with a couple expected use cases.

This revision is now accepted and ready to land.May 5 2022, 18:35
This revision was automatically updated to reflect the committed changes.