X-Git-Url: http://git.bitcoin.ninja/index.cgi?a=blobdiff_plain;f=src%2Fmain%2Fjava%2Forg%2Fldk%2Fstructs%2FNodeInfo.java;h=0b7e93fd760a127328bf3ece7f050033f42bee6a;hb=5cdb34f643d09f21c147c9d0b2f8888609e43429;hp=350d736470dac2abc6157675e89ad18f6680ee38;hpb=3c60e0fd0da579be9932801c1be2b32014c944a5;p=ldk-java

diff --git a/src/main/java/org/ldk/structs/NodeInfo.java b/src/main/java/org/ldk/structs/NodeInfo.java
index 350d7364..0b7e93fd 100644
--- a/src/main/java/org/ldk/structs/NodeInfo.java
+++ b/src/main/java/org/ldk/structs/NodeInfo.java
@@ -40,37 +40,6 @@ public class NodeInfo extends CommonBase {
 		Reference.reachabilityFence(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
-	 */
-	@Nullable
-	public RoutingFees get_lowest_inbound_channel_fees() {
-		long ret = bindings.NodeInfo_get_lowest_inbound_channel_fees(this.ptr);
-		Reference.reachabilityFence(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.add(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(@Nullable RoutingFees val) {
-		bindings.NodeInfo_set_lowest_inbound_channel_fees(this.ptr, val == null ? 0 : val.ptr);
-		Reference.reachabilityFence(this);
-		Reference.reachabilityFence(val);
-		if (this != null) { this.ptrs_to.add(val); };
-	}
-
 	/**
 	 * More information about a node from node_announcement.
 	 * Optional because we store a Node entry after learning about it from
@@ -95,7 +64,7 @@ public class NodeInfo extends CommonBase {
 	 * 
 	 * Note that val (or a relevant inner pointer) may be NULL or all-0s to represent None
 	 */
-	public void set_announcement_info(@Nullable NodeAnnouncementInfo val) {
+	public void set_announcement_info(@Nullable org.ldk.structs.NodeAnnouncementInfo val) {
 		bindings.NodeInfo_set_announcement_info(this.ptr, val == null ? 0 : val.ptr);
 		Reference.reachabilityFence(this);
 		Reference.reachabilityFence(val);
@@ -105,15 +74,13 @@ public class NodeInfo extends CommonBase {
 	/**
 	 * 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, 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(channels_arg, announcement_info_arg == null ? 0 : announcement_info_arg.ptr);
 		Reference.reachabilityFence(channels_arg);
-		Reference.reachabilityFence(lowest_inbound_channel_fees_arg);
 		Reference.reachabilityFence(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.add(ret_hu_conv); };
-		if (ret_hu_conv != null) { ret_hu_conv.ptrs_to.add(lowest_inbound_channel_fees_arg); };
 		if (ret_hu_conv != null) { ret_hu_conv.ptrs_to.add(announcement_info_arg); };
 		return ret_hu_conv;
 	}
@@ -136,6 +103,23 @@ public class NodeInfo extends CommonBase {
 		return ret_hu_conv;
 	}
 
+	/**
+	 * Checks if two NodeInfos contain equal inner contents.
+	 * This ignores pointers and is_owned flags and looks at the values in fields.
+	 * Two objects with NULL inner values will be considered "equal" here.
+	 */
+	public boolean eq(org.ldk.structs.NodeInfo b) {
+		boolean ret = bindings.NodeInfo_eq(this.ptr, b == null ? 0 : b.ptr);
+		Reference.reachabilityFence(this);
+		Reference.reachabilityFence(b);
+		if (this != null) { this.ptrs_to.add(b); };
+		return ret;
+	}
+
+	@Override public boolean equals(Object o) {
+		if (!(o instanceof NodeInfo)) return false;
+		return this.eq((NodeInfo)o);
+	}
 	/**
 	 * Serialize the NodeInfo object into a byte array which can be read by NodeInfo_read
 	 */