| /external/eigen/doc/snippets/ |
| Map_simple.cpp | 1 int array[9]; variable
2 for(int i = 0; i < 9; ++i) array[i] = i;
3 cout << Map<Matrix3i>(array) << endl;
|
| MatrixBase_array.cpp | 2 v.array() += 3;
3 v.array() -= 2;
|
| Tutorial_Map_rowmajor.cpp | 1 int array[8]; variable
2 for(int i = 0; i < 8; ++i) array[i] = i;
3 cout << "Column-major:\n" << Map<Matrix<int,2,4> >(array) << endl;
4 cout << "Row-major:\n" << Map<Matrix<int,2,4,RowMajor> >(array) << endl;
6 Map<Matrix<int,2,4>, Unaligned, Stride<1,4> >(array) << endl;
|
| /external/stlport/test/unit/ |
| 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...] |
| /ndk/tests/device/test-gnustl-full/unit/ |
| 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...] |
| /ndk/tests/device/test-stlport/unit/ |
| 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...] |
| /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/Source/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/clang/test/CodeGenCXX/ |
| 2005-02-14-BitFieldOffset.cpp | 7 unsigned short array[1]; member in struct:QVectorTypedData
11 X->array[0] = 123;
|
| microsoft-abi-array-cookies.cpp | 11 ClassWithoutDtor *array = new ClassWithoutDtor[42]; local
14 delete [] array;
26 ClassWithDtor *array = new ClassWithDtor[42]; local
31 // CHECK: [[ARRAY:%.*]] = getelementptr inbounds i8* [[ALLOCATED]], i64 4
32 // CHECK: bitcast i8* [[ARRAY]] to [[CLASS:%.*]]*
34 delete [] array;
48 ClassWithAlignment *array = new ClassWithAlignment[42]; local
53 // CHECK: [[ARRAY:%.*]] = getelementptr inbounds i8* [[ALLOCATED]], i64 8
54 // CHECK: bitcast i8* [[ARRAY]] to [[CLASS:%.*]]*
56 delete [] array;
[all...] |
| /external/clang/test/Sema/ |
| invalid-cast.cpp | 6 T array; member in struct:X
10 return x0.array[17];
|
| /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/clang/test/SemaTemplate/ |
| function-template-specialization.cpp | 3 template<int N> void f0(int (&array)[N]);
6 template<> void f0(int (&array)[1]);
14 template<> void f0(char (&array)[1]); // expected-error{{no function template matches}}
15 template<> void f0<2>(int (&array)[2]) { }
18 template<typename T, int N> void f1(T (&array)[N]); // expected-note{{matches}}
19 template<int N> void f1(int (&array)[N]); // expected-note{{matches}}
21 template<> void f1(float (&array)[1]);
22 template<> void f1(int (&array)[1]);
25 template<typename T> void f1(T (&array)[17]); // expected-note{{matches}}
26 template<> void f1(int (&array)[17]); // expected-error{{ambiguous}
[all...] |
| /external/webkit/Source/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...] |
| /external/webkit/Source/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...] |
| /libcore/luni/src/test/java/libcore/java/util/ |
| OldAndroidArrayListTest.java | 30 ArrayList array = new ArrayList(); local
31 assertEquals(0, array.size());
32 assertTrue(array.isEmpty());
34 array.add(new Integer(0));
35 array.add(0, new Integer(1));
36 array.add(1, new Integer(2));
37 array.add(new Integer(3));
38 array.add(new Integer(1));
40 assertEquals(5, array.size());
41 assertFalse(array.isEmpty())
[all...] |
| /external/hamcrest/src/org/hamcrest/internal/ |
| ArrayIterator.java | 3 import java.lang.reflect.Array;
7 private final Object array; field in class:ArrayIterator
10 public ArrayIterator(Object array) {
11 if (!array.getClass().isArray()) {
12 throw new IllegalArgumentException("not an array");
14 this.array = array;
18 return currentIndex < Array.getLength(array);
22 return Array.get(array, currentIndex++)
[all...] |
| /external/libvpx/libvpx/examples/includes/geshi/geshi/ |
| php-brief.php | 50 $language_data = array (
52 'COMMENT_SINGLE' => array(1 => '//', 2 => '#'),
53 'COMMENT_MULTI' => array('/*' => '*/'),
55 'COMMENT_REGEXP' => array(3 => '/<<<\s*?(\'?)([a-zA-Z0-9]+)\1[^\n]*?\\n.*\\n\\2(?![a-zA-Z0-9])/siU'),
57 'QUOTEMARKS' => array("'", '"'),
59 'HARDQUOTE' => array("'", "'"),
60 'HARDESCAPE' => array("\'"),
64 'KEYWORDS' => array(
65 1 => array(
70 2 => array(
[all...] |
| /external/webkit/Source/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...] |
