| /external/apache-harmony/nio/src/test/java/common/org/apache/harmony/nio/tests/java/nio/ |
| FloatBufferTest.java | 51 float array[] = buf.array(); local
52 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity());
54 loadTestData1(array, buf.arrayOffset(), buf.capacity());
55 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity());
57 loadTestData2(array, buf.arrayOffset(), buf.capacity());
58 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity());
61 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity());
64 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity());
68 float array[] = buf.array() local
277 float array[] = new float[1]; local
306 float array[] = new float[buf.capacity()]; local
440 float array[] = new float[1]; local
469 float array[] = new float[buf.capacity()]; local
655 assertEquals(buf.get(i), array[offset + i], 0.01); local
[all...] |
| IntBufferTest.java | 51 int array[] = buf.array(); local
52 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity());
54 loadTestData1(array, buf.arrayOffset(), buf.capacity());
55 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity());
57 loadTestData2(array, buf.arrayOffset(), buf.capacity());
58 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity());
61 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity());
64 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity());
68 int array[] = buf.array() local
257 int array[] = new int[1]; local
284 int array[] = new int[buf.capacity()]; local
416 int array[] = new int[1]; local
445 int array[] = new int[buf.capacity()]; local
631 assertEquals(buf.get(i), array[offset + i]); local
[all...] |
| DoubleBufferTest.java | 75 double array[] = buf.array(); local
76 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity());
78 loadTestData1(array, buf.arrayOffset(), buf.capacity());
79 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity());
81 loadTestData2(array, buf.arrayOffset(), buf.capacity());
82 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity());
85 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity());
88 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity());
92 double array[] = buf.array() local
287 double array[] = new double[1]; local
308 double array[] = new double[buf.capacity()]; local
440 double array[] = new double[1]; local
463 double array[] = new double[buf.capacity()]; local
645 assertEquals(buf.get(i), array[offset + i], 0.01); local
[all...] |
| ShortBufferTest.java | 50 short array[] = buf.array(); local
51 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity());
53 loadTestData1(array, buf.arrayOffset(), buf.capacity());
54 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity());
56 loadTestData2(array, buf.arrayOffset(), buf.capacity());
57 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity());
60 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity());
63 assertContentEquals(buf, array, buf.arrayOffset(), buf.capacity());
67 short array[] = buf.array() local
256 short array[] = new short[1]; local
277 short array[] = new short[buf.capacity()]; local
403 short array[] = new short[1]; local
432 short array[] = new short[buf.capacity()]; local
618 assertEquals(buf.get(i), array[offset + i]); local
[all...] |
| /external/apache-harmony/support/src/test/java/tests/support/ |
| Support_Proxy_I1.java | 23 int[] array(long[] f); method in interface:Support_Proxy_I1
|
| /external/ceres-solver/include/ceres/internal/ |
| macros.h | 66 // The arraysize(arr) macro returns the # of elements in an array arr.
71 // One caveat is that arraysize() doesn't accept any array of an
81 char (&ArraySizeHelper(T (&array)[N]))[N];
88 char (&ArraySizeHelper(const T (&array)[N]))[N];
91 #define arraysize(array) (sizeof(ArraySizeHelper(array)))
113 // the array) and sizeof(*(arr)) (the # of bytes in one array
115 // indeed an array, in which case the division result is the # of
116 // elements in the array. Otherwise, arr cannot possibly be an array
[all...] |
| /external/clang/test/Analysis/ |
| misc-ps-cxx0x.cpp | 52 int array[2] = { 1, 2 }; local
54 for ( int i : array )
61 int array[2] = { 1, 2 }; local
63 for (int i : array)
|
| /external/clang/test/CodeGen/ |
| 2009-03-08-ZeroEltStructCrash.c | 10 int *array = u->contents.zero_arr; local
|
| /external/eigen/doc/snippets/ |
| PartialRedux_count.cpp | 3 cout << "Here is the count of elements larger or equal than 0.5 of each row:" << endl << (m.array() >= 0.5).rowwise().count() << endl;
|
| /external/eigen/test/ |
| nesting_ops.cpp | 30 VERIFY_IS_APPROX( (m.transpose() * m).diagonal().array().abs().sum(), (m.transpose() * m).diagonal().array().abs().sum() );
32 VERIFY_IS_APPROX( (m.transpose() * m).array().abs().sum(), (m.transpose() * m).array().abs().sum() );
|
| /external/embunit/inc/ |
| HelperMacro.h | 41 #define EMB_UNIT_TESTSUITE(su,name,array) \
42 static const TestSuite su = new_TestSuite(name,(Test**)array,sizeof(array)/sizeof(array[0]))
|
| /external/guava/guava-testlib/src/com/google/common/collect/testing/testers/ |
| ListCreationTester.java | 39 E[] array = createSamplesArray(); local
40 array[1] = samples.e0;
41 collection = getSubjectGenerator().create(array);
43 expectContents(array);
|
| /external/icu4c/common/ |
| uarrsort.c | 57 doInsertionSort(char *array, int32_t start, int32_t limit, int32_t itemSize,
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[i]=v; *
[all...] |
| /external/replicaisland/src/com/replica/replicaisland/ |
| Sorter.java | 22 public abstract void sort(Type[] array, int count, Comparator<Type> comparator);
|
| /external/skia/src/core/ |
| SkTSort.h | 29 /* Sifts a broken heap. The input array is a heap from root to bottom
32 * Sinks a hole from array[root] to leaf and then sifts the original array[root] element
40 * @param root the one based index into array of the out-of-place root of the heap.
41 * @param bottom the one based index in the array of the last entry in the heap.
44 void SkTHeapSort_SiftUp(T array[], size_t root, size_t bottom, C lessThan) {
45 T x = array[root-1];
49 if (j < bottom && lessThan(array[j-1], array[j])) {
52 array[root-1] = array[j-1]
[all...] |
| /external/webkit/Source/JavaScriptCore/tests/mozilla/ecma/Array/ |
| 15.4.2.1-2.js | 24 ECMA Section: 15.4.2.1 new Array( item0, item1, ... )
29 object is set to the original Array prototype object,
30 the one that is the initial value of Array.prototype
34 is set to "Array".
52 var TITLE = "The Array Constructor: new Array( item0, item1, ...)";
61 var array = new Array();
63 var TEST_STRING = "new Array(";
77 array[item] = new TestCase( SECTION, "["+item+"]", item, TEST_ARRAY[item] )
[all...] |
| /external/webkit/Source/JavaScriptCore/tests/mozilla/ecma/Boolean/ |
| 15.6.3.1-4.js | 48 var array = new Array();
53 array[item++] = new TestCase( SECTION,
58 array[item++] = new TestCase( SECTION,
63 return ( array );
|
| 15.6.3.1.js | 51 var array = new Array();
54 array[item++] = new TestCase( SECTION, "Boolean.prototype.valueOf()", false, Boolean.prototype.valueOf() );
55 array[item++] = new TestCase( SECTION, "Boolean.length", 1, Boolean.length );
57 return ( array );
|
| 15.6.3.js | 47 var array = new Array();
50 array[item++] = new TestCase( SECTION, "Boolean.__proto__ == Function.prototype", true, Boolean.__proto__ == Function.prototype );
51 array[item++] = new TestCase( SECTION, "Boolean.length", 1, Boolean.length );
53 return ( array );
|
| 15.6.4.2-3.js | 47 var array = new Array();
50 array[item++] = new TestCase( SECTION, "tostr=Boolean.prototype.toString; x=true; x.toString=tostr;x.toString()", "true", eval("tostr=Boolean.prototype.toString; x=true; x.toString=tostr;x.toString()") );
51 array[item++] = new TestCase( SECTION, "tostr=Boolean.prototype.toString; x=false; x.toString=tostr;x.toString()", "false", eval("tostr=Boolean.prototype.toString; x=false; x.toString=tostr;x.toString()") );
53 return ( array );
|
| 15.6.4.3-2.js | 47 var array = new Array();
50 array[item++] = new TestCase( SECTION, "valof=Boolean.prototype.valueOf; x=new Boolean(); x.valueOf=valof;x.valueOf()", false, eval("valof=Boolean.prototype.valueOf; x=new Boolean(); x.valueOf=valof;x.valueOf()") );
51 array[item++] = new TestCase( SECTION, "valof=Boolean.prototype.valueOf; x=new Boolean(true); x.valueOf=valof;x.valueOf()", true, eval("valof=Boolean.prototype.valueOf; x=new Boolean(true); x.valueOf=valof;x.valueOf()") );
52 return ( array );
|
| /external/webkit/Source/JavaScriptCore/tests/mozilla/ecma/FunctionObjects/ |
| 15.3.3.1-2.js | 50 var array = new Array();
52 array[item++] = new TestCase( SECTION,
57 return ( array );
59 function test( array ) {
|
| 15.3.4.1.js | 44 var array = new Array();
47 array[item++] = new TestCase( SECTION, "Function.prototype.constructor", Function, Function.prototype.constructor );
49 return ( array );
51 function test( array ) {
|
| /external/webkit/Source/JavaScriptCore/tests/mozilla/ecma/LexicalConventions/ |
| 7.2-6.js | 50 var array = new Array();
53 array[item++] = new TestCase( SECTION, "var a\u000Ab = 5; ab=10;ab;", 10, eval("var a\nb = 5; ab=10;ab") );
54 array[item++] = new TestCase( SECTION, "var a\u000Db = 5; ab=10;b;", 5, eval("var a\nb = 5; ab=10;b") );
55 return ( array );
|
| 7.5-1.js | 44 var array = new Array();
47 array[item++] = new TestCase( SECTION, "var $123 = 5", 5, eval("var $123 = 5;$123") );
48 array[item++] = new TestCase( SECTION, "var _123 = 5", 5, eval("var _123 = 5;_123") );
50 return ( array );
|
