本文整理了Java中org.bouncycastle.math.ec.ECCurve.hashCode()方法的一些代码示例，展示了ECCurve.hashCode()的具体用法。这些代码示例主要来源于Github/Stackoverflow/Maven等平台，是从一些精选项目中提取出来的代码，具有较强的参考意义，能在一定程度帮忙到你。ECCurve.hashCode()方法的具体详情如下：
包路径：org.bouncycastle.math.ec.ECCurve
类名称：ECCurve
方法名：hashCode

ECCurve.hashCode介绍

暂无

代码示例

代码示例来源：origin: org.bouncycastle/bcprov-debug-jdk15on

public int hashCode()
{
  int hc = curve.hashCode();
  hc *= 37;
  hc ^= G.hashCode();
  hc *= 37;
  hc ^= n.hashCode();
  hc *= 37;
  hc ^= h.hashCode();
  return hc;
}

代码示例来源：origin: redfish64/TinyTravelTracker

public int hashCode()
{
  ECCurve c = this.getCurve();
  int hc = (null == c) ? 0 : ~c.hashCode();
  if (!this.isInfinity())
  {
    // TODO Consider just requiring already normalized, to avoid silent performance degradation
    ECPoint p = normalize();
    hc ^= p.getXCoord().hashCode() * 17;
    hc ^= p.getYCoord().hashCode() * 257;
  }
  return hc;
}

代码示例来源：origin: org.bouncycastle/bcprov-debug-jdk15on

public int hashCode()
  {
    return this.getCurve().hashCode() ^ this.getG().hashCode();
  }
}

代码示例来源：origin: org.bouncycastle/bcprov-debug-jdk15on

public int hashCode()
{
  ECCurve c = this.getCurve();
  int hc = (null == c) ? 0 : ~c.hashCode();
  if (!this.isInfinity())
  {
    // TODO Consider just requiring already normalized, to avoid silent performance degradation
    ECPoint p = normalize();
    hc ^= p.getXCoord().hashCode() * 17;
    hc ^= p.getYCoord().hashCode() * 257;
  }
  return hc;
}