Searched defs:array (Results 226 - 250 of 627) sorted by relevance

1234567891011>>

/external/eigen/demos/mix_eigen_and_c/
H A Dbinary_library.cpp137 C_Map_MatrixXd* Map_MatrixXd_new(double *array, int rows, int cols) argument
139 return eigen_to_c(*new Map<MatrixXd>(array,rows,cols));
/external/eigen/test/
H A Darray.cpp12 template<typename ArrayType> void array(const ArrayType& m) function
145 // TODO allows colwise/rowwise for array
207 // scalar by array division
243 // min/max with array
265 CALL_SUBTEST_1( array(Array<float, 1, 1>()) );
266 CALL_SUBTEST_2( array(Array22f()) );
267 CALL_SUBTEST_3( array(Array44d()) );
268 CALL_SUBTEST_4( array(ArrayXXcf(internal::random<int>(1,EIGEN_TEST_MAX_SIZE), internal::random<int>(1,EIGEN_TEST_MAX_SIZE))) );
269 CALL_SUBTEST_5( array(ArrayXXf(internal::random<int>(1,EIGEN_TEST_MAX_SIZE), internal::random<int>(1,EIGEN_TEST_MAX_SIZE))) );
270 CALL_SUBTEST_6( array(ArrayXX
[all...]
/external/guava/guava/src/com/google/common/collect/
H A DConcurrentHashMultiset.java190 @Override public <T> T[] toArray(T[] array) { argument
191 return snapshot().toArray(array);
540 @Override public <T> T[] toArray(T[] array) { argument
541 return snapshot().toArray(array);
H A DForwardingCollection.java119 public <T> T[] toArray(T[] array) { argument
120 return delegate().toArray(array);
262 @Beta protected <T> T[] standardToArray(T[] array) { argument
263 return ObjectArrays.toArrayImpl(this, array);
H A DRegularImmutableSortedSet.java150 @Override public <T> T[] toArray(T[] array) { argument
151 return elements.toArray(array);
H A DSortedMultisets.java188 @Override public <T> T[] toArray(T[] array) { argument
189 return standardToArray(array);
/external/guava/guava/src/com/google/common/primitives/
H A DUnsignedInts.java75 * Returns the least value present in {@code array}, treating values as unsigned.
77 * @param array a <i>nonempty</i> array of unsigned {@code int} values
78 * @return the value present in {@code array} that is less than or equal to every other value in
79 * the array according to {@link #compare}
80 * @throws IllegalArgumentException if {@code array} is empty
82 public static int min(int... array) { argument
83 checkArgument(array.length > 0);
84 int min = flip(array[0]);
85 for (int i = 1; i < array
102 max(int... array) argument
122 join(String separator, int... array) argument
[all...]
H A DUnsignedLongs.java76 * Returns the least value present in {@code array}, treating values as unsigned.
78 * @param array a <i>nonempty</i> array of unsigned {@code long} values
79 * @return the value present in {@code array} that is less than or equal to every other value in
80 * the array according to {@link #compare}
81 * @throws IllegalArgumentException if {@code array} is empty
83 public static long min(long... array) { argument
84 checkArgument(array.length > 0);
85 long min = flip(array[0]);
86 for (int i = 1; i < array
103 max(long... array) argument
123 join(String separator, long... array) argument
[all...]
/external/guava/guava-tests/test/com/google/common/collect/
H A DForwardingCollectionTest.java85 @Override public <T> T[] toArray(T[] array) { argument
86 return standardToArray(array);
H A DForwardingSetTest.java93 @Override public <T> T[] toArray(T[] array) { argument
94 return standardToArray(array);
H A DForwardingSortedSetTest.java92 @Override public <T> T[] toArray(T[] array) { argument
93 return standardToArray(array);
/external/icu4c/common/
H A Duarrsort.c57 doInsertionSort(char *array, int32_t start, int32_t limit, int32_t itemSize, argument
62 /* v=array[j] */
63 uprv_memcpy(pv, array+j*itemSize, itemSize);
66 if(/* v>=array[i-1] */ cmp(context, pv, array+(i-1)*itemSize)>=0) {
70 /* array[i]=array[i-1]; */
71 uprv_memcpy(array+i*itemSize, array+(i-1)*itemSize, itemSize);
75 /* array[
82 insertionSort(char *array, int32_t length, int32_t itemSize, UComparator *cmp, const void *context, UErrorCode *pErrorCode) argument
120 subQuickSort(char *array, int32_t start, int32_t limit, int32_t itemSize, UComparator *cmp, const void *context, void *px, void *pw) argument
186 quickSort(char *array, int32_t length, int32_t itemSize, UComparator *cmp, const void *context, UErrorCode *pErrorCode) argument
217 uprv_sortArray(void *array, int32_t length, int32_t itemSize, UComparator *cmp, const void *context, UBool sortStable, UErrorCode *pErrorCode) argument
[all...]
H A Dunistr_cnv.cpp377 UChar *array, *myTarget; local
398 array = getArrayStart();
399 myTarget = array + length();
400 ucnv_toUnicode(converter, &myTarget, array + getCapacity(),
404 setLength((int32_t)(myTarget - array));
/external/jmonkeyengine/engine/src/android/jme3test/android/
H A DR.java11 public static final class array { class in class:R
/external/jmonkeyengine/engine/src/core/com/jme3/animation/
H A DCompactArray.java47 protected float[] array; field in class:CompactArray
51 * Creates a compact array
57 * create array using serialized data
62 this.array = compressedArray;
136 * return a float array of serialized data
141 return array;
145 * serialize this compact array
150 if (array == null || Array.getLength(array) < newSize) {
151 array
[all...]
/external/jmonkeyengine/engine/src/xml/com/jme3/export/xml/
H A DDOMOutputCapsule.java182 int[] array = value[i];
183 write(array, "array_"+i, defVal==null?null:defVal[i]);
269 double[] array = value[i];
270 write(array, "array_"+i, defVal==null?null:defVal[i]);
308 long[] array = value[i];
309 write(array, "array_"+i, defVal==null?null:defVal[i]);
347 short[] array = value[i];
348 write(array, "array_"+i, defVal==null?null:defVal[i]);
386 boolean[] array = value[i];
387 write(array, "array
546 writeSavableArrayList(ArrayList array, String name, ArrayList defVal) argument
608 writeFloatBufferArrayList(ArrayList<FloatBuffer> array, String name, ArrayList<FloatBuffer> defVal) argument
809 writeByteBufferArrayList(ArrayList<ByteBuffer> array, String name, ArrayList<ByteBuffer> defVal) argument
[all...]
/external/mesa3d/src/glsl/
H A Dir_constant_expression.cpp92 /* Handle array operations here, rather than below. */
879 ir_constant *array = this->array->constant_expression_value(); local
882 if ((array != NULL) && (idx != NULL)) {
884 if (array->type->is_matrix()) {
889 const glsl_type *const column_type = array->type->column_type();
902 data.u[i] = array->value.u[mat_idx + i];
908 data.f[i] = array->value.f[mat_idx + i];
918 } else if (array->type->is_vector()) {
921 return new(ctx) ir_constant(array, componen
[all...]
/external/qemu/distrib/sdl-1.2.15/src/video/symbian/EKA1/
H A DSDL_epocevents.cpp442 RArray<TInt> array; local
443 TRAPD(err, ReadL(fs, array));
444 if(err == KErrNone && array.Count() > 0)
450 for(TInt k = 0; k < array.Count(); k+= 2)
452 const TInt oldval = array[k];
453 const TInt newval = array[k + 1];
460 array.Close();
/external/skia/samplecode/
H A DSampleCull.cpp57 SkIPoint* array; local
74 array = new SkIPoint[n];
82 array[n++].set(SkScalarRound(pts[0].fX), SkScalarRound(pts[0].fY));
85 array[n++].set(SkScalarRound(pts[1].fX), SkScalarRound(pts[1].fY));
96 return array;
/external/skia/src/animator/
H A DSkAnimateBase.cpp166 void SkAnimateBase::packARGB(SkScalar array[], int count, SkTDOperandArray* converted) argument
170 SkColor color = SkColorSetARGB(SkScalarRound(array[0]), SkScalarRound(array[1]),
171 SkScalarRound(array[2]), SkScalarRound(array[3]));
H A DSkOperandIterpolator.cpp99 static SkOperand* iset(SkOperand array[3], int a, int b, int c) argument
101 array[0].fScalar = SkIntToScalar(a);
102 array[1].fScalar = SkIntToScalar(b);
103 array[2].fScalar = SkIntToScalar(c);
104 return array;
/external/skia/src/xml/
H A DSkBML_XMLParser.cpp38 static void set(char* array[256], int index, SkStream& s, int data) argument
44 if (array[index] == NULL)
45 array[index] = (char*)sk_malloc_throw(size + 1);
48 if (strlen(array[index]) < size)
49 array[index] = (char*)sk_realloc_throw(array[index], size + 1);
52 s.read(array[index], size);
53 array[index][size] = 0;
56 static void freeAll(char* array[256]) argument
59 sk_free(array[
[all...]
/external/skia/tests/
H A DPathCoverageTest.cpp111 static bool one_d_pe(const int* array, const unsigned int count, argument
114 path[1] = SkPoint::Make(SkIntToScalar(array[0]), SkIntToScalar(array[1]));
115 path[2] = SkPoint::Make(SkIntToScalar(array[2]), SkIntToScalar(array[3]));
120 path[2] = SkPoint::Make(SkIntToScalar(array[i]),
121 SkIntToScalar(array[i+1]));
H A DUtilsTest.cpp79 int i, array[kSEARCH_COUNT]; local
83 array[i] = rand.nextS();
86 SkTHeapSort<int>(array, kSEARCH_COUNT);
89 REPORTER_ASSERT(reporter, array[i-1] <= array[i]);
94 int index = SkTSearch<int>(array, kSEARCH_COUNT, array[i], sizeof(int));
102 int index = SkTSearch<int>(array, kSEARCH_COUNT, value, sizeof(int));
106 index < kSEARCH_COUNT && array[index] == value);
111 REPORTER_ASSERT(reporter, value < array[inde
[all...]
/external/stlport/test/unit/
H A Dalg_test.cpp193 int array[] = {0, 0, 1, 0, 1, 1}; local
194 int* array_end = array + sizeof(array) / sizeof(*array);
195 CPPUNIT_ASSERT(search_n(array, array_end, 3, 1) == array_end);
200 int array[] = {0, 1, 2, 3, 4, 5}; local
201 int* array_end = array + sizeof(array) / sizeof(*array);
202 CPPUNIT_ASSERT( search_n(array, array_en
[all...]

Completed in 452 milliseconds

1234567891011>>