| /external/webkit/Source/JavaScriptCore/tests/mozilla/ecma/NativeObjects/ |
| 15-1.js | 50 var array = new Array();
53 array[item++] = new TestCase( SECTION, "Function.prototype.__proto__", Object.prototype, Function.prototype.__proto__ );
54 array[item++] = new TestCase( SECTION, "Array.prototype.__proto__", Object.prototype, Array.prototype.__proto__ );
55 array[item++] = new TestCase( SECTION, "String.prototype.__proto__", Object.prototype, String.prototype.__proto__ );
56 array[item++] = new TestCase( SECTION, "Boolean.prototype.__proto__", Object.prototype, Boolean.prototype.__proto__ );
57 array[item++] = new TestCase( SECTION, "Number.prototype.__proto__", Object.prototype, Number.prototype.__proto__ );
58 // array[item++] = new TestCase( SECTION, "Math.prototype.__proto__", Object.prototype, Math.prototy (…)
[all...] |
| /external/jmonkeyengine/engine/src/core/com/jme3/scene/shape/ |
| Curve.java | 98 float[] array = new float[((spline.getControlPoints().size() - 1) * nbSubSegments + 1) * 3]; local
104 array[i] = vector3f.x;
106 array[i] = vector3f.y;
108 array[i] = vector3f.z;
113 array[i] = temp.getX();
115 array[i] = temp.getY();
117 array[i] = temp.getZ();
136 this.setBuffer(VertexBuffer.Type.Position, 3, array);
155 float[] array = new float[((centerPointsAmount - 1) * nbSubSegments + 1) * 3]; local
161 array[lineIndex++] = vector3f.x
204 float[] array = new float[(nbSubSegments + 1) * 3]; local
232 float[] array = new float[spline.getControlPoints().size() * 3]; local
[all...] |
| /cts/tests/tests/jni/src/android/jni/cts/ |
| JniStaticTest.java | 108 short[] array = StaticNonce.returnShortArray(); local
109 assertSame(short[].class, array.getClass());
110 assertEquals(3, array.length);
111 assertEquals(10, array[0]);
112 assertEquals(20, array[1]);
113 assertEquals(30, array[2]);
120 String[] array = StaticNonce.returnStringArray(); local
121 assertSame(String[].class, array.getClass());
122 assertEquals(100, array.length);
123 assertEquals("blort", array[0])
[all...] |
| /external/webkit/Source/JavaScriptCore/tests/mozilla/ecma/Expressions/ |
| 11.6.1-3.js | 85 var array = new Array();
94 array[item++] = new TestCase( SECTION,
99 array[item++] = new TestCase( SECTION,
104 array[item++] = new TestCase( SECTION,
109 array[item++] = new TestCase( SECTION,
114 array[item++] = new TestCase( SECTION,
119 array[item++] = new TestCase( SECTION,
129 array[item++] = new TestCase( SECTION,
134 array[item++] = new TestCase( SECTION
[all...] |
| 11.13.1.js | 50 var array = new Array();
53 array[item++] = new TestCase( SECTION, "SOMEVAR = true", true, SOMEVAR = true );
56 return ( array );
|
| /external/v8/test/mjsunit/ |
| external-array.js | 109 var array = new Float64Array(2);
111 set(array, 0, 2.5);
112 assertEquals(2.5, array[0]);
115 set(array, 0, 2.5);
116 assertEquals(2.5, array[0]);
117 set(array, 1, 3.5);
118 assertEquals(3.5, array[1]);
120 assertEquals(2.5, get(array, 0));
121 assertEquals(3.5, array[1]);
124 assertEquals(2.5, get(array, 0))
[all...] |
| /external/skia/bench/ |
| SortBench.cpp | 23 static void rand_proc(int array[], int count) {
26 array[i] = rand.nextS();
30 static void randN_proc(int array[], int count) {
34 array[i] = rand.nextU() % mod;
38 static void forward_proc(int array[], int count) {
40 array[i] = i;
44 static void backward_proc(int array[], int count) {
46 array[i] = -i;
50 static void same_proc(int array[], int count) {
52 array[i] = count
[all...] |
| /external/apache-harmony/nio/src/test/java/common/org/apache/harmony/nio/tests/java/nio/ |
| WrappedByteBufferTest.java | 40 byte array[] = new byte[BUFFER_LENGTH];
42 ByteBuffer.wrap(array, -1, 0);
48 ByteBuffer.wrap(array, BUFFER_LENGTH + 1, 0);
54 ByteBuffer.wrap(array, 0, -1);
60 ByteBuffer.wrap(array, 0, BUFFER_LENGTH + 1);
66 ByteBuffer.wrap(array, 1, Integer.MAX_VALUE);
72 ByteBuffer.wrap(array, Integer.MAX_VALUE, 1);
|
| /external/guava/guava-testlib/src/com/google/common/collect/testing/testers/ |
| ListRetainAllTester.java | 41 E[] array = createSamplesArray(); local
42 array[1] = samples.e0;
43 collection = getSubjectGenerator().create(array);
46 expectContents(array);
53 E[] array = createSamplesArray(); local
54 array[1] = samples.e0;
55 collection = getSubjectGenerator().create(array);
|
| /external/jmonkeyengine/engine/src/core/com/jme3/util/ |
| SafeArrayList.java | 40 * direct access to the current array. This List allows modification of the
43 * array is only presenting a snap shot and so can be safely iterated while
56 * as the array can be accessed directly.</p>
102 return (T[])java.lang.reflect.Array.newInstance(type, size);
110 * Returns a current snapshot of this List's backing array that
112 * Changes to this array may or may not be reflected in the list and
122 // Only keep the array or the buffer but never both at
138 // Only keep the array or the buffer but never both at
169 E[] array = getArray(); local
170 if (a.length < array.length)
249 E[] array = getArray(); local
281 E[] array = getArray(); local
295 E[] array = getArray(); local
325 E[] array = getArray(); local
343 private E[] array; field in class:SafeArrayList.ArrayIterator
[all...] |
| /external/libvpx/libvpx/examples/includes/geshi/geshi/ |
| z80.php | 46 $language_data = array (
48 'COMMENT_SINGLE' => array(1 => ';'),
49 'COMMENT_MULTI' => array(),
51 'QUOTEMARKS' => array("'", '"'),
53 'KEYWORDS' => array(
55 1 => array(
66 2 => array(
72 3 => array(
77 'SYMBOLS' => array(
80 'CASE_SENSITIVE' => array(
[all...] |
| /external/quake/tools/ |
| dumpms2.py | 22 import array namespace
26 a = array.array('i')
31 a = array.array('f')
43 vertexOrder = array.array('i')
|
| /external/webkit/Source/JavaScriptCore/tests/mozilla/ecma/Date/ |
| 15.9.2.2-2.js | 45 // all tests must call a function that returns an array of TestCase objects.
49 var array = new Array();
53 array[item++] = new TestCase( SECTION, "Date(1999,11,15,59,59)", (new Date()).toString(), Date(1999,11,15,59,59));
54 array[item++] = new TestCase( SECTION, "Date(1999,11,16,0,0,0)", (new Date()).toString(), Date(1999,11,16,0,0,0));
55 array[item++] = new TestCase( SECTION, "Date(1999,11,31,23,59,59)", (new Date()).toString(), Date(1999,11,31,23,59,59) );
56 array[item++] = new TestCase( SECTION, "Date(2000,0,1,0,0,0)", (new Date()).toString(), Date(2000,0,0,0,0,0) );
57 array[item++] = new TestCase( SECTION, "Date(2000,0,1,0,0,1)", (new Date()).toString(), Date(2000,0,0,0,0,1) );
62 array[item++] = new TestCase( SECTION, "Date(1899,11,31,23,59,59)", (new Date()).toString(), Date(1899,11,31,23,59,59));
63 array[item++] = new TestCase( SECTION, "Date(1900,0,1,0,0,0)", (new Date()).toString(), Date (…)
[all...] |
| /external/guava/guava/src/com/google/common/primitives/ |
| generate.sh | 136 * {@code array}.
138 * @param array an array of {@code primtyp} values, possibly empty
140 * @return {@code true} if {@code array[i] == target} for some value of {@code
143 public static boolean contains(primtyp[] array, primtyp target) {
144 for (primtyp value : array) {
154 * {@code array}.
156 * @param array an array of {@code primtyp} values, possibly empty
158 * @return the least index {@code i} for which {@code array[i] == target}, o
[all...] |
| /external/eigen/unsupported/test/ |
| mpreal_support.cpp | 31 VERIFY(Eigen::internal::isApprox(A.array().abs2().sum(), A.squaredNorm()));
32 VERIFY_IS_APPROX(A.array().exp(), exp(A.array()));
33 VERIFY_IS_APPROX(A.array().abs2().sqrt(), A.array().abs());
34 VERIFY_IS_APPROX(A.array().sin(), sin(A.array()));
35 VERIFY_IS_APPROX(A.array().cos(), cos(A.array()));
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.sort/partial.sort/ |
| partial_sort_comp.pass.cpp | 38 int* array = new int[N]; local
40 array[i] = i;
41 std::random_shuffle(array, array+N);
42 std::partial_sort(array, array+M, array+N, std::greater<int>());
44 assert(array[i] == N-i-1);
45 delete [] array;
|
| /external/clang/test/PCH/ |
| objc_container.h | 14 NSMutableArray *array; local
15 id oldObject = array[10];
17 array[10] = oldObject;
|
| /external/eigen/doc/examples/ |
| Tutorial_ArrayClass_interop_matrix.cpp | 20 result = m.array() * n.array();
21 cout << "-- Array m*n: --" << endl << result << endl << endl;
24 result = m.array() + 4;
25 cout << "-- Array m + 4: --" << endl << result << endl << endl;
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| UnmodifiableIteratorTest.java | 35 final String[] array = {"a", "b", "c"}; local
41 return i < array.length;
48 return array[i++];
|
| /external/icu4c/common/ |
| unistr_props.cpp | 33 UChar *array = getArrayStart(); local
44 U16_PREV(array, 0, i, c);
61 U16_NEXT(array, i, length, c);
|
| /external/icu4c/layout/ |
| OpenTypeUtilities.h | 25 static le_int32 search(le_uint16 value, const le_uint16 array[], le_int32 count);
26 static le_int32 search(le_uint32 value, const le_uint32 array[], le_int32 count);
27 static void sort(le_uint16 *array, le_int32 count);
|
| /external/jmonkeyengine/engine/src/bullet-native/ |
| com_jme3_bullet_collision_shapes_HullCollisionShape.cpp | 50 (JNIEnv *env, jobject object, jobject array) {
52 float* data = (float*) env->GetDirectBufferAddress(array);
54 int length = env->GetDirectBufferCapacity(array)/4;
|
| /external/stlport/test/unit/ |
| ostmit_test.cpp | 34 int array [] = { 1, 5, 2, 4 }; local
47 copy(array, array + 4, iter2);
|
| /external/v8/test/mjsunit/compiler/ |
| literals-optimized.js | 30 // Test optimized versions of array and object literals.
40 // Test shallow array literal.
44 function verify_arr_shallow(array, a, b, c) {
45 assertSame(6, array.length);
46 assertSame(0, array[0]);
47 assertSame(a, array[1]);
48 assertSame(0, array[2]);
49 assertSame(b, array[3]);
50 assertSame(0, array[4]);
51 assertSame(c, array[5])
[all...] |
| /external/valgrind/main/drd/tests/ |
| annotate_barrier.c | 45 int* array; member in struct:threadinfo
102 * Single thread, which touches p->iterations elements of array p->array.
103 * Each modification of an element of p->array is a data race.
108 int* const array = p->array; local
117 p->thread_num, i + 1, &array[i]);
118 array[i] = i;
131 int* array; local
134 array = malloc(iterations * sizeof(array[0]))
[all...] |
