/external/eigen/doc/snippets/ |
H A D | MatrixBase_array_const.cpp | 2 cout << "the absolute values:" << endl << v.array().abs() << endl; 3 cout << "the absolute values plus one:" << endl << v.array().abs()+1 << endl; 4 cout << "sum of the squares: " << v.array().square().sum() << endl;
|
H A D | MatrixBase_all.cpp | 5 << ((boxMin.array()<p0.array()).all() && (boxMax.array()>p0.array()).all()) << endl; 7 << ((boxMin.array()<p1.array()).all() && (boxMax.array()>p1.array()).all()) << endl;
|
/external/chromium_org/third_party/icu/source/test/letest/ |
H A D | letest.h | 25 #define ARRAY_SIZE(array) (sizeof array / sizeof array[0]) 31 #define DELETE_ARRAY(array) free((void *) (array)) 33 #define GROW_ARRAY(array,newSize) realloc((void *) (array), (newSize) * sizeof (array)[0])
|
/external/chromium_org/v8/test/mjsunit/regress/ |
H A D | regress-crbug-352929.js | 8 array = new Int32Array(100); 11 array[-17] = 0; 13 array[base - 1] = 1; 14 array[base - 2] = 2; 16 array[base - 4] = 3; 17 array[base - 5] = 4; 19 array[base - 6] = 5; 20 array[base - 100] = 777;
|
H A D | regress-crbug-87478.js | 30 function f(array) { return array[0]; }
|
H A D | regress-smi-only-concat.js | 30 // This tests that concatenating a fast smi-only array and a fast object array 31 // results in a fast object array. 34 var array = fast_array.concat(fast_array); variable 37 assertTrue(%HasFastObjectElements(array));
|
H A D | regress-1708.js | 29 // array caused invalid marking bit patterns on lazily swept pages. 47 array = new Array(100); 50 // At this point "array" should have been promoted to old-space and be 52 // the array to trigger left-trimming operations. 53 assertEquals(100, array.length); 55 array.shift(); 57 assertEquals(50, array.length); 59 // At this point "array" should have been trimmed from the left with
|
H A D | regress-crbug-344186.js | 8 var array = new Int32Array(128); 10 array[base - 95] = 1; 11 array[base - 99] = 2; 12 array[base + 4] = 3;
|
/external/chromium_org/v8/test/mjsunit/ |
H A D | string-split-cache.js | 38 var array = str.split(""); variable 40 assertArrayEquals(expected, array);
|
H A D | sparse-array.js | 35 var array = []; 37 array[i * stride] = i;
|
/external/chromium_org/v8/test/webkit/ |
H A D | dfg-negative-array-index.js | 25 "Tests that storing into a negative array index works right." 33 var array = []; 34 foo(array, -1); 35 shouldBe("array[-1]", "42");
|
H A D | dfg-uint32array-overflow-constant.js | 32 var array = new Uint32Array(1); 35 foo(array); 36 shouldBe("array[0]", "0x8005465c");
|
H A D | function-dot-apply-replace-base.js | 37 var array = []; 38 array.push(1); 39 array.push(2); 41 x = x.apply(void(0), array);
|
/external/clang/test/CXX/expr/expr.prim/expr.prim.lambda/ |
H A D | p15.cpp | 9 int array[3]; local 12 (void)[&array] () -> void {};
|
/external/clang/test/Sema/ |
H A D | template-specialization.cpp | 13 int array[i]; local 14 A::template bar(array[0]); // expected-error {{no matching function for call to 'bar'}}
|
/external/icu/icu4c/source/test/letest/ |
H A D | letest.h | 25 #define ARRAY_SIZE(array) (sizeof array / sizeof array[0]) 31 #define DELETE_ARRAY(array) free((void *) (array)) 33 #define GROW_ARRAY(array,newSize) realloc((void *) (array), (newSize) * sizeof (array)[0])
|
/external/libcxx/test/containers/sequences/array/array.tuple/ |
H A D | get.fail.cpp | 10 // <array> 12 // template <size_t I, class T, size_t N> T& get(array<T, N>& a); 14 #include <array> 21 typedef std::array<T, 3> C;
|
/external/lldb/test/functionalities/command_script/ |
H A D | main.cpp | 56 int array[9]; local 57 memset(array,0,9*sizeof(int)); 59 array[0] = foo (1238, 78392); 60 array[1] = foo (379265, 23674); 61 array[2] = foo (872934, 234); 62 array[3] = foo (1238, 78392); 63 array[4] = foo (379265, 23674); 64 array[5] = foo (872934, 234); 65 array[6] = foo (1238, 78392); 66 array[ [all...] |
/external/stlport/test/unit/ |
H A D | binsert_test.cpp | 32 const char* array [] = { "laurie", "jennifer", "leisa" }; local 35 bit = copy(array, array + 3, bit); 37 CPPUNIT_ASSERT(!strcmp(names[0],array[0])); 38 CPPUNIT_ASSERT(!strcmp(names[1],array[1])); 39 CPPUNIT_ASSERT(!strcmp(names[2],array[2])); 41 copy(array, array + 3, bit); 42 CPPUNIT_ASSERT(!strcmp(names[3],array[0])); 43 CPPUNIT_ASSERT(!strcmp(names[4],array[ 48 const char* array [] = { "laurie", "jennifer", "leisa" }; local [all...] |
/external/ceres-solver/internal/ceres/ |
H A D | array_utils_test.cc | 76 vector<int> array; local 77 array.push_back(0); 78 array.push_back(1); 79 vector<int> expected = array; 80 MapValuesToContiguousRange(array.size(), &array[0]); 81 EXPECT_EQ(array, expected); 82 array.clear(); 84 array.push_back(1); 85 array 92 vector<int> array; local 103 vector<int> array; local [all...] |
/external/chromium_org/third_party/WebKit/ManualTests/resources/ |
H A D | ArrayParameterTestApplet.java | 30 public void arrayFunction(String [] array) { argument 32 for (int i = 0; i < array.length; i++) 33 System.out.println(array[i]); 36 public void booleanFunction(boolean[] array) { argument 38 for (int i = 0; i < array.length; i++) 39 System.out.println(array[i]); 42 public void byteFunction(byte[] array) { argument 44 for (int i = 0; i < array.length; i++) 45 System.out.println(array[i]); 48 public void charFunction(char[] array) { argument 54 shortFunction(short[] array) argument 60 intFunction(int[] array) argument 66 longFunction(long[] array) argument 72 floatFunction(float[] array) argument 78 doubleFunction(double[] array) argument 84 objectFunction(Applet[] array) argument [all...] |
/external/libcxx/test/containers/sequences/array/ |
H A D | version.pass.cpp | 10 // <array> 12 #include <array>
|
/external/dexmaker/src/dx/java/com/android/dx/io/instructions/ |
H A D | ShortArrayCodeInput.java | 26 /** source array to read from */ 27 private final short[] array; field in class:ShortArrayCodeInput 32 public ShortArrayCodeInput(short[] array) { argument 33 if (array == null) { 34 throw new NullPointerException("array == null"); 37 this.array = array; 42 return cursor() < array.length; 48 int value = array[cursor()];
|
/external/chromium_org/base/debug/ |
H A D | asan_invalid_access.cc | 33 int* array = new int[kArraySize]; local 40 int volatile dummy = array[-1]--; 46 delete[] array; 60 scoped_ptr<int[]> array(new int[kArraySize]); 64 dummy = array[kArraySize]; 69 scoped_ptr<int[]> array(new int[kArraySize]); 74 // access array[-1] will trigger a warning C4245: "conversion from 'int' to 76 int* underflow_address = &array[0] - 1; 82 scoped_ptr<int[]> array(new int[kArraySize]); 86 int* dangling = array [all...] |
/external/chromium_org/third_party/WebKit/Source/modules/crypto/ |
H A D | Crypto.cpp | 42 bool isIntegerArray(ArrayBufferView* array) argument 44 ArrayBufferView::ViewType type = array->type(); 60 void Crypto::getRandomValues(ArrayBufferView* array, ExceptionState& exceptionState) argument 62 if (!array) { 66 if (!isIntegerArray(array)) { 67 exceptionState.throwDOMException(TypeMismatchError, String::format("The provided ArrayBufferView is of type '%s', which is not an integer array type.", array->typeName())); 70 if (array->byteLength() > 65536) { 71 exceptionState.throwDOMException(QuotaExceededError, String::format("The ArrayBufferView's byte length (%u) exceeds the number of bytes of entropy available via this API (65536).", array->byteLength())); 74 cryptographicallyRandomValues(array [all...] |