--- /dev/null
+package org.ldk.structs;
+
+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;
+
+
+/**
+ * Rapid Gossip Sync struct
+ * See [crate-level documentation] for usage.
+ *
+ * [crate-level documentation]: crate
+ */
+@SuppressWarnings("unchecked") // We correctly assign various generic arrays
+public class RapidGossipSync extends CommonBase {
+ RapidGossipSync(Object _dummy, long ptr) { super(ptr); }
+ @Override @SuppressWarnings("deprecation")
+ protected void finalize() throws Throwable {
+ super.finalize();
+ if (ptr != 0) { bindings.RapidGossipSync_free(ptr); }
+ }
+
+ /**
+ * Instantiate a new [`RapidGossipSync`] instance
+ */
+ public static RapidGossipSync of(NetworkGraph network_graph) {
+ long ret = bindings.RapidGossipSync_new(network_graph == null ? 0 : network_graph.ptr & ~1);
+ Reference.reachabilityFence(network_graph);
+ if (ret >= 0 && ret <= 4096) { return null; }
+ org.ldk.structs.RapidGossipSync ret_hu_conv = null; if (ret < 0 || ret > 4096) { ret_hu_conv = new org.ldk.structs.RapidGossipSync(null, ret); }
+ ret_hu_conv.ptrs_to.add(ret_hu_conv);
+ ret_hu_conv.ptrs_to.add(network_graph);
+ return ret_hu_conv;
+ }
+
+ /**
+ * Sync gossip data from a file
+ * Returns the last sync timestamp to be used the next time rapid sync data is queried.
+ *
+ * `network_graph`: The network graph to apply the updates to
+ *
+ * `sync_path`: Path to the file where the gossip update data is located
+ */
+ public Result_u32GraphSyncErrorZ sync_network_graph_with_file_path(java.lang.String sync_path) {
+ long ret = bindings.RapidGossipSync_sync_network_graph_with_file_path(this.ptr, sync_path);
+ Reference.reachabilityFence(this);
+ Reference.reachabilityFence(sync_path);
+ if (ret >= 0 && ret <= 4096) { return null; }
+ Result_u32GraphSyncErrorZ ret_hu_conv = Result_u32GraphSyncErrorZ.constr_from_ptr(ret);
+ return ret_hu_conv;
+ }
+
+ /**
+ * Returns whether a rapid gossip sync has completed at least once
+ */
+ public boolean is_initial_sync_complete() {
+ boolean ret = bindings.RapidGossipSync_is_initial_sync_complete(this.ptr);
+ Reference.reachabilityFence(this);
+ return ret;
+ }
+
+ /**
+ * Update network graph from binary data.
+ * Returns the last sync timestamp to be used the next time rapid sync data is queried.
+ *
+ * `network_graph`: network graph to be updated
+ *
+ * `update_data`: `&[u8]` binary stream that comprises the update data
+ */
+ public Result_u32GraphSyncErrorZ update_network_graph(byte[] update_data) {
+ long ret = bindings.RapidGossipSync_update_network_graph(this.ptr, update_data);
+ Reference.reachabilityFence(this);
+ Reference.reachabilityFence(update_data);
+ if (ret >= 0 && ret <= 4096) { return null; }
+ Result_u32GraphSyncErrorZ ret_hu_conv = Result_u32GraphSyncErrorZ.constr_from_ptr(ret);
+ return ret_hu_conv;
+ }
+
+}