* Utility method to constructs a new BlindedPath-variant Destination
*/
public static Destination blinded_path(org.ldk.structs.BlindedPath a) {
- long ret = bindings.Destination_blinded_path(a == null ? 0 : a.ptr);
+ long ret = bindings.Destination_blinded_path(a.ptr);
Reference.reachabilityFence(a);
if (ret >= 0 && ret <= 4096) { return null; }
org.ldk.structs.Destination ret_hu_conv = org.ldk.structs.Destination.constr_from_ptr(ret);
return ret_hu_conv;
}
+ /**
+ * Generates a non-cryptographic 64-bit hash of the Destination.
+ */
+ public long hash() {
+ long ret = bindings.Destination_hash(this.ptr);
+ Reference.reachabilityFence(this);
+ return ret;
+ }
+
+ @Override public int hashCode() {
+ return (int)this.hash();
+ }
+ /**
+ * Checks if two Destinations contain equal inner contents.
+ * This ignores pointers and is_owned flags and looks at the values in fields.
+ */
+ public boolean eq(org.ldk.structs.Destination b) {
+ boolean ret = bindings.Destination_eq(this.ptr, b.ptr);
+ Reference.reachabilityFence(this);
+ Reference.reachabilityFence(b);
+ return ret;
+ }
+
+ @Override public boolean equals(Object o) {
+ if (!(o instanceof Destination)) return false;
+ return this.eq((Destination)o);
+ }
+ /**
+ * Attempts to resolve the [`IntroductionNode::DirectedShortChannelId`] of a
+ * [`Destination::BlindedPath`] to a [`IntroductionNode::NodeId`], if applicable, using the
+ * provided [`ReadOnlyNetworkGraph`].
+ */
+ public void resolve(org.ldk.structs.ReadOnlyNetworkGraph network_graph) {
+ bindings.Destination_resolve(this.ptr, network_graph.ptr);
+ Reference.reachabilityFence(this);
+ Reference.reachabilityFence(network_graph);
+ if (this != null) { this.ptrs_to.add(network_graph); };
+ }
+
}