* Returns a copy of the field.
*/
public long[] get_channels() {
- long[] ret = bindings.NodeInfo_get_channels(this.ptr);
+ long ret = bindings.NodeInfo_get_channels(this.ptr);
GC.KeepAlive(this);
- return ret;
+ if (ret >= 0 && ret <= 4096) { return null; }
+ long[] ret_conv = InternalUtils.decodeUint64Array(ret);
+ return ret_conv;
}
/**
* All valid channels a node has announced
*/
public void set_channels(long[] val) {
- bindings.NodeInfo_set_channels(this.ptr, val);
- GC.KeepAlive(this);
- GC.KeepAlive(val);
- }
-
- /**
- * Lowest fees enabling routing via any of the enabled, known channels to a node.
- * The two fields (flat and proportional fee) are independent,
- * meaning they don't have to refer to the same channel.
- *
- * Note that the return value (or a relevant inner pointer) may be NULL or all-0s to represent None
- */
- public RoutingFees get_lowest_inbound_channel_fees() {
- long ret = bindings.NodeInfo_get_lowest_inbound_channel_fees(this.ptr);
- GC.KeepAlive(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.AddLast(this); };
- return ret_hu_conv;
- }
-
- /**
- * Lowest fees enabling routing via any of the enabled, known channels to a node.
- * The two fields (flat and proportional fee) are independent,
- * meaning they don't have to refer to the same channel.
- *
- * Note that val (or a relevant inner pointer) may be NULL or all-0s to represent None
- */
- public void set_lowest_inbound_channel_fees(org.ldk.structs.RoutingFees val) {
- bindings.NodeInfo_set_lowest_inbound_channel_fees(this.ptr, val == null ? 0 : val.ptr);
+ bindings.NodeInfo_set_channels(this.ptr, InternalUtils.encodeUint64Array(val));
GC.KeepAlive(this);
GC.KeepAlive(val);
- if (this != null) { this.ptrs_to.AddLast(val); };
}
/**
/**
* Constructs a new NodeInfo given each field
+ *
+ * Note that announcement_info_arg (or a relevant inner pointer) may be NULL or all-0s to represent None
*/
- public static NodeInfo of(long[] channels_arg, org.ldk.structs.RoutingFees lowest_inbound_channel_fees_arg, org.ldk.structs.NodeAnnouncementInfo 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);
+ public static NodeInfo of(long[] channels_arg, org.ldk.structs.NodeAnnouncementInfo announcement_info_arg) {
+ long ret = bindings.NodeInfo_new(InternalUtils.encodeUint64Array(channels_arg), announcement_info_arg == null ? 0 : announcement_info_arg.ptr);
GC.KeepAlive(channels_arg);
- GC.KeepAlive(lowest_inbound_channel_fees_arg);
GC.KeepAlive(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.AddLast(ret_hu_conv); };
- if (ret_hu_conv != null) { ret_hu_conv.ptrs_to.AddLast(lowest_inbound_channel_fees_arg); };
if (ret_hu_conv != null) { ret_hu_conv.ptrs_to.AddLast(announcement_info_arg); };
return ret_hu_conv;
}
* 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);
+ long ret = bindings.NodeInfo_write(this.ptr);
GC.KeepAlive(this);
- return ret;
+ if (ret >= 0 && ret <= 4096) { return null; }
+ byte[] ret_conv = InternalUtils.decodeUint8Array(ret);
+ return ret_conv;
}
/**
* Read a NodeInfo from a byte array, created by NodeInfo_write
*/
public static Result_NodeInfoDecodeErrorZ read(byte[] ser) {
- long ret = bindings.NodeInfo_read(ser);
+ long ret = bindings.NodeInfo_read(InternalUtils.encodeUint8Array(ser));
GC.KeepAlive(ser);
if (ret >= 0 && ret <= 4096) { return null; }
Result_NodeInfoDecodeErrorZ ret_hu_conv = Result_NodeInfoDecodeErrorZ.constr_from_ptr(ret);