com.google.gerrit.server.approval.AutoValue_ApprovalCopier_ApprovalCopyResult Maven / Gradle / Ivy
The newest version!
package com.google.gerrit.server.approval;
import com.google.common.collect.ImmutableSet;
import com.google.gerrit.common.Nullable;
import javax.annotation.processing.Generated;
@Generated("com.google.auto.value.processor.AutoValueProcessor")
final class AutoValue_ApprovalCopier_ApprovalCopyResult extends ApprovalCopier.ApprovalCopyResult {
private final boolean canCopy;
@Nullable
private final String labelCopyCondition;
private final boolean labelCopy;
@Nullable
private final String copyEnforcement;
private final boolean forcedCopy;
@Nullable
private final String copyRestriction;
private final boolean forcedNonCopy;
private final ImmutableSet passingAtoms;
private final ImmutableSet failingAtoms;
AutoValue_ApprovalCopier_ApprovalCopyResult(
boolean canCopy,
@Nullable String labelCopyCondition,
boolean labelCopy,
@Nullable String copyEnforcement,
boolean forcedCopy,
@Nullable String copyRestriction,
boolean forcedNonCopy,
ImmutableSet passingAtoms,
ImmutableSet failingAtoms) {
this.canCopy = canCopy;
this.labelCopyCondition = labelCopyCondition;
this.labelCopy = labelCopy;
this.copyEnforcement = copyEnforcement;
this.forcedCopy = forcedCopy;
this.copyRestriction = copyRestriction;
this.forcedNonCopy = forcedNonCopy;
if (passingAtoms == null) {
throw new NullPointerException("Null passingAtoms");
}
this.passingAtoms = passingAtoms;
if (failingAtoms == null) {
throw new NullPointerException("Null failingAtoms");
}
this.failingAtoms = failingAtoms;
}
@Override
public boolean canCopy() {
return canCopy;
}
@Nullable
@Override
public String labelCopyCondition() {
return labelCopyCondition;
}
@Override
public boolean labelCopy() {
return labelCopy;
}
@Nullable
@Override
public String copyEnforcement() {
return copyEnforcement;
}
@Override
public boolean forcedCopy() {
return forcedCopy;
}
@Nullable
@Override
public String copyRestriction() {
return copyRestriction;
}
@Override
public boolean forcedNonCopy() {
return forcedNonCopy;
}
@Override
public ImmutableSet passingAtoms() {
return passingAtoms;
}
@Override
public ImmutableSet failingAtoms() {
return failingAtoms;
}
@Override
public String toString() {
return "ApprovalCopyResult{"
+ "canCopy=" + canCopy + ", "
+ "labelCopyCondition=" + labelCopyCondition + ", "
+ "labelCopy=" + labelCopy + ", "
+ "copyEnforcement=" + copyEnforcement + ", "
+ "forcedCopy=" + forcedCopy + ", "
+ "copyRestriction=" + copyRestriction + ", "
+ "forcedNonCopy=" + forcedNonCopy + ", "
+ "passingAtoms=" + passingAtoms + ", "
+ "failingAtoms=" + failingAtoms
+ "}";
}
@Override
public boolean equals(Object o) {
if (o == this) {
return true;
}
if (o instanceof ApprovalCopier.ApprovalCopyResult) {
ApprovalCopier.ApprovalCopyResult that = (ApprovalCopier.ApprovalCopyResult) o;
return this.canCopy == that.canCopy()
&& (this.labelCopyCondition == null ? that.labelCopyCondition() == null : this.labelCopyCondition.equals(that.labelCopyCondition()))
&& this.labelCopy == that.labelCopy()
&& (this.copyEnforcement == null ? that.copyEnforcement() == null : this.copyEnforcement.equals(that.copyEnforcement()))
&& this.forcedCopy == that.forcedCopy()
&& (this.copyRestriction == null ? that.copyRestriction() == null : this.copyRestriction.equals(that.copyRestriction()))
&& this.forcedNonCopy == that.forcedNonCopy()
&& this.passingAtoms.equals(that.passingAtoms())
&& this.failingAtoms.equals(that.failingAtoms());
}
return false;
}
@Override
public int hashCode() {
int h$ = 1;
h$ *= 1000003;
h$ ^= canCopy ? 1231 : 1237;
h$ *= 1000003;
h$ ^= (labelCopyCondition == null) ? 0 : labelCopyCondition.hashCode();
h$ *= 1000003;
h$ ^= labelCopy ? 1231 : 1237;
h$ *= 1000003;
h$ ^= (copyEnforcement == null) ? 0 : copyEnforcement.hashCode();
h$ *= 1000003;
h$ ^= forcedCopy ? 1231 : 1237;
h$ *= 1000003;
h$ ^= (copyRestriction == null) ? 0 : copyRestriction.hashCode();
h$ *= 1000003;
h$ ^= forcedNonCopy ? 1231 : 1237;
h$ *= 1000003;
h$ ^= passingAtoms.hashCode();
h$ *= 1000003;
h$ ^= failingAtoms.hashCode();
return h$;
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy