HomeSort by relevance Sort by last modified time
    Searched refs:array (Results 26 - 50 of 7929) sorted by null

12 3 4 5 6 7 8 91011>>

  /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;
  /external/libcxx/test/std/containers/sequences/array/
empty.fail.cpp 11 // <array>
13 // class array
20 #include <array>
27 std::array<int, 1> c;
29 std::array<int, 0> c0;
  /external/vixl/test/
test-utils.h 32 #define ARRAY_SIZE(array) (sizeof(array) / sizeof((array)[0]))
  /system/bt/osi/src/
array.cc 21 #include "osi/include/array.h"
38 static bool grow(array_t* array);
45 array_t* array = static_cast<array_t*>( local
48 array->element_size = element_size;
49 array->capacity = INTERNAL_ELEMENTS;
50 array->data = array->internal_storage;
51 return array;
54 void array_free(array_t* array) {
55 if (!array) return
    [all...]
  /external/kmod/testsuite/
test-array.c 25 #include <shared/array.h>
31 struct array array; local
34 array_init(&array, 2);
35 array_append(&array, c1);
36 assert_return(array.count == 1, EXIT_FAILURE);
37 assert_return(array.array[0] == c1, EXIT_FAILURE);
38 array_free_array(&array);
43 .description = "test simple array append")
48 struct array array; local
70 struct array array; local
102 struct array array; local
131 struct array array; local
171 struct array array; local
    [all...]
  /art/test/609-checker-x86-bounds-check/src/
Main.java 20 int[] array = new int[51]; local
21 testArrayLengthBoundsCheckX86(array, 10);
27 /// CHECK-DAG: <<Array:l\d+>> ParameterValue
30 /// CHECK-DAG: <<CheckedArray:l\d+>> NullCheck [<<Array>>]
36 /// CHECK-DAG: <<Array:l\d+>> ParameterValue
39 /// CHECK-DAG: <<CheckedArray:l\d+>> NullCheck [<<Array>>]
45 /// CHECK-DAG: <<Array:l\d+>> ParameterValue
48 /// CHECK: <<CheckedArray:l\d+>> NullCheck [<<Array>>]
49 /// CHECK-NEXT: <<Length:i\d+>> ArrayLength [<<Array>>] is_string_length:false emitted_at_use:true loop:none
52 /// CHECK: <<ArraySet:v\d+>> ArraySet [<<Array>>,<<Index>>,<<Value>>
    [all...]
  /art/test/667-out-of-bounds/src/
Main.java 18 static int $noinline$arrayAccess(int[] array) {
19 return array[82];
23 int[] array = new int[5]; local
25 $noinline$arrayAccess(array);
  /art/test/554-checker-rtp-checkcast/src/
Main.java 28 int[] array = new int[20]; local
29 if (array.hashCode() > 5) {
30 array = (int[]) returnIntArray();
32 array[0] = 14;
41 int[] array = new int[20]; local
45 array[i] = i;
47 array = (int[]) returnIntArray();
50 array[0] = 14;
  /art/test/562-checker-no-intermediate/src/
Main.java 26 /// CHECK-DAG: <<Array:l\d+>> NullCheck
28 /// CHECK-DAG: <<ArrayGet:i\d+>> ArrayGet [<<Array>>,<<Index>>]
31 /// CHECK-DAG: ArraySet [<<Array>>,<<Index>>,<<Add>>]
36 /// CHECK-DAG: <<Array:l\d+>> NullCheck
38 /// CHECK-DAG: <<Address1:i\d+>> IntermediateAddress [<<Array>>,<<DataOffset>>]
42 /// CHECK-DAG: <<Address2:i\d+>> IntermediateAddress [<<Array>>,<<DataOffset>>]
48 /// CHECK-DAG: <<Array:l\d+>> NullCheck
50 /// CHECK-DAG: <<Address1:i\d+>> IntermediateAddress [<<Array>>,<<DataOffset>>]
54 /// CHECK-DAG: <<Address2:i\d+>> IntermediateAddress [<<Array>>,<<DataOffset>>]
60 /// CHECK-DAG: <<Array:l\d+>> NullChec
96 static int[] array = new int[2]; field in class:Main
    [all...]
  /external/clang/test/Sema/
invalid-cast.cpp 6 T array; member in struct:X
10 return x0.array[17];
  /external/icu/icu4c/source/samples/layout/
arraymem.h 15 #define ARRAY_SIZE(array) (sizeof array / sizeof array[0])
21 #define DELETE_ARRAY(array) free((void *) (array))
23 #define GROW_ARRAY(array,newSize) realloc((void *) (array), (newSize) * sizeof (array)[0])
  /external/parameter-framework/asio-1.10.6/include/asio/detail/
array_fwd.hpp 20 class array;
25 // include the array header. Fortunately, it's fairly lightweight and doesn't
27 # include <array>
  /frameworks/av/services/camera/libcameraservice/tests/
DistortionMapperTest_OpenCvData.h 5 std::array<int32_t, 2000> rawCoords = {
1007 std::array<int32_t, 2000> expCoords = {
  /external/compiler-rt/test/asan/TestCases/
global-location.cc 12 static int array[10]; member in struct:C
17 int C::array[10]; member in class:C
18 // CLASS_STATIC: 0x{{.*}} is located 4 bytes to the right of global variable 'C::array' defined in '{{.*}}global-location.cc:[[@LINE-1]]:8' {{.*}} of size 40
24 case 'c': return C::array[one * 11];
26 static int array[10]; local
27 // FUNC_STATIC: 0x{{.*}} is located 4 bytes to the right of global variable 'array' defined in '{{.*}}global-location.cc:[[@LINE-1]]:16' {{.*}} of size 40
28 memset(array, 0, 10);
29 return array[one * 11];
strtol_strict.c 31 void test1(char *array, char *endptr) {
33 long r = strtol(array, &endptr, 3);
34 assert(array + 2 == endptr);
38 void test2(char *array, char *endptr) {
40 array[2] = 'z';
41 long r = strtol(array, &endptr, 35);
42 assert(array + 2 == endptr);
46 void test3(char *array, char *endptr) {
57 memset(array, 0, 8);
58 ASAN_POISON_MEMORY_REGION(array, 8)
106 char* array = array0 + 8; local
    [all...]
  /system/chre/util/include/chre/util/
macros.h 21 * Obtains the number of elements in a C-style array.
23 #define ARRAY_SIZE(array) (sizeof(array) / sizeof((array)[0]))
24 #define ARRAY_END(array) (array + ARRAY_SIZE(array))
  /external/caliper/examples/src/main/java/examples/
CopyArrayBenchmark.java 27 * Tests each of four ways to copy an array, for all nine array types.
29 * <p>Once upon a time, {@code clone} was much slower than the other array copy techniques, but
33 * array clone() much slower than Arrays.copyOf</a>
43 * <li>As array sizes get large, the runtime is indeed proportional to the size of the array in
50 @Override Object[] copy(Object[] array) {
51 return array.clone();
53 @Override boolean[] copy(boolean[] array) {
54 return array.clone()
    [all...]
  /external/proguard/src/proguard/util/
ArrayUtil.java 23 import java.lang.reflect.Array;
33 * @param array1 the first array.
34 * @param array2 the second array.
54 * @param array1 the first array.
55 * @param array2 the second array.
75 * @param array1 the first array.
76 * @param array2 the second array.
96 * @param array1 the first array.
97 * @param array2 the second array.
118 * @param array1 the first array
    [all...]
  /external/clang/test/SemaTemplate/
function-template-specialization.cpp 4 void f0(int (&array)[N]); // expected-note {{candidate template ignored: could not match 'int' against 'char'}}
7 template<> void f0(int (&array)[1]);
15 template<> void f0(char (&array)[1]); // expected-error{{no function template matches}}
16 template<> void f0<2>(int (&array)[2]) { }
19 template<typename T, int N> void f1(T (&array)[N]); // expected-note{{matches}}
20 template<int N> void f1(int (&array)[N]); // expected-note{{matches}}
22 template<> void f1(float (&array)[1]);
23 template<> void f1(int (&array)[1]);
26 template<typename T> void f1(T (&array)[17]); // expected-note{{matches}}
27 template<> void f1(int (&array)[17]); // expected-error{{ambiguous}
    [all...]
  /external/clang/test/CXX/dcl.decl/dcl.meaning/dcl.array/
p3.cpp 4 // which the bound was specified, an omitted array bound is taken to be the
9 extern "C" int array[]; member in namespace:test0
10 void declare() { extern int array[100]; }
11 int value1 = sizeof(array); // expected-error {{invalid application of 'sizeof' to an incomplete type 'int []'}}
12 extern "C" int array[]; member in namespace:test0
13 int value2 = sizeof(array); // expected-error {{invalid application of 'sizeof' to an incomplete type 'int []'}}
17 extern "C" int array[]; member in namespace:test1
19 { extern int array[100]; }
20 extern int array[];
21 int x = sizeof(array); // expected-error {{invalid application of 'sizeof' to an incomplete type 'int []'}
    [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/mesa3d/src/egl/main/
eglarray.c 37 * Grow the size of the array.
40 _eglGrowArray(_EGLArray *array)
45 new_size = array->MaxSize;
46 while (new_size <= array->Size)
49 elems = realloc(array->Elements, new_size * sizeof(array->Elements[0]));
51 _eglLog(_EGL_DEBUG, "failed to grow %s array to %d",
52 array->Name, new_size);
56 array->Elements = elems;
57 array->MaxSize = new_size
69 _EGLArray *array; local
    [all...]
  /external/hamcrest/hamcrest-core/src/main/java/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;
19 return currentIndex < Array.getLength(array);
24 return Array.get(array, currentIndex++)
    [all...]
  /system/bt/osi/test/
array_test.cc 5 #include "osi/include/array.h"
10 array_t* array = array_new(4); local
11 ASSERT_TRUE(array != NULL);
12 array_free(array);
18 array_t* array = array_new(4); local
19 EXPECT_DEATH(array_ptr(array), "");
20 array_free(array);
24 array_t* array = array_new(4); local
25 EXPECT_DEATH(array_at(array, 1), "");
26 array_free(array);
30 array_t* array = array_new(sizeof(int)); local
42 array_t* array = array_new(sizeof(int)); local
59 array_t* array = array_new(128); local
    [all...]

Completed in 471 milliseconds

12 3 4 5 6 7 8 91011>>