/external/chromium_org/net/third_party/nss/ssl/bodge/ |
H A D | secitem_array.c | 28 SECITEM_AllocArray(PLArenaPool *arena, SECItemArray *array, unsigned int len) argument 37 if (array == NULL) { 47 PORT_Assert(array->items == NULL); 48 result = array; 75 if (array != NULL) { 76 array->items = NULL; 77 array->len = 0; 80 if (result != NULL && array == NULL) { 84 * If array is not NULL, the above has set array 92 secitem_FreeArray(SECItemArray *array, PRBool zero_items, PRBool freeit) argument 118 SECITEM_FreeArray(SECItemArray *array, PRBool freeit) argument 123 SECITEM_ZfreeArray(SECItemArray *array, PRBool freeit) argument [all...] |
/external/chromium_org/ppapi/c/ |
H A D | ppb_var_array.h | 22 * a way to interact with array vars. 32 * Creates an array var, i.e., a <code>PP_Var</code> with type set to 33 * <code>PP_VARTYPE_ARRAY</code>. The array length is set to 0. 35 * @return An empty array var, whose reference count is set to 1 on behalf of 40 * Gets an element from the array. 42 * @param[in] array An array var. 47 * <code>index</code> is larger than or equal to the array length, an 50 struct PP_Var (*Get)(struct PP_Var array, uint32_t index); 52 * Sets the value of an element in the array [all...] |
H A D | ppb_var_array_buffer.h | 60 * @param[in] array The <code>ArrayBuffer</code> whose length should be 68 PP_Bool (*ByteLength)(struct PP_Var array, uint32_t* byte_length); 92 * @param[in] array The <code>ArrayBuffer</code> whose internal buffer should 100 void* (*Map)(struct PP_Var array); 108 * @param[in] array The <code>ArrayBuffer</code> to be released. 110 void (*Unmap)(struct PP_Var array);
|
/external/clang/test/CodeGenCXX/ |
H A D | debug-info-global-ctor-dtor.cpp | 13 A array[2]; variable
|
/external/guava/guava/src/com/google/common/primitives/ |
H A D | Bytes.java | 63 * {@code array}. 65 * @param array an array of {@code byte} values, possibly empty 67 * @return {@code true} if {@code array[i] == target} for some value of {@code 70 public static boolean contains(byte[] array, byte target) { argument 71 for (byte value : array) { 81 * {@code array}. 83 * @param array an array of {@code byte} values, possibly empty 85 * @return the least index {@code i} for which {@code array[ 88 indexOf(byte[] array, byte target) argument 93 indexOf( byte[] array, byte target, int start, int end) argument 114 indexOf(byte[] array, byte[] target) argument 142 lastIndexOf(byte[] array, byte target) argument 147 lastIndexOf( byte[] array, byte target, int start, int end) argument 196 ensureCapacity( byte[] array, int minLength, int padding) argument 265 final byte[] array; field in class:Bytes.ByteArrayAsList 269 ByteArrayAsList(byte[] array) argument 273 ByteArrayAsList(byte[] array, int start, int end) argument [all...] |
/external/jmonkeyengine/engine/src/bullet-native/ |
H A D | com_jme3_bullet_collision_shapes_MeshCollisionShape.cpp | 52 btTriangleIndexVertexArray* array = reinterpret_cast<btTriangleIndexVertexArray*>(arrayId); local 53 btBvhTriangleMeshShape* shape = new btBvhTriangleMeshShape(array, true, true); 64 btTriangleIndexVertexArray* array = reinterpret_cast<btTriangleIndexVertexArray*>(arrayId); local 65 delete(array);
|
/external/chromium_org/v8/test/webkit/ |
H A D | array-enumerators-functions.js | 25 "This test checks the behavior of the various array enumeration functions in certain edge case scenarios" 30 function(elem, index, array) { return currentFunc.call(this, elem, index, array); }, 31 function(elem, index, array) { return currentFunc.call(this, elem, index, array); }, 32 function(elem, index, array) { return currentFunc.call(this, elem, index, array); }, 33 function(elem, index, array) { return currentFunc.call(this, elem, index, array); }, 34 function(prev, elem, index, array) { retur [all...] |
H A D | dfg-arrayify-elimination.js | 31 var array = []; 33 array.unshift(52); 34 foo(array, 1, 2, 3); 36 shouldBe("array", "[52,42,43,44]"); 38 shouldBe("array", "[,42,43,44]");
|
H A D | dfg-cfg-simplify-redundant-dead-get-local.js | 28 var array = []; variable 45 array.push(dist); 53 for (var i = 0; i < array.length; ++i) 54 shouldBe("array[i]", "2.23606797749979");
|
H A D | dfg-put-by-val-setter-then-get-by-val.js | 33 var array = []; variable 35 array.__defineSetter__( 38 array.__defineGetter__( 43 shouldBe("foo(array, -1, i)", "42");
|
H A D | array-every.js | 29 function isBigEnough(element, index, array) { 51 function isBigEnoughAndPop(element, index, array) { 52 array.pop(); 60 function isBigEnoughAndChange(element, index, array) { 61 array[array.length-1-index]= 5; 69 function isBigEnoughAndPush(element, index, array) { 70 array.push(131); 78 function isBigEnoughAndException(element, index, array) { 97 function isBigEnoughShortCircuit(element, index, array) { [all...] |
/external/chromium_org/chrome/installer/mini_installer/ |
H A D | decompress.h | 10 char (&ArraySizeHelper(T (&array)[N]))[N]; 11 #define arraysize(array) (sizeof(ArraySizeHelper(array)))
|
/external/chromium_org/v8/test/mjsunit/regress/ |
H A D | regress-crbug-263276.js | 36 function bad(array) { 37 array[array.length] = 1;
|
H A D | regress-2596.js | 36 var array = [3.5, 3.5]; variable 37 array.__proto__ = prototype; 38 assertTrue(%HasFastDoubleElements(array)); 41 array[index] = doubles[0]; 42 return array[index];
|
/external/dexmaker/src/dx/java/com/android/dx/dex/file/ |
H A D | EncodedArrayItem.java | 24 * Encoded array of constant values. 30 /** {@code non-null;} the array to represent */ 31 private final CstArray array; field in class:EncodedArrayItem 42 * @param array {@code non-null;} array to represent 44 public EncodedArrayItem(CstArray array) { argument 51 if (array == null) { 52 throw new NullPointerException("array == null"); 55 this.array = array; [all...] |
/external/guava/guava-tests/test/com/google/common/io/ |
H A D | IoTestCase.java | 36 /** Returns a byte array of length size that has values 0 .. size - 1. */ 42 * Returns a byte array of length size that has values 46 byte[] array = new byte[size]; 48 array[i] = (byte) (offset + i); 50 return array;
|
/external/icu4c/layoutex/ |
H A D | LXUtilities.h | 20 static le_int32 search(le_int32 value, const le_int32 array[], le_int32 count); 21 static void reverse(le_int32 array[], le_int32 count); 22 static void reverse(float array[], le_int32 count);
|
/external/stlport/test/unit/ |
H A D | unary_test.cpp | 46 int array [3] = { 1, 2, 3 }; local 48 int* p = find_if((int*)array, (int*)array + 3, unary_negate<odd>(odd())); 49 CPPUNIT_ASSERT((p != array + 3)); 54 int array [3] = { 1, 2, 3 }; local 55 int* p = find_if((int*)array, (int*)array + 3, not1(odd())); 56 CPPUNIT_ASSERT(p != array + 3); 66 int array [3] = { 1, 2, 3 }; local 67 int* p = find_if((int*)array, (in [all...] |
/external/chromium_org/v8/test/mjsunit/ |
H A D | undeletable-functions.js | 31 var array; variable 33 array = [ 37 CheckEcmaSemantics(Array.prototype, array, "Array prototype"); 46 array = [ 57 CheckEcmaSemantics(Date.prototype, array, "Date prototype"); 59 array = [ 62 CheckEcmaSemantics(Math, array, "Math1"); 66 array = [ 68 CheckDontDelete(Math, array, "Math2"); 70 array [all...] |
H A D | array-literal-transitions.js | 45 // IC and Crankshaft support for smi-only elements in dynamic array literals. 145 var array = deopt_array(false); 149 array = deopt_array(false); 161 array = deopt_array_literal_all_smis(4); 162 assertEquals(0, array[0]); 163 assertEquals(1, array[1]); 164 assertEquals(4, array[2]); 166 array = deopt_array_literal_all_smis(5); 167 array = deopt_array_literal_all_smis(6); 169 assertEquals(0, array[ [all...] |
/external/v8/test/mjsunit/ |
H A D | undeletable-functions.js | 31 var array; variable 33 array = [ 37 CheckEcmaSemantics(Array.prototype, array, "Array prototype"); 46 array = [ 57 CheckEcmaSemantics(Date.prototype, array, "Date prototype"); 59 array = [ 62 CheckEcmaSemantics(Math, array, "Math1"); 66 array = [ 68 CheckDontDelete(Math, array, "Math2"); 70 array [all...] |
/external/chromium_org/v8/test/mjsunit/compiler/ |
H A D | 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[ [all...] |
/external/v8/test/mjsunit/compiler/ |
H A D | 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[ [all...] |
/external/replicaisland/src/com/replica/replicaisland/ |
H A D | ShellSorter.java | 26 * to pass over the array each time. Currently this function uses Robert Cruse's suggestion 30 public void sort(Type[] array, int count, Comparator<Type> comparator) { argument 36 insertionSort(array, count, start, increment, comparator); 44 insertionSort(array, count, 0, 1, comparator ); 58 public void insertionSort(Type[] array, int count, int start, int increment, argument 67 int delta = comparator.compare(array[j], array[k]); 72 temp = array[j]; 74 array[j] = array[ [all...] |
/external/chromium_org/third_party/npapi/npspy/extern/java/ |
H A D | jritypes.h | 154 ** is to allow Java runtime implementations to optimize boolean array 162 #define JRI_GetByteArrayLength(env, array) \ 163 JRI_GetScalarArrayLength(env, array) 164 #define JRI_GetByteArrayElements(env, array) \ 165 JRI_GetScalarArrayElements(env, array) 169 #define JRI_GetCharArrayLength(env, array) \ 170 JRI_GetScalarArrayLength(env, array) 171 #define JRI_GetCharArrayElements(env, array) \ 172 ((jchar*)JRI_GetScalarArrayElements(env, array)) 176 #define JRI_GetShortArrayLength(env, array) \ [all...] |