HomeSort by relevance Sort by last modified time
    Searched refs:ciPos (Results 1 - 2 of 2) sorted by null

  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/
IntArray.java 562 int ciPos = ci.length, pow2 = ciPos >>> 1, offset = 32;
563 while (--ciPos > 1)
565 if (ciPos == pow2)
573 distribute(c, ci[pow2], ci[ciPos - pow2], ci[ciPos], cLen);
LongArray.java     [all...]

Completed in 33 milliseconds