[C#] Update auto-generated files

[ldk-java] / c_sharp / src / org / ldk / structs / NodeInfo.cs

diff --git a/c_sharp/src/org/ldk/structs/NodeInfo.cs b/c_sharp/src/org/ldk/structs/NodeInfo.cs
index 87c8d14b4f8a13822f6bb07510900cfb66a700b8..542ba8c14bdef0eefc57ff061a961bd7dca5c32b 100644 (file)
--- a/c_sharp/src/org/ldk/structs/NodeInfo.cs
+++ b/c_sharp/src/org/ldk/structs/NodeInfo.cs
@@ -35,36 +35,6 @@ public class NodeInfo : CommonBase {
                GC.KeepAlive(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
-        */
-       public RoutingFees get_lowest_inbound_channel_fees() {
-               long ret = bindings.NodeInfo_get_lowest_inbound_channel_fees(this.ptr);
-               GC.KeepAlive(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.AddLast(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(org.ldk.structs.RoutingFees val) {
-               bindings.NodeInfo_set_lowest_inbound_channel_fees(this.ptr, val == null ? 0 : val.ptr);
-               GC.KeepAlive(this);
-               GC.KeepAlive(val);
-               if (this != null) { this.ptrs_to.AddLast(val); };
-       }
-
        /**
         * More information about a node from node_announcement.
         * Optional because we store a Node entry after learning about it from
@@ -98,15 +68,13 @@ public class NodeInfo : CommonBase {
        /**
         * Constructs a new NodeInfo given each field
         */
-       public static NodeInfo of(long[] channels_arg, org.ldk.structs.RoutingFees lowest_inbound_channel_fees_arg, org.ldk.structs.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);
                GC.KeepAlive(channels_arg);
-               GC.KeepAlive(lowest_inbound_channel_fees_arg);
                GC.KeepAlive(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.AddLast(ret_hu_conv); };
-               if (ret_hu_conv != null) { ret_hu_conv.ptrs_to.AddLast(lowest_inbound_channel_fees_arg); };
                if (ret_hu_conv != null) { ret_hu_conv.ptrs_to.AddLast(announcement_info_arg); };
                return ret_hu_conv;
        }