public override int GetHashCode()
{
const int prime = 31;
int result = base.GetHashCode();
result = prime * result + (m_disableCoord ? 1231 : 1237);
result = prime * result + J2N.BitConversion.SingleToInt32Bits(m_highFreqBoost);
result = prime * result + /*((highFreqOccur == null) ? 0 :*/ m_highFreqOccur.GetHashCode() /*)*/;
result = prime * result + J2N.BitConversion.SingleToInt32Bits(m_lowFreqBoost);
result = prime * result + /*((lowFreqOccur == null) ? 0 :*/ m_lowFreqOccur.GetHashCode() /*)*/;
result = prime * result + J2N.BitConversion.SingleToInt32Bits(m_maxTermFrequency);
result = prime * result + J2N.BitConversion.SingleToInt32Bits(m_lowFreqMinNrShouldMatch);
result = prime * result + J2N.BitConversion.SingleToInt32Bits(m_highFreqMinNrShouldMatch);
// LUCENENET specific: use structural equality comparison
result = prime * result + ((m_terms == null) ? 0 : JCG.ListEqualityComparer <Term> .Default.GetHashCode(m_terms));
return(result);
}
public override int GetHashCode()
{
const int prime = 31;
int result = base.GetHashCode();
result = prime * result + (m_disableCoord ? 1231 : 1237);
result = prime * result + Number.SingleToInt32Bits(m_highFreqBoost);
result = prime * result + /*((highFreqOccur == null) ? 0 :*/ m_highFreqOccur.GetHashCode() /*)*/;
result = prime * result + Number.SingleToInt32Bits(m_lowFreqBoost);
result = prime * result + /*((lowFreqOccur == null) ? 0 :*/ m_lowFreqOccur.GetHashCode() /*)*/;
result = prime * result + Number.SingleToInt32Bits(m_maxTermFrequency);
result = prime * result + Number.SingleToInt32Bits(m_lowFreqMinNrShouldMatch);
result = prime * result + Number.SingleToInt32Bits(m_highFreqMinNrShouldMatch);
// LUCENENET specific: wrap the m_terms to ensure the collection values are
// compared for equalitly
result = prime * result + ((m_terms == null) ? 0 : Equatable.Wrap(m_terms).GetHashCode());
return(result);
}
public override int GetHashCode()
{
return(filter.GetHashCode() ^ occur.GetHashCode());
}
