Lines Matching refs:keep
583 int highMask = (highBit << 1) - 1; // Bits to keep in high int
1647 * The idea is to keep a running product of b1 = n^(high-order bits of exp)
1648 * and then keep appending exponent bits to it. The following patterns
2807 int keep;
2810 for (keep = 0; keep < vlen && val[keep] == 0; keep++)
2812 return java.util.Arrays.copyOfRange(val, keep, vlen);
2821 int keep;
2824 for (keep = 0; keep < vlen && val[keep] == 0; keep++)
2826 return keep == 0 ? val : java.util.Arrays.copyOfRange(val, keep, vlen);
2834 int keep;
2837 for (keep = 0; keep < byteLength && a[keep]==0; keep++)
2841 int intLength = ((byteLength - keep) + 3) >>> 2;
2846 int bytesRemaining = b - keep + 1;
2859 int keep, k;
2863 for (keep=0; keep<byteLength && a[keep]==-1; keep++)
2869 for (k=keep; k<byteLength && a[k]==0; k++)
2873 int intLength = ((byteLength - keep + extraByte) + 3)/4;
2881 int numBytesToTransfer = Math.min(3, b-keep+1);
2907 int keep, j;
2910 for (keep=0; keep<a.length && a[keep]==-1; keep++)
2915 for (j=keep; j<a.length && a[j]==0; j++)
2918 int result[] = new int[a.length - keep + extraInt];
2922 for (int i = keep; i<a.length; i++)
2923 result[i - keep + extraInt] = ~a[i];