A node in a miniscript expression.
Synopsis
Declared in <script/miniscript.h>
template<typename Key>
class Node;Member Functions
Name |
Description |
|
Constructors |
|
Destroys the node, tearing down subexpressions iteratively to avoid deep recursion. |
Assignment operators |
|
Check whether there is no duplicate key across this fragment and all its sub‐fragments. |
|
Check the ops limit of this script against the consensus limit. |
|
Check the maximum stack size for this script against the policy limit. |
|
Check whether there is no satisfaction path that contains both timelocks and heightlocks |
|
Creates a deep copy of this node and all its subexpressions. |
|
Accesses the data bytes carried by this expression. |
|
Update duplicate key information in this Node. |
|
Find an insane subnode which has no insane children. Nullptr if there is none. |
|
Accesses the fragment (node type) of this node. |
|
Return the maximum size of the stack during execution of this script. |
|
Return the script context for this node. |
|
Return the maximum number of ops needed to satisfy this script non‐malleably. |
|
Return the maximum number of stack elements needed to satisfy this script non‐malleably. |
|
Return the number of ops in the script (not counting the dynamic ones that depend on execution). |
|
Return the expression type. |
|
Return the maximum size in bytes of a witness to satisfy this script non‐malleably. Note this does not include the witness script push. |
|
Whether this node is of type B, K or W. (That is, anything but V.) |
|
Check whether this script can always be satisfied in a non‐malleable way. |
|
Whether no satisfaction exists for this node. |
|
Check whether this node is safe as a script on its own. |
|
Whether the apparent policy of this node matches its script semantics. Doesn't guarantee it is a safe script on its own. |
|
Determine whether a Miniscript node is satisfiable. fn(node) will be invoked for all key, time, and hashing nodes, and should return their satisfiability. |
|
Check whether this node is valid at all. |
|
Check whether this node is valid as a script on its own. |
|
Accesses the k parameter of this node. |
|
Accesses the keys used by this expression. |
|
Check whether this script always needs a signature. |
|
Produce a witness for this script, if possible and given the information available in the context. The non‐malleable satisfaction is guaranteed to be valid if it exists, and ValidSatisfaction() is true. If IsSane() holds, this satisfaction is guaranteed to succeed in case the node's conditions are satisfied (private keys and hash preimages available, locktimes satisfied). |
|
Return the size of the script for this expression (faster than ToScript().size()). |
|
Accesses the subexpressions of this node. |
|
Builds the CScript encoding of this Miniscript expression. |
|
Produces the textual (policy‐language) representation of this Miniscript. |
|
Whether successful non‐malleable satisfactions are guaranteed to be valid. |
|
Equality testing. |
Friends
Name |
Description |
Compare two miniscript subtrees, using a non‐recursive algorithm. |
Non-Member Functions
Name |
Description |
Unordered traversal of a miniscript node tree. |
|
Decodes a Miniscript from a Bitcoin Script. |
|
Parses a Miniscript from its textual (policy‐language) representation. |
Created with MrDocs