當前位置: 首頁>>代碼示例>>Java>>正文


Java EllipticCurve.hashCode方法代碼示例

本文整理匯總了Java中java.security.spec.EllipticCurve.hashCode方法的典型用法代碼示例。如果您正苦於以下問題:Java EllipticCurve.hashCode方法的具體用法?Java EllipticCurve.hashCode怎麽用?Java EllipticCurve.hashCode使用的例子?那麽, 這裏精選的方法代碼示例或許可以為您提供幫助。您也可以進一步了解該方法所在java.security.spec.EllipticCurve的用法示例。


在下文中一共展示了EllipticCurve.hashCode方法的3個代碼示例,這些例子默認根據受歡迎程度排序。您可以為喜歡或者感覺有用的代碼點讚,您的評價將有助於係統推薦出更棒的Java代碼示例。

示例1: testHashCode01

import java.security.spec.EllipticCurve; //導入方法依賴的package包/類
/**
 * Test #1 for <code>hashCode()</code> method.<br>
 *
 * Assertion: must return the same value if invoked
 * repeatedly on the same object.
 */
@TestTargetNew(
    level = TestLevel.PARTIAL_COMPLETE,
    notes = "Verifies that several calls of hashCode method for the same objects return the same values.",
    method = "hashCode",
    args = {}
)
public final void testHashCode01() {
    int hc = 0;
    EllipticCurve f = new EllipticCurve(new ECFieldFp(BigInteger
            .valueOf(23L)), BigInteger.ONE, BigInteger.valueOf(19L),
            new byte[24]);
    hc = f.hashCode();
    assertTrue(hc == f.hashCode() && hc == f.hashCode()
            && hc == f.hashCode() && hc == f.hashCode()
            && hc == f.hashCode() && hc == f.hashCode()
            && hc == f.hashCode() && hc == f.hashCode());
}
 
開發者ID:keplersj,項目名稱:In-the-Box-Fork,代碼行數:24,代碼來源:EllipticCurveTest.java

示例2: testHashCode01

import java.security.spec.EllipticCurve; //導入方法依賴的package包/類
/**
 * Test #1 for <code>hashCode()</code> method.<br>
 *
 * Assertion: must return the same value if invoked
 * repeatedly on the same object.
 */
public final void testHashCode01() {
    int hc = 0;
    EllipticCurve f = new EllipticCurve(new ECFieldFp(BigInteger
            .valueOf(23L)), BigInteger.ONE, BigInteger.valueOf(19L),
            new byte[24]);
    hc = f.hashCode();
    assertTrue(hc == f.hashCode() && hc == f.hashCode()
            && hc == f.hashCode() && hc == f.hashCode()
            && hc == f.hashCode() && hc == f.hashCode()
            && hc == f.hashCode() && hc == f.hashCode());
}
 
開發者ID:Sellegit,項目名稱:j2objc,代碼行數:18,代碼來源:EllipticCurveTest.java

示例3: testHashCode01

import java.security.spec.EllipticCurve; //導入方法依賴的package包/類
/**
 * Test #1 for <code>hashCode()</code> method.<br>
 *
 * Assertion: must return the same value if invoked
 * repeatedly on the same object. 
 */
public final void testHashCode01() {
    int hc = 0;
    EllipticCurve f = new EllipticCurve(new ECFieldFp(BigInteger
            .valueOf(23L)), BigInteger.ONE, BigInteger.valueOf(19L),
            new byte[24]);
    hc = f.hashCode();
    assertTrue(hc == f.hashCode() && hc == f.hashCode()
            && hc == f.hashCode() && hc == f.hashCode()
            && hc == f.hashCode() && hc == f.hashCode()
            && hc == f.hashCode() && hc == f.hashCode());
}
 
開發者ID:shannah,項目名稱:cn1,代碼行數:18,代碼來源:EllipticCurveTest.java


注:本文中的java.security.spec.EllipticCurve.hashCode方法示例由純淨天空整理自Github/MSDocs等開源代碼及文檔管理平台,相關代碼片段篩選自各路編程大神貢獻的開源項目,源碼版權歸原作者所有,傳播和使用請參考對應項目的License;未經允許,請勿轉載。