Searched refs:hc (Results 1 - 6 of 6) sorted by relevance

/libcore/luni/src/test/java/tests/security/spec/
H A DECFieldFpTest.java110 int hc = f.hashCode();
111 assertTrue(hc == f.hashCode() &&
112 hc == f.hashCode() &&
113 hc == f.hashCode() &&
114 hc == f.hashCode() &&
115 hc == f.hashCode() &&
116 hc == f.hashCode() &&
117 hc == f.hashCode() &&
118 hc == f.hashCode());
H A DECFieldF2mTest.java325 int hc = f.hashCode();
326 assertTrue(hc == f.hashCode() &&
327 hc == f.hashCode() &&
328 hc == f.hashCode() &&
329 hc == f.hashCode() &&
330 hc == f.hashCode() &&
331 hc == f.hashCode() &&
332 hc == f.hashCode() &&
333 hc == f.hashCode());
344 int hc
[all...]
H A DECPointTest.java201 int hc = f.hashCode();
202 assertTrue(hc == f.hashCode() &&
203 hc == f.hashCode() &&
204 hc == f.hashCode() &&
205 hc == f.hashCode() &&
206 hc == f.hashCode() &&
207 hc == f.hashCode() &&
208 hc == f.hashCode() &&
209 hc == f.hashCode());
213 hc
[all...]
H A DEllipticCurveTest.java602 int hc = 0;
606 hc = f.hashCode();
607 assertTrue(hc == f.hashCode() && hc == f.hashCode()
608 && hc == f.hashCode() && hc == f.hashCode()
609 && hc == f.hashCode() && hc == f.hashCode()
610 && hc == f.hashCode() && hc
[all...]
/libcore/luni/src/main/java/java/util/concurrent/
H A DConcurrentHashMap.java1577 CounterHashCode hc; CounterCell a; long v; int m;
1579 if ((hc = threadCounterHashCode.get()) == null ||
1581 (a = as[m & hc.code]) == null ||
1584 fullAddCount(x, hc, uncontended);
1765 int lc = 0, hc = 0;
1784 ++hc;
1788 (hc != 0) ? new TreeBin<K,V>(lo) : t;
1789 hn = (hc <= UNTREEIFY_THRESHOLD) ? untreeify(hi) :
3073 private final void fullAddCount(long x, CounterHashCode hc, argument
3076 if (hc
[all...]
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/
H A DEnumSetTest.java102 Class<HugeEnumWithInnerClass> hc = (Class<HugeEnumWithInnerClass>) HugeEnumWithInnerClass.a
105 EnumSet.noneOf(hc);

Completed in 109 milliseconds