_ Git - ldk-java/blob - src/main/java/org/ldk/structs/NodeInfo.java

   1 package org.ldk.structs;
   2
   3 import org.ldk.impl.bindings;
   4 import org.ldk.enums.*;
   5 import org.ldk.util.*;
   6 import java.util.Arrays;
   7 import java.lang.ref.Reference;
   8 import javax.annotation.Nullable;
   9
  10
  11 /**
  12  * Details about a node in the network, known from the network announcement.
  13  */
  14 @SuppressWarnings("unchecked") // We correctly assign various generic arrays
  15 public class NodeInfo extends CommonBase {
  16         NodeInfo(Object _dummy, long ptr) { super(ptr); }
  17         @Override @SuppressWarnings("deprecation")
  18         protected void finalize() throws Throwable {
  19                 super.finalize();
  20                 if (ptr != 0) { bindings.NodeInfo_free(ptr); }
  21         }
  22
  23         /**
  24          * All valid channels a node has announced
  25          *
  26          * Returns a copy of the field.
  27          */
  28         public long[] get_channels() {
  29                 long[] ret = bindings.NodeInfo_get_channels(this.ptr);
  30                 Reference.reachabilityFence(this);
  31                 return ret;
  32         }
  33
  34         /**
  35          * All valid channels a node has announced
  36          */
  37         public void set_channels(long[] val) {
  38                 bindings.NodeInfo_set_channels(this.ptr, val);
  39                 Reference.reachabilityFence(this);
  40                 Reference.reachabilityFence(val);
  41         }
  42
  43         /**
  44          * Lowest fees enabling routing via any of the enabled, known channels to a node.
  45          * The two fields (flat and proportional fee) are independent,
  46          * meaning they don't have to refer to the same channel.
  47          *
  48          * Note that the return value (or a relevant inner pointer) may be NULL or all-0s to represent None
  49          */
  50         @Nullable
  51         public RoutingFees get_lowest_inbound_channel_fees() {
  52                 long ret = bindings.NodeInfo_get_lowest_inbound_channel_fees(this.ptr);
  53                 Reference.reachabilityFence(this);
  54                 if (ret >= 0 && ret <= 4096) { return null; }
  55                 org.ldk.structs.RoutingFees ret_hu_conv = null; if (ret < 0 || ret > 4096) { ret_hu_conv = new org.ldk.structs.RoutingFees(null, ret); }
  56                 ret_hu_conv.ptrs_to.add(this);
  57                 return ret_hu_conv;
  58         }
  59
  60         /**
  61          * Lowest fees enabling routing via any of the enabled, known channels to a node.
  62          * The two fields (flat and proportional fee) are independent,
  63          * meaning they don't have to refer to the same channel.
  64          *
  65          * Note that val (or a relevant inner pointer) may be NULL or all-0s to represent None
  66          */
  67         public void set_lowest_inbound_channel_fees(@Nullable RoutingFees val) {
  68                 bindings.NodeInfo_set_lowest_inbound_channel_fees(this.ptr, val == null ? 0 : val.ptr & ~1);
  69                 Reference.reachabilityFence(this);
  70                 Reference.reachabilityFence(val);
  71         }
  72
  73         /**
  74          * More information about a node from node_announcement.
  75          * Optional because we store a Node entry after learning about it from
  76          * a channel announcement, but before receiving a node announcement.
  77          *
  78          * Note that the return value (or a relevant inner pointer) may be NULL or all-0s to represent None
  79          */
  80         @Nullable
  81         public NodeAnnouncementInfo get_announcement_info() {
  82                 long ret = bindings.NodeInfo_get_announcement_info(this.ptr);
  83                 Reference.reachabilityFence(this);
  84                 if (ret >= 0 && ret <= 4096) { return null; }
  85                 org.ldk.structs.NodeAnnouncementInfo ret_hu_conv = null; if (ret < 0 || ret > 4096) { ret_hu_conv = new org.ldk.structs.NodeAnnouncementInfo(null, ret); }
  86                 ret_hu_conv.ptrs_to.add(this);
  87                 return ret_hu_conv;
  88         }
  89
  90         /**
  91          * More information about a node from node_announcement.
  92          * Optional because we store a Node entry after learning about it from
  93          * a channel announcement, but before receiving a node announcement.
  94          *
  95          * Note that val (or a relevant inner pointer) may be NULL or all-0s to represent None
  96          */
  97         public void set_announcement_info(@Nullable NodeAnnouncementInfo val) {
  98                 bindings.NodeInfo_set_announcement_info(this.ptr, val == null ? 0 : val.ptr & ~1);
  99                 Reference.reachabilityFence(this);
 100                 Reference.reachabilityFence(val);
 101         }
 102
 103         /**
 104          * Constructs a new NodeInfo given each field
 105          */
 106         public static NodeInfo of(long[] channels_arg, RoutingFees lowest_inbound_channel_fees_arg, NodeAnnouncementInfo announcement_info_arg) {
 107                 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);
 108                 Reference.reachabilityFence(channels_arg);
 109                 Reference.reachabilityFence(lowest_inbound_channel_fees_arg);
 110                 Reference.reachabilityFence(announcement_info_arg);
 111                 if (ret >= 0 && ret <= 4096) { return null; }
 112                 org.ldk.structs.NodeInfo ret_hu_conv = null; if (ret < 0 || ret > 4096) { ret_hu_conv = new org.ldk.structs.NodeInfo(null, ret); }
 113                 ret_hu_conv.ptrs_to.add(ret_hu_conv);
 114                 return ret_hu_conv;
 115         }
 116
 117         long clone_ptr() {
 118                 long ret = bindings.NodeInfo_clone_ptr(this.ptr);
 119                 Reference.reachabilityFence(this);
 120                 return ret;
 121         }
 122
 123         /**
 124          * Creates a copy of the NodeInfo
 125          */
 126         public NodeInfo clone() {
 127                 long ret = bindings.NodeInfo_clone(this.ptr);
 128                 Reference.reachabilityFence(this);
 129                 if (ret >= 0 && ret <= 4096) { return null; }
 130                 org.ldk.structs.NodeInfo ret_hu_conv = null; if (ret < 0 || ret > 4096) { ret_hu_conv = new org.ldk.structs.NodeInfo(null, ret); }
 131                 ret_hu_conv.ptrs_to.add(this);
 132                 return ret_hu_conv;
 133         }
 134
 135         /**
 136          * Serialize the NodeInfo object into a byte array which can be read by NodeInfo_read
 137          */
 138         public byte[] write() {
 139                 byte[] ret = bindings.NodeInfo_write(this.ptr);
 140                 Reference.reachabilityFence(this);
 141                 return ret;
 142         }
 143
 144         /**
 145          * Read a NodeInfo from a byte array, created by NodeInfo_write
 146          */
 147         public static Result_NodeInfoDecodeErrorZ read(byte[] ser) {
 148                 long ret = bindings.NodeInfo_read(ser);
 149                 Reference.reachabilityFence(ser);
 150                 if (ret >= 0 && ret <= 4096) { return null; }
 151                 Result_NodeInfoDecodeErrorZ ret_hu_conv = Result_NodeInfoDecodeErrorZ.constr_from_ptr(ret);
 152                 return ret_hu_conv;
 153         }
 154
 155 }