6 namespace org { namespace ldk { namespace structs {
12 public class TwoTuple_TxidCOption_BlockHashZZ : CommonBase {
13 internal TwoTuple_TxidCOption_BlockHashZZ(object _dummy, long ptr) : base(ptr) { }
14 ~TwoTuple_TxidCOption_BlockHashZZ() {
15 if (ptr != 0) { bindings.C2Tuple_TxidCOption_BlockHashZZ_free(ptr); }
21 public byte[] get_a() {
22 byte[] ret = bindings.C2Tuple_TxidCOption_BlockHashZZ_get_a(this.ptr);
30 public Option_BlockHashZ get_b() {
31 long ret = bindings.C2Tuple_TxidCOption_BlockHashZZ_get_b(this.ptr);
33 if (ret >= 0 && ret <= 4096) { return null; }
34 org.ldk.structs.Option_BlockHashZ ret_hu_conv = org.ldk.structs.Option_BlockHashZ.constr_from_ptr(ret);
35 if (ret_hu_conv != null) { ret_hu_conv.ptrs_to.AddLast(this); };
39 internal long clone_ptr() {
40 long ret = bindings.C2Tuple_TxidCOption_BlockHashZZ_clone_ptr(this.ptr);
46 * Creates a new tuple which has the same data as `orig`
47 * but with all dynamically-allocated buffers duplicated in new buffers.
49 public TwoTuple_TxidCOption_BlockHashZZ clone() {
50 long ret = bindings.C2Tuple_TxidCOption_BlockHashZZ_clone(this.ptr);
52 if (ret >= 0 && ret <= 4096) { return null; }
53 TwoTuple_TxidCOption_BlockHashZZ ret_hu_conv = new TwoTuple_TxidCOption_BlockHashZZ(null, ret);
54 if (ret_hu_conv != null) { ret_hu_conv.ptrs_to.AddLast(this); };
59 * Creates a new C2Tuple_TxidCOption_BlockHashZZ from the contained elements.
61 public static TwoTuple_TxidCOption_BlockHashZZ of(byte[] a, org.ldk.structs.Option_BlockHashZ b) {
62 long ret = bindings.C2Tuple_TxidCOption_BlockHashZZ_new(InternalUtils.check_arr_len(a, 32), b.ptr);
65 if (ret >= 0 && ret <= 4096) { return null; }
66 TwoTuple_TxidCOption_BlockHashZZ ret_hu_conv = new TwoTuple_TxidCOption_BlockHashZZ(null, ret);
67 if (ret_hu_conv != null) { ret_hu_conv.ptrs_to.AddLast(ret_hu_conv); };
68 if (ret_hu_conv != null) { ret_hu_conv.ptrs_to.AddLast(b); };