OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:least
(Results
1 - 7
of
7
) sorted by null
/external/zlib/src/examples/
enough.c
207
int
least
; /*
least
number of syms to use at this juncture */
local
225
/* we need to use at
least
this many bit patterns so that the code won't be
227
least
= (left << 1) - syms;
228
if (
least
< 0)
229
least
= 0;
239
for (use =
least
; use <= most; use++) {
324
int
least
; /*
least
number of syms to use at this juncture */
local
361
/* we need to use at
least
this many bit patterns so that the code won't b
[
all
...]
/external/libvorbis/vq/
bookutil.c
350
long
least
=-1;
local
356
if(
least
==-1 || hist[j]<=
least
){
357
least
=hist[j];
360
least
=-1;
362
if((
least
==-1 || hist[j]<=
least
) && membership[j]!=first){
363
least
=hist[j];
372
least
=hist[first]+hist[second];
376
hist[j]=
least
;
[
all
...]
/external/chromium_org/v8/src/
mark-compact.cc
806
Candidate*
least
= NULL;
local
860
if (
least
== NULL) {
862
if (
least
== NULL ||
863
candidates[i].fragmentation() <
least
->fragmentation()) {
864
least
= candidates + i;
868
if (
least
->fragmentation() < fragmentation) {
869
*
least
= Candidate(fragmentation, p);
870
least
= NULL;
[
all
...]
/external/v8/src/
mark-compact.cc
559
Candidate*
least
= NULL;
local
613
if (
least
== NULL) {
615
if (
least
== NULL ||
616
candidates[i].fragmentation() <
least
->fragmentation()) {
617
least
= candidates + i;
621
if (
least
->fragmentation() < fragmentation) {
622
*
least
= Candidate(fragmentation, p);
623
least
= NULL;
[
all
...]
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
org.apache.jasper_5.5.17.v201004212143.jar
org.eclipse.jdt.core_3.6.2.v_A76_R36x.jar
/prebuilts/misc/common/ecj/
ecj.jar
Completed in 433 milliseconds