+ /**
+ * The list of routes taken for a single (potentially-)multi-part payment. The pubkey of the
+ * last RouteHop in each path must be the same.
+ * Each entry represents a list of hops, NOT INCLUDING our own, where the last hop is the
+ * destination. Thus, this must always be at least length one. While the maximum length of any
+ * given path is variable, keeping the length of any path to less than 20 should currently
+ * ensure it is viable.
+ */
+ public RouteHop[][] get_paths() {
+ long[][] ret = bindings.Route_get_paths(this.ptr);
+ Reference.reachabilityFence(this);
+ RouteHop[][] ret_conv_12_arr = new RouteHop[ret.length][];
+ for (int m = 0; m < ret.length; m++) {
+ long[] ret_conv_12 = ret[m];
+ RouteHop[] ret_conv_12_conv_10_arr = new RouteHop[ret_conv_12.length];
+ for (int k = 0; k < ret_conv_12.length; k++) {
+ long ret_conv_12_conv_10 = ret_conv_12[k];
+ RouteHop ret_conv_12_conv_10_hu_conv = null; if (ret_conv_12_conv_10 < 0 || ret_conv_12_conv_10 > 4096) { ret_conv_12_conv_10_hu_conv = new RouteHop(null, ret_conv_12_conv_10); }
+ ret_conv_12_conv_10_hu_conv.ptrs_to.add(this);
+ ret_conv_12_conv_10_arr[k] = ret_conv_12_conv_10_hu_conv;
+ }
+ ret_conv_12_arr[m] = ret_conv_12_conv_10_arr;
+ }
+ return ret_conv_12_arr;
+ }
+
+ /**
+ * The list of routes taken for a single (potentially-)multi-part payment. The pubkey of the
+ * last RouteHop in each path must be the same.
+ * Each entry represents a list of hops, NOT INCLUDING our own, where the last hop is the
+ * destination. Thus, this must always be at least length one. While the maximum length of any
+ * given path is variable, keeping the length of any path to less than 20 should currently
+ * ensure it is viable.
+ */