Searched defs:array (Results 251 - 275 of 488) sorted by relevance

<<11121314151617181920

/external/icu4c/i18n/
H A Dcsrmbcs.cpp18 #define ARRAY_SIZE(array) (sizeof array / sizeof array[0])
93 static int32_t binarySearch(const uint16_t *array, int32_t len, uint16_t value) argument
99 if(array[mid] == value) {
103 if(array[mid] < value){
H A Dfmtable.cpp69 * Creates a new Formattable array and copies the values from the specified
71 * @param array the original array
72 * @param count the original array count
73 * @return the new Formattable array.
75 static Formattable* createArrayCopy(const Formattable* array, int32_t count) { argument
79 result[i] = array[i]; // Don't memcpy!
229 // Sets each element in the array one by one and records the array count.
561 // Sets the value to an array o
564 setArray(const Formattable* array, int32_t count) argument
587 adoptArray(Formattable* array, int32_t count) argument
831 const Formattable* array; local
[all...]
/external/icu4c/test/cintltst/
H A Duenumtst.c42 char **array; member in struct:chArrayContext
73 cont->currChar = (cont->array)[cont->currIndex];
86 cont->currChar = (cont->array)[cont->currIndex];
147 UChar **array; member in struct:uchArrayContext
170 ucont->currUChar = (ucont->array)[ucont->currIndex];
201 cont->array = (char **)source;
272 ucont->array = (UChar **)source;
/external/icu4c/test/intltest/
H A Dcpdtrtst.cpp248 UnicodeString *array=split(ID, 0x003b, count); local
252 if(child != *(array+i)){
253 errln("Error getTransliterator() failed: Expected->" + *(array+i) + " Got->" + child);
255 logln("OK: getTransliterator() passed: Expected->" + *(array+i) + " Got->" + child);
258 delete []array;
262 array=split(ID2, 0x003b, count);
265 transarray[i]=Transliterator::createInstance(*(array+i), UTRANS_FORWARD, parseError, status);
267 errln("Error could not create Transliterator with ID :"+*(array+i));
315 delete []array;
330 // make an array
[all...]
/external/icu4c/test/letest/
H A Dxmlreader.cpp45 le_uint32 *array = NEW_ARRAY(le_uint32, arraySize); local
61 sscanf(number, "%x", &array[count++]);
77 sscanf(number, "%x", &array[count]);
79 return array;
91 float *array = NEW_ARRAY(float, arraySize); local
107 sscanf(number, "%f", &array[count++]);
127 sscanf(number, "%f", &array[count]);
129 return array;
/external/icu4c/test/perf/DateFmtPerf/
H A DDateFmtPerf.h318 const Formattable* array = f.getArray(count); local
324 result += formattableToString(array[i]);
/external/icu4c/tools/toolutil/
H A Dtoolutil.cpp213 void *array; member in struct:UToolMemory
230 mem->array=mem->staticArray;
243 if(mem->array!=mem->staticArray) {
244 uprv_free(mem->array);
253 return (char *)mem->array;
273 /* try to allocate a larger array */
282 if(mem->array==mem->staticArray) {
283 mem->array=uprv_malloc(newCapacity*mem->size);
284 if(mem->array!=NULL) {
285 uprv_memcpy(mem->array, me
[all...]
/external/javassist/src/main/javassist/bytecode/stackmap/
H A DTypeData.java28 * array type is a subtype of Cloneable and Serializable
40 * @param className dot-separated name unless the type is an array type.
389 * derived as an element type from an array type by AALOAD.
392 TypeData array; field in class:TypeData.ArrayElement
395 array = a;
399 return new ArrayElement(array);
404 array.setType(getArrayType(typeName), cp);
408 String name = array.getName();
417 throw new BadBytecode("bad array type for AALOAD: "
/external/llvm/runtime/libprofile/
H A DPathProfiling.c52 void* array; member in struct:__anon7111
59 /* write an array table to file */
68 /* look through each entry in the array to determine whether the function
71 uint32_t pc = ((uint32_t*)ft->array)[arrayIterator];
164 if( ft[functionNumber-1].array == 0)
165 ft[functionNumber-1].array = calloc(sizeof(pathHashTable_t), 1);
167 hashTable = (pathHashTable_t*)((ftEntry_t*)ft)[functionNumber-1].array;
244 if( ft[i].array ) {
245 writeHashTable(i+1,ft[i].array);
247 free(ft[i].array);
[all...]
/external/mesa3d/src/glsl/
H A Dglsl_types.cpp67 enum glsl_sampler_dim dim, bool shadow, bool array,
72 sampler_array(array), sampler_type(type),
248 glsl_type::glsl_type(const glsl_type *array, unsigned length) : argument
255 this->fields.array = array;
260 this->gl_type = array->gl_type;
262 /* Allow a maximum of 10 characters for the array size. This is enough
266 const unsigned name_length = strlen(array->name) + 10 + 3;
270 snprintf(n, name_length, "%s[]", array->name);
272 snprintf(n, name_length, "%s[%u]", array
66 glsl_type(GLenum gl_type, enum glsl_sampler_dim dim, bool shadow, bool array, unsigned type, const char *name) argument
[all...]
H A Dlower_variable_index_to_cond_assign.cpp27 * Turns non-constant indexing into array types to a series of
43 ir_rvalue* array; member in struct:assignment_generator
58 new(mem_ctx) ir_dereference_array(this->array->clone(mem_ctx, NULL),
97 /* If the array access is a read, read the first element of this subregion
99 * value with one of the other array elements.
239 || !is_array_or_matrix(deref->array))
242 if (deref->array->ir_type == ir_type_constant)
245 const ir_variable *const var = deref->array->variable_referenced();
267 assert(is_array_or_matrix(orig_deref->array));
269 const unsigned length = (orig_deref->array
[all...]
/external/oprofile/opjitconv/
H A Djitsymbol.c53 /* create an array pointing to the jitentry structures which is sorted
58 struct jitentry ** array = local
60 fill_entry_array(array);
61 qsort(array, entry_count, sizeof(struct jitentry *), compare);
62 return array;
88 /* resort address_ascending array */
111 /* Copy address_ascending array to entries_symbols_ascending and resort it. */
129 /* add a new create jitentry to the array. mallocs new arrays if space is
366 * Within the index range (into the array entries_address_ascending), find the
519 * scan through the sorted array an
[all...]
/external/proguard/src/proguard/shrink/
H A DClassShrinker.java128 // Shrink the attributes array.
145 // Shrink the array of InnerClassesInfo objects.
172 // Shrink the attributes array.
181 // Shrink the annotations array.
196 // Shrink the parameter annotations array.
211 // Shrink the element values array.
305 // Shrink the element values array.
363 * from the given array.
366 private int shrinkConstantIndexArray(Constant[] constantPool, int[] array, int length) argument
373 if (usageMarker.isUsed(constantPool[array[inde
395 shrinkToNewArray(Clazz[] array) argument
427 shrinkArray(VisitorAccepter[] array, int length) argument
[all...]
/external/skia/include/core/
H A DSkTDArray.h89 /** Return a ptr to the array of data, to be freed with sk_free. This also
93 T* array = fArray; local
97 return array;
228 // routines to treat the array like a stack
H A DSkTemplates.h81 SkAutoTDeleteArray(T array[]) : fArray(array) {} argument
86 T* detach() { T* array = fArray; fArray = NULL; return array; } local
92 /** Allocate an array of T elements, and free the array in the destructor
110 /** Return the array of T elements. Will be NULL if count == 0
114 /** Return the nth element in the array
155 /** Return the number of T elements in the array
159 /** Return the array o
[all...]
/external/skia/src/animator/
H A DSkMemberInfo.cpp122 SkTDOperandArray* array = (SkTDOperandArray*) memberData(displayable); local
123 byteSize = GetSize(type) * array->count();
165 SkTDScalarArray* array = (SkTDScalarArray* ) dst; local
166 array->setCount(count);
167 dst = (char*) array->begin();
300 // !!! incomplete; create array of appropriate type and add scriptValue to it
433 SkTypedArray* array = scriptValue.fOperand.fArray; local
436 SkASSERT(scriptValue.fType != SkType_Array || (array != NULL &&
437 array->getType() == SkType_Int));
438 int numberOfColors = scriptValue.fType == SkType_Array ? array
[all...]
/external/skia/src/effects/
H A DSkColorMatrixFilter.cpp6 static int32_t rowmul4(const int32_t array[], unsigned r, unsigned g, argument
8 return array[0] * r + array[1] * g + array[2] * b + array[3] * a + array[4];
11 static int32_t rowmul3(const int32_t array[], unsigned r, unsigned g, argument
13 return array[0] * r + array[1] * g + array[
18 const int32_t* SK_RESTRICT array = state->fArray; local
30 const int32_t* SK_RESTRICT array = state->fArray; local
41 const int32_t* SK_RESTRICT array = state->fArray; local
53 const int32_t* SK_RESTRICT array = state->fArray; local
64 const int32_t* SK_RESTRICT array = state->fArray; local
77 const int32_t* SK_RESTRICT array = state->fArray; local
89 const int32_t* SK_RESTRICT array = state->fArray; local
101 const int32_t* SK_RESTRICT array = state->fArray; local
121 int32_t* SK_RESTRICT array = fState.fArray; local
214 SkColorMatrixFilter(const SkScalar array[20]) argument
[all...]
/external/skia/src/xml/
H A DSkXMLWriter.cpp108 const char** array = gEscapeChars; local
111 if (array[i][0] == c)
112 return &array[i][1];
/external/sonivox/arm-fm-22k/lib_src/
H A Deas_chorus.c181 * Purpose: Does fractional array look-up using linear interpolation
187 * array: pointer to array of signed 16 bit values, typically either PCM data or control data
190 * indexLimit: the total size of the array, used to compute buffer wrap
193 * Value from the input array, linearly interpolated between two actual data values
197 static EAS_I16 WeightedTap(const EAS_I16 *array, EAS_I16 indexReference, EAS_I32 indexDesired, EAS_I16 indexLimit) argument
212 //make sure we stay within array bounds, this implements circular buffer
218 //get two adjacent values from the array
219 val1 = array[index];
224 val2 = array[indexLimi
[all...]
/external/sonivox/arm-hybrid-22k/lib_src/
H A Deas_chorus.c181 * Purpose: Does fractional array look-up using linear interpolation
187 * array: pointer to array of signed 16 bit values, typically either PCM data or control data
190 * indexLimit: the total size of the array, used to compute buffer wrap
193 * Value from the input array, linearly interpolated between two actual data values
197 static EAS_I16 WeightedTap(const EAS_I16 *array, EAS_I16 indexReference, EAS_I32 indexDesired, EAS_I16 indexLimit) argument
212 //make sure we stay within array bounds, this implements circular buffer
218 //get two adjacent values from the array
219 val1 = array[index];
224 val2 = array[indexLimi
[all...]
/external/sonivox/arm-wt-22k/lib_src/
H A Deas_chorus.c181 * Purpose: Does fractional array look-up using linear interpolation
187 * array: pointer to array of signed 16 bit values, typically either PCM data or control data
190 * indexLimit: the total size of the array, used to compute buffer wrap
193 * Value from the input array, linearly interpolated between two actual data values
197 static EAS_I16 WeightedTap(const EAS_I16 *array, EAS_I16 indexReference, EAS_I32 indexDesired, EAS_I16 indexLimit) argument
212 //make sure we stay within array bounds, this implements circular buffer
218 //get two adjacent values from the array
219 val1 = array[index];
224 val2 = array[indexLimi
[all...]
/external/stlport/test/unit/
H A Dmap_test.cpp123 pair_type array [] = { local
132 mmap m(array + 0, array + 6);
167 pair_type array [] = { local
176 mmap m(array+0, array + 6);
H A Dvector_test.cpp179 int array [] = { 1, 4, 9, 16 }; local
181 vector<int> v(array, array + 4);
193 int array [] = { 1, 4, 9, 16, 25, 36 }; local
195 vector<int> v(array, array + 6);
449 int array[] = { 1, 2, 3, 4, 5 }; local
451 v.assign( array, array + 5 );
/external/v8/src/
H A Dserialize.h117 SnapshotByteSource(const byte* array, int length) argument
118 : data_(array), length_(length), position_(0) { }
192 kRootArray = 0x9, // Object is found in root array.
/external/v8/test/cctest/
H A Dtest-accessors.cc145 v8::Handle<v8::Array> array = v8::Handle<v8::Array>::Cast(CompileRun( local
153 CHECK_EQ(10, array->Length());
155 v8::Handle<Value> entry = array->Get(v8::Integer::New(i));

Completed in 2948 milliseconds

<<11121314151617181920