| /external/python/cpython3/Lib/test/decimaltestdata/ |
| D | max.decTest | 2 -- max.decTest -- decimal maximum --
32 maxx001 max -2 -2 -> -2
33 maxx002 max -2 -1 -> -1
34 maxx003 max -2 0 -> 0
35 maxx004 max -2 1 -> 1
36 maxx005 max -2 2 -> 2
37 maxx006 max -1 -2 -> -1
38 maxx007 max -1 -1 -> -1
39 maxx008 max -1 0 -> 0
40 maxx009 max -1 1 -> 1
[all …]
|
| D | dqMax.decTest | 32 dqmax001 max -2 -2 -> -2
33 dqmax002 max -2 -1 -> -1
34 dqmax003 max -2 0 -> 0
35 dqmax004 max -2 1 -> 1
36 dqmax005 max -2 2 -> 2
37 dqmax006 max -1 -2 -> -1
38 dqmax007 max -1 -1 -> -1
39 dqmax008 max -1 0 -> 0
40 dqmax009 max -1 1 -> 1
41 dqmax010 max -1 2 -> 2
[all …]
|
| D | ddMax.decTest | 32 ddmax001 max -2 -2 -> -2
33 ddmax002 max -2 -1 -> -1
34 ddmax003 max -2 0 -> 0
35 ddmax004 max -2 1 -> 1
36 ddmax005 max -2 2 -> 2
37 ddmax006 max -1 -2 -> -1
38 ddmax007 max -1 -1 -> -1
39 ddmax008 max -1 0 -> 0
40 ddmax009 max -1 1 -> 1
41 ddmax010 max -1 2 -> 2
[all …]
|
| /external/perfetto/test/trace_processor/diff_tests/metrics/memory/ |
| D | android_mem_counters.out | 7 max: 2523136.0
13 max: 2392064.0
19 max: 0.0
25 max: 2523136.0
36 max: 884736.0
42 max: 2101248.0
48 max: 0.0
54 max: 884736.0
65 max: 3989504.0
71 max: 9334784.0
[all …]
|
| D | android_mem_by_priority.out | 7 max: 4000.0
13 max: 10000.0
19 max: 0.0
25 max: 4000.0
35 max: 3000.0
40 max: 10000.0
45 max: 0.0
50 max: 3000.0
60 max: 4000.0
65 max: 10000.0
[all …]
|
| /external/e2fsprogs/tests/f_h_reindex/ |
| D | expect.1 | 5 Problem in HTREE directory inode 16001: block #1 has bad max hash
7 Problem in HTREE directory inode 16001: block #2 has bad max hash
9 Problem in HTREE directory inode 16001: block #3 has bad max hash
11 Problem in HTREE directory inode 16001: block #4 has bad max hash
13 Problem in HTREE directory inode 16001: block #5 has bad max hash
15 Problem in HTREE directory inode 16001: block #6 has bad max hash
17 Problem in HTREE directory inode 16001: block #7 has bad max hash
21 Problem in HTREE directory inode 24001: block #1 has bad max hash
22 Problem in HTREE directory inode 24001: block #2 has bad max hash
24 Problem in HTREE directory inode 24001: block #3 has bad max hash
[all …]
|
| /external/cronet/tot/net/http/ |
| D | http_security_headers_unittest.cc | 44 "max-age=123", ";max-age=123", ";;max-age=123", in TEST_F()
45 ";;;;max-age=123", "; ;max-age=123", "; ; max-age=123", in TEST_F()
46 ";max-age=123;", ";;max-age=123;;", ";;;;max-age=123;;;;", in TEST_F()
47 "; ;max-age=123; ;", "; ; max-age=123; ; ", "max-age=123;", in TEST_F()
48 "max-age=123;;", "max-age=123;;;;", "max-age=123; ;", in TEST_F()
49 "max-age=123; ; ", in TEST_F()
64 "'max-age'=1", in TEST_F()
65 "\"max-age\"=1", in TEST_F()
66 "max-age=1; max-age=2", in TEST_F()
67 "max-age=1; MaX-AgE=2", in TEST_F()
[all …]
|
| /external/cronet/stable/net/http/ |
| D | http_security_headers_unittest.cc | 44 "max-age=123", ";max-age=123", ";;max-age=123", in TEST_F()
45 ";;;;max-age=123", "; ;max-age=123", "; ; max-age=123", in TEST_F()
46 ";max-age=123;", ";;max-age=123;;", ";;;;max-age=123;;;;", in TEST_F()
47 "; ;max-age=123; ;", "; ; max-age=123; ; ", "max-age=123;", in TEST_F()
48 "max-age=123;;", "max-age=123;;;;", "max-age=123; ;", in TEST_F()
49 "max-age=123; ; ", in TEST_F()
64 "'max-age'=1", in TEST_F()
65 "\"max-age\"=1", in TEST_F()
66 "max-age=1; max-age=2", in TEST_F()
67 "max-age=1; MaX-AgE=2", in TEST_F()
[all …]
|
| /external/rust/android-crates-io/crates/num-integer/tests/ |
| D | average.rs | 12 let max = std::$I::MAX; localVariable
13 assert_eq!((max - 3).average_ceil(&(max - 1)), max - 2);
14 assert_eq!((max - 3).average_ceil(&(max - 2)), max - 2);
23 let max = std::$I::MAX; localVariable
24 assert_eq!(min.average_ceil(&max), 0 as $I);
36 let max = std::$I::MAX; localVariable
37 assert_eq!((max - 3).average_floor(&(max - 1)), max - 2);
38 assert_eq!((max - 3).average_floor(&(max - 2)), max - 3);
47 let max = std::$I::MAX; localVariable
48 assert_eq!(min.average_floor(&max), -1 as $I);
[all …]
|
| /external/deqp/android/cts/main/vk-main-2022-03-01/image/ |
| D | atomic-operations.txt | 1 dEQP-VK.image.atomic_operations.max.1d.notransfer.normal_read.normal_img.r32f_end_result
2 dEQP-VK.image.atomic_operations.max.1d.notransfer.normal_read.normal_img.r32f_intermediate_values
3 dEQP-VK.image.atomic_operations.max.1d.transfer.normal_read.normal_img.r32f_end_result
4 dEQP-VK.image.atomic_operations.max.1d.transfer.normal_read.normal_img.r32f_intermediate_values
5 dEQP-VK.image.atomic_operations.max.1d_array.notransfer.normal_read.normal_img.r32f_end_result
6 dEQP-VK.image.atomic_operations.max.1d_array.notransfer.normal_read.normal_img.r32f_intermediate_va…
7 dEQP-VK.image.atomic_operations.max.1d_array.transfer.normal_read.normal_img.r32f_end_result
8 dEQP-VK.image.atomic_operations.max.1d_array.transfer.normal_read.normal_img.r32f_intermediate_valu…
9 dEQP-VK.image.atomic_operations.max.2d.notransfer.normal_read.normal_img.r32f_end_result
10 dEQP-VK.image.atomic_operations.max.2d.notransfer.normal_read.normal_img.r32f_intermediate_values
[all …]
|
| /external/llvm/test/Transforms/LoopVectorize/ |
| D | minmax_reduction.ll | 11 ; Turn this into a max reduction. Make sure we use a splat to initialize the
14 ; CHECK: %[[VAR:.*]] = insertelement <2 x i32> undef, i32 %max, i32 0
22 define i32 @max_red(i32 %max) {
28 %max.red.08 = phi i32 [ %max, %entry ], [ %max.red.0, %for.body ]
31 %cmp3 = icmp sgt i32 %0, %max.red.08
32 %max.red.0 = select i1 %cmp3, i32 %0, i32 %max.red.08
39 ret i32 %max.red.0
42 ; Turn this into a max reduction. The select has its inputs reversed therefore
43 ; this is a max reduction.
51 define i32 @max_red_inverse_select(i32 %max) {
[all …]
|
| /external/jazzer-api/src/main/java/com/code_intelligence/jazzer/driver/ |
| D | FuzzedDataProviderImpl.java | 146 public byte consumeByte(byte min, byte max) { in consumeByte() argument
147 if (min > max) { in consumeByte()
149 String.format("min must be <= max (got min: %d, max: %d)", min, max)); in consumeByte()
151 return consumeByteUnchecked(min, max); in consumeByte()
157 public short consumeShort(short min, short max) { in consumeShort() argument
158 if (min > max) { in consumeShort()
160 String.format("min must be <= max (got min: %d, max: %d)", min, max)); in consumeShort()
162 return consumeShortUnchecked(min, max); in consumeShort()
170 public int consumeInt(int min, int max) { in consumeInt() argument
171 if (min > max) { in consumeInt()
[all …]
|
| /external/openscreen/util/ |
| D | saturate_cast_unittest.cc | 18 {std::numeric_limits<int64_t>::max(), in TEST()
19 std::numeric_limits<int32_t>::max()}, in TEST()
20 {std::numeric_limits<int64_t>::max() / 2 + 42, in TEST()
21 std::numeric_limits<int32_t>::max()}, in TEST()
22 {std::numeric_limits<int32_t>::max(), in TEST()
23 std::numeric_limits<int32_t>::max()}, in TEST()
45 {std::numeric_limits<uint64_t>::max(), in TEST()
46 std::numeric_limits<uint32_t>::max()}, in TEST()
47 {std::numeric_limits<uint64_t>::max() / 2 + 42, in TEST()
48 std::numeric_limits<uint32_t>::max()}, in TEST()
[all …]
|
| /external/XNNPACK/test/ |
| D | f32-vmax.cc | 26 .Test(xnn_f32_vmax_ukernel__neon_x4, VBinaryMicrokernelTester::OpType::Max); in TEST()
34 .Test(xnn_f32_vmax_ukernel__neon_x4, VBinaryMicrokernelTester::OpType::Max); in TEST()
43 .Test(xnn_f32_vmax_ukernel__neon_x4, VBinaryMicrokernelTester::OpType::Max); in TEST()
52 .Test(xnn_f32_vmax_ukernel__neon_x4, VBinaryMicrokernelTester::OpType::Max); in TEST()
62 .Test(xnn_f32_vmax_ukernel__neon_x4, VBinaryMicrokernelTester::OpType::Max); in TEST()
72 .Test(xnn_f32_vmax_ukernel__neon_x4, VBinaryMicrokernelTester::OpType::Max); in TEST()
83 .Test(xnn_f32_vmax_ukernel__neon_x4, VBinaryMicrokernelTester::OpType::Max); in TEST()
94 .Test(xnn_f32_vmax_ukernel__neon_x8, VBinaryMicrokernelTester::OpType::Max); in TEST()
102 .Test(xnn_f32_vmax_ukernel__neon_x8, VBinaryMicrokernelTester::OpType::Max); in TEST()
111 .Test(xnn_f32_vmax_ukernel__neon_x8, VBinaryMicrokernelTester::OpType::Max); in TEST()
[all …]
|
| D | qs8-requantization.cc | 29 .qmax(std::numeric_limits<int8_t>::max()) in TEST()
37 zero_point <= std::numeric_limits<int8_t>::max(); in TEST()
44 .qmax(std::numeric_limits<int8_t>::max()) in TEST()
53 zero_point <= std::numeric_limits<int8_t>::max(); in TEST()
60 .qmax(std::numeric_limits<int8_t>::max()) in TEST()
69 zero_point <= std::numeric_limits<int8_t>::max(); in TEST()
76 .qmax(std::numeric_limits<int8_t>::max()) in TEST()
85 zero_point <= std::numeric_limits<int8_t>::max(); in TEST()
92 .qmax(std::numeric_limits<int8_t>::max()) in TEST()
102 .qmax(std::numeric_limits<int8_t>::max()) in TEST()
[all …]
|
| /external/llvm/unittests/Support/ |
| D | MathExtrasTest.cpp | 225 const T Max = std::numeric_limits<T>::max(); in SaturatingAddTestHelper() local
232 EXPECT_EQ(Max, SaturatingAdd(Max, T(1))); in SaturatingAddTestHelper()
233 EXPECT_EQ(Max, SaturatingAdd(Max, T(1), &ResultOverflowed)); in SaturatingAddTestHelper()
236 EXPECT_EQ(Max, SaturatingAdd(T(1), T(Max - 1))); in SaturatingAddTestHelper()
237 EXPECT_EQ(Max, SaturatingAdd(T(1), T(Max - 1), &ResultOverflowed)); in SaturatingAddTestHelper()
240 EXPECT_EQ(Max, SaturatingAdd(T(1), Max)); in SaturatingAddTestHelper()
241 EXPECT_EQ(Max, SaturatingAdd(T(1), Max, &ResultOverflowed)); in SaturatingAddTestHelper()
244 EXPECT_EQ(Max, SaturatingAdd(Max, Max)); in SaturatingAddTestHelper()
245 EXPECT_EQ(Max, SaturatingAdd(Max, Max, &ResultOverflowed)); in SaturatingAddTestHelper()
259 const T Max = std::numeric_limits<T>::max(); in SaturatingMultiplyTestHelper() local
[all …]
|
| /external/tensorflow/tensorflow/core/platform/cloud/ |
| D | gcs_file_system_test.cc | 82 0 /* max bytes */, 0 /* max staleness */, 0 /* stat cache max age */, in TEST()
83 0 /* stat cache max entries */, 0 /* matching paths cache max age */, in TEST()
84 0 /* matching paths cache max entries */, kTestRetryConfig, in TEST()
129 0 /* max bytes */, 0 /* max staleness */, 0 /* stat cache max age */, in TEST()
130 0 /* stat cache max entries */, 0 /* matching paths cache max age */, in TEST()
131 0 /* matching paths cache max entries */, kTestRetryConfig, in TEST()
177 0 /* max bytes */, 0 /* max staleness */, 0 /* stat cache max age */, in TEST()
178 0 /* stat cache max entries */, 0 /* matching paths cache max age */, in TEST()
179 0 /* matching paths cache max entries */, kTestRetryConfig, in TEST()
224 0 /* max bytes */, 0 /* max staleness */, 0 /* stat cache max age */, in TEST()
[all …]
|
| /external/oboe/samples/RhythmGame/third_party/glm/gtc/ |
| D | random.inl | 25 std::rand() % std::numeric_limits<uint8>::max());
35 std::rand() % std::numeric_limits<uint8>::max(),
36 std::rand() % std::numeric_limits<uint8>::max());
46 std::rand() % std::numeric_limits<uint8>::max(),
47 std::rand() % std::numeric_limits<uint8>::max(),
48 std::rand() % std::numeric_limits<uint8>::max());
58 std::rand() % std::numeric_limits<uint8>::max(),
59 std::rand() % std::numeric_limits<uint8>::max(),
60 std::rand() % std::numeric_limits<uint8>::max(),
61 std::rand() % std::numeric_limits<uint8>::max());
[all …]
|
| /external/trace-cmd/Documentation/trace-cmd/ |
| D | trace-cmd-profile.1.txt | 110 Event: sched_switch:R (2) Total: 234559 Avg: 117279 Max: 129886 Min:104673
113 100% (2) time:234559 max:129886 min:104673 avg:117279
119 | 55% (1) time:129886 max:129886 min:0 avg:129886
129 45% (1) time:104673 max:104673 min:0 avg:104673
145 Event: sched_switch:S (1) Total: 1000513242 Avg: 1000513242 Max: 1000513242 Min:1000513242
148 100% (1) time:1000513242 max:1000513242 min:0 avg:1000513242
159 Event: sched_wakeup:1121 (1) Total: 43405 Avg: 43405 Max: 43405 Min:43405
162 100% (1) time:43405 max:43405 min:0 avg:43405
184 Event: func: sys_nanosleep() (1) Total: 1000598016 Avg: 1000598016 Max: 1000598016 Min:1000598016
185 Event: func: sys_munmap() (1) Total: 14300 Avg: 14300 Max: 14300 Min:14300
[all …]
|
| /external/cronet/tot/net/third_party/quiche/src/quiche/quic/core/ |
| D | quic_interval.h | 18 // as the half-open QuicInterval [min, max). A point p is considered to be
19 // contained in the QuicInterval iff p >= min && p < max. One consequence of
21 // the QuicInterval but max is not. There is no canonical representation for the
22 // empty QuicInterval; rather, any QuicInterval where max <= min is regarded as
24 // despite possibly having different underlying min() or max() values. Also
26 // "max" rather than "begin" and "end" as is conventional for the STL.
34 // either they are both empty or if their corresponding min and max fields
94 // Construct an QuicInterval representing the QuicInterval [min, max). If min
95 // < max, the constructed object will represent the non-empty QuicInterval
96 // containing all values from min up to (but not including) max. On the other
[all …]
|
| /external/cronet/stable/net/third_party/quiche/src/quiche/quic/core/ |
| D | quic_interval.h | 18 // as the half-open QuicInterval [min, max). A point p is considered to be
19 // contained in the QuicInterval iff p >= min && p < max. One consequence of
21 // the QuicInterval but max is not. There is no canonical representation for the
22 // empty QuicInterval; rather, any QuicInterval where max <= min is regarded as
24 // despite possibly having different underlying min() or max() values. Also
26 // "max" rather than "begin" and "end" as is conventional for the STL.
34 // either they are both empty or if their corresponding min and max fields
94 // Construct an QuicInterval representing the QuicInterval [min, max). If min
95 // < max, the constructed object will represent the non-empty QuicInterval
96 // containing all values from min up to (but not including) max. On the other
[all …]
|
| /external/grpc-grpc/src/core/lib/debug/ |
| D | stats_data.yaml | 24 max: 65536
41 max: 16777216 # 16 meg max write tracked
45 max: 80
53 max: 16777216
57 max: 16777216
61 max: 80
66 max: 16777216
80 max: 65536
93 max: 10000
97 max: 10000
[all …]
|
| /external/rust/android-crates-io/crates/ring/src/arithmetic/ |
| D | montgomery.rs | 215 const MAX: Limb = ZERO.wrapping_sub(1); in test_mul_add_words() constant
218 (&[MAX], &[0], MAX, 0, &[MAX]), in test_mul_add_words()
219 (&[0], &[MAX], MAX, MAX - 1, &[1]), in test_mul_add_words()
220 (&[MAX], &[MAX], MAX, MAX, &[0]), in test_mul_add_words()
221 (&[0, 0], &[MAX, MAX], MAX, MAX - 1, &[1, MAX]), in test_mul_add_words()
222 (&[1, 0], &[MAX, MAX], MAX, MAX - 1, &[2, MAX]), in test_mul_add_words()
223 (&[MAX, 0], &[MAX, MAX], MAX, MAX, &[0, 0]), in test_mul_add_words()
224 (&[0, 1], &[MAX, MAX], MAX, MAX, &[1, 0]), in test_mul_add_words()
225 (&[MAX, MAX], &[MAX, MAX], MAX, MAX, &[0, MAX]), in test_mul_add_words()
|
| /external/cronet/stable/net/base/ |
| D | interval.h | 15 // the half-open interval [min, max). A point p is considered to be contained in
16 // the interval iff p >= min && p < max. One consequence of this definition is
17 // that for any non-empty interval, min is contained in the interval but max is
19 // interval where max <= min is regarded as empty. As a consequence, two empty
21 // underlying min() or max() values. Also beware of the terminology used here:
22 // the library uses the terms "min" and "max" rather than "begin" and "end" as
32 // either they are both empty or if their corresponding min and max fields
102 // Construct an Interval representing the interval [min, max). If min < max,
104 // values from min up to (but not including) max. On the other hand, if min >=
105 // max, the constructed object will represent the empty interval.
[all …]
|
| /external/cronet/tot/net/base/ |
| D | interval.h | 15 // the half-open interval [min, max). A point p is considered to be contained in
16 // the interval iff p >= min && p < max. One consequence of this definition is
17 // that for any non-empty interval, min is contained in the interval but max is
19 // interval where max <= min is regarded as empty. As a consequence, two empty
21 // underlying min() or max() values. Also beware of the terminology used here:
22 // the library uses the terms "min" and "max" rather than "begin" and "end" as
32 // either they are both empty or if their corresponding min and max fields
102 // Construct an Interval representing the interval [min, max). If min < max,
104 // values from min up to (but not including) max. On the other hand, if min >=
105 // max, the constructed object will represent the empty interval.
[all …]
|