public override int GetHashCode() { unchecked { return(((Value1 != null ? Value1.GetHashCode() : 0) * 397) ^ (Value2 != null ? Value2.GetHashCode() : 0)); } }
public override int GetHashCode() { unchecked { return((Value0.GetHashCode() * 397) ^ Value1.GetHashCode()); } }
/// <summary> /// Gets the hash code /// </summary> /// <returns>Hash code</returns> public override int GetHashCode() { unchecked // Overflow is fine, just wrap { var hashCode = 41; // Suitable nullity checks etc, of course :) if (Uuid != null) { hashCode = hashCode * 59 + Uuid.GetHashCode(); } if (Name != null) { hashCode = hashCode * 59 + Name.GetHashCode(); } if (Description != null) { hashCode = hashCode * 59 + Description.GetHashCode(); } if (Value1 != null) { hashCode = hashCode * 59 + Value1.GetHashCode(); } if (Value2 != null) { hashCode = hashCode * 59 + Value2.GetHashCode(); } if (Value3 != null) { hashCode = hashCode * 59 + Value3.GetHashCode(); } return(hashCode); } }
public override int GetHashCode() { int hash = 13; hash = (hash * 7) + Value1.GetHashCode(); hash = (hash * 7) + Value2.GetHashCode(); return(hash); }
public override int GetHashCode() { unchecked { int hashCode = (Value1 != null ? Value1.GetHashCode() : 0); hashCode = (hashCode * 397) ^ Value2; hashCode = (hashCode * 397) ^ Value3.GetHashCode(); return(hashCode); } }
public override int GetHashCode() { unchecked { var hashCode = (Breadcrumb != null ? Breadcrumb.GetHashCode() : 0); hashCode = (hashCode * 397) ^ (ChildProperty != null ? ChildProperty.GetHashCode() : 0); hashCode = (hashCode * 397) ^ (Value1 != null ? Value1.GetHashCode() : 0); hashCode = (hashCode * 397) ^ (Value2 != null ? Value2.GetHashCode() : 0); return(hashCode); } }
public override int GetHashCode() { int hash; unchecked { hash = 27; hash = (hash * 23) + ((Value1 == null) ? 0 : Value1.GetHashCode()); hash = (hash * 23) + Value2.GetHashCode(); } return(hash); }
public int GetHashCode() { unchecked { int result = 37; result *= 23; if Value1 != null) result += Value1.GetHashCode(); result *= 23; if (Value2 != null) result += Value2.GetHashCode(); return result; } }
public override int GetHashCode() { int hash = 1; if (value1_ != null) { hash ^= Value1.GetHashCode(); } if (Value2 != 0) { hash ^= Value2.GetHashCode(); } if (_unknownFields != null) { hash ^= _unknownFields.GetHashCode(); } return(hash); }
public override int GetHashCode() { int hash = 1; if (Id.Length != 0) { hash ^= Id.GetHashCode(); } if (Value1 != 0) { hash ^= Value1.GetHashCode(); } if (Value2 != 0D) { hash ^= pbc::ProtobufEqualityComparers.BitwiseDoubleEqualityComparer.GetHashCode(Value2); } if (_unknownFields != null) { hash ^= _unknownFields.GetHashCode(); } return(hash); }
public override int GetHashCode() { int hash = 1; if (Name.Length != 0) { hash ^= Name.GetHashCode(); } if (Id != 0L) { hash ^= Id.GetHashCode(); } if (Email.Length != 0) { hash ^= Email.GetHashCode(); } if (Value1 != 0D) { hash ^= Value1.GetHashCode(); } hash ^= phones_.GetHashCode(); return(hash); }
public override Int32 GetHashCode() => Timestamp.GetHashCode() ^ Value1.GetHashCode() ^ Value2.GetHashCode() ^ Value3.GetHashCode();
public override int GetHashCode() => Value1.GetHashCode() ^ Value2.GetHashCode();
public override int GetHashCode() { return(Value1.GetHashCode() ^ Value2.GetHashCode() ^ Weight.GetHashCode()); }
public override int GetHashCode() => IsFirst ? Value1.GetHashCode() : Value2.GetHashCode();
// this isn't exactly identical to the netcore algorithm, but good enough public override int GetHashCode() => (Value1?.GetHashCode() ?? 0) ^ (Value2?.GetHashCode() ?? 0 << 3);
public override int GetHashCode() { return(Value1.GetHashCode() + Value2.GetHashCode() + Value3.GetHashCode()); }