Rename RandomStrategy into RandomWalkStrategy

Author: randomlogin

src/builder.rs

@@ -78,7 +78,7 @@ use crate::message_handler::NodeCustomMessageHandler;
 use crate::payment::asynchronous::om_mailbox::OnionMessageMailbox;
 use crate::peer_store::PeerStore;
 use crate::probing::{
-	HighDegreeStrategy, Prober, ProbingConfig, ProbingStrategy, ProbingStrategyKind, RandomStrategy,
+	HighDegreeStrategy, Prober, ProbingConfig, ProbingStrategy, ProbingStrategyKind, RandomWalkStrategy,
 };
 use crate::runtime::{Runtime, RuntimeSpawner};
 use crate::tx_broadcaster::TransactionBroadcaster;
@@ -2097,7 +2097,7 @@ fn build_with_store_internal(
 					config.probing_liquidity_limit_multiplier,
 				))
 			},
-			ProbingStrategyKind::Random { max_hops } => Arc::new(RandomStrategy::new(
+			ProbingStrategyKind::RandomWalk { max_hops } => Arc::new(RandomWalkStrategy::new(
 				Arc::clone(&network_graph),
 				Arc::clone(&channel_manager),
 				*max_hops,

src/probing.rs

@@ -18,7 +18,7 @@
 //! their capacities, providing accurate data to the scorer and router.
 //!
 //! This module provides the configuration for such a service. There are two pre-built strategies,
-//! [`RandomStrategy`] and [`HighDegreeStrategy`], as well as a [`ProbingStrategy`] trait which
+//! [`RandomWalkStrategy`] and [`HighDegreeStrategy`], as well as a [`ProbingStrategy`] trait which
 //! allows defining a custom probing strategy (for example if there is an established payment
 //! pattern).
 //!
@@ -89,7 +89,7 @@ use crate::util::random_range;
 #[derive(Clone)]
 pub(crate) enum ProbingStrategyKind {
 	HighDegree { top_node_count: usize },
-	Random { max_hops: usize },
+	RandomWalk { max_hops: usize },
 	Custom(Arc<dyn ProbingStrategy>),
 }
 
@@ -99,8 +99,8 @@ impl fmt::Debug for ProbingStrategyKind {
 			Self::HighDegree { top_node_count } => {
 				f.debug_struct("HighDegree").field("top_node_count", top_node_count).finish()
 			},
-			Self::Random { max_hops } => {
-				f.debug_struct("Random").field("max_hops", max_hops).finish()
+			Self::RandomWalk { max_hops } => {
+				f.debug_struct("RandomWalk").field("max_hops", max_hops).finish()
 			},
 			Self::Custom(_) => f.write_str("Custom(<probing strategy>)"),
 		}
@@ -206,7 +206,7 @@ impl ProbingConfigBuilder {
 	/// `max_hops` is the upper bound on the number of hops in a randomly constructed path.
 	/// Values below `2` are clamped to `2`.
 	pub fn random_walk(max_hops: usize) -> Self {
-		Self::with_kind(ProbingStrategyKind::Random { max_hops })
+		Self::with_kind(ProbingStrategyKind::RandomWalk { max_hops })
 	}
 
 	/// Start building a config with a custom [`ProbingStrategy`] implementation.
@@ -238,7 +238,7 @@ impl ProbingConfigBuilder {
 	///
 	/// This is only useful for probing strategies that route through the scorer
 	/// (e.g., [`HighDegreeStrategy`]). Strategies that build paths manually
-	/// (e.g., [`RandomStrategy`]) bypass the scorer entirely.
+	/// (e.g., [`RandomWalkStrategy`]) bypass the scorer entirely.
 	///
 	/// If unset, LDK's default of `0` (no penalty) is used.
 	pub fn diversity_penalty_msat(&mut self, penalty_msat: u64) -> &mut Self {
@@ -326,7 +326,7 @@ impl ArcedProbingConfigBuilder {
 	///
 	/// This is only useful for probing strategies that route through the scorer
 	/// (e.g., [`HighDegreeStrategy`]). Strategies that build paths manually
-	/// (e.g., [`RandomStrategy`]) bypass the scorer entirely.
+	/// (e.g., [`RandomWalkStrategy`]) bypass the scorer entirely.
 	///
 	/// If unset, LDK's default of `0` (no penalty) is used.
 	pub fn set_diversity_penalty_msat(&self, penalty_msat: u64) {
@@ -504,8 +504,8 @@ impl ProbingStrategy for HighDegreeStrategy {
 /// Because path selection ignores the scorer, this probes channels the router
 /// would never try on its own, teaching the scorer about previously unknown paths.
 ///
-/// `RandomStrategy` can only use publicly announced channels for probing.
-pub struct RandomStrategy {
+/// `RandomWalkStrategy` can only use publicly announced channels for probing.
+pub struct RandomWalkStrategy {
 	network_graph: Arc<Graph>,
 	channel_manager: Arc<ChannelManager>,
 	/// Upper bound on the number of hops in a randomly constructed path.
@@ -516,7 +516,7 @@ pub struct RandomStrategy {
 	pub max_amount_msat: u64,
 }
 
-impl RandomStrategy {
+impl RandomWalkStrategy {
 	/// Creates a new random-walk probing strategy.
 	pub(crate) fn new(
 		network_graph: Arc<Graph>, channel_manager: Arc<ChannelManager>, max_hops: usize,
@@ -722,7 +722,7 @@ impl RandomStrategy {
 	}
 }
 
-impl ProbingStrategy for RandomStrategy {
+impl ProbingStrategy for RandomWalkStrategy {
 	fn next_probe(&self) -> Option<Path> {
 		let target_hops = random_range(2, self.max_hops as u64) as usize;
 		let amount_msat = random_range(self.min_amount_msat, self.max_amount_msat);