X-Git-Url: http://git.bitcoin.ninja/index.cgi?a=blobdiff_plain;f=src%2Fmain%2Fjava%2Forg%2Fldk%2Fstructs%2FNodeInfo.java;h=68a027a458eb0cb9122374d2b32cc9f6dbb1f5a2;hb=b6cc0960eaee5a5bbc7fde79a56152d6dcd649d8;hp=e76ff9e760e5223a9ad435dc6ed7542d9f0a2284;hpb=2ed9081562d00a8645604b07629e963231d49e0f;p=ldk-java

diff --git a/src/main/java/org/ldk/structs/NodeInfo.java b/src/main/java/org/ldk/structs/NodeInfo.java
index e76ff9e7..68a027a4 100644
--- a/src/main/java/org/ldk/structs/NodeInfo.java
+++ b/src/main/java/org/ldk/structs/NodeInfo.java
@@ -2,43 +2,110 @@ package org.ldk.structs;
 
 import org.ldk.impl.bindings;
 import org.ldk.enums.*;
+import org.ldk.util.*;
+import java.util.Arrays;
 
+
+/**
+ * Details about a node in the network, known from the network announcement.
+ */
+@SuppressWarnings("unchecked") // We correctly assign various generic arrays
 public class NodeInfo extends CommonBase {
 	NodeInfo(Object _dummy, long ptr) { super(ptr); }
 	@Override @SuppressWarnings("deprecation")
 	protected void finalize() throws Throwable {
-		bindings.NodeInfo_free(ptr); super.finalize();
+		super.finalize();
+		if (ptr != 0) { bindings.NodeInfo_free(ptr); }
 	}
 
-	// Skipped NodeInfo_set_channels
-	public RoutingFees get_lowest_inbound_channel_fees(NodeInfo this_ptr) {
-		RoutingFees ret = new RoutingFees(null, bindings.NodeInfo_get_lowest_inbound_channel_fees(this_ptr == null ? 0 : this_ptr.ptr & ~1));
-		this.ptrs_to.add(this_ptr);
-		return ret;
+	/**
+	 * All valid channels a node has announced
+	 */
+	public void set_channels(long[] val) {
+		bindings.NodeInfo_set_channels(this.ptr, 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.
+	 */
+	public RoutingFees get_lowest_inbound_channel_fees() {
+		long ret = bindings.NodeInfo_get_lowest_inbound_channel_fees(this.ptr);
+		RoutingFees ret_hu_conv = new RoutingFees(null, ret);
+		ret_hu_conv.ptrs_to.add(this);
+		return ret_hu_conv;
 	}
 
-	public void set_lowest_inbound_channel_fees(NodeInfo this_ptr, RoutingFees val) {
-		bindings.NodeInfo_set_lowest_inbound_channel_fees(this_ptr == null ? 0 : this_ptr.ptr & ~1, val == null ? 0 : val.ptr & ~1);
-		this.ptrs_to.add(this_ptr);
+	/**
+	 * 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.
+	 */
+	public void set_lowest_inbound_channel_fees(RoutingFees val) {
+		bindings.NodeInfo_set_lowest_inbound_channel_fees(this.ptr, val == null ? 0 : val.ptr & ~1);
 		this.ptrs_to.add(val);
 	}
 
-	public NodeAnnouncementInfo get_announcement_info(NodeInfo this_ptr) {
-		NodeAnnouncementInfo ret = new NodeAnnouncementInfo(null, bindings.NodeInfo_get_announcement_info(this_ptr == null ? 0 : this_ptr.ptr & ~1));
-		this.ptrs_to.add(this_ptr);
-		return ret;
+	/**
+	 * More information about a node from node_announcement.
+	 * Optional because we store a Node entry after learning about it from
+	 * a channel announcement, but before receiving a node announcement.
+	 */
+	public NodeAnnouncementInfo get_announcement_info() {
+		long ret = bindings.NodeInfo_get_announcement_info(this.ptr);
+		NodeAnnouncementInfo ret_hu_conv = new NodeAnnouncementInfo(null, ret);
+		ret_hu_conv.ptrs_to.add(this);
+		return ret_hu_conv;
 	}
 
-	public void set_announcement_info(NodeInfo this_ptr, NodeAnnouncementInfo val) {
-		bindings.NodeInfo_set_announcement_info(this_ptr == null ? 0 : this_ptr.ptr & ~1, val == null ? 0 : val.ptr & ~1);
-		this.ptrs_to.add(this_ptr);
+	/**
+	 * More information about a node from node_announcement.
+	 * Optional because we store a Node entry after learning about it from
+	 * a channel announcement, but before receiving a node announcement.
+	 */
+	public void set_announcement_info(NodeAnnouncementInfo val) {
+		bindings.NodeInfo_set_announcement_info(this.ptr, val == null ? 0 : val.ptr & ~1);
 		this.ptrs_to.add(val);
 	}
 
-	// Skipped NodeInfo_new
-	// Skipped NodeInfo_write
-	public NodeInfo(byte[] ser) {
-		super(bindings.NodeInfo_read(ser));
+	/**
+	 * 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);
+		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);
+		return ret_hu_conv;
+	}
+
+	/**
+	 * Creates a copy of the NodeInfo
+	 */
+	public NodeInfo clone() {
+		long ret = bindings.NodeInfo_clone(this.ptr);
+		NodeInfo ret_hu_conv = new NodeInfo(null, ret);
+		ret_hu_conv.ptrs_to.add(this);
+		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);
+		return ret;
+	}
+
+	/**
+	 * Read a NodeInfo from a byte array, created by NodeInfo_write
+	 */
+	public static Result_NodeInfoDecodeErrorZ read(byte[] ser) {
+		long ret = bindings.NodeInfo_read(ser);
+		Result_NodeInfoDecodeErrorZ ret_hu_conv = Result_NodeInfoDecodeErrorZ.constr_from_ptr(ret);
+		return ret_hu_conv;
 	}
 
 }