From f02ed0050f5d6d00473447276628b2c5cf5629f9 Mon Sep 17 00:00:00 2001 From: Benjamin Tan Date: Fri, 10 Jan 2025 02:38:06 +0800 Subject: [PATCH] lib: dag_walk: fix doc comment typos This commit fixes more typos unintentionally introduced in d9c68e08, when renaming `jj branch` to `jj bookmark`. --- lib/src/dag_walk.rs | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) diff --git a/lib/src/dag_walk.rs b/lib/src/dag_walk.rs index 0416619a02..dd383f9a47 100644 --- a/lib/src/dag_walk.rs +++ b/lib/src/dag_walk.rs @@ -171,7 +171,7 @@ where /// For example, topological order of chronological data should respect /// timestamp (except a few outliers caused by clock skew.) /// -/// Use `topo_order_reverse()` if the DAG is heavily bookmarked. This can +/// Use `topo_order_reverse()` if the DAG is heavily branched. This can /// only process linear part lazily. pub fn topo_order_reverse_lazy( start: II, @@ -286,9 +286,9 @@ impl TopoOrderReverseLazyInner { /// o A /// ``` /// -/// If a bookmark reached to root (empty neighbors), the graph can't be split -/// anymore because the other bookmark may be connected to a descendant of -/// the rooted bookmark. +/// If a branch reached to root (empty neighbors), the graph can't be split +/// anymore because the other branch may be connected to a descendant of +/// the rooted branch. /// /// ```text /// o | C @@ -809,7 +809,7 @@ mod tests { assert_eq!(common, vec!['E', 'D', 'C', 'B', 'a']); // The root node 'a' is visited before 'C'. If the graph were split there, - // the bookmark 'C->B->a' would be orphaned. + // the branch 'C->B->a' would be orphaned. let common = topo_order_reverse_lazy(vec!['E'], id_fn, neighbors_fn).collect_vec(); assert_eq!(common, vec!['E', 'D', 'C', 'B', 'a']);