OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:INDEX
(Results
1 - 7
of
7
) sorted by null
/frameworks/base/media/libstagefright/codecs/m4v_h263/dec/src/
post_proc.h
37
#define
INDEX
(x,thr) (((x)>=thr)?1:0)
/cts/tests/tests/database/src/android/database/cts/
CursorIndexOutOfBoundsExceptionTest.java
44
int
INDEX
= 100;
47
String expected2 = "
Index
" +
INDEX
+ " requested, with a size of " + SIZE;
63
throw new CursorIndexOutOfBoundsException(
INDEX
, SIZE);
/external/bison/src/
relation.c
55
static relation_nodes
INDEX
;
68
INDEX
[i] = height = top;
73
if (
INDEX
[R[i][j]] == 0)
76
if (
INDEX
[i] >
INDEX
[R[i][j]])
77
INDEX
[i] =
INDEX
[R[i][j]];
82
if (
INDEX
[i] == height)
86
INDEX
[j] = infinity;
102
INDEX
= xcalloc (size + 1, sizeof *INDEX)
[
all
...]
/external/zlib/examples/
enough.c
16
Use a macro to compute the history
index
49
has size 1 << (len - root), to
index
the remaining bits in that set of
135
We build the array with length max-1 lists for the len
index
, with syms-3
137
varying in length as a function of sym. See the calculation of
index
in
138
count() for the
index
, and the calculation of size in main() for the size
155
states. mem and rem are used to calculate a single
index
in a triangular
175
/*
Index
function for num[] and done[] */
176
#define
INDEX
(i,j,k) (((size_t)((i-1)>>1)*((i-2)>>1)+(j>>1)-1)*(max-1)+k-1)
207
size_t
index
; /*
index
of this case in *num *
local
257
size_t
index
; \/*
index
for this state's bit vector *\/
local
404
size_t
index
; \/*
index
of this case in *num *\/
local
[
all
...]
/system/media/opensles/tests/sandbox/
intbufq.c
38
#define
INDEX
index
44
#define
INDEX
playIndex
237
printf("\rplayIndex=%u\r\n", (unsigned) bufqstate.
INDEX
);
/external/bluetooth/glib/tests/
queue-test.c
204
PEEK_NTH,
INDEX
, REMOVE, REMOVE_ALL,
471
case
INDEX
:
/frameworks/base/graphics/java/android/renderscript/
Element.java
79
INDEX
(5),
283
return new Element(rs, DataType.UNSIGNED_16, DataKind.
INDEX
, false, 1);
Completed in 563 milliseconds