Skip to content
This repository has been archived by the owner on Nov 15, 2023. It is now read-only.

Commit

Permalink
improve docs
Browse files Browse the repository at this point in the history
  • Loading branch information
rphmeier committed Feb 25, 2022
1 parent fff0817 commit f49482c
Showing 1 changed file with 6 additions and 1 deletion.
7 changes: 6 additions & 1 deletion node/core/prospective-parachains/src/fragment_tree.rs
Original file line number Diff line number Diff line change
Expand Up @@ -41,7 +41,12 @@
//! have different depths in different parts of the tree.
//!
//! We also need to handle cycles, including nodes for candidates which produce a header
//! which is the same as its parent's. Within a [`Fragment]
//! which is the same as its parent's. Within a [`FragmentTree`], cycles are bounded by the
//! maximum depth allowed by the tree.
//!
//! As long as the [`CandidateStorage`] has bounded input on the number of candidates supplied,
//! [`FragmentTree`] complexity is bounded. This means that higher-level code needs to be selective
//! about limiting the amount of candidates that are considered.
// TODO [now]: review & update.

use std::{
Expand Down

0 comments on commit f49482c

Please sign in to comment.