From 5d10b25c56f6c6dff0b209447d5e0e0c4bc75368 Mon Sep 17 00:00:00 2001 From: radik878 Date: Tue, 7 Oct 2025 14:21:49 +0300 Subject: [PATCH 1/3] docs: fix typos --- packages/std/src/traits.rs | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/packages/std/src/traits.rs b/packages/std/src/traits.rs index ed6da0102e..d8d805dc17 100644 --- a/packages/std/src/traits.rs +++ b/packages/std/src/traits.rs @@ -59,7 +59,7 @@ pub trait Storage { /// Allows iteration over a set of key/value pairs, either forwards or backwards. /// /// The bound `start` is inclusive and `end` is exclusive. - /// If `start` is lexicographically greater than or equal to `end`, an empty range is described, mo matter of the order. + /// If `start` is lexicographically greater than or equal to `end`, an empty range is described, no matter of the order. #[cfg(feature = "iterator")] #[allow(unused_variables)] fn range<'a>( @@ -76,7 +76,7 @@ pub trait Storage { /// Allows iteration over a set of keys, either forwards or backwards. /// /// The bound `start` is inclusive and `end` is exclusive. - /// If `start` is lexicographically greater than or equal to `end`, an empty range is described, mo matter of the order. + /// If `start` is lexicographically greater than or equal to `end`, an empty range is described, no matter of the order. /// /// The default implementation uses [`Storage::range`] and discards the values. More efficient /// implementations might be possible depending on the storage. @@ -93,7 +93,7 @@ pub trait Storage { /// Allows iteration over a set of values, either forwards or backwards. /// /// The bound `start` is inclusive and `end` is exclusive. - /// If `start` is lexicographically greater than or equal to `end`, an empty range is described, mo matter of the order. + /// If `start` is lexicographically greater than or equal to `end`, an empty range is described, no matter of the order. /// /// The default implementation uses [`Storage::range`] and discards the keys. More efficient implementations /// might be possible depending on the storage. From 8c6534f83d960b19424b4ea7c5911e3b0fb7cb5a Mon Sep 17 00:00:00 2001 From: radik878 Date: Tue, 7 Oct 2025 14:22:24 +0300 Subject: [PATCH 2/3] docs: fix typo --- packages/std/src/query/wasm.rs | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/packages/std/src/query/wasm.rs b/packages/std/src/query/wasm.rs index d34b3989ce..f544856096 100644 --- a/packages/std/src/query/wasm.rs +++ b/packages/std/src/query/wasm.rs @@ -52,7 +52,7 @@ pub enum WasmQuery { /// Inclusive start bound. This is the first key you would like to get data for. /// /// If `start` is lexicographically greater than or equal to `end`, - /// an empty range is described, mo matter of the order. + /// an empty range is described, no matter of the order. start: Option, /// Exclusive end bound. This is the key after the last key you would like to get data for. end: Option, From c63954844c28458e276040ee9b98b604f44376cf Mon Sep 17 00:00:00 2001 From: radik878 Date: Tue, 7 Oct 2025 14:22:51 +0300 Subject: [PATCH 3/3] docs: fix typos --- packages/vm/src/backend.rs | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/packages/vm/src/backend.rs b/packages/vm/src/backend.rs index f3760be066..ba12eff412 100644 --- a/packages/vm/src/backend.rs +++ b/packages/vm/src/backend.rs @@ -99,7 +99,7 @@ pub trait Storage { /// /// The bound `start` is inclusive and `end` is exclusive. /// - /// If `start` is lexicographically greater than or equal to `end`, an empty range is described, mo matter of the order. + /// If `start` is lexicographically greater than or equal to `end`, an empty range is described, no matter of the order. /// /// This call must not change data in the storage, but creating and storing a new iterator can be a mutating operation on /// the Storage implementation.