From 3287c58494e1dc92bbb2d8fcfc5d9ecdebe064e6 Mon Sep 17 00:00:00 2001 From: Elias Rad <146735585+nnsW3@users.noreply.github.com> Date: Sun, 4 Aug 2024 01:52:16 +0300 Subject: [PATCH] Fix spelling (#3267) Signed-off-by: Elias Rad <146735585+nnsW3@users.noreply.github.com> --- chains/manager.go | 2 +- codec/manager.go | 2 +- codec/reflectcodec/type_codec.go | 2 +- x/merkledb/README.md | 2 +- 4 files changed, 4 insertions(+), 4 deletions(-) diff --git a/chains/manager.go b/chains/manager.go index 5cb75c79bc94..0b6ae14bd6b1 100644 --- a/chains/manager.go +++ b/chains/manager.go @@ -446,7 +446,7 @@ func (m *manager) createChain(chainParams ChainParameters) { ) } - // Notify those that registered to be notified when a new chain is created + // Notify those who registered to be notified when a new chain is created m.notifyRegistrants(chain.Name, chain.Context, chain.VM) // Allows messages to be routed to the new chain. If the handler hasn't been diff --git a/codec/manager.go b/codec/manager.go index 608bbcabc0fe..00de14e5c9a9 100644 --- a/codec/manager.go +++ b/codec/manager.go @@ -15,7 +15,7 @@ import ( const ( VersionSize = wrappers.ShortLen - // default max size, in bytes, of something being marshalled by Marshal() + // default max size, in bytes, of something being marshaled by Marshal() defaultMaxSize = 256 * units.KiB // initial capacity of byte slice that values are marshaled into. diff --git a/codec/reflectcodec/type_codec.go b/codec/reflectcodec/type_codec.go index c5ce970a8054..901ff2bc9065 100644 --- a/codec/reflectcodec/type_codec.go +++ b/codec/reflectcodec/type_codec.go @@ -673,7 +673,7 @@ func (c *genericCodec) unmarshal( if err != nil { return fmt.Errorf("couldn't unmarshal struct: %w", err) } - // Go through the fields and umarshal into them + // Go through the fields and unmarshal into them for _, fieldIndex := range serializedFieldIndices { if err := c.unmarshal(p, value.Field(fieldIndex), typeStack); err != nil { return err diff --git a/x/merkledb/README.md b/x/merkledb/README.md index be2fb4e6b2aa..9f840c343776 100644 --- a/x/merkledb/README.md +++ b/x/merkledb/README.md @@ -4,7 +4,7 @@ A _Merkle radix trie_ is a data structure that is both a [Merkle tree](https://en.wikipedia.org/wiki/Merkle_tree) and a [radix trie](https://en.wikipedia.org/wiki/Radix_tree). MerkleDB is an implementation of a persisted key-value store (sometimes just called "a store") using a Merkle radix trie. We sometimes use "Merkle radix trie" and "MerkleDB instance" interchangeably below, but the two are not the same. MerkleDB maintains data in a Merkle radix trie, but not all Merkle radix tries implement a key-value store. -Like all tries, a MerkleDB instance is composed of nodes. Conceputally, a node has: +Like all tries, a MerkleDB instance is composed of nodes. Conceptually, a node has: * A unique _key_ which identifies its position in the trie. A node's key is a prefix of its childrens' keys. * A unique _ID_, which is the hash of the node. * A _children_ array, where each element is the ID of the child at that index. A child at a lower index is to the "left" of children at higher indices.