Searched defs:array (Results 26 - 50 of 1079) sorted by relevance

1234567891011>>

/external/chromium_org/v8/test/webkit/
H A Ddfg-put-by-val-setter-then-get-by-val.js33 var array = []; variable
35 array.__defineSetter__(
38 array.__defineGetter__(
43 shouldBe("foo(array, -1, i)", "42");
/external/clang/test/CodeGen/
H A D2003-07-22-ArrayAccessTypeSafety.c4 void test(int* array, long long N) { argument
5 array[N] = N[array] = 33;
H A D2004-03-09-LargeArrayInitializers.c9 const int array[] = { local
31 return array[x];
/external/clang/test/CodeGenCXX/
H A D2005-02-13-BadDynamicInit.cpp5 unsigned array[1]; member in struct:Data
9 Data shared_null = { shared_null.array };
/external/clang/test/Sema/
H A Dinvalid-cast.cpp6 T array; member in struct:X
10 return x0.array[17];
H A Daddress-constant.c8 int *array[] = {&i, a, &s.i}; variable
/external/clang/test/SemaCXX/
H A Dparentheses.cpp5 bool test(Foo f, int *array) argument
7 return false && false || array[f.get()]; // expected-warning {{'&&' within '||'}} expected-note {{parentheses}}
H A Dstatic-array-member.cpp4 static int array[]; member in struct:X0
10 int X0::array[sizeof(X0) * 2]; member in class:X0
14 static T array[]; member in struct:X1
18 T X1<T, N>::array[N]; member in class:X1
/external/stlport/test/unit/
H A Dbnegate_test.cpp32 int array [4] = { 4, 9, 7, 1 }; local
34 sort(array, array + 4, binary_negate<greater<int> >(greater<int>()));
35 CPPUNIT_ASSERT(array[0]==1);
36 CPPUNIT_ASSERT(array[1]==4);
37 CPPUNIT_ASSERT(array[2]==7);
38 CPPUNIT_ASSERT(array[3]==9);
42 int array [4] = { 4, 9, 7, 1 }; local
43 sort(array, array
[all...]
H A Dgreater_test.cpp33 int array[4] = { 3, 1, 4, 2 }; local
34 sort(array, array + 4, greater<int>() );
36 CPPUNIT_ASSERT(array[0]==4);
37 CPPUNIT_ASSERT(array[1]==3);
38 CPPUNIT_ASSERT(array[2]==2);
39 CPPUNIT_ASSERT(array[3]==1);
43 int array [4] = { 3, 1, 4, 2 }; local
44 sort(array, array
[all...]
H A Dless_test.cpp33 int array [4] = { 3, 1, 4, 2 }; local
34 sort(array, array + 4, less<int>());
36 CPPUNIT_ASSERT(array[0]==1);
37 CPPUNIT_ASSERT(array[1]==2);
38 CPPUNIT_ASSERT(array[2]==3);
39 CPPUNIT_ASSERT(array[3]==4);
43 int array [4] = { 3, 1, 4, 2 }; local
44 sort(array, array
[all...]
H A Dbinsert_test.cpp32 const char* array [] = { "laurie", "jennifer", "leisa" }; local
35 bit = copy(array, array + 3, bit);
37 CPPUNIT_ASSERT(!strcmp(names[0],array[0]));
38 CPPUNIT_ASSERT(!strcmp(names[1],array[1]));
39 CPPUNIT_ASSERT(!strcmp(names[2],array[2]));
41 copy(array, array + 3, bit);
42 CPPUNIT_ASSERT(!strcmp(names[3],array[0]));
43 CPPUNIT_ASSERT(!strcmp(names[4],array[
48 const char* array [] = { "laurie", "jennifer", "leisa" }; local
[all...]
H A Dfinsert_test.cpp33 char const* array [] = { "laurie", "jennifer", "leisa" }; local
36 fit = copy(array, array + 3, front_insert_iterator<deque <char const*> >(names));
38 CPPUNIT_ASSERT(names[0]==array[2]);
39 CPPUNIT_ASSERT(names[1]==array[1]);
40 CPPUNIT_ASSERT(names[2]==array[0]);
42 copy(array, array + 3, fit);
43 CPPUNIT_ASSERT(names[3]==array[2]);
44 CPPUNIT_ASSERT(names[4]==array[
50 char const* array [] = { "laurie", "jennifer", "leisa" }; local
[all...]
H A Dostmit_test.cpp34 int array [] = { 1, 5, 2, 4 }; local
47 copy(array, array + 4, iter2);
/external/chromium_org/v8/test/mjsunit/
H A Darray-push7.js9 function push_wrapper(array, value) {
10 array.push(value);
12 function pop_wrapper(array) {
13 return array.pop();
18 var array = []; variable
24 Object.observe(array, somethingChanged);
25 push_wrapper(array, 1);
27 assertEquals(1, array.length);
29 push_wrapper(array, 1);
31 assertEquals(2, array
[all...]
/external/chromium_org/v8/test/mjsunit/regress/
H A Dregress-1160.js30 // Array.prototype.join uses a temporary array internally. Verify it
32 // when keyed store on the array does not work as expected because of
36 var array = Array(N); variable
38 array[i] = i;
41 assertEquals("0,1,2,3,4,5,6,7,8,9", array.join(","));
/external/clang/test/CXX/expr/expr.prim/expr.prim.lambda/
H A Dp15.cpp9 int array[3]; local
12 (void)[&array] () -> void {};
/external/clang/test/CXX/temp/temp.spec/temp.expl.spec/
H A Dp9.cpp14 int array[NumElements]; member in class:N::Y
/external/ceres-solver/internal/ceres/
H A Darray_utils_test.cc76 vector<int> array; local
77 array.push_back(0);
78 array.push_back(1);
79 vector<int> expected = array;
80 MapValuesToContiguousRange(array.size(), &array[0]);
81 EXPECT_EQ(array, expected);
82 array.clear();
84 array.push_back(1);
85 array
92 vector<int> array; local
103 vector<int> array; local
[all...]
/external/chromium_org/third_party/icu/source/common/
H A Dunistr_props.cpp33 UChar *array = getArrayStart(); local
44 U16_PREV(array, 0, i, c);
61 U16_NEXT(array, i, length, c);
/external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/vega/
H A Dpolygon.h35 struct array;
68 struct array *array; member in struct:polygon_array
/external/chromium_org/third_party/mesa/src/src/mesa/main/
H A Dvarray.h39 * Compute the index of the last array element that can be safely accessed in
40 * a vertex array. We can really only do this when the array lives in a VBO.
41 * The array->_MaxElement field will be updated.
45 _mesa_update_array_max_element(struct gl_client_array *array) argument
47 assert(array->Enabled);
49 if (array->BufferObj->Name) {
50 GLsizeiptrARB offset = (GLsizeiptrARB) array->Ptr;
51 GLsizeiptrARB bufSize = (GLsizeiptrARB) array->BufferObj->Size;
54 array
[all...]
/external/chromium_org/third_party/skia/include/utils/
H A DSkDebugUtils.h25 inline void SkDebugDumpMathematica(const char *name, const T *array, int size) { argument
29 SkDebugDumpMathematica<T>(array[i]);
36 inline void SkDebugDumpMathematica(const char *name, const T *array, int width, int height) { argument
42 SkDebugDumpMathematica<T>(array[i*width + j]);
/external/chromium_org/third_party/skia/tests/
H A DGrTBSearchTest.cpp26 const int array[] = { local
30 for (int n = 0; n < static_cast<int>(SK_ARRAY_COUNT(array)); ++n) {
32 int index = GrTBSearch<int, int>(array, n, array[i]);
34 index = GrTBSearch<int, int>(array, n, -array[i]);
/external/chromium_org/third_party/webrtc/modules/audio_coding/codecs/ilbc/
H A Dnearest_neighbor.c22 * Find index in array such that the array element with said
23 * index is the element of said array closest to "value"
28 int16_t *index, /* (o) index of array element closest to value */
29 int16_t *array, /* (i) data array (Q2) */
31 int16_t arlength /* (i) dimension of data array (==8) */
40 diff=array[i]-value;
27 WebRtcIlbcfix_NearestNeighbor( int16_t *index, int16_t *array, int16_t value, int16_t arlength ) argument

Completed in 4290 milliseconds

1234567891011>>