1 package org.ldk.structs;
3 import org.ldk.impl.bindings;
4 import org.ldk.enums.*;
6 import java.util.Arrays;
7 import java.lang.ref.Reference;
8 import javax.annotation.Nullable;
12 * A [`Router`] implemented using [`find_route`].
14 @SuppressWarnings("unchecked") // We correctly assign various generic arrays
15 public class DefaultRouter extends CommonBase {
16 DefaultRouter(Object _dummy, long ptr) { super(ptr); }
17 @Override @SuppressWarnings("deprecation")
18 protected void finalize() throws Throwable {
20 if (ptr != 0) { bindings.DefaultRouter_free(ptr); }
24 * Creates a new router using the given [`NetworkGraph`], a [`Logger`], and a randomness source
25 * `random_seed_bytes`.
27 public static DefaultRouter of(NetworkGraph network_graph, Logger logger, byte[] random_seed_bytes) {
28 long ret = bindings.DefaultRouter_new(network_graph == null ? 0 : network_graph.ptr & ~1, logger == null ? 0 : logger.ptr, InternalUtils.check_arr_len(random_seed_bytes, 32));
29 Reference.reachabilityFence(network_graph);
30 Reference.reachabilityFence(logger);
31 Reference.reachabilityFence(random_seed_bytes);
32 if (ret >= 0 && ret <= 4096) { return null; }
33 org.ldk.structs.DefaultRouter ret_hu_conv = null; if (ret < 0 || ret > 4096) { ret_hu_conv = new org.ldk.structs.DefaultRouter(null, ret); }
34 ret_hu_conv.ptrs_to.add(ret_hu_conv);
35 ret_hu_conv.ptrs_to.add(network_graph);
36 ret_hu_conv.ptrs_to.add(logger);
41 * Constructs a new Router which calls the relevant methods on this_arg.
42 * This copies the `inner` pointer in this_arg and thus the returned Router must be freed before this_arg is
44 public Router as_Router() {
45 long ret = bindings.DefaultRouter_as_Router(this.ptr);
46 Reference.reachabilityFence(this);
47 if (ret >= 0 && ret <= 4096) { return null; }
48 Router ret_hu_conv = new Router(null, ret);
49 ret_hu_conv.ptrs_to.add(this);