OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:SMALLEST
(Results
1 - 25
of
28
) sorted by null
1
2
/external/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/
fx_zlib_trees.c
424
#define
SMALLEST
1
429
* Remove the
smallest
element from the heap and recreate the heap with
434
top = s->heap[
SMALLEST
]; \
435
s->heap[
SMALLEST
] = s->heap[s->heap_len--]; \
436
pqdownheap(s, tree,
SMALLEST
); \
449
* exchanging a node with the
smallest
of its two sons if necessary, stopping
461
/* Set j to the
smallest
of the two sons: */
469
/* Exchange v with the
smallest
son */
629
* heap[
SMALLEST
]. The sons of heap[n] are heap[2*n] and heap[2*n+1].
668
m = s->heap[
SMALLEST
]; /* m = node of next least frequency *
[
all
...]
/external/qemu/distrib/zlib-1.2.8/
trees.c
424
#define
SMALLEST
1
429
* Remove the
smallest
element from the heap and recreate the heap with
434
top = s->heap[
SMALLEST
]; \
435
s->heap[
SMALLEST
] = s->heap[s->heap_len--]; \
436
pqdownheap(s, tree,
SMALLEST
); \
449
* exchanging a node with the
smallest
of its two sons if necessary, stopping
461
/* Set j to the
smallest
of the two sons: */
469
/* Exchange v with the
smallest
son */
629
* heap[
SMALLEST
]. The sons of heap[n] are heap[2*n] and heap[2*n+1].
668
m = s->heap[
SMALLEST
]; /* m = node of next least frequency *
[
all
...]
/external/zlib/src/
trees.c
424
#define
SMALLEST
1
429
* Remove the
smallest
element from the heap and recreate the heap with
434
top = s->heap[
SMALLEST
]; \
435
s->heap[
SMALLEST
] = s->heap[s->heap_len--]; \
436
pqdownheap(s, tree,
SMALLEST
); \
449
* exchanging a node with the
smallest
of its two sons if necessary, stopping
461
/* Set j to the
smallest
of the two sons: */
469
/* Exchange v with the
smallest
son */
629
* heap[
SMALLEST
]. The sons of heap[n] are heap[2*n] and heap[2*n+1].
668
m = s->heap[
SMALLEST
]; /* m = node of next least frequency *
[
all
...]
/external/chromium_org/third_party/zlib/
trees.c
430
#define
SMALLEST
1
435
* Remove the
smallest
element from the heap and recreate the heap with
440
top = s->heap[
SMALLEST
]; \
441
s->heap[
SMALLEST
] = s->heap[s->heap_len--]; \
442
pqdownheap(s, tree,
SMALLEST
); \
455
* exchanging a node with the
smallest
of its two sons if necessary, stopping
467
/* Set j to the
smallest
of the two sons: */
475
/* Exchange v with the
smallest
son */
635
* heap[
SMALLEST
]. The sons of heap[n] are heap[2*n] and heap[2*n+1].
674
m = s->heap[
SMALLEST
]; /* m = node of next least frequency *
[
all
...]
/frameworks/base/core/java/android/webkit/
WebSettings.java
69
* <li>
SMALLEST
is 50%</li>
79
SMALLEST
(50),
[
all
...]
/cts/tests/tests/webkit/src/android/webkit/cts/
WebSettingsTest.java
544
mSettings.setTextSize(TextSize.
SMALLEST
);
545
assertEquals(TextSize.
SMALLEST
, mSettings.getTextSize());
[
all
...]
/packages/apps/Browser/src/com/android/browser/
BrowserSettings.java
200
*
SMALLEST
is 50%
207
case
SMALLEST
:
/external/chromium_org/third_party/libaddressinput/src/java/
android.jar
/external/robolectric/lib/main/
android.jar
/prebuilts/sdk/11/
android.jar
/prebuilts/sdk/12/
android.jar
/prebuilts/sdk/14/
android.jar
/prebuilts/sdk/17/
android.jar
/prebuilts/sdk/18/
android.jar
/prebuilts/sdk/19/
android.jar
/prebuilts/sdk/20/
android.jar
/prebuilts/sdk/21/
android.jar
/prebuilts/sdk/4/
android.jar
/prebuilts/sdk/5/
android.jar
/prebuilts/sdk/6/
android.jar
/prebuilts/sdk/7/
android.jar
/prebuilts/sdk/8/
android.jar
/prebuilts/sdk/9/
android.jar
/prebuilts/sdk/current/
android.jar
/prebuilts/sdk/system_current/
android.jar
Completed in 260 milliseconds
1
2