Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion packages/std/src/query/wasm.rs
Original file line number Diff line number Diff line change
Expand Up @@ -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>,
Expand Down
6 changes: 3 additions & 3 deletions packages/std/src/traits.rs
Original file line number Diff line number Diff line change
Expand Up @@ -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>(
Expand All @@ -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.
Expand All @@ -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.
Expand Down
2 changes: 1 addition & 1 deletion packages/vm/src/backend.rs
Original file line number Diff line number Diff line change
Expand Up @@ -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.
Expand Down