docs: fix typos (#2554)

Author: radik878

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<Binary>,
         /// Exclusive end bound. This is the key after the last key you would like to get data for.
         end: Option<Binary>,

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.

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.