public override int GetHashCode()
{
int prime = 31;
int result = 1;
result = prime * result + N;
result = prime * result
+ ((basisType == null) ? 0 : basisType.GetHashCode());
result = prime * result + ((f == null) ? 0 : f.GetHashCode());
result = prime * result
+ ((fPrime == null) ? 0 : fPrime.GetHashCode());
result = prime * result + ((h == null) ? 0 : h.GetHashCode());
long temp;
temp = BitConverter.DoubleToInt64Bits(keyNormBoundSq);
result = prime * result + (int)(temp ^ (IntUtils.URShift(temp, 32)));
result = prime * result
+ ((polyType == null) ? 0 : polyType.GetHashCode());
result = prime * result + q;
return(result);
}
//@Override
public override int GetHashCode()
{
int prime = 31;
int result = 1;
result = prime * result + B;
result = prime * result + N;
result = prime * result + ((basisType == null) ? 0 : basisType.GetHashCode());
long temp;
temp = IntUtils.floatToIntBits(beta);
result = prime * result + (int)(temp ^ (IntUtils.URShift(temp, 32)));
temp = IntUtils.floatToIntBits(betaSq);
result = prime * result + (int)(temp ^ (IntUtils.URShift(temp, 32)));
result = prime * result + bitsF;
result = prime * result + d;
result = prime * result + d1;
result = prime * result + d2;
result = prime * result + d3;
result = prime * result + ((hashAlg == null) ? 0 : hashAlg.GetHashCode());
result = prime * result + ((keyGenAlg == null) ? 0 : keyGenAlg.GetHashCode());
temp = IntUtils.floatToIntBits(keyNormBound);
result = prime * result + (int)(temp ^ (IntUtils.URShift(temp, 32)));
temp = IntUtils.floatToIntBits(keyNormBoundSq);
result = prime * result + (int)(temp ^ (IntUtils.URShift(temp, 32)));
temp = IntUtils.floatToIntBits(normBound);
result = prime * result + (int)(temp ^ (IntUtils.URShift(temp, 32)));
temp = IntUtils.floatToIntBits(normBoundSq);
result = prime * result + (int)(temp ^ (IntUtils.URShift(temp, 32)));
result = prime * result + ((polyType == null) ? 0 : polyType.GetHashCode());
result = prime * result + (primeCheck ? 1231 : 1237);
result = prime * result + q;
result = prime * result + signFailTolerance;
result = prime * result + (sparse ? 1231 : 1237);
return(result);
}
