diff options
| author | Jon Atack <jon@atack.com> | 2021-06-23 13:33:18 +0200 |
|---|---|---|
| committer | Jon Atack <jon@atack.com> | 2021-06-23 13:33:18 +0200 |
| commit | 184d4534f6f9633d930f288184ca5248333c8ca2 (patch) | |
| tree | c50b9af1184f5117ad0732af405e260d5324f771 /src/script | |
| parent | 567670bec5ecf9bc252e91370382be53fd81ccee (diff) | |
script, doc: spelling update
Diffstat (limited to 'src/script')
| -rw-r--r-- | src/script/standard.cpp | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/src/script/standard.cpp b/src/script/standard.cpp index b3dd5442fc..0fa5e56eb6 100644 --- a/src/script/standard.cpp +++ b/src/script/standard.cpp @@ -530,9 +530,9 @@ std::optional<std::vector<std::tuple<int, CScript, int>>> InferTaprootTree(const std::vector<std::tuple<int, CScript, int>> ret; if (spenddata.merkle_root.IsNull()) return ret; - /** Data structure to represent the nodes of the tree we're going to be build. */ + /** Data structure to represent the nodes of the tree we're going to build. */ struct TreeNode { - /** Hash of this none, if known; 0 otherwise. */ + /** Hash of this node, if known; 0 otherwise. */ uint256 hash; /** The left and right subtrees (note that their order is irrelevant). */ std::unique_ptr<TreeNode> sub[2]; @@ -547,7 +547,7 @@ std::optional<std::vector<std::tuple<int, CScript, int>>> InferTaprootTree(const bool done = false; }; - // Build tree from the provides branches. + // Build tree from the provided branches. TreeNode root; root.hash = spenddata.merkle_root; for (const auto& [key, control_blocks] : spenddata.scripts) { |