1 package org.ldk.structs;
3 import org.ldk.impl.bindings;
4 import org.ldk.enums.*;
6 import java.util.Arrays;
7 import java.lang.ref.Reference;
8 import javax.annotation.Nullable;
12 * Information received in the latest node_announcement from this node.
14 @SuppressWarnings("unchecked") // We correctly assign various generic arrays
15 public class NodeAnnouncementInfo extends CommonBase {
16 NodeAnnouncementInfo(Object _dummy, long ptr) { super(ptr); }
17 @Override @SuppressWarnings("deprecation")
18 protected void finalize() throws Throwable {
20 if (ptr != 0) { bindings.NodeAnnouncementInfo_free(ptr); }
24 * Protocol features the node announced support for
26 public NodeFeatures get_features() {
27 long ret = bindings.NodeAnnouncementInfo_get_features(this.ptr);
28 Reference.reachabilityFence(this);
29 if (ret >= 0 && ret <= 4096) { return null; }
30 org.ldk.structs.NodeFeatures ret_hu_conv = null; if (ret < 0 || ret > 4096) { ret_hu_conv = new org.ldk.structs.NodeFeatures(null, ret); }
31 if (ret_hu_conv != null) { ret_hu_conv.ptrs_to.add(this); };
36 * Protocol features the node announced support for
38 public void set_features(org.ldk.structs.NodeFeatures val) {
39 bindings.NodeAnnouncementInfo_set_features(this.ptr, val == null ? 0 : val.ptr);
40 Reference.reachabilityFence(this);
41 Reference.reachabilityFence(val);
42 if (this != null) { this.ptrs_to.add(val); };
46 * When the last known update to the node state was issued.
47 * Value is opaque, as set in the announcement.
49 public int get_last_update() {
50 int ret = bindings.NodeAnnouncementInfo_get_last_update(this.ptr);
51 Reference.reachabilityFence(this);
56 * When the last known update to the node state was issued.
57 * Value is opaque, as set in the announcement.
59 public void set_last_update(int val) {
60 bindings.NodeAnnouncementInfo_set_last_update(this.ptr, val);
61 Reference.reachabilityFence(this);
62 Reference.reachabilityFence(val);
66 * Color assigned to the node
68 public byte[] get_rgb() {
69 byte[] ret = bindings.NodeAnnouncementInfo_get_rgb(this.ptr);
70 Reference.reachabilityFence(this);
75 * Color assigned to the node
77 public void set_rgb(byte[] val) {
78 bindings.NodeAnnouncementInfo_set_rgb(this.ptr, InternalUtils.check_arr_len(val, 3));
79 Reference.reachabilityFence(this);
80 Reference.reachabilityFence(val);
84 * Moniker assigned to the node.
85 * May be invalid or malicious (eg control chars),
86 * should not be exposed to the user.
88 public NodeAlias get_alias() {
89 long ret = bindings.NodeAnnouncementInfo_get_alias(this.ptr);
90 Reference.reachabilityFence(this);
91 if (ret >= 0 && ret <= 4096) { return null; }
92 org.ldk.structs.NodeAlias ret_hu_conv = null; if (ret < 0 || ret > 4096) { ret_hu_conv = new org.ldk.structs.NodeAlias(null, ret); }
93 if (ret_hu_conv != null) { ret_hu_conv.ptrs_to.add(this); };
98 * Moniker assigned to the node.
99 * May be invalid or malicious (eg control chars),
100 * should not be exposed to the user.
102 public void set_alias(org.ldk.structs.NodeAlias val) {
103 bindings.NodeAnnouncementInfo_set_alias(this.ptr, val == null ? 0 : val.ptr);
104 Reference.reachabilityFence(this);
105 Reference.reachabilityFence(val);
106 if (this != null) { this.ptrs_to.add(val); };
110 * Internet-level addresses via which one can connect to the node
112 * Returns a copy of the field.
114 public NetAddress[] get_addresses() {
115 long[] ret = bindings.NodeAnnouncementInfo_get_addresses(this.ptr);
116 Reference.reachabilityFence(this);
117 int ret_conv_12_len = ret.length;
118 NetAddress[] ret_conv_12_arr = new NetAddress[ret_conv_12_len];
119 for (int m = 0; m < ret_conv_12_len; m++) {
120 long ret_conv_12 = ret[m];
121 org.ldk.structs.NetAddress ret_conv_12_hu_conv = org.ldk.structs.NetAddress.constr_from_ptr(ret_conv_12);
122 if (ret_conv_12_hu_conv != null) { ret_conv_12_hu_conv.ptrs_to.add(this); };
123 ret_conv_12_arr[m] = ret_conv_12_hu_conv;
125 return ret_conv_12_arr;
129 * Internet-level addresses via which one can connect to the node
131 public void set_addresses(NetAddress[] val) {
132 bindings.NodeAnnouncementInfo_set_addresses(this.ptr, val != null ? Arrays.stream(val).mapToLong(val_conv_12 -> val_conv_12.ptr).toArray() : null);
133 Reference.reachabilityFence(this);
134 Reference.reachabilityFence(val);
138 * An initial announcement of the node
139 * Mostly redundant with the data we store in fields explicitly.
140 * Everything else is useful only for sending out for initial routing sync.
141 * Not stored if contains excess data to prevent DoS.
143 * Note that the return value (or a relevant inner pointer) may be NULL or all-0s to represent None
146 public NodeAnnouncement get_announcement_message() {
147 long ret = bindings.NodeAnnouncementInfo_get_announcement_message(this.ptr);
148 Reference.reachabilityFence(this);
149 if (ret >= 0 && ret <= 4096) { return null; }
150 org.ldk.structs.NodeAnnouncement ret_hu_conv = null; if (ret < 0 || ret > 4096) { ret_hu_conv = new org.ldk.structs.NodeAnnouncement(null, ret); }
151 if (ret_hu_conv != null) { ret_hu_conv.ptrs_to.add(this); };
156 * An initial announcement of the node
157 * Mostly redundant with the data we store in fields explicitly.
158 * Everything else is useful only for sending out for initial routing sync.
159 * Not stored if contains excess data to prevent DoS.
161 * Note that val (or a relevant inner pointer) may be NULL or all-0s to represent None
163 public void set_announcement_message(@Nullable org.ldk.structs.NodeAnnouncement val) {
164 bindings.NodeAnnouncementInfo_set_announcement_message(this.ptr, val == null ? 0 : val.ptr);
165 Reference.reachabilityFence(this);
166 Reference.reachabilityFence(val);
167 if (this != null) { this.ptrs_to.add(val); };
171 * Constructs a new NodeAnnouncementInfo given each field
173 public static NodeAnnouncementInfo of(org.ldk.structs.NodeFeatures features_arg, int last_update_arg, byte[] rgb_arg, org.ldk.structs.NodeAlias alias_arg, NetAddress[] addresses_arg, org.ldk.structs.NodeAnnouncement announcement_message_arg) {
174 long ret = bindings.NodeAnnouncementInfo_new(features_arg == null ? 0 : features_arg.ptr, last_update_arg, InternalUtils.check_arr_len(rgb_arg, 3), alias_arg == null ? 0 : alias_arg.ptr, addresses_arg != null ? Arrays.stream(addresses_arg).mapToLong(addresses_arg_conv_12 -> addresses_arg_conv_12.ptr).toArray() : null, announcement_message_arg == null ? 0 : announcement_message_arg.ptr);
175 Reference.reachabilityFence(features_arg);
176 Reference.reachabilityFence(last_update_arg);
177 Reference.reachabilityFence(rgb_arg);
178 Reference.reachabilityFence(alias_arg);
179 Reference.reachabilityFence(addresses_arg);
180 Reference.reachabilityFence(announcement_message_arg);
181 if (ret >= 0 && ret <= 4096) { return null; }
182 org.ldk.structs.NodeAnnouncementInfo ret_hu_conv = null; if (ret < 0 || ret > 4096) { ret_hu_conv = new org.ldk.structs.NodeAnnouncementInfo(null, ret); }
183 if (ret_hu_conv != null) { ret_hu_conv.ptrs_to.add(ret_hu_conv); };
184 if (ret_hu_conv != null) { ret_hu_conv.ptrs_to.add(features_arg); };
185 if (ret_hu_conv != null) { ret_hu_conv.ptrs_to.add(alias_arg); };
186 if (ret_hu_conv != null) { ret_hu_conv.ptrs_to.add(announcement_message_arg); };
191 long ret = bindings.NodeAnnouncementInfo_clone_ptr(this.ptr);
192 Reference.reachabilityFence(this);
197 * Creates a copy of the NodeAnnouncementInfo
199 public NodeAnnouncementInfo clone() {
200 long ret = bindings.NodeAnnouncementInfo_clone(this.ptr);
201 Reference.reachabilityFence(this);
202 if (ret >= 0 && ret <= 4096) { return null; }
203 org.ldk.structs.NodeAnnouncementInfo ret_hu_conv = null; if (ret < 0 || ret > 4096) { ret_hu_conv = new org.ldk.structs.NodeAnnouncementInfo(null, ret); }
204 if (ret_hu_conv != null) { ret_hu_conv.ptrs_to.add(this); };
209 * Checks if two NodeAnnouncementInfos contain equal inner contents.
210 * This ignores pointers and is_owned flags and looks at the values in fields.
211 * Two objects with NULL inner values will be considered "equal" here.
213 public boolean eq(org.ldk.structs.NodeAnnouncementInfo b) {
214 boolean ret = bindings.NodeAnnouncementInfo_eq(this.ptr, b == null ? 0 : b.ptr);
215 Reference.reachabilityFence(this);
216 Reference.reachabilityFence(b);
217 if (this != null) { this.ptrs_to.add(b); };
221 @Override public boolean equals(Object o) {
222 if (!(o instanceof NodeAnnouncementInfo)) return false;
223 return this.eq((NodeAnnouncementInfo)o);
226 * Serialize the NodeAnnouncementInfo object into a byte array which can be read by NodeAnnouncementInfo_read
228 public byte[] write() {
229 byte[] ret = bindings.NodeAnnouncementInfo_write(this.ptr);
230 Reference.reachabilityFence(this);
235 * Read a NodeAnnouncementInfo from a byte array, created by NodeAnnouncementInfo_write
237 public static Result_NodeAnnouncementInfoDecodeErrorZ read(byte[] ser) {
238 long ret = bindings.NodeAnnouncementInfo_read(ser);
239 Reference.reachabilityFence(ser);
240 if (ret >= 0 && ret <= 4096) { return null; }
241 Result_NodeAnnouncementInfoDecodeErrorZ ret_hu_conv = Result_NodeAnnouncementInfoDecodeErrorZ.constr_from_ptr(ret);