/external/chromium_org/base/android/ |
jni_array.h | 19 // Returns a new Java byte array converted from the given bytes array. 23 // Returns a new Java long array converted from the given int64 array. 30 // Returns a array of Java byte array converted from |v|. 40 // Converts a Java string array to a native array. 43 jobjectArray array, 48 jobjectArray array, [all...] |
/external/chromium_org/ppapi/cpp/extensions/ |
ext_output_traits.h | 76 // of type T. The PP_Var is used as an output parameter to receive an array var 77 // from the browser. Each element in the array var is converted to a T object, 97 VarArray array(var); 99 uint32_t length = array.GetLength(); 102 FromVarConverter<T> converter(array.Get(i).pp_var());
|
/external/chromium_org/third_party/WebKit/Source/core/inspector/ |
ScriptProfile.cpp | 76 RefPtr<TypeBuilder::Array<TypeBuilder::Profiler::CPUProfileNode> > children = TypeBuilder::Array<TypeBuilder::Profiler::CPUProfileNode>::create(); 100 PassRefPtr<TypeBuilder::Array<int> > ScriptProfile::buildInspectorObjectForSamples() const 102 RefPtr<TypeBuilder::Array<int> > array = TypeBuilder::Array<int>::create(); local 105 array->addItem(m_profile->GetSample(i)->GetNodeId()); 106 return array.release();
|
/external/chromium_org/third_party/WebKit/Source/wtf/ |
Float32Array.h | 38 static inline PassRefPtr<Float32Array> create(const float* array, unsigned length); 41 // Should only be used when it is known the entire array will be filled. Do 75 PassRefPtr<Float32Array> Float32Array::create(const float* array, unsigned length) 77 return TypedArrayBase<float>::create<Float32Array>(array, length);
|
Float64Array.h | 38 static inline PassRefPtr<Float64Array> create(const double* array, unsigned length); 41 // Should only be used when it is known the entire array will be filled. Do 75 PassRefPtr<Float64Array> Float64Array::create(const double* array, unsigned length) 77 return TypedArrayBase<double>::create<Float64Array>(array, length);
|
Uint8ClampedArray.h | 41 static inline PassRefPtr<Uint8ClampedArray> create(const unsigned char* array, unsigned length); 44 // Should only be used when it is known the entire array will be filled. Do 48 // It's only needed to potentially call this method if the array 77 PassRefPtr<Uint8ClampedArray> Uint8ClampedArray::create(const unsigned char* array, unsigned length) 79 return TypedArrayBase<unsigned char>::create<Uint8ClampedArray>(array, length);
|
/external/chromium_org/third_party/icu/source/test/cintltst/ |
sorttest.c | 24 #define LENGTHOF(array) (int32_t)(sizeof(array)/sizeof((array)[0])) 36 /* sort small array (stable) */ 55 /* sort medium array (stable) */ 68 /* sort large array (not stable) */
|
/external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/vega/ |
stroker.h | 35 struct array; 42 struct array *segments; 43 struct array *control_points;
|
/external/chromium_org/third_party/mesa/src/src/mesa/main/ |
arrayobj.c | 57 * Look up the array object for the given ID. 60 * Either a pointer to the array object with the specified ID or \c NULL for 72 _mesa_HashLookup(ctx->Array.Objects, id); 77 * For all the vertex arrays in the array object, unbind any pointers 79 * This is done just prior to array object destruction. 92 * Allocate and initialize a new vertex array object. 108 * Delete an array object. 137 /* Unreference the old array object */ 161 /* reference new array object */ 164 /* this array's being deleted (look just above) * [all...] |
/external/chromium_org/third_party/skia/include/core/ |
SkDataTable.h | 73 * "array". 75 * @param ptrs array of points to each element to be copied into the table. 76 * @param sizes array of byte-lengths for each entry in the corresponding 77 * ptrs[] array. 78 * @param count the number of array elements in ptrs[] and sizes[] to copy. 84 * Return a new table that contains a copy of the data in array. 86 * @param array contiguous array of data for all elements to be copied. 88 * @param count the number of entries to be copied out of array. The number 91 static SkDataTable* NewCopyArray(const void* array, size_t elemSize [all...] |
/external/chromium_org/v8/test/mjsunit/ |
extra-arguments.js | 34 var array = f.arguments; 35 for (var i = 0; i < array.length; i++) { 36 result += array[i]; 45 var array = new Array(i); 49 array[j] = j; 51 assertEquals(expected, f.apply(null, array), String(i));
|
/external/chromium_org/v8/test/mjsunit/regress/ |
regress-crbug-162085.js | 28 // Ensure extending an empty packed smi array with a double initializes the 29 // array with holes. 38 // Ensure the double array growstub initializes the array with holes. 59 // Ensure the double array growstub initializes the array with holes.
|
/external/chromium_org/v8/test/webkit/ |
dfg-abs-backwards-propagation.js | 28 function foo(f, array, i) { 29 return f(array[i]); 37 var f, array, expected; 40 array = "[, 1.5]"; 44 array = "[1.5]"; 47 shouldBe("foo(" + f + ", " + array + ", 0)", expected);
|
dfg-max-backwards-propagation.js | 28 function foo(f, array, i) { 29 return f(array[i], 2.5); 37 var f, array, expected; 40 array = "[, 1.5]"; 44 array = "[1.5]"; 47 shouldBe("foo(" + f + ", " + array + ", 0)", expected);
|
dfg-min-backwards-propagation.js | 28 function foo(f, array, i) { 29 return f(array[i], 2.5); 37 var f, array, expected; 40 array = "[, 1.5]"; 44 array = "[1.5]"; 47 shouldBe("foo(" + f + ", " + array + ", 0)", expected);
|
dfg-proven-sqrt-backwards-propagation.js | 28 function foo(array, i) { 29 var x = array[i]; 40 var array, expected; 42 array = [, 1.5]; 45 array = [1.5]; 48 shouldBe("foo(array, 0)", expected);
|
dfg-sqrt-backwards-propagation.js | 28 function foo(f, array, i) { 29 return f(array[i]); 37 var f, array, expected; 40 array = "[, 1.5]"; 44 array = "[1.5]"; 47 shouldBe("foo(" + f + ", " + array + ", 0)", expected);
|
/external/eigen/test/ |
dontalign.cpp | 43 Scalar* array = internal::aligned_new<Scalar>(rows); local 44 v = VectorType::MapAligned(array, rows); 45 internal::aligned_delete(array, rows);
|
/external/guava/guava-testlib/src/com/google/common/collect/testing/testers/ |
ListAddTester.java | 39 @SuppressWarnings("unchecked") // too many "unchecked generic array creations" 65 E[] array = createArrayWithNullElement(); local 66 collection = getSubjectGenerator().create(array); 69 List<E> expected = Helpers.copyToList(array);
|
/external/icu4c/test/cintltst/ |
sorttest.c | 24 #define LENGTHOF(array) (int32_t)(sizeof(array)/sizeof((array)[0])) 36 /* sort small array (stable) */ 55 /* sort medium array (stable) */ 68 /* sort large array (not stable) */
|
/external/mesa3d/src/gallium/state_trackers/vega/ |
stroker.h | 35 struct array; 42 struct array *segments; 43 struct array *control_points;
|
/external/mesa3d/src/mesa/main/ |
arrayobj.c | 57 * Look up the array object for the given ID. 60 * Either a pointer to the array object with the specified ID or \c NULL for 72 _mesa_HashLookup(ctx->Array.Objects, id); 77 * For all the vertex arrays in the array object, unbind any pointers 79 * This is done just prior to array object destruction. 92 * Allocate and initialize a new vertex array object. 108 * Delete an array object. 137 /* Unreference the old array object */ 161 /* reference new array object */ 164 /* this array's being deleted (look just above) * [all...] |
/external/sfntly/cpp/src/sfntly/data/ |
byte_array.h | 27 // An abstraction to a contiguous array of bytes. 34 // Gets the current filled and readable length of the array. 37 // Gets the maximum size of the array. This is the maximum number of bytes that 38 // the array can hold and all of it may not be filled with data or even fully 42 // Determines whether or not this array is growable or of fixed size. 48 // @param index the index into the byte array 54 // end of the array. 55 // @param index the index into the byte array 62 // that would go past the end of the array. 63 // @param index the index into the byte array [all...] |
/external/skia/include/core/ |
SkDataTable.h | 73 * "array". 75 * @param ptrs array of points to each element to be copied into the table. 76 * @param sizes array of byte-lengths for each entry in the corresponding 77 * ptrs[] array. 78 * @param count the number of array elements in ptrs[] and sizes[] to copy. 84 * Return a new table that contains a copy of the data in array. 86 * @param array contiguous array of data for all elements to be copied. 88 * @param count the number of entries to be copied out of array. The number 91 static SkDataTable* NewCopyArray(const void* array, size_t elemSize [all...] |
/external/smack/src/org/xbill/DNS/ |
Tokenizer.java | 579 * them together, and converts the base64 encoded data to a byte array. 582 * @return The byte array containing the decoded strings, or null if there 596 byte [] array = base64.fromString(s); 597 if (array == null) 599 return array; 604 * them together, and converts the base64 encoded data to a byte array. 605 * @return The byte array containing the decoded strings, or null if there 617 * them together, and converts the hex encoded data to a byte array. 620 * @return The byte array containing the decoded strings, or null if there 634 byte [] array = base16.fromString(s) [all...] |