| /external/stlport/test/unit/ |
| bnegate_test.cpp | 32 int array [4] = { 4, 9, 7, 1 }; local
34 sort(array, array + 4, binary_negate<greater<int> >(greater<int>()));
35 CPPUNIT_ASSERT(array[0]==1);
36 CPPUNIT_ASSERT(array[1]==4);
37 CPPUNIT_ASSERT(array[2]==7);
38 CPPUNIT_ASSERT(array[3]==9);
42 int array [4] = { 4, 9, 7, 1 }; local
43 sort(array, array + 4, not2(greater<int>()))
[all...] |
| greater_test.cpp | 33 int array[4] = { 3, 1, 4, 2 }; local
34 sort(array, array + 4, greater<int>() );
36 CPPUNIT_ASSERT(array[0]==4);
37 CPPUNIT_ASSERT(array[1]==3);
38 CPPUNIT_ASSERT(array[2]==2);
39 CPPUNIT_ASSERT(array[3]==1);
43 int array [4] = { 3, 1, 4, 2 }; local
44 sort(array, array + 4, greater_equal<int>())
[all...] |
| less_test.cpp | 33 int array [4] = { 3, 1, 4, 2 }; local
34 sort(array, array + 4, less<int>());
36 CPPUNIT_ASSERT(array[0]==1);
37 CPPUNIT_ASSERT(array[1]==2);
38 CPPUNIT_ASSERT(array[2]==3);
39 CPPUNIT_ASSERT(array[3]==4);
43 int array [4] = { 3, 1, 4, 2 }; local
44 sort(array, array + 4, less_equal<int>())
[all...] |
| bind_test.cpp | 55 int array [3] = { 1, 2, 3 }; local
56 int* p = remove_if((int*)array, (int*)array + 3, bind1st(less<int>(), 2));
58 CPPUNIT_ASSERT(p == &array[2]);
59 CPPUNIT_ASSERT(array[0] == 1);
60 CPPUNIT_ASSERT(array[1] == 2);
62 for_each((int*)array, (int*)array + 3, bind1st(pre_increment(), 1));
63 CPPUNIT_ASSERT(array[0] == 2);
64 CPPUNIT_ASSERT(array[1] == 3)
75 int array [3] = { 1, 2, 3 }; local
84 int array [3] = { 1, 2, 3 }; local
104 int array[3] = { 1, 2, 3 }; local
143 A array[3]; local
[all...] |
| finsert_test.cpp | 33 char const* array [] = { "laurie", "jennifer", "leisa" }; local
36 fit = copy(array, array + 3, front_insert_iterator<deque <char const*> >(names));
38 CPPUNIT_ASSERT(names[0]==array[2]);
39 CPPUNIT_ASSERT(names[1]==array[1]);
40 CPPUNIT_ASSERT(names[2]==array[0]);
42 copy(array, array + 3, fit);
43 CPPUNIT_ASSERT(names[3]==array[2]);
44 CPPUNIT_ASSERT(names[4]==array[1])
50 char const* array [] = { "laurie", "jennifer", "leisa" }; local
[all...] |
| /dalvik/libcore/luni-kernel/src/main/java/java/lang/reflect/ |
| Array.java | 40 public final class Array {
45 private Array(){
50 * Returns the element of the array at the specified index. This reproduces
51 * the effect of {@code array[index]}. If the array component is a primitive
54 * @param array
55 * the array
62 * if the array is null
64 * if {@code array} is not an array
[all...] |
| /system/core/libcutils/ |
| array.c | 17 #include <cutils/array.h>
26 struct Array {
32 Array* arrayCreate() {
33 return calloc(1, sizeof(struct Array));
36 void arrayFree(Array* array) {
37 assert(array != NULL);
39 // Free internal array.
40 free(array->contents);
42 // Free the Array itself
[all...] |
| /external/webkit/JavaScriptCore/tests/mozilla/ecma/LexicalConventions/ |
| 7.7.3.js | 48 var array = new Array();
51 array[item++] = new TestCase( SECTION, "0", 0, 0 );
52 array[item++] = new TestCase( SECTION, "1", 1, 1 );
53 array[item++] = new TestCase( SECTION, "2", 2, 2 );
54 array[item++] = new TestCase( SECTION, "3", 3, 3 );
55 array[item++] = new TestCase( SECTION, "4", 4, 4 );
56 array[item++] = new TestCase( SECTION, "5", 5, 5 );
57 array[item++] = new TestCase( SECTION, "6", 6, 6 );
58 array[item++] = new TestCase( SECTION, "7", 7, 7 )
[all...] |
| 7.7.4.js | 46 var array = new Array();
51 array[item++] = new TestCase( SECTION, "\"\"", "", "" );
52 array[item++] = new TestCase( SECTION, "\'\'", "", '' );
55 array[item++] = new TestCase( SECTION, "\\\"", String.fromCharCode(0x0022), "\"" );
56 array[item++] = new TestCase( SECTION, "\\\'", String.fromCharCode(0x0027), "\'" );
57 array[item++] = new TestCase( SECTION, "\\", String.fromCharCode(0x005C), "\\" );
58 array[item++] = new TestCase( SECTION, "\\b", String.fromCharCode(0x0008), "\b" );
59 array[item++] = new TestCase( SECTION, "\\f", String.fromCharCode(0x000C), "\f" );
60 array[item++] = new TestCase( SECTION, "\\n", String.fromCharCode(0x000A), "\n" )
[all...] |
| /external/icu4c/samples/layout/ |
| arraymem.h | 12 #define ARRAY_SIZE(array) (sizeof array / sizeof array[0])
18 #define DELETE_ARRAY(array) free((void *) (array))
20 #define GROW_ARRAY(array,newSize) realloc((void *) (array), (newSize) * sizeof (array)[0])
|
| /system/core/include/cutils/ |
| array.h | 18 * A pointer array which intelligently expands its capacity ad needed.
30 /** An array. */
31 typedef struct Array Array;
33 /** Constructs a new array. Returns NULL if we ran out of memory. */
34 Array* arrayCreate();
36 /** Frees an array. Does not free elements themselves. */
37 void arrayFree(Array* array);
40 int arrayAdd(Array* array, void* pointer)
[all...] |
| /external/bluetooth/glib/glib/ |
| garray.c | 60 #define g_array_elt_len(array,i) ((array)->elt_size * (i))
61 #define g_array_elt_pos(array,i) ((array)->data + g_array_elt_len((array),(i)))
62 #define g_array_elt_zero(array, pos, len) \
63 (memset (g_array_elt_pos ((array), pos), 0, g_array_elt_len ((array), len)))
64 #define g_array_zero_terminate(array) G_STMT_START{ \
65 if ((array)->zero_terminated)
86 GRealArray *array = g_slice_new (GRealArray); local
120 g_slice_free1 (sizeof (GRealArray), array); local
130 GRealArray *array = (GRealArray*) farray; local
149 GRealArray *array = (GRealArray*) farray; local
171 GRealArray *array = (GRealArray*) farray; local
192 GRealArray *array = (GRealArray*) farray; local
214 GRealArray* array = (GRealArray*) farray; local
239 GRealArray* array = (GRealArray*) farray; local
265 GRealArray *array = (GRealArray*) farray; local
289 GRealArray *array = (GRealArray*) farray; local
304 GRealArray *array = (GRealArray*) farray; local
372 GRealPtrArray *array = g_slice_new (GRealPtrArray); local
400 g_slice_free1 (sizeof (GRealPtrArray), array); local
425 GRealPtrArray* array = (GRealPtrArray*) farray; local
456 GRealPtrArray* array = (GRealPtrArray*) farray; local
481 GRealPtrArray* array = (GRealPtrArray*) farray; local
506 GRealPtrArray* array = (GRealPtrArray*) farray; local
530 GRealPtrArray* array = (GRealPtrArray*) farray; local
551 GRealPtrArray* array = (GRealPtrArray*) farray; local
572 GRealPtrArray* array = (GRealPtrArray*) farray; local
[all...] |
| /external/webkit/JavaScriptCore/tests/mozilla/ecma/TypeConversion/ |
| 9.8.1.js | 104 var array = new Array();
107 array[item++] = new TestCase( SECTION, "Number.NaN", "NaN", Number.NaN + "" );
108 array[item++] = new TestCase( SECTION, "0", "0", 0 + "" );
109 array[item++] = new TestCase( SECTION, "-0", "0", -0 + "" );
110 array[item++] = new TestCase( SECTION, "Number.POSITIVE_INFINITY", "Infinity", Number.POSITIVE_INFINITY + "" );
111 array[item++] = new TestCase( SECTION, "Number.NEGATIVE_INFINITY", "-Infinity", Number.NEGATIVE_INFINITY + "" );
112 array[item++] = new TestCase( SECTION, "-1", "-1", -1 + "" );
116 array[item++] = new TestCase( SECTION, "1", "1", 1 + "" );
117 array[item++] = new TestCase( SECTION, "10", "10", 10 + "" )
[all...] |
| 9.3.1-1.js | 67 var array = new Array();
79 array[item++] = new TestCase( SECTION, "Number('')", 0, Number("") );
80 array[item++] = new TestCase( SECTION, "Number(' ')", 0, Number(" ") );
81 array[item++] = new TestCase( SECTION, "Number(\\t)", 0, Number("\t") );
82 array[item++] = new TestCase( SECTION, "Number(\\n)", 0, Number("\n") );
83 array[item++] = new TestCase( SECTION, "Number(\\r)", 0, Number("\r") );
84 array[item++] = new TestCase( SECTION, "Number(\\f)", 0, Number("\f") );
86 array[item++] = new TestCase( SECTION, "Number(String.fromCharCode(0x0009)", 0, Number(String.fromCharCode(0x0009)) );
87 array[item++] = new TestCase( SECTION, "Number(String.fromCharCode(0x0020)", 0, Number(String.fromCh (…)
[all...] |
| /external/webkit/JavaScriptCore/tests/mozilla/ecma/GlobalObject/ |
| 15.1.2.3-2.js | 72 var array = new Array();
75 array[item++] = new TestCase( SECTION, "parseFloat(true)", Number.NaN, parseFloat(true) );
76 array[item++] = new TestCase( SECTION, "parseFloat(false)", Number.NaN, parseFloat(false) );
77 array[item++] = new TestCase( SECTION, "parseFloat('string')", Number.NaN, parseFloat("string") );
79 array[item++] = new TestCase( SECTION, "parseFloat(' Infinity')", Number.POSITIVE_INFINITY, parseFloat("Infinity") );
80 // array[item++] = new TestCase( SECTION, "parseFloat(Infinity)", Number.POSITIVE_INFINITY, parseFloat(Infinity) );
82 array[item++] = new TestCase( SECTION, "parseFloat(' 0')", 0, parseFloat(" 0") );
83 array[item++] = new TestCase( SECTION, "parseFloat(' -0')", -0, parseFloat(" -0") );
84 array[item++] = new TestCase( SECTION, "parseFloat(' +0')", 0, parseFloat(" (…)
[all...] |
| 15.1.2.6.js | 48 var array = new Array();
51 array[item++] = new TestCase( SECTION, "isNaN.length", 1, isNaN.length );
52 array[item++] = new TestCase( SECTION, "var MYPROPS=''; for ( var p in isNaN ) { MYPROPS+= p }; MYPROPS", "", eval("var MYPROPS=''; for ( var p in isNaN ) { MYPROPS+= p }; MYPROPS") );
53 array[item++] = new TestCase( SECTION, "isNaN.length = null; isNaN.length", 1, eval("isNaN.length=null; isNaN.length") );
54 array[item++] = new TestCase( SECTION, "delete isNaN.length", false, delete isNaN.length );
55 array[item++] = new TestCase( SECTION, "delete isNaN.length; isNaN.length", 1, eval("delete isNaN.length; isNaN.length") );
57 // array[item++] = new TestCase( SECTION, "isNaN.__proto__", Function.prototype, isNaN.__proto__ );
59 array[item++] = new TestCase( SECTION, "isNaN()", true, isNaN() );
60 array[item++] = new TestCase( SECTION, "isNaN( null )", false, isNaN(null) )
[all...] |
| /frameworks/base/tests/CoreTests/android/core/ |
| ArrayListTest.java | 32 ArrayList array = new ArrayList(); local
33 assertEquals(0, array.size());
34 assertTrue(array.isEmpty());
36 array.add(new Integer(0));
37 array.add(0, new Integer(1));
38 array.add(1, new Integer(2));
39 array.add(new Integer(3));
40 array.add(new Integer(1));
42 assertEquals(5, array.size());
43 assertFalse(array.isEmpty())
[all...] |
| /dalvik/libcore/security/src/main/java/org/bouncycastle/util/ |
| Arrays.java | 4 * General array utilities.
39 byte[] array,
42 for (int i = 0; i < array.length; i++)
44 array[i] = value;
49 long[] array,
52 for (int i = 0; i < array.length; i++)
54 array[i] = value;
59 short[] array,
62 for (int i = 0; i < array.length; i++)
64 array[i] = value
[all...] |
| /external/webkit/JavaScriptCore/tests/mozilla/ecma/String/ |
| 15.5.1.js | 50 var array = new Array();
53 array[item++] = new TestCase( SECTION, "String('string primitive')", "string primitive", String('string primitive') );
54 array[item++] = new TestCase( SECTION, "String(void 0)", "undefined", String( void 0) );
55 array[item++] = new TestCase( SECTION, "String(null)", "null", String( null ) );
56 array[item++] = new TestCase( SECTION, "String(true)", "true", String( true) );
57 array[item++] = new TestCase( SECTION, "String(false)", "false", String( false ) );
58 array[item++] = new TestCase( SECTION, "String(Boolean(true))", "true", String(Boolean(true)) );
59 array[item++] = new TestCase( SECTION, "String(Boolean(false))", "false", String(Boolean(false)) );
60 array[item++] = new TestCase( SECTION, "String(Boolean())", "false", String(Boolean(false)) )
[all...] |
| /external/webkit/JavaScriptCore/tests/mozilla/ecma/Boolean/ |
| 15.6.4.3.js | 37 var array = new Array();
40 array[item++] = new TestCase( "15.8.6.4", "new Boolean(1)", true, (new Boolean(1)).valueOf() );
42 array[item++] = new TestCase( "15.8.6.4", "new Boolean(0)", false, (new Boolean(0)).valueOf() );
43 array[item++] = new TestCase( "15.8.6.4", "new Boolean(-1)", true, (new Boolean(-1)).valueOf() );
44 array[item++] = new TestCase( "15.8.6.4", "new Boolean('1')", true, (new Boolean("1")).valueOf() );
45 array[item++] = new TestCase( "15.8.6.4", "new Boolean('0')", true, (new Boolean("0")).valueOf() );
46 array[item++] = new TestCase( "15.8.6.4", "new Boolean(true)", true, (new Boolean(true)).valueOf() );
47 array[item++] = new TestCase( "15.8.6.4", "new Boolean(false)", false, (new Boolean(false)).valueOf() );
48 array[item++] = new TestCase( "15.8.6.4", "new Boolean('true')", true, (new Boolean("true")).valueO (…)
[all...] |
| /external/webkit/JavaScriptCore/tests/mozilla/ecma/Expressions/ |
| 11.9.1.js | 64 var array = new Array();
69 array[item++] = new TestCase( SECTION, "void 0 = void 0", true, void 0 == void 0 );
70 array[item++] = new TestCase( SECTION, "null == null", true, null == null );
74 array[item++] = new TestCase( SECTION, "NaN == NaN", false, Number.NaN == Number.NaN );
75 array[item++] = new TestCase( SECTION, "NaN == 0", false, Number.NaN == 0 );
76 array[item++] = new TestCase( SECTION, "0 == NaN", false, 0 == Number.NaN );
77 array[item++] = new TestCase( SECTION, "NaN == Infinity", false, Number.NaN == Number.POSITIVE_INFINITY );
78 array[item++] = new TestCase( SECTION, "Infinity == NaN", false, Number.POSITIVE_INFINITY == Number.NaN );
82 array[item++] = new TestCase( SECTION, "Number.MAX_VALUE == Number.MAX_VALUE", true, Number.MAX_V (…)
[all...] |
| 11.9.2.js | 63 var array = new Array();
68 array[item++] = new TestCase( SECTION, "void 0 == void 0", false, void 0 != void 0 );
69 array[item++] = new TestCase( SECTION, "null == null", false, null != null );
73 array[item++] = new TestCase( SECTION, "NaN != NaN", true, Number.NaN != Number.NaN );
74 array[item++] = new TestCase( SECTION, "NaN != 0", true, Number.NaN != 0 );
75 array[item++] = new TestCase( SECTION, "0 != NaN", true, 0 != Number.NaN );
76 array[item++] = new TestCase( SECTION, "NaN != Infinity", true, Number.NaN != Number.POSITIVE_INFINITY );
77 array[item++] = new TestCase( SECTION, "Infinity != NaN", true, Number.POSITIVE_INFINITY != Number.NaN );
81 array[item++] = new TestCase( SECTION, "Number.MAX_VALUE != Number.MAX_VALUE", false, Number.MAX_ (…)
[all...] |
| 11.9.3.js | 63 var array = new Array();
68 array[item++] = new TestCase( SECTION, "void 0 = void 0", true, void 0 == void 0 );
69 array[item++] = new TestCase( SECTION, "null == null", true, null == null );
73 array[item++] = new TestCase( SECTION, "NaN == NaN", false, Number.NaN == Number.NaN );
74 array[item++] = new TestCase( SECTION, "NaN == 0", false, Number.NaN == 0 );
75 array[item++] = new TestCase( SECTION, "0 == NaN", false, 0 == Number.NaN );
76 array[item++] = new TestCase( SECTION, "NaN == Infinity", false, Number.NaN == Number.POSITIVE_INFINITY );
77 array[item++] = new TestCase( SECTION, "Infinity == NaN", false, Number.POSITIVE_INFINITY == Number.NaN );
81 array[item++] = new TestCase( SECTION, "Number.MAX_VALUE == Number.MAX_VALUE", true, Number.MAX_V (…)
[all...] |
| 11.4.6.js | 53 var array = new Array();
55 array[item++] = new TestCase( SECTION, "+('')", 0, +("") );
56 array[item++] = new TestCase( SECTION, "+(' ')", 0, +(" ") );
57 array[item++] = new TestCase( SECTION, "+(\\t)", 0, +("\t") );
58 array[item++] = new TestCase( SECTION, "+(\\n)", 0, +("\n") );
59 array[item++] = new TestCase( SECTION, "+(\\r)", 0, +("\r") );
60 array[item++] = new TestCase( SECTION, "+(\\f)", 0, +("\f") );
62 array[item++] = new TestCase( SECTION, "+(String.fromCharCode(0x0009)", 0, +(String.fromCharCode(0x0009)) );
63 array[item++] = new TestCase( SECTION, "+(String.fromCharCode(0x0020)", 0, +(String.fromCharCode(0x0 (…)
[all...] |
| /external/skia/src/core/ |
| SkTSort.h | 24 void SkTHeapSort_SiftDown(T array[], int root, int bottom) {
27 if (child+1 <= bottom && array[child] < array[child+1]) {
30 if (array[root] < array[child]) {
31 SkTSwap<T>(array[root], array[child]);
39 template <typename T> void SkTHeapSort(T array[], int count) {
42 SkTHeapSort_SiftDown<T>(array, i, count-1);
45 SkTSwap<T>(array[0], array[i])
[all...] |
