OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:nRemaining
(Results
1 - 5
of
5
) sorted by null
/libcore/luni/src/main/java/org/apache/harmony/security/provider/crypto/
SHA1PRNG_SecureRandomImpl.java
420
int
nRemaining
= (seed[BYTES_OFFSET] + 3) >> 2; // converting bytes in words
425
// so in "seed[]" to serialize are remaining bytes (seed[0-
nRemaining
]) and
428
intData = new int[only_hash +
nRemaining
];
430
System.arraycopy(seed, 0, intData, 0,
nRemaining
);
431
System.arraycopy(seed, HASH_OFFSET, intData,
nRemaining
,
442
intData = new int[hashes_and_frame +
nRemaining
];
446
intData = new int[hashes_and_frame_extra +
nRemaining
];
459
offset,
nRemaining
);
460
offset +=
nRemaining
;
488
int
nRemaining
= (seed[BYTES_OFFSET] + 3) >> 2; // converting bytes in word
[
all
...]
/libcore/luni/src/main/java/java/util/
ComparableTimSort.java
147
int
nRemaining
= hi - lo;
148
if (
nRemaining
< 2)
152
if (
nRemaining
< MIN_MERGE) {
164
int minRun = minRunLength(
nRemaining
);
169
// If run is short, extend to min(minRun,
nRemaining
)
171
int force =
nRemaining
<= minRun ?
nRemaining
: minRun;
182
nRemaining
-= runLen;
183
} while (
nRemaining
!= 0);
[
all
...]
TimSort.java
179
int
nRemaining
= hi - lo;
180
if (
nRemaining
< 2)
184
if (
nRemaining
< MIN_MERGE) {
196
int minRun = minRunLength(
nRemaining
);
201
// If run is short, extend to min(minRun,
nRemaining
)
203
int force =
nRemaining
<= minRun ?
nRemaining
: minRun;
214
nRemaining
-= runLen;
215
} while (
nRemaining
!= 0);
[
all
...]
/external/sqlite/dist/
sqlite3.c
[
all
...]
sqlite3.c.orig
[
all
...]
Completed in 472 milliseconds