Home
last modified time | relevance | path

Searched refs:arr (Results 1 – 25 of 1722) sorted by relevance

12345678910>>...69

/external/protobuf/php/tests/
Darray_test.php19 $arr = new RepeatedField(GPBType::INT32);
22 $arr[] = MAX_INT32;
23 $this->assertSame(MAX_INT32, $arr[0]);
24 $arr[] = MIN_INT32;
25 $this->assertSame(MIN_INT32, $arr[1]);
27 $arr[] = 1.1;
28 $this->assertSame(1, $arr[2]);
29 $arr[] = MAX_INT32_FLOAT;
30 $this->assertSame(MAX_INT32, $arr[3]);
31 $arr[] = MAX_INT32_FLOAT;
[all …]
Dmap_field_test.php17 $arr = new MapField(GPBType::INT32, GPBType::INT32);
20 $arr[MAX_INT32] = MAX_INT32;
21 $this->assertSame(MAX_INT32, $arr[MAX_INT32]);
22 $arr[MIN_INT32] = MIN_INT32;
23 $this->assertSame(MIN_INT32, $arr[MIN_INT32]);
24 $this->assertEquals(2, count($arr));
25 $this->assertTrue(isset($arr[MAX_INT32]));
26 $this->assertTrue(isset($arr[MIN_INT32]));
27 unset($arr[MAX_INT32]);
28 unset($arr[MIN_INT32]);
[all …]
Dundefined_test.php18 $arr = new RepeatedField(GPBType::INT32);
19 $arr[] = 'abc';
27 $arr = new RepeatedField(GPBType::INT32);
28 $arr[] = 0;
29 $arr[0] = 'abc';
37 $arr = new RepeatedField(GPBType::INT32);
38 $arr[] = new Sub();
46 $arr = new RepeatedField(GPBType::INT32);
47 $arr[] = 0;
48 $arr[0] = new Sub();
[all …]
/external/libxkbcommon/src/
Ddarray.h38 #define darray_init(arr) do { \ argument
39 (arr).item = 0; (arr).size = 0; (arr).alloc = 0; \
42 #define darray_free(arr) do { \ argument
43 free((arr).item); \
44 darray_init(arr); \
47 #define darray_steal(arr, to, to_size) do { \ argument
48 *(to) = (arr).item; \
50 *(unsigned int *) (to_size) = (arr).size; \
51 darray_init(arr); \
85 #define darray_item(arr, i) ((arr).item[i]) argument
[all …]
/external/llvm-project/libcxx/test/libcxx/diagnostics/
Dnodiscard_extensions.verify.cpp37 int arr[1] = { 1 }; in main() local
40 std::adjacent_find(std::begin(arr), std::end(arr)); in main()
43 std::adjacent_find(std::begin(arr), std::end(arr), std::greater<int>()); in main()
46 std::all_of(std::begin(arr), std::end(arr), P()); in main()
49 std::any_of(std::begin(arr), std::end(arr), P()); in main()
52 std::binary_search(std::begin(arr), std::end(arr), 1); in main()
55 std::binary_search(std::begin(arr), std::end(arr), 1, std::greater<int>()); in main()
66 std::count_if(std::begin(arr), std::end(arr), P()); in main()
69 std::count(std::begin(arr), std::end(arr), 1); in main()
72 std::equal_range(std::begin(arr), std::end(arr), 1); in main()
[all …]
Dnodiscard_extensions.pass.cpp37 int arr[1] = { 1 }; in main() local
39 std::adjacent_find(std::begin(arr), std::end(arr)); in main()
40 std::adjacent_find(std::begin(arr), std::end(arr), std::greater<int>()); in main()
41 std::all_of(std::begin(arr), std::end(arr), P()); in main()
42 std::any_of(std::begin(arr), std::end(arr), P()); in main()
43 std::binary_search(std::begin(arr), std::end(arr), 1); in main()
44 std::binary_search(std::begin(arr), std::end(arr), 1, std::greater<int>()); in main()
49 std::count_if(std::begin(arr), std::end(arr), P()); in main()
50 std::count(std::begin(arr), std::end(arr), 1); in main()
51 std::equal_range(std::begin(arr), std::end(arr), 1); in main()
[all …]
/external/clang/test/SemaCXX/
Dtype-traits.cpp168 { int arr[T(__is_pod(int))]; } in is_pod() local
169 { int arr[T(__is_pod(Enum))]; } in is_pod() local
170 { int arr[T(__is_pod(POD))]; } in is_pod() local
171 { int arr[T(__is_pod(Int))]; } in is_pod() local
172 { int arr[T(__is_pod(IntAr))]; } in is_pod() local
173 { int arr[T(__is_pod(Statics))]; } in is_pod() local
174 { int arr[T(__is_pod(Empty))]; } in is_pod() local
175 { int arr[T(__is_pod(EmptyUnion))]; } in is_pod() local
176 { int arr[T(__is_pod(Union))]; } in is_pod() local
177 { int arr[T(__is_pod(HasFunc))]; } in is_pod() local
[all …]
/external/llvm-project/libcxx/test/std/containers/sequences/array/array.creation/
Dto_array.pass.cpp30 auto arr = std::to_array({1, 2, 3}); in tests() local
31 ASSERT_SAME_TYPE(decltype(arr), std::array<int, 3>); in tests()
32 assert(arr[0] == 1); in tests()
33 assert(arr[1] == 2); in tests()
34 assert(arr[2] == 3); in tests()
39 auto arr = std::to_array({1L, 4L, 9L, l1}); in tests() local
40 ASSERT_SAME_TYPE(decltype(arr)::value_type, long); in tests()
41 static_assert(arr.size() == 4, ""); in tests()
42 assert(arr[0] == 1); in tests()
43 assert(arr[1] == 4); in tests()
[all …]
/external/llvm-project/clang/test/SemaCXX/
Dtype-traits.cpp212 { int arr[T(__is_pod(int))]; } in is_pod() local
213 { int arr[T(__is_pod(Enum))]; } in is_pod() local
214 { int arr[T(__is_pod(POD))]; } in is_pod() local
215 { int arr[T(__is_pod(Int))]; } in is_pod() local
216 { int arr[T(__is_pod(IntAr))]; } in is_pod() local
217 { int arr[T(__is_pod(Statics))]; } in is_pod() local
218 { int arr[T(__is_pod(Empty))]; } in is_pod() local
219 { int arr[T(__is_pod(EmptyUnion))]; } in is_pod() local
220 { int arr[T(__is_pod(Union))]; } in is_pod() local
221 { int arr[T(__is_pod(HasFunc))]; } in is_pod() local
[all …]
/external/deqp/framework/delibs/decpp/
DdePoolArray.cpp35 PoolArray<int> arr (&pool); in intArrayTest() local
45 arr.pushBack(i); in intArrayTest()
49 DE_TEST_ASSERT(arr.size() == 5000); in intArrayTest()
53 DE_TEST_ASSERT(arr[i] == i); in intArrayTest()
60 DE_TEST_ASSERT(arr.popBack() == (4999 - i)); in intArrayTest()
64 DE_TEST_ASSERT(arr.size() == 4000); in intArrayTest()
68 DE_TEST_ASSERT(arr[i] == i); in intArrayTest()
73 arr.resize(1000); in intArrayTest()
77 arr.pushBack(i); in intArrayTest()
81 DE_TEST_ASSERT(arr.size() == 5000); in intArrayTest()
[all …]
/external/deqp/framework/delibs/depool/
DdePoolArray.c46 dePoolArray* arr = DE_POOL_NEW(pool, dePoolArray); in dePoolArray_create() local
47 if (!arr) in dePoolArray_create()
51 memset(arr, 0, sizeof(dePoolArray)); in dePoolArray_create()
52 arr->pool = pool; in dePoolArray_create()
53 arr->elementSize = elementSize; in dePoolArray_create()
55 return arr; in dePoolArray_create()
65 deBool dePoolArray_reserve (dePoolArray* arr, int size) in dePoolArray_reserve() argument
67 if (size >= arr->capacity) in dePoolArray_reserve()
75 if (arr->pageTableCapacity < reqPageTableCapacity) in dePoolArray_reserve()
77 int newPageTableCapacity = deMax32(2*arr->pageTableCapacity, reqPageTableCapacity); in dePoolArray_reserve()
[all …]
DdePoolArray.h53 deBool dePoolArray_reserve (dePoolArray* arr, int capacity);
54 deBool dePoolArray_setSize (dePoolArray* arr, int size);
107 DE_INLINE int TYPENAME##_getNumElements (const TYPENAME* arr) DE_UNUSED_FUNCTION; \
108 DE_INLINE deBool TYPENAME##_reserve (DE_PTR_TYPE(TYPENAME) arr, int capacity) DE_UNUSED_FUNCTI…
109 DE_INLINE deBool TYPENAME##_setSize (DE_PTR_TYPE(TYPENAME) arr, int size) DE_UNUSED_FUNCTION;…
110 DE_INLINE void TYPENAME##_reset (DE_PTR_TYPE(TYPENAME) arr) DE_UNUSED_FUNCTION; \
111 DE_INLINE VALUETYPE TYPENAME##_get (const TYPENAME* arr, int ndx) DE_UNUSED_FUNCTION; \
112 DE_INLINE void TYPENAME##_set (DE_PTR_TYPE(TYPENAME) arr, int ndx, VALUETYPE elem) DE_UNUSED_FU…
113 DE_INLINE deBool TYPENAME##_pushBack (DE_PTR_TYPE(TYPENAME) arr, VALUETYPE elem) DE_UNUSED_FUN…
114 DE_INLINE VALUETYPE TYPENAME##_popBack (DE_PTR_TYPE(TYPENAME) arr) DE_UNUSED_FUNCTION; \
[all …]
/external/tensorflow/tensorflow/compiler/xla/
Darray2d_test.cc53 Array2D<int> arr = {{1, 2, 3}, {4, 5, 6}}; in TEST() local
55 EXPECT_EQ(arr.n1(), 2); in TEST()
56 EXPECT_EQ(arr.n2(), 3); in TEST()
58 EXPECT_EQ(arr(0, 0), 1); in TEST()
59 EXPECT_EQ(arr(0, 1), 2); in TEST()
60 EXPECT_EQ(arr(0, 2), 3); in TEST()
61 EXPECT_EQ(arr(1, 0), 4); in TEST()
62 EXPECT_EQ(arr(1, 1), 5); in TEST()
63 EXPECT_EQ(arr(1, 2), 6); in TEST()
67 Array2D<Eigen::half> arr = {{1.0f, 2.0f, 3.0f}, {4.0f, 5.0f, 6.0f}}; in TEST() local
[all …]
Darray_test.cc50 Array<int> arr({{1, 2, 3}, {4, 5, 6}}); in TEST() local
52 EXPECT_EQ(arr.dim(0), 2); in TEST()
53 EXPECT_EQ(arr.dim(1), 3); in TEST()
55 EXPECT_EQ(arr(0, 0), 1); in TEST()
56 EXPECT_EQ(arr(0, 1), 2); in TEST()
57 EXPECT_EQ(arr(0, 2), 3); in TEST()
58 EXPECT_EQ(arr(1, 0), 4); in TEST()
59 EXPECT_EQ(arr(1, 1), 5); in TEST()
60 EXPECT_EQ(arr(1, 2), 6); in TEST()
83 Array<int> arr({2, 3}); in TEST() local
[all …]
Darray4d_test.cc30 int64 Array4DLinearIndex(const Array4D<T>& arr, absl::Span<const int64> idx) { in Array4DLinearIndex() argument
32 return (idx[3] + idx[2] * arr.n4() + idx[1] * arr.n3() * arr.n4() + in Array4DLinearIndex()
33 idx[0] * arr.n2() * arr.n3() * arr.n4()); in Array4DLinearIndex()
63 Array4D<int> arr(2, 3, 4, 5, filler); in TEST() local
65 EXPECT_EQ(arr.n1(), 2); in TEST()
66 EXPECT_EQ(arr.n2(), 3); in TEST()
67 EXPECT_EQ(arr.n3(), 4); in TEST()
68 EXPECT_EQ(arr.n4(), 5); in TEST()
70 arr.Each([&arr](absl::Span<const int64> idx, int* cell) { in TEST()
71 EXPECT_EQ(*cell, Array4DLinearIndex(arr, idx)); in TEST()
[all …]
Darray3d_test.cc51 Array3D<int> arr = {{{1, 2}, {3, 4}, {5, 6}, {7, 8}}, in TEST() local
55 EXPECT_EQ(arr.n1(), 3); in TEST()
56 EXPECT_EQ(arr.n2(), 4); in TEST()
57 EXPECT_EQ(arr.n3(), 2); in TEST()
58 EXPECT_EQ(arr.num_elements(), 24); in TEST()
60 EXPECT_EQ(arr(0, 0, 0), 1); in TEST()
61 EXPECT_EQ(arr(0, 0, 1), 2); in TEST()
62 EXPECT_EQ(arr(0, 1, 0), 3); in TEST()
63 EXPECT_EQ(arr(0, 3, 1), 8); in TEST()
64 EXPECT_EQ(arr(1, 0, 0), 9); in TEST()
[all …]
/external/pdfium/core/fpdfapi/parser/
Dcpdf_array_unittest.cpp17 auto arr = pdfium::MakeRetain<CPDF_Array>(); in TEST() local
18 arr->AddNew<CPDF_Boolean>(true); in TEST()
19 arr->AddNew<CPDF_Boolean>(false); in TEST()
20 arr->AddNew<CPDF_Number>(100); in TEST()
21 arr->AddNew<CPDF_Number>(0); in TEST()
23 ASSERT_EQ(4u, arr->size()); in TEST()
24 EXPECT_TRUE(arr->GetBooleanAt(0, true)); in TEST()
25 EXPECT_TRUE(arr->GetBooleanAt(0, false)); in TEST()
26 EXPECT_FALSE(arr->GetBooleanAt(1, true)); in TEST()
27 EXPECT_FALSE(arr->GetBooleanAt(1, false)); in TEST()
[all …]
/external/llvm-project/clang/test/Analysis/
Dosobject-retain-release.cpp61 OtherStruct(OSArray *arr);
315 void test_no_infinite_check_recursion(MyArray *arr) { in test_no_infinite_check_recursion() argument
317 OSObject *o = arr->generateObject(input); in test_no_infinite_check_recursion()
324 OSArray *arr = new OSArray; in check_param_attribute_propagation() local
325 parent->consumeReference(arr); in check_param_attribute_propagation()
328 unsigned int check_attribute_propagation(OSArray *arr) { in check_attribute_propagation() argument
329 OSObject *other = arr->identity(); in check_attribute_propagation()
336 unsigned int check_attribute_indirect_propagation(MyArray *arr) { in check_attribute_indirect_propagation() argument
337 OSObject *other = arr->identity(); in check_attribute_indirect_propagation()
345 OSArray *arr = new OSArray; in check_consumes_this() local
[all …]
/external/boringssl/src/crypto/asn1/
Dcharmap.pl60 my ($i, @arr);
76 $arr[$i] = 0;
78 $arr[$i] |= $ESC_CTRL;
85 $arr[$i] |= $PSTRING_CHAR;
93 $arr[ord(" ")] |= $NOESC_QUOTE | $RFC2253_FIRST_ESC | $RFC2253_LAST_ESC;
94 $arr[ord("#")] |= $NOESC_QUOTE | $RFC2253_FIRST_ESC;
96 $arr[ord(",")] |= $NOESC_QUOTE | $RFC2253_ESC;
97 $arr[ord("+")] |= $NOESC_QUOTE | $RFC2253_ESC;
98 $arr[ord("\"")] |= $RFC2253_ESC;
99 $arr[ord("\\")] |= $RFC2253_ESC;
[all …]
/external/protobuf/ruby/tests/
Drepeated_field_test.rb148 check_self_modifying_method(m.repeated_string, reference_arr) do |arr|
149 arr[1]
151 check_self_modifying_method(m.repeated_string, reference_arr) do |arr|
152 arr[-2]
154 check_self_modifying_method(m.repeated_string, reference_arr) do |arr|
155 arr[20]
157 check_self_modifying_method(m.repeated_string, reference_arr) do |arr|
158 arr[1, 2]
160 check_self_modifying_method(m.repeated_string, reference_arr) do |arr|
161 arr[0..2]
[all …]
/external/protobuf/ruby/compatibility_tests/v3.0.0/tests/
Drepeated_field_test.rb134 check_self_modifying_method(m.repeated_string, reference_arr) do |arr|
135 arr[1]
137 check_self_modifying_method(m.repeated_string, reference_arr) do |arr|
138 arr[-2]
140 check_self_modifying_method(m.repeated_string, reference_arr) do |arr|
141 arr[20]
143 check_self_modifying_method(m.repeated_string, reference_arr) do |arr|
144 arr[1, 2]
146 check_self_modifying_method(m.repeated_string, reference_arr) do |arr|
147 arr[0..2]
[all …]
/external/llvm-project/llvm/test/CodeGen/AArch64/
Daarch64-minmaxv.ll24 define i8 @smax_B(<16 x i8>* nocapture readonly %arr) {
25 %arr.load = load <16 x i8>, <16 x i8>* %arr
26 %r = call i8 @llvm.vector.reduce.smax.v16i8(<16 x i8> %arr.load)
32 define i16 @smax_H(<8 x i16>* nocapture readonly %arr) {
33 %arr.load = load <8 x i16>, <8 x i16>* %arr
34 %r = call i16 @llvm.vector.reduce.smax.v8i16(<8 x i16> %arr.load)
40 define i32 @smax_S(<4 x i32> * nocapture readonly %arr) {
41 %arr.load = load <4 x i32>, <4 x i32>* %arr
42 %r = call i32 @llvm.vector.reduce.smax.v4i32(<4 x i32> %arr.load)
48 define i8 @umax_B(<16 x i8>* nocapture readonly %arr) {
[all …]
/external/webrtc/api/
Darray_view_unittest.cc42 char arr[] = "Arrr!"; in TEST() local
44 EXPECT_EQ(6u, Call<const char>(arr)); in TEST()
46 EXPECT_EQ(6u, Call<char>(arr)); in TEST()
52 ArrayView<char> y = arr; in TEST()
54 EXPECT_EQ(arr, y.data()); in TEST()
55 ArrayView<char, 6> yf = arr; in TEST()
57 EXPECT_EQ(arr, yf.data()); in TEST()
58 ArrayView<const char> z(arr + 1, 3); in TEST()
60 EXPECT_EQ(arr + 1, z.data()); in TEST()
61 ArrayView<const char, 3> zf(arr + 1, 3); in TEST()
[all …]
/external/libxkbcommon/test/
Datom.c72 struct atom_string *arr; in test_random_strings() local
84 arr = calloc(N, sizeof(*arr)); in test_random_strings()
85 assert(arr); in test_random_strings()
88 random_string(&arr[i].string, &arr[i].len); in test_random_strings()
90 atom = atom_intern(table, arr[i].string, arr[i].len, false); in test_random_strings()
95 if (arr[i].len != strlen(string) || in test_random_strings()
96 strncmp(string, arr[i].string, arr[i].len) != 0) { in test_random_strings()
101 arr[i].len, (int) arr[i].len, arr[i].string); in test_random_strings()
107 free(arr[i].string); in test_random_strings()
112 arr[i].atom = atom_intern(table, arr[i].string, arr[i].len, true); in test_random_strings()
[all …]
/external/llvm-project/clang/test/CodeGen/
Dalloc-size.c38 void *const arr = my_calloc(100, 5); in test1() local
40 gi = OBJECT_SIZE_BUILTIN(arr, 0); in test1()
42 gi = OBJECT_SIZE_BUILTIN(arr, 1); in test1()
44 gi = OBJECT_SIZE_BUILTIN(arr, 2); in test1()
46 gi = OBJECT_SIZE_BUILTIN(arr, 3); in test1()
140 struct Data *const arr = my_calloc(sizeof(*data), 2); in test5() local
142 gi = OBJECT_SIZE_BUILTIN(arr, 0); in test5()
144 gi = OBJECT_SIZE_BUILTIN(arr, 1); in test5()
146 gi = OBJECT_SIZE_BUILTIN(arr, 2); in test5()
148 gi = OBJECT_SIZE_BUILTIN(arr, 3); in test5()
[all …]

12345678910>>...69