_ Git - ldk-java/blob - ts/structs/NodeInfo.ts

   1
   2 import CommonBase from './CommonBase';
   3 import * as bindings from '../bindings' // TODO: figure out location
   4
   5 public class NodeInfo extends CommonBase {
   6         NodeInfo(Object _dummy, long ptr) { super(ptr); }
   7         @Override @SuppressWarnings("deprecation")
   8         protected void finalize() throws Throwable {
   9                 super.finalize();
  10                 if (ptr != 0) { bindings.NodeInfo_free(ptr); }
  11         }
  12
  13         public void set_channels(long[] val) {
  14                 bindings.NodeInfo_set_channels(this.ptr, val);
  15         }
  16
  17         public RoutingFees get_lowest_inbound_channel_fees() {
  18                 uint32_t ret = bindings.NodeInfo_get_lowest_inbound_channel_fees(this.ptr);
  19                 RoutingFees ret_hu_conv = new RoutingFees(null, ret);
  20                 return ret_hu_conv;
  21         }
  22
  23         public void set_lowest_inbound_channel_fees(RoutingFees val) {
  24                 bindings.NodeInfo_set_lowest_inbound_channel_fees(this.ptr, val == null ? 0 : val.ptr & ~1);
  25                 this.ptrs_to.add(val);
  26         }
  27
  28         public NodeAnnouncementInfo get_announcement_info() {
  29                 uint32_t ret = bindings.NodeInfo_get_announcement_info(this.ptr);
  30                 NodeAnnouncementInfo ret_hu_conv = new NodeAnnouncementInfo(null, ret);
  31                 return ret_hu_conv;
  32         }
  33
  34         public void set_announcement_info(NodeFeatures val_features_arg, int val_last_update_arg, byte[] val_rgb_arg, byte[] val_alias_arg, NetAddress[] val_addresses_arg, NodeAnnouncement val_announcement_message_arg) {
  35                 bindings.NodeInfo_set_announcement_info(this.ptr, bindings.NodeAnnouncementInfo_new(val_features_arg == null ? 0 : val_features_arg.ptr & ~1, val_last_update_arg, val_rgb_arg, val_alias_arg, (uint32_t[])Arrays.stream(val_addresses_arg).map(arr_conv_12 -> arr_conv_12.ptr).toArray(), val_announcement_message_arg == null ? 0 : val_announcement_message_arg.ptr & ~1));
  36         }
  37
  38         public static NodeInfo constructor_new(long[] channels_arg, RoutingFees lowest_inbound_channel_fees_arg, NodeFeatures announcement_info_arg_features_arg, int announcement_info_arg_last_update_arg, byte[] announcement_info_arg_rgb_arg, byte[] announcement_info_arg_alias_arg, NetAddress[] announcement_info_arg_addresses_arg, NodeAnnouncement announcement_info_arg_announcement_message_arg) {
  39                 uint32_t ret = bindings.NodeInfo_new(channels_arg, lowest_inbound_channel_fees_arg == null ? 0 : lowest_inbound_channel_fees_arg.ptr & ~1, bindings.NodeAnnouncementInfo_new(announcement_info_arg_features_arg == null ? 0 : announcement_info_arg_features_arg.ptr & ~1, announcement_info_arg_last_update_arg, announcement_info_arg_rgb_arg, announcement_info_arg_alias_arg, (uint32_t[])Arrays.stream(announcement_info_arg_addresses_arg).map(arr_conv_12 -> arr_conv_12.ptr).toArray(), announcement_info_arg_announcement_message_arg == null ? 0 : announcement_info_arg_announcement_message_arg.ptr & ~1));
  40                 NodeInfo ret_hu_conv = new NodeInfo(null, ret);
  41                 ret_hu_conv.ptrs_to.add(lowest_inbound_channel_fees_arg);
  42                 ret_hu_conv.ptrs_to.add(announcement_info_arg_features_arg);
  43                 /* TODO 2 NetAddress  */;
  44                 ret_hu_conv.ptrs_to.add(announcement_info_arg_announcement_message_arg);
  45                 return ret_hu_conv;
  46         }
  47
  48         public byte[] write() {
  49                 byte[] ret = bindings.NodeInfo_write(this.ptr);
  50                 return ret;
  51         }
  52
  53         public static Result_NodeInfoDecodeErrorZ constructor_read(byte[] ser) {
  54                 uint32_t ret = bindings.NodeInfo_read(ser);
  55                 Result_NodeInfoDecodeErrorZ ret_hu_conv = Result_NodeInfoDecodeErrorZ.constr_from_ptr(ret);
  56                 return ret_hu_conv;
  57         }
  58
  59 }