import org.ldk.enums.*;
import org.ldk.util.*;
import java.util.Arrays;
+import java.lang.ref.Reference;
+import javax.annotation.Nullable;
/**
- * A revoke_and_ack message to be sent or received from a peer
+ * A [`revoke_and_ack`] message to be sent to or received from a peer.
+ *
+ * [`revoke_and_ack`]: https://github.com/lightning/bolts/blob/master/02-peer-protocol.md#completing-the-transition-to-the-updated-state-revoke_and_ack
*/
@SuppressWarnings("unchecked") // We correctly assign various generic arrays
public class RevokeAndACK extends CommonBase {
*/
public byte[] get_channel_id() {
byte[] ret = bindings.RevokeAndACK_get_channel_id(this.ptr);
+ Reference.reachabilityFence(this);
return ret;
}
* The channel ID
*/
public void set_channel_id(byte[] val) {
- bindings.RevokeAndACK_set_channel_id(this.ptr, val);
+ bindings.RevokeAndACK_set_channel_id(this.ptr, InternalUtils.check_arr_len(val, 32));
+ Reference.reachabilityFence(this);
+ Reference.reachabilityFence(val);
}
/**
*/
public byte[] get_per_commitment_secret() {
byte[] ret = bindings.RevokeAndACK_get_per_commitment_secret(this.ptr);
+ Reference.reachabilityFence(this);
return ret;
}
* The secret corresponding to the per-commitment point
*/
public void set_per_commitment_secret(byte[] val) {
- bindings.RevokeAndACK_set_per_commitment_secret(this.ptr, val);
+ bindings.RevokeAndACK_set_per_commitment_secret(this.ptr, InternalUtils.check_arr_len(val, 32));
+ Reference.reachabilityFence(this);
+ Reference.reachabilityFence(val);
}
/**
*/
public byte[] get_next_per_commitment_point() {
byte[] ret = bindings.RevokeAndACK_get_next_per_commitment_point(this.ptr);
+ Reference.reachabilityFence(this);
return ret;
}
* The next sender-broadcast commitment transaction's per-commitment point
*/
public void set_next_per_commitment_point(byte[] val) {
- bindings.RevokeAndACK_set_next_per_commitment_point(this.ptr, val);
+ bindings.RevokeAndACK_set_next_per_commitment_point(this.ptr, InternalUtils.check_arr_len(val, 33));
+ Reference.reachabilityFence(this);
+ Reference.reachabilityFence(val);
}
/**
* Constructs a new RevokeAndACK given each field
*/
- public static RevokeAndACK constructor_new(byte[] channel_id_arg, byte[] per_commitment_secret_arg, byte[] next_per_commitment_point_arg) {
- long ret = bindings.RevokeAndACK_new(channel_id_arg, per_commitment_secret_arg, next_per_commitment_point_arg);
- RevokeAndACK ret_hu_conv = new RevokeAndACK(null, ret);
- ret_hu_conv.ptrs_to.add(ret_hu_conv);
+ public static RevokeAndACK of(byte[] channel_id_arg, byte[] per_commitment_secret_arg, byte[] next_per_commitment_point_arg) {
+ long ret = bindings.RevokeAndACK_new(InternalUtils.check_arr_len(channel_id_arg, 32), InternalUtils.check_arr_len(per_commitment_secret_arg, 32), InternalUtils.check_arr_len(next_per_commitment_point_arg, 33));
+ Reference.reachabilityFence(channel_id_arg);
+ Reference.reachabilityFence(per_commitment_secret_arg);
+ Reference.reachabilityFence(next_per_commitment_point_arg);
+ if (ret >= 0 && ret <= 4096) { return null; }
+ org.ldk.structs.RevokeAndACK ret_hu_conv = null; if (ret < 0 || ret > 4096) { ret_hu_conv = new org.ldk.structs.RevokeAndACK(null, ret); }
+ if (ret_hu_conv != null) { ret_hu_conv.ptrs_to.add(ret_hu_conv); };
return ret_hu_conv;
}
+ long clone_ptr() {
+ long ret = bindings.RevokeAndACK_clone_ptr(this.ptr);
+ Reference.reachabilityFence(this);
+ return ret;
+ }
+
/**
* Creates a copy of the RevokeAndACK
*/
public RevokeAndACK clone() {
long ret = bindings.RevokeAndACK_clone(this.ptr);
- RevokeAndACK ret_hu_conv = new RevokeAndACK(null, ret);
- ret_hu_conv.ptrs_to.add(this);
+ Reference.reachabilityFence(this);
+ if (ret >= 0 && ret <= 4096) { return null; }
+ org.ldk.structs.RevokeAndACK ret_hu_conv = null; if (ret < 0 || ret > 4096) { ret_hu_conv = new org.ldk.structs.RevokeAndACK(null, ret); }
+ if (ret_hu_conv != null) { ret_hu_conv.ptrs_to.add(this); };
return ret_hu_conv;
}
+ /**
+ * Generates a non-cryptographic 64-bit hash of the RevokeAndACK.
+ */
+ public long hash() {
+ long ret = bindings.RevokeAndACK_hash(this.ptr);
+ Reference.reachabilityFence(this);
+ return ret;
+ }
+
+ @Override public int hashCode() {
+ return (int)this.hash();
+ }
+ /**
+ * Checks if two RevokeAndACKs contain equal inner contents.
+ * This ignores pointers and is_owned flags and looks at the values in fields.
+ * Two objects with NULL inner values will be considered "equal" here.
+ */
+ public boolean eq(org.ldk.structs.RevokeAndACK b) {
+ boolean ret = bindings.RevokeAndACK_eq(this.ptr, b == null ? 0 : b.ptr);
+ Reference.reachabilityFence(this);
+ Reference.reachabilityFence(b);
+ if (this != null) { this.ptrs_to.add(b); };
+ return ret;
+ }
+
+ @Override public boolean equals(Object o) {
+ if (!(o instanceof RevokeAndACK)) return false;
+ return this.eq((RevokeAndACK)o);
+ }
/**
* Serialize the RevokeAndACK object into a byte array which can be read by RevokeAndACK_read
*/
public byte[] write() {
byte[] ret = bindings.RevokeAndACK_write(this.ptr);
+ Reference.reachabilityFence(this);
return ret;
}
/**
* Read a RevokeAndACK from a byte array, created by RevokeAndACK_write
*/
- public static Result_RevokeAndACKDecodeErrorZ constructor_read(byte[] ser) {
+ public static Result_RevokeAndACKDecodeErrorZ read(byte[] ser) {
long ret = bindings.RevokeAndACK_read(ser);
+ Reference.reachabilityFence(ser);
+ if (ret >= 0 && ret <= 4096) { return null; }
Result_RevokeAndACKDecodeErrorZ ret_hu_conv = Result_RevokeAndACKDecodeErrorZ.constr_from_ptr(ret);
return ret_hu_conv;
}
projects / ldk-java / blobdiff