import org.ldk.enums.*;
import org.ldk.util.*;
import java.util.Arrays;
+import java.lang.ref.Reference;
import javax.annotation.Nullable;
if (ptr != 0) { bindings.NodeInfo_free(ptr); }
}
+ /**
+ * All valid channels a node has announced
+ *
+ * Returns a copy of the field.
+ */
+ public long[] get_channels() {
+ long[] ret = bindings.NodeInfo_get_channels(this.ptr);
+ Reference.reachabilityFence(this);
+ return ret;
+ }
+
/**
* All valid channels a node has announced
*/
public void set_channels(long[] val) {
bindings.NodeInfo_set_channels(this.ptr, val);
+ Reference.reachabilityFence(this);
+ Reference.reachabilityFence(val);
}
/**
@Nullable
public RoutingFees get_lowest_inbound_channel_fees() {
long ret = bindings.NodeInfo_get_lowest_inbound_channel_fees(this.ptr);
- if (ret < 1024) { return null; }
- RoutingFees ret_hu_conv = new RoutingFees(null, ret);
- ret_hu_conv.ptrs_to.add(this);
+ Reference.reachabilityFence(this);
+ if (ret >= 0 && ret <= 4096) { return null; }
+ org.ldk.structs.RoutingFees ret_hu_conv = null; if (ret < 0 || ret > 4096) { ret_hu_conv = new org.ldk.structs.RoutingFees(null, ret); }
+ if (ret_hu_conv != null) { ret_hu_conv.ptrs_to.add(this); };
return ret_hu_conv;
}
* Note that val (or a relevant inner pointer) may be NULL or all-0s to represent None
*/
public void set_lowest_inbound_channel_fees(@Nullable RoutingFees val) {
- bindings.NodeInfo_set_lowest_inbound_channel_fees(this.ptr, val == null ? 0 : val.ptr & ~1);
- this.ptrs_to.add(val);
+ bindings.NodeInfo_set_lowest_inbound_channel_fees(this.ptr, val == null ? 0 : val.ptr);
+ Reference.reachabilityFence(this);
+ Reference.reachabilityFence(val);
+ if (this != null) { this.ptrs_to.add(val); };
}
/**
@Nullable
public NodeAnnouncementInfo get_announcement_info() {
long ret = bindings.NodeInfo_get_announcement_info(this.ptr);
- if (ret < 1024) { return null; }
- NodeAnnouncementInfo ret_hu_conv = new NodeAnnouncementInfo(null, ret);
- ret_hu_conv.ptrs_to.add(this);
+ Reference.reachabilityFence(this);
+ if (ret >= 0 && ret <= 4096) { return null; }
+ org.ldk.structs.NodeAnnouncementInfo ret_hu_conv = null; if (ret < 0 || ret > 4096) { ret_hu_conv = new org.ldk.structs.NodeAnnouncementInfo(null, ret); }
+ if (ret_hu_conv != null) { ret_hu_conv.ptrs_to.add(this); };
return ret_hu_conv;
}
* Note that val (or a relevant inner pointer) may be NULL or all-0s to represent None
*/
public void set_announcement_info(@Nullable NodeAnnouncementInfo val) {
- bindings.NodeInfo_set_announcement_info(this.ptr, val == null ? 0 : val.ptr & ~1);
- this.ptrs_to.add(val);
+ bindings.NodeInfo_set_announcement_info(this.ptr, val == null ? 0 : val.ptr);
+ Reference.reachabilityFence(this);
+ Reference.reachabilityFence(val);
+ if (this != null) { this.ptrs_to.add(val); };
}
/**
* Constructs a new NodeInfo given each field
*/
public static NodeInfo of(long[] channels_arg, RoutingFees lowest_inbound_channel_fees_arg, NodeAnnouncementInfo announcement_info_arg) {
- long ret = bindings.NodeInfo_new(channels_arg, lowest_inbound_channel_fees_arg == null ? 0 : lowest_inbound_channel_fees_arg.ptr & ~1, announcement_info_arg == null ? 0 : announcement_info_arg.ptr & ~1);
- if (ret < 1024) { return null; }
- NodeInfo ret_hu_conv = new NodeInfo(null, ret);
- ret_hu_conv.ptrs_to.add(ret_hu_conv);
- ret_hu_conv.ptrs_to.add(lowest_inbound_channel_fees_arg);
- ret_hu_conv.ptrs_to.add(announcement_info_arg);
+ long ret = bindings.NodeInfo_new(channels_arg, lowest_inbound_channel_fees_arg == null ? 0 : lowest_inbound_channel_fees_arg.ptr, announcement_info_arg == null ? 0 : announcement_info_arg.ptr);
+ Reference.reachabilityFence(channels_arg);
+ Reference.reachabilityFence(lowest_inbound_channel_fees_arg);
+ Reference.reachabilityFence(announcement_info_arg);
+ if (ret >= 0 && ret <= 4096) { return null; }
+ org.ldk.structs.NodeInfo ret_hu_conv = null; if (ret < 0 || ret > 4096) { ret_hu_conv = new org.ldk.structs.NodeInfo(null, ret); }
+ if (ret_hu_conv != null) { ret_hu_conv.ptrs_to.add(ret_hu_conv); };
+ if (ret_hu_conv != null) { ret_hu_conv.ptrs_to.add(lowest_inbound_channel_fees_arg); };
+ if (ret_hu_conv != null) { ret_hu_conv.ptrs_to.add(announcement_info_arg); };
return ret_hu_conv;
}
+ long clone_ptr() {
+ long ret = bindings.NodeInfo_clone_ptr(this.ptr);
+ Reference.reachabilityFence(this);
+ return ret;
+ }
+
/**
* Creates a copy of the NodeInfo
*/
public NodeInfo clone() {
long ret = bindings.NodeInfo_clone(this.ptr);
- if (ret < 1024) { return null; }
- NodeInfo ret_hu_conv = new NodeInfo(null, ret);
- ret_hu_conv.ptrs_to.add(this);
+ Reference.reachabilityFence(this);
+ if (ret >= 0 && ret <= 4096) { return null; }
+ org.ldk.structs.NodeInfo ret_hu_conv = null; if (ret < 0 || ret > 4096) { ret_hu_conv = new org.ldk.structs.NodeInfo(null, ret); }
+ if (ret_hu_conv != null) { ret_hu_conv.ptrs_to.add(this); };
return ret_hu_conv;
}
+ /**
+ * Checks if two NodeInfos contain equal inner contents.
+ * This ignores pointers and is_owned flags and looks at the values in fields.
+ * Two objects with NULL inner values will be considered "equal" here.
+ */
+ public boolean eq(NodeInfo b) {
+ boolean ret = bindings.NodeInfo_eq(this.ptr, b == null ? 0 : b.ptr);
+ Reference.reachabilityFence(this);
+ Reference.reachabilityFence(b);
+ if (this != null) { this.ptrs_to.add(b); };
+ return ret;
+ }
+
+ @Override public boolean equals(Object o) {
+ if (!(o instanceof NodeInfo)) return false;
+ return this.eq((NodeInfo)o);
+ }
/**
* Serialize the NodeInfo object into a byte array which can be read by NodeInfo_read
*/
public byte[] write() {
byte[] ret = bindings.NodeInfo_write(this.ptr);
+ Reference.reachabilityFence(this);
return ret;
}
*/
public static Result_NodeInfoDecodeErrorZ read(byte[] ser) {
long ret = bindings.NodeInfo_read(ser);
- if (ret < 1024) { return null; }
+ Reference.reachabilityFence(ser);
+ if (ret >= 0 && ret <= 4096) { return null; }
Result_NodeInfoDecodeErrorZ ret_hu_conv = Result_NodeInfoDecodeErrorZ.constr_from_ptr(ret);
return ret_hu_conv;
}
projects / ldk-java / blobdiff