X-Git-Url: http://git.bitcoin.ninja/index.cgi?a=blobdiff_plain;f=src%2Fmain%2Fjava%2Forg%2Fldk%2Fstructs%2FScore.java;h=5e7fd85fb379413cbce75803dd543dcdee402c52;hb=5e9de82b3a7712a41189756d9d16d946142b2ac5;hp=f7a0d95e9a229a20cb6c5e0cd5659ad340763c9d;hpb=db55d4ed1b9ee1b2712db1df0f9b0081a70e269b;p=ldk-java

diff --git a/src/main/java/org/ldk/structs/Score.java b/src/main/java/org/ldk/structs/Score.java
index f7a0d95e..5e7fd85f 100644
--- a/src/main/java/org/ldk/structs/Score.java
+++ b/src/main/java/org/ldk/structs/Score.java
@@ -4,6 +4,7 @@ import org.ldk.impl.bindings;
 import org.ldk.enums.*;
 import org.ldk.util.*;
 import java.util.Arrays;
+import java.lang.ref.Reference;
 import javax.annotation.Nullable;
 
 /**
@@ -27,26 +28,177 @@ public class Score extends CommonBase {
 
 	public static interface ScoreInterface {
 		/**
-		 * Returns the fee in msats willing to be paid to avoid routing through the given channel.
+		 * Returns the fee in msats willing to be paid to avoid routing `send_amt_msat` through the
+		 * given channel in the direction from `source` to `target`.
+		 * 
+		 * The channel's capacity (less any other MPP parts that are also being considered for use in
+		 * the same payment) is given by `capacity_msat`. It may be determined from various sources
+		 * such as a chain data, network gossip, or invoice hints. For invoice hints, a capacity near
+		 * [`u64::max_value`] is given to indicate sufficient capacity for the invoice's full amount.
+		 * Thus, implementations should be overflow-safe.
 		 */
