@@ -13,21 +13,21 @@ pub trait ReachabilityService {
1313 /// Note that we use the graph theory convention here which defines that a block is also an ancestor of itself.
1414 fn is_chain_ancestor_of ( & self , this : Hash , queried : Hash ) -> bool ;
1515
16- /// Result version of [`is_dag_ancestor_of`] (avoids unwrapping internally)
16+ /// Result version of [`Self:: is_dag_ancestor_of`] (avoids unwrapping internally)
1717 fn is_dag_ancestor_of_result ( & self , this : Hash , queried : Hash ) -> Result < bool > ;
1818
1919 /// Returns true if `this` is a DAG ancestor of `queried` (i.e., `queried ∈ future(this) ∪ {this}`).
2020 /// Note: this method will return true if `this == queried`.
2121 /// The complexity of this method is `O(log(|future_covering_set(this)|))`
2222 fn is_dag_ancestor_of ( & self , this : Hash , queried : Hash ) -> bool ;
2323
24- /// Checks if `this` is DAG ancestor of any of the blocks in `queried`. See [`is_dag_ancestor_of`] as well.
24+ /// Checks if `this` is DAG ancestor of any of the blocks in `queried`. See [`Self:: is_dag_ancestor_of`] as well.
2525 fn is_dag_ancestor_of_any ( & self , this : Hash , queried : & mut impl Iterator < Item = Hash > ) -> bool ;
2626
27- /// Checks if any of the blocks in `list` is DAG ancestor of `queried`. See [`is_dag_ancestor_of`] as well.
27+ /// Checks if any of the blocks in `list` is DAG ancestor of `queried`. See [`Self:: is_dag_ancestor_of`] as well.
2828 fn is_any_dag_ancestor ( & self , list : & mut impl Iterator < Item = Hash > , queried : Hash ) -> bool ;
2929
30- /// Result version of [`is_any_dag_ancestor`] (avoids unwrapping internally)
30+ /// Result version of [`Self:: is_any_dag_ancestor`] (avoids unwrapping internally)
3131 fn is_any_dag_ancestor_result ( & self , list : & mut impl Iterator < Item = Hash > , queried : Hash ) -> Result < bool > ;
3232
3333 /// Finds the tree child of `ancestor` which is also a chain ancestor of `descendant`.
0 commit comments