@Override public int hashCode() { int result = super.hashCode(); result = 31 * result + (isPositive ? 1 : 0); return result; } }
@Override public int hashCode() { int result = super.hashCode(); result = 31 * result + (isPositive ? 1 : 0); result = 31 * result + prevDistance; return result; } }
@Override public int hashCode() { int result = super.hashCode(); result = 31 * result + (isPositive ? 1 : 0); result = 31 * result + prevDistance; return result; } }
@Override public int hashCode() { int result = atom != null ? atom.hashCode() : 0; result = 31 * result + distance; return result; } }
@Override public int hashCode() { int result = atom != null ? atom.hashCode() : 0; result = 31 * result + distance; return result; } }
@Override public int hashCode() { int result = super.hashCode(); result = 31 * result + (isPositive ? 1 : 0); return result; } }
@Override public int hashCode() { int result = stringRepr != null ? stringRepr.hashCode() : 0; result = 31 * result + (root != null ? root.hashCode() : 0); result = 31 * result + (root0 != null ? root0.hashCode() : 0); result = 31 * result + memregs; result = 31 * result + counters; result = 31 * result + lookaheads; result = 31 * result + (namedGroupMap != null ? namedGroupMap.hashCode() : 0); return result; }
@Override public int hashCode() { int result = stringRepr != null ? stringRepr.hashCode() : 0; result = 31 * result + (root != null ? root.hashCode() : 0); result = 31 * result + (root0 != null ? root0.hashCode() : 0); result = 31 * result + memregs; result = 31 * result + counters; result = 31 * result + lookaheads; result = 31 * result + (namedGroupMap != null ? namedGroupMap.hashCode() : 0); return result; } }
@Override public int hashCode() { int result = term != null ? term.hashCode() : 0; result = 31 * result + index; result = 31 * result + cnt; result = 31 * result + regLen; result = 31 * result + (isState ? 1 : 0); result = 31 * result + (mHead != null ? mHead.hashCode() : 0); result = 31 * result + (mCurrent != null ? mCurrent.hashCode() : 0); result = 31 * result + (cHead != null ? cHead.hashCode() : 0); result = 31 * result + (cCurrent != null ? cCurrent.hashCode() : 0); return result; }
@Override public int hashCode() { int result = term != null ? term.hashCode() : 0; result = 31 * result + index; result = 31 * result + cnt; result = 31 * result + regLen; result = 31 * result + (isState ? 1 : 0); result = 31 * result + (mHead != null ? mHead.hashCode() : 0); result = 31 * result + (mCurrent != null ? mCurrent.hashCode() : 0); result = 31 * result + (cHead != null ? cHead.hashCode() : 0); result = 31 * result + (cCurrent != null ? cCurrent.hashCode() : 0); return result; }
@Override public int hashCode() { int result = super.hashCode(); result = 31 * result + (node != null ? node.hashCode() : 0); result = 31 * result + (newBranchStarted ? 1 : 0); result = 31 * result + (linkAsBranch ? 1 : 0); return result; } }
@Override public int hashCode() { int result = super.hashCode(); result = 31 * result + (node != null ? node.hashCode() : 0); result = 31 * result + (newBranchStarted ? 1 : 0); result = 31 * result + (linkAsBranch ? 1 : 0); return result; } }
@Override public int hashCode() { int result = next != null ? next.hashCode() : 0; result = 31 * result + type; result = 31 * result + (inverse ? 1 : 0); result = 31 * result + (int) c; result = 31 * result + distance; result = 31 * result + (eat ? 1 : 0); result = 31 * result + (bitset != null ? bitset.hashCode() : 0); result = 31 * result + Arrays.hashCode(bitset2); result = 31 * result + Arrays.hashCode(categoryBitset); result = 31 * result + weight; result = 31 * result + memreg; result = 31 * result + minCount; result = 31 * result + maxCount; result = 31 * result + cntreg; result = 31 * result + lookaheadId; return result; } }
@Override public int hashCode() { int result = next != null ? next.hashCode() : 0; result = 31 * result + type; result = 31 * result + (inverse ? 1 : 0);