@@ -40,7 +40,7 @@ namespace miniscript {
40
40
* - For example: older(n) = <n> OP_CHECKSEQUENCEVERIFY.
41
41
* - "V" Verify:
42
42
* - Takes its inputs from the top of the stack.
43
- * - When satisfactied , pushes nothing.
43
+ * - When satisfied , pushes nothing.
44
44
* - Cannot be dissatisfied.
45
45
* - This can be obtained by adding an OP_VERIFY to a B, modifying the last opcode
46
46
* of a B to its -VERIFY version (only for OP_CHECKSIG, OP_CHECKSIGVERIFY
@@ -329,6 +329,8 @@ struct Node {
329
329
* computes the result of the node. If std::nullopt is returned by upfn,
330
330
* TreeEvalMaybe() immediately returns std::nullopt.
331
331
* The return value of TreeEvalMaybe is the result of the root node.
332
+ *
333
+ * Result type cannot be bool due to the std::vector<bool> specialization.
332
334
*/
333
335
template <typename Result, typename State, typename DownFn, typename UpFn>
334
336
std::optional<Result> TreeEvalMaybe (State root_state, DownFn downfn, UpFn upfn) const
@@ -858,7 +860,7 @@ enum class ParseContext {
858
860
859
861
int FindNextChar (Span<const char > in, const char m);
860
862
861
- /* * Parse a key string ending with a ')' or ',' . */
863
+ /* * Parse a key string ending at the end of the fragment's text representation . */
862
864
template <typename Key, typename Ctx>
863
865
std::optional<std::pair<Key, int >> ParseKeyEnd (Span<const char > in, const Ctx& ctx)
864
866
{
0 commit comments