Home
last modified time | relevance | path

Searched full:arr (Results 1 – 25 of 2687) sorted by relevance

12345678910>>...108

/external/cronet/stable/third_party/protobuf/php/tests/
DArrayTest.php20 $arr = new RepeatedField(GPBType::INT32);
23 $arr[] = MAX_INT32;
24 $this->assertSame(MAX_INT32, $arr[0]);
25 $arr[] = MIN_INT32;
26 $this->assertSame(MIN_INT32, $arr[1]);
28 $arr[] = 1.1;
29 $this->assertSame(1, $arr[2]);
30 $arr[] = MAX_INT32_FLOAT;
31 $this->assertSame(MAX_INT32, $arr[3]);
32 $arr[] = MAX_INT32_FLOAT;
[all …]
DMapFieldTest.php18 $arr = new MapField(GPBType::INT32, GPBType::INT32);
21 $arr[MAX_INT32] = MAX_INT32;
22 $this->assertSame(MAX_INT32, $arr[MAX_INT32]);
23 $arr[MIN_INT32] = MIN_INT32;
24 $this->assertSame(MIN_INT32, $arr[MIN_INT32]);
25 $this->assertEquals(2, count($arr));
26 $this->assertTrue(isset($arr[MAX_INT32]));
27 $this->assertTrue(isset($arr[MIN_INT32]));
28 unset($arr[MAX_INT32]);
29 unset($arr[MIN_INT32]);
[all …]
/external/protobuf/php/tests/
DArrayTest.php20 $arr = new RepeatedField(GPBType::INT32);
23 $arr[] = MAX_INT32;
24 $this->assertSame(MAX_INT32, $arr[0]);
25 $arr[] = MIN_INT32;
26 $this->assertSame(MIN_INT32, $arr[1]);
28 $arr[] = 1.1;
29 $this->assertSame(1, $arr[2]);
30 $arr[] = MAX_INT32_FLOAT;
31 $this->assertSame(MAX_INT32, $arr[3]);
32 $arr[] = MAX_INT32_FLOAT;
[all …]
DMapFieldTest.php18 $arr = new MapField(GPBType::INT32, GPBType::INT32);
21 $arr[MAX_INT32] = MAX_INT32;
22 $this->assertSame(MAX_INT32, $arr[MAX_INT32]);
23 $arr[MIN_INT32] = MIN_INT32;
24 $this->assertSame(MIN_INT32, $arr[MIN_INT32]);
25 $this->assertEquals(2, count($arr));
26 $this->assertTrue(isset($arr[MAX_INT32]));
27 $this->assertTrue(isset($arr[MIN_INT32]));
28 unset($arr[MAX_INT32]);
29 unset($arr[MIN_INT32]);
[all …]
/external/cronet/tot/third_party/protobuf/php/tests/
DArrayTest.php20 $arr = new RepeatedField(GPBType::INT32);
23 $arr[] = MAX_INT32;
24 $this->assertSame(MAX_INT32, $arr[0]);
25 $arr[] = MIN_INT32;
26 $this->assertSame(MIN_INT32, $arr[1]);
28 $arr[] = 1.1;
29 $this->assertSame(1, $arr[2]);
30 $arr[] = MAX_INT32_FLOAT;
31 $this->assertSame(MAX_INT32, $arr[3]);
32 $arr[] = MAX_INT32_FLOAT;
[all …]
DMapFieldTest.php18 $arr = new MapField(GPBType::INT32, GPBType::INT32);
21 $arr[MAX_INT32] = MAX_INT32;
22 $this->assertSame(MAX_INT32, $arr[MAX_INT32]);
23 $arr[MIN_INT32] = MIN_INT32;
24 $this->assertSame(MIN_INT32, $arr[MIN_INT32]);
25 $this->assertEquals(2, count($arr));
26 $this->assertTrue(isset($arr[MAX_INT32]));
27 $this->assertTrue(isset($arr[MIN_INT32]));
28 unset($arr[MAX_INT32]);
29 unset($arr[MIN_INT32]);
[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); \
60 * void foo(darray(int) *arr);
[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/protobuf/ruby/tests/
Drepeated_field_test.rb163 check_self_modifying_method(m.repeated_string, reference_arr) do |arr|
164 arr[1]
166 check_self_modifying_method(m.repeated_string, reference_arr) do |arr|
167 arr[-2]
169 check_self_modifying_method(m.repeated_string, reference_arr) do |arr|
170 arr[20]
172 check_self_modifying_method(m.repeated_string, reference_arr) do |arr|
173 arr[1, 2]
175 check_self_modifying_method(m.repeated_string, reference_arr) do |arr|
176 arr[0..2]
[all …]
/external/cronet/tot/third_party/protobuf/ruby/tests/
Drepeated_field_test.rb163 check_self_modifying_method(m.repeated_string, reference_arr) do |arr|
164 arr[1]
166 check_self_modifying_method(m.repeated_string, reference_arr) do |arr|
167 arr[-2]
169 check_self_modifying_method(m.repeated_string, reference_arr) do |arr|
170 arr[20]
172 check_self_modifying_method(m.repeated_string, reference_arr) do |arr|
173 arr[1, 2]
175 check_self_modifying_method(m.repeated_string, reference_arr) do |arr|
176 arr[0..2]
[all …]
/external/cronet/stable/third_party/protobuf/ruby/tests/
Drepeated_field_test.rb163 check_self_modifying_method(m.repeated_string, reference_arr) do |arr|
164 arr[1]
166 check_self_modifying_method(m.repeated_string, reference_arr) do |arr|
167 arr[-2]
169 check_self_modifying_method(m.repeated_string, reference_arr) do |arr|
170 arr[20]
172 check_self_modifying_method(m.repeated_string, reference_arr) do |arr|
173 arr[1, 2]
175 check_self_modifying_method(m.repeated_string, reference_arr) do |arr|
176 arr[0..2]
[all …]
/external/apache-commons-math/src/main/java/org/apache/commons/math3/random/
DISAACRandom.java74 private final int[] arr = new int[8]; field in ISAACRandom
199 for (int j = 0; j < arr.length; j++) { in initState()
200 arr[j] = GLD_RATIO; in initState()
207 arr[0] += rsl[j]; in initState()
208 arr[1] += rsl[j + 1]; in initState()
209 arr[2] += rsl[j + 2]; in initState()
210 arr[3] += rsl[j + 3]; in initState()
211 arr[4] += rsl[j + 4]; in initState()
212 arr[5] += rsl[j + 5]; in initState()
213 arr[6] += rsl[j + 6]; in initState()
[all …]
/external/cronet/tot/third_party/protobuf/ruby/compatibility_tests/v3.0.0/tests/
Drepeated_field_test.rb136 check_self_modifying_method(m.repeated_string, reference_arr) do |arr|
137 arr[1]
139 check_self_modifying_method(m.repeated_string, reference_arr) do |arr|
140 arr[-2]
142 check_self_modifying_method(m.repeated_string, reference_arr) do |arr|
143 arr[20]
145 check_self_modifying_method(m.repeated_string, reference_arr) do |arr|
146 arr[1, 2]
148 check_self_modifying_method(m.repeated_string, reference_arr) do |arr|
149 arr[0..2]
[all …]
/external/protobuf/ruby/compatibility_tests/v3.0.0/tests/
Drepeated_field_test.rb136 check_self_modifying_method(m.repeated_string, reference_arr) do |arr|
137 arr[1]
139 check_self_modifying_method(m.repeated_string, reference_arr) do |arr|
140 arr[-2]
142 check_self_modifying_method(m.repeated_string, reference_arr) do |arr|
143 arr[20]
145 check_self_modifying_method(m.repeated_string, reference_arr) do |arr|
146 arr[1, 2]
148 check_self_modifying_method(m.repeated_string, reference_arr) do |arr|
149 arr[0..2]
[all …]
/external/cronet/stable/third_party/protobuf/ruby/compatibility_tests/v3.0.0/tests/
Drepeated_field_test.rb136 check_self_modifying_method(m.repeated_string, reference_arr) do |arr|
137 arr[1]
139 check_self_modifying_method(m.repeated_string, reference_arr) do |arr|
140 arr[-2]
142 check_self_modifying_method(m.repeated_string, reference_arr) do |arr|
143 arr[20]
145 check_self_modifying_method(m.repeated_string, reference_arr) do |arr|
146 arr[1, 2]
148 check_self_modifying_method(m.repeated_string, reference_arr) do |arr|
149 arr[0..2]
[all …]
/external/pdfium/core/fpdfapi/parser/
Dcpdf_array_unittest.cpp18 auto arr = pdfium::MakeRetain<CPDF_Array>(); in TEST() local
19 arr->AppendNew<CPDF_Boolean>(true); in TEST()
20 arr->AppendNew<CPDF_Boolean>(false); in TEST()
21 arr->AppendNew<CPDF_Number>(100); in TEST()
22 arr->AppendNew<CPDF_Number>(0); in TEST()
24 ASSERT_EQ(4u, arr->size()); in TEST()
25 EXPECT_TRUE(arr->GetBooleanAt(0, true)); in TEST()
26 EXPECT_TRUE(arr->GetBooleanAt(0, false)); in TEST()
27 EXPECT_FALSE(arr->GetBooleanAt(1, true)); in TEST()
28 EXPECT_FALSE(arr->GetBooleanAt(1, false)); in TEST()
[all …]
/external/cronet/stable/third_party/libc++/src/test/std/containers/sequences/array/array.creation/
Dto_array.pass.cpp13 // constexpr auto to_array(T (&arr)[Size])
17 // constexpr auto to_array(T (&&arr)[Size])
30 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()
[all …]
/external/cronet/tot/third_party/libc++/src/test/std/containers/sequences/array/array.creation/
Dto_array.pass.cpp13 // constexpr auto to_array(T (&arr)[Size])
17 // constexpr auto to_array(T (&&arr)[Size])
30 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()
[all …]
/external/cronet/stable/third_party/libc++/src/test/libcxx/diagnostics/
Dalgorithm.nodiscard.verify.cpp26 int arr[1] = { 1 }; in test() local
29 std::adjacent_find(std::begin(arr), std::end(arr)); in test()
32 std::adjacent_find(std::begin(arr), std::end(arr), std::greater<int>()); in test()
35 std::all_of(std::begin(arr), std::end(arr), P()); in test()
38 std::any_of(std::begin(arr), std::end(arr), P()); in test()
41 std::binary_search(std::begin(arr), std::end(arr), 1); in test()
44 std::binary_search(std::begin(arr), std::end(arr), 1, std::greater<int>()); in test()
55 std::count_if(std::begin(arr), std::end(arr), P()); in test()
58 std::count(std::begin(arr), std::end(arr), 1); in test()
61 std::equal_range(std::begin(arr), std::end(arr), 1); in test()
[all …]
/external/cronet/tot/third_party/libc++/src/test/libcxx/diagnostics/
Dalgorithm.nodiscard.verify.cpp26 int arr[1] = { 1 }; in test() local
29 std::adjacent_find(std::begin(arr), std::end(arr)); in test()
32 std::adjacent_find(std::begin(arr), std::end(arr), std::greater<int>()); in test()
35 std::all_of(std::begin(arr), std::end(arr), P()); in test()
38 std::any_of(std::begin(arr), std::end(arr), P()); in test()
41 std::binary_search(std::begin(arr), std::end(arr), 1); in test()
44 std::binary_search(std::begin(arr), std::end(arr), 1, std::greater<int>()); in test()
55 std::count_if(std::begin(arr), std::end(arr), P()); in test()
58 std::count(std::begin(arr), std::end(arr), 1); in test()
61 std::equal_range(std::begin(arr), std::end(arr), 1); in test()
[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/tensorflow/tensorflow/compiler/xla/
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 …]
/external/mesa3d/src/intel/common/
Dintel_sample_positions.h69 #define INTEL_SAMPLE_POS_ELEM(prefix, arr, sample_idx) \ argument
70 prefix##sample_idx##XOffset = CLAMP(arr[sample_idx].x, 0.0, 0.9375); \
71 prefix##sample_idx##YOffset = CLAMP(arr[sample_idx].y, 0.0, 0.9375);
73 #define INTEL_SAMPLE_POS_1X_ARRAY(prefix, arr)\ argument
74 INTEL_SAMPLE_POS_ELEM(prefix, arr, 0);
76 #define INTEL_SAMPLE_POS_2X_ARRAY(prefix, arr) \ argument
77 INTEL_SAMPLE_POS_ELEM(prefix, arr, 0); \
78 INTEL_SAMPLE_POS_ELEM(prefix, arr, 1);
80 #define INTEL_SAMPLE_POS_4X_ARRAY(prefix, arr) \ argument
81 INTEL_SAMPLE_POS_ELEM(prefix, arr, 0); \
[all …]
/external/rust/android-crates-io/crates/grpcio-sys/grpc/third_party/upb/upb/collections/
Darray.c53 size_t upb_Array_Size(const upb_Array* arr) { return arr->size; } in upb_Array_Size() argument
55 upb_MessageValue upb_Array_Get(const upb_Array* arr, size_t i) { in upb_Array_Get() argument
57 const char* data = _upb_array_constptr(arr); in upb_Array_Get()
58 int lg2 = arr->data & 7; in upb_Array_Get()
59 UPB_ASSERT(i < arr->size); in upb_Array_Get()
64 void upb_Array_Set(upb_Array* arr, size_t i, upb_MessageValue val) { in upb_Array_Set() argument
65 char* data = _upb_array_ptr(arr); in upb_Array_Set()
66 int lg2 = arr->data & 7; in upb_Array_Set()
67 UPB_ASSERT(i < arr->size); in upb_Array_Set()
71 bool upb_Array_Append(upb_Array* arr, upb_MessageValue val, upb_Arena* arena) { in upb_Array_Append() argument
[all …]
/external/grpc-grpc/third_party/upb/upb/message/
Darray.c26 upb_MessageValue upb_Array_Get(const upb_Array* arr, size_t i) { in upb_Array_Get() argument
28 const char* data = upb_Array_DataPtr(arr); in upb_Array_Get()
29 const int lg2 = UPB_PRIVATE(_upb_Array_ElemSizeLg2)(arr); in upb_Array_Get()
30 UPB_ASSERT(i < arr->UPB_PRIVATE(size)); in upb_Array_Get()
35 upb_MutableMessageValue upb_Array_GetMutable(upb_Array* arr, size_t i) { in upb_Array_GetMutable() argument
37 char* data = upb_Array_MutableDataPtr(arr); in upb_Array_GetMutable()
38 const int lg2 = UPB_PRIVATE(_upb_Array_ElemSizeLg2)(arr); in upb_Array_GetMutable()
39 UPB_ASSERT(i < arr->UPB_PRIVATE(size)); in upb_Array_GetMutable()
44 void upb_Array_Set(upb_Array* arr, size_t i, upb_MessageValue val) { in upb_Array_Set() argument
45 char* data = upb_Array_MutableDataPtr(arr); in upb_Array_Set()
[all …]

12345678910>>...108