include_amount: invreq_payer_id, invoice_payment_hash, invoice_node_id * *and* invoice_amount. This demonstrates the case where * proof_missing_hashes are NOT in ascending-type order: the left pair * [type0,type22] is entirely omitted, so its subtree hash is appended *after* * the hash for type82 (which shares the same 4-leaf subtree). The DFS * traversal resolves the right child (type82) b
| 108 | * the left (type0+22). |
| 109 | */ |
| 110 | static bool include_amount(const struct tlv_field *f, void *arg UNNEEDED) |
| 111 | { |
| 112 | return include_minimal(f, arg) |
| 113 | || f->numtype == TLV_PAYER_PROOF_INVOICE_AMOUNT; |
| 114 | } |
| 115 | |
| 116 | static void print_fields_json(const struct tlv_field *fields, size_t n, |
| 117 | bool (*include_field)(const struct tlv_field *, void *), |
nothing calls this directly
no test coverage detected