-		long channel_penalty_msat(long short_channel_id);
+		long channel_penalty_msat(long short_channel_id, NodeId source, NodeId target, ChannelUsage usage);
+		/**
+		 * Handles updating channel penalties after failing to route through a channel.
+		 */
+		void payment_path_failed(RouteHop[] path, long short_channel_id);
+		/**
+		 * Handles updating channel penalties after successfully routing along a path.
+		 */
+		void payment_path_successful(RouteHop[] path);
+		/**
+		 * Handles updating channel penalties after a probe over the given path failed.
+		 */
+		void probe_failed(RouteHop[] path, long short_channel_id);
+		/**
+		 * Handles updating channel penalties after a probe over the given path succeeded.
+		 */
+		void probe_successful(RouteHop[] path);
+		/**
+		 * Serialize the object into a byte array
+		 */
+		byte[] write();
 	}
 	private static class LDKScoreHolder { Score held; }
 	public static Score new_impl(ScoreInterface arg) {
 		final LDKScoreHolder impl_holder = new LDKScoreHolder();
 		impl_holder.held = new Score(new bindings.LDKScore() {
-			@Override public long channel_penalty_msat(long short_channel_id) {
-				long ret = arg.channel_penalty_msat(short_channel_id);
+			@Override public long channel_penalty_msat(long short_channel_id, long source, long target, long usage) {
+				org.ldk.structs.NodeId source_hu_conv = null; if (source < 0 || source > 4096) { source_hu_conv = new org.ldk.structs.NodeId(null, source); }
+				org.ldk.structs.NodeId target_hu_conv = null; if (target < 0 || target > 4096) { target_hu_conv = new org.ldk.structs.NodeId(null, target); }
+				org.ldk.structs.ChannelUsage usage_hu_conv = null; if (usage < 0 || usage > 4096) { usage_hu_conv = new org.ldk.structs.ChannelUsage(null, usage); }
+				if (usage_hu_conv != null) { usage_hu_conv.ptrs_to.add(this); };
+				long ret = arg.channel_penalty_msat(short_channel_id, source_hu_conv, target_hu_conv, usage_hu_conv);
+				Reference.reachabilityFence(arg);
+				return ret;
+			}
+			@Override public void payment_path_failed(long[] path, long short_channel_id) {
+				int path_conv_10_len = path.length;
+				RouteHop[] path_conv_10_arr = new RouteHop[path_conv_10_len];
+				for (int k = 0; k < path_conv_10_len; k++) {
+					long path_conv_10 = path[k];
+					org.ldk.structs.RouteHop path_conv_10_hu_conv = null; if (path_conv_10 < 0 || path_conv_10 > 4096) { path_conv_10_hu_conv = new org.ldk.structs.RouteHop(null, path_conv_10); }
+					if (path_conv_10_hu_conv != null) { path_conv_10_hu_conv.ptrs_to.add(this); };
+					path_conv_10_arr[k] = path_conv_10_hu_conv;
+				}
+				arg.payment_path_failed(path_conv_10_arr, short_channel_id);
+				Reference.reachabilityFence(arg);
+			}
+			@Override public void payment_path_successful(long[] path) {
+				int path_conv_10_len = path.length;
+				RouteHop[] path_conv_10_arr = new RouteHop[path_conv_10_len];
+				for (int k = 0; k < path_conv_10_len; k++) {
+					long path_conv_10 = path[k];
+					org.ldk.structs.RouteHop path_conv_10_hu_conv = null; if (path_conv_10 < 0 || path_conv_10 > 4096) { path_conv_10_hu_conv = new org.ldk.structs.RouteHop(null, path_conv_10); }
+					if (path_conv_10_hu_conv != null) { path_conv_10_hu_conv.ptrs_to.add(this); };
+					path_conv_10_arr[k] = path_conv_10_hu_conv;
+				}
+				arg.payment_path_successful(path_conv_10_arr);
+				Reference.reachabilityFence(arg);
+			}
+			@Override public void probe_failed(long[] path, long short_channel_id) {
+				int path_conv_10_len = path.length;
+				RouteHop[] path_conv_10_arr = new RouteHop[path_conv_10_len];
+				for (int k = 0; k < path_conv_10_len; k++) {
+					long path_conv_10 = path[k];
+					org.ldk.structs.RouteHop path_conv_10_hu_conv = null; if (path_conv_10 < 0 || path_conv_10 > 4096) { path_conv_10_hu_conv = new org.ldk.structs.RouteHop(null, path_conv_10); }
+					if (path_conv_10_hu_conv != null) { path_conv_10_hu_conv.ptrs_to.add(this); };
+					path_conv_10_arr[k] = path_conv_10_hu_conv;
+				}
+				arg.probe_failed(path_conv_10_arr, short_channel_id);
+				Reference.reachabilityFence(arg);
+			}
+			@Override public void probe_successful(long[] path) {
+				int path_conv_10_len = path.length;
+				RouteHop[] path_conv_10_arr = new RouteHop[path_conv_10_len];
+				for (int k = 0; k < path_conv_10_len; k++) {
+					long path_conv_10 = path[k];
+					org.ldk.structs.RouteHop path_conv_10_hu_conv = null; if (path_conv_10 < 0 || path_conv_10 > 4096) { path_conv_10_hu_conv = new org.ldk.structs.RouteHop(null, path_conv_10); }
+					if (path_conv_10_hu_conv != null) { path_conv_10_hu_conv.ptrs_to.add(this); };
+					path_conv_10_arr[k] = path_conv_10_hu_conv;
+				}
+				arg.probe_successful(path_conv_10_arr);
+				Reference.reachabilityFence(arg);
+			}
+			@Override public byte[] write() {
+				byte[] ret = arg.write();
+				Reference.reachabilityFence(arg);
 				return ret;
 			}
 		});
 		return impl_holder.held;
 	}
 	/**
-	 * Returns the fee in msats willing to be paid to avoid routing through the given channel.
+	 * Returns the fee in msats willing to be paid to avoid routing `send_amt_msat` through the
+	 * given channel in the direction from `source` to `target`.
+	 * 
+	 * The channel's capacity (less any other MPP parts that are also being considered for use in
+	 * the same payment) is given by `capacity_msat`. It may be determined from various sources
+	 * such as a chain data, network gossip, or invoice hints. For invoice hints, a capacity near
+	 * [`u64::max_value`] is given to indicate sufficient capacity for the invoice's full amount.
+	 * Thus, implementations should be overflow-safe.
+	 */
+	public long channel_penalty_msat(long short_channel_id, NodeId source, NodeId target, ChannelUsage usage) {
+		long ret = bindings.Score_channel_penalty_msat(this.ptr, short_channel_id, source == null ? 0 : source.ptr, target == null ? 0 : target.ptr, usage == null ? 0 : usage.ptr);
+		Reference.reachabilityFence(this);
+		Reference.reachabilityFence(short_channel_id);
+		Reference.reachabilityFence(source);
+		Reference.reachabilityFence(target);
+		Reference.reachabilityFence(usage);
+		if (this != null) { this.ptrs_to.add(source); };
+		if (this != null) { this.ptrs_to.add(target); };
+		if (this != null) { this.ptrs_to.add(usage); };
+		return ret;
+	}
+
+	/**
+	 * Handles updating channel penalties after failing to route through a channel.
+	 */
+	public void payment_path_failed(RouteHop[] path, long short_channel_id) {
+		bindings.Score_payment_path_failed(this.ptr, path != null ? Arrays.stream(path).mapToLong(path_conv_10 -> path_conv_10 == null ? 0 : path_conv_10.ptr).toArray() : null, short_channel_id);
+		Reference.reachabilityFence(this);
+		Reference.reachabilityFence(path);
+		Reference.reachabilityFence(short_channel_id);
+		for (RouteHop path_conv_10: path) { if (this != null) { this.ptrs_to.add(path_conv_10); }; };
+	}
+
+	/**
+	 * Handles updating channel penalties after successfully routing along a path.
+	 */
+	public void payment_path_successful(RouteHop[] path) {
+		bindings.Score_payment_path_successful(this.ptr, path != null ? Arrays.stream(path).mapToLong(path_conv_10 -> path_conv_10 == null ? 0 : path_conv_10.ptr).toArray() : null);
+		Reference.reachabilityFence(this);
+		Reference.reachabilityFence(path);
+		for (RouteHop path_conv_10: path) { if (this != null) { this.ptrs_to.add(path_conv_10); }; };
+	}
+
+	/**
+	 * Handles updating channel penalties after a probe over the given path failed.
+	 */
+	public void probe_failed(RouteHop[] path, long short_channel_id) {
+		bindings.Score_probe_failed(this.ptr, path != null ? Arrays.stream(path).mapToLong(path_conv_10 -> path_conv_10 == null ? 0 : path_conv_10.ptr).toArray() : null, short_channel_id);
+		Reference.reachabilityFence(this);
+		Reference.reachabilityFence(path);
+		Reference.reachabilityFence(short_channel_id);
+		for (RouteHop path_conv_10: path) { if (this != null) { this.ptrs_to.add(path_conv_10); }; };
+	}
+
+	/**
+	 * Handles updating channel penalties after a probe over the given path succeeded.
+	 */
+	public void probe_successful(RouteHop[] path) {
+		bindings.Score_probe_successful(this.ptr, path != null ? Arrays.stream(path).mapToLong(path_conv_10 -> path_conv_10 == null ? 0 : path_conv_10.ptr).toArray() : null);
+		Reference.reachabilityFence(this);
+		Reference.reachabilityFence(path);
+		for (RouteHop path_conv_10: path) { if (this != null) { this.ptrs_to.add(path_conv_10); }; };
+	}
+
+	/**
+	 * Serialize the object into a byte array
 	 */
-	public long channel_penalty_msat(long short_channel_id) {
-		long ret = bindings.Score_channel_penalty_msat(this.ptr, short_channel_id);
+	public byte[] write() {
+		byte[] ret = bindings.Score_write(this.ptr);
+		Reference.reachabilityFence(this);
 		return ret;
 	}