| /external/libchrome/base/task/sequence_manager/ |
| D | intrusive_heap_unittest.cc | 75 TEST_F(IntrusiveHeapTest, Min) { in TEST_F() argument
89 EXPECT_EQ(2, heap.Min().key); in TEST_F()
99 EXPECT_EQ(0, heap.Min().key); in TEST_F()
109 EXPECT_EQ(1, heap.Min().key); in TEST_F()
173 EXPECT_EQ(i, heap.Min().key); in TEST_F()
196 EXPECT_EQ(11, heap.Min().key); in TEST_F()
198 EXPECT_EQ(13, heap.Min().key); in TEST_F()
200 EXPECT_EQ(14, heap.Min().key); in TEST_F()
202 EXPECT_EQ(15, heap.Min().key); in TEST_F()
213 EXPECT_EQ(1, heap.Min().key); in TEST_F()
[all …]
|
| D | time_domain.cc | 61 previous_wake_up = delayed_wake_up_queue_.Min().wake_up.time; in SetNextWakeUpForQueue()
81 new_wake_up = delayed_wake_up_queue_.Min().wake_up.time; in SetNextWakeUpForQueue()
106 delayed_wake_up_queue_.Min().wake_up.time <= lazy_now->Now()) { in WakeUpReadyDelayedQueues()
107 internal::TaskQueueImpl* queue = delayed_wake_up_queue_.Min().queue; in WakeUpReadyDelayedQueues()
116 return delayed_wake_up_queue_.Min().wake_up.time; in NextScheduledRunTime()
124 TimeDelta delay = delayed_wake_up_queue_.Min().wake_up.time - Now(); in AsValueInto()
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/stat/descriptive/rank/ |
| D | Min.java | 40 public class Min extends AbstractStorelessUnivariateStatistic implements Serializable { class
54 public Min() { in Min() method in Min
65 public Min(Min original) { in Min() method in Min
144 public Min copy() { in copy()
145 Min result = new Min(); in copy()
158 public static void copy(Min source, Min dest) { in copy()
|
| /external/libcxx/test/std/numerics/rand/rand.adapt/rand.adapt.ibits/ |
| D | result_type.pass.cpp | 24 template <class UIntType, UIntType Min, UIntType Max>
34 static_assert(Min < Max, "rand1 invalid parameters");
39 static const result_type _Min = Min;
43 static TEST_CONSTEXPR result_type min() {return Min;} in min()
46 explicit rand1(result_type sd = Min) : x_(sd) in rand1()
48 if (x_ < Min) in rand1()
49 x_ = Min; in rand1()
60 x_ = Min; in operator ()()
|
| D | eval.pass.cpp | 22 template <class UIntType, UIntType Min, UIntType Max>
32 static_assert(Min < Max, "rand1 invalid parameters");
37 static const result_type _Min = Min;
41 static TEST_CONSTEXPR result_type min() {return Min;} in min()
44 explicit rand1(result_type sd = Min) : x_(sd) in rand1()
56 x_ = Min; in operator ()()
|
| /external/libcxx/test/std/numerics/rand/rand.adapt/rand.adapt.shuf/ |
| D | result_type.pass.cpp | 24 template <class UIntType, UIntType Min, UIntType Max>
34 static_assert(Min < Max, "rand1 invalid parameters");
39 static const result_type _Min = Min;
43 static TEST_CONSTEXPR result_type min() {return Min;} in min()
46 explicit rand1(result_type sd = Min) : x_(sd) in rand1()
48 if (x_ < Min) in rand1()
49 x_ = Min; in rand1()
60 x_ = Min; in operator ()()
|
| D | eval.pass.cpp | 22 template <class UIntType, UIntType Min, UIntType Max>
32 static_assert(Min < Max, "rand1 invalid parameters");
37 static const result_type _Min = Min;
41 static TEST_CONSTEXPR result_type min() {return Min;} in min()
44 explicit rand1(result_type sd = Min) : x_(sd) in rand1()
56 x_ = Min; in operator ()()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/unittests/Support/ |
| D | CheckedArithmeticTest.cpp | 10 const int64_t Min = std::numeric_limits<int64_t>::min(); in TEST() local
12 EXPECT_EQ(checkedAdd<int64_t>(Min, -1), None); in TEST()
19 const int16_t Min = std::numeric_limits<int16_t>::min(); in TEST() local
21 EXPECT_EQ(checkedAdd<int16_t>(Min, -1), None); in TEST()
28 const int64_t Min = std::numeric_limits<int64_t>::min(); in TEST() local
31 EXPECT_EQ(checkedMul<int64_t>(Min, 2), None); in TEST()
37 const int64_t Min = std::numeric_limits<int64_t>::min(); in TEST() local
40 EXPECT_EQ(checkedMulAdd<int64_t>(1, -1, Min), None); in TEST()
46 const int16_t Min = std::numeric_limits<int16_t>::min(); in TEST() local
49 EXPECT_EQ(checkedMul<int16_t>(Min, 2), None); in TEST()
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/GlobalISel/ |
| D | LegalizeMutations.cpp | 31 unsigned Min) { in widenScalarToNextPow2() argument
35 if (NewSizeInBits < Min) in widenScalarToNextPow2()
36 NewSizeInBits = Min; in widenScalarToNextPow2()
42 unsigned Min) { in moreElementsToNextPow2() argument
46 if (NewNumElements < Min) in moreElementsToNextPow2()
47 NewNumElements = Min; in moreElementsToNextPow2()
|
| /external/vboot_reference/tests/ |
| D | utility_tests.c | 34 TEST_EQ(Min(1, 2), 1, "Min 1"); in MacrosTest()
35 TEST_EQ(Min(4, 3), 3, "Min 2"); in MacrosTest()
36 TEST_EQ(Min(5, 5), 5, "Min 5"); in MacrosTest()
37 TEST_EQ(Min(a, b), b, "Min uint64 1"); in MacrosTest()
38 TEST_EQ(Min(b, a), b, "Min uint64 2"); in MacrosTest()
39 TEST_EQ(Min(b, b), b, "Min uint64 same"); in MacrosTest()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/tools/llvm-xray/ |
| D | xray-graph.h | 45 double Min; member
170 return {A.Count + B.Count, A.Min + B.Min, A.Median + B.Median,
179 return {A.Count - B.Count, A.Min - B.Min, A.Median - B.Median,
189 A.Min / B,
201 A.Min * B,
218 return {A.Count * B.Count, A.Min * B.Min, A.Median * B.Median,
226 return {A.Count / B.Count, A.Min / B.Min, A.Median / B.Median,
|
| D | xray-color-helper.cpp | 87 int Min = 0; in convertToHSV() local
90 if (Scaled[i] < Scaled[Min]) in convertToHSV()
91 Min = i; in convertToHSV()
96 double C = Scaled[Max] - Scaled[Min]; in convertToHSV()
143 double Min = V - C; in convertToRGB() local
144 double RGB2[3] = {RGB1[0] + Min, RGB1[1] + Min, RGB1[2] + Min}; in convertToRGB()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/CodeGen/PBQP/ |
| D | ReductionRules.h | 51 PBQPNum Min = ECosts[0][j] + XCosts[0]; in applyR1() local
54 if (C < Min) in applyR1()
55 Min = C; in applyR1()
57 YCosts[j] += Min; in applyR1()
61 PBQPNum Min = ECosts[i][0] + XCosts[0]; in applyR1() local
64 if (C < Min) in applyR1()
65 Min = C; in applyR1()
67 YCosts[i] += Min; in applyR1()
113 PBQPNum Min = (*YXECosts)[i][0] + (*ZXECosts)[j][0] + XCosts[0]; in applyR2() local
116 if (C < Min) { in applyR2()
[all …]
|
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| D | ReductionRules.h | 49 PBQPNum Min = ECosts[0][j] + XCosts[0]; in applyR1() local
52 if (C < Min) in applyR1()
53 Min = C; in applyR1()
55 YCosts[j] += Min; in applyR1()
59 PBQPNum Min = ECosts[i][0] + XCosts[0]; in applyR1() local
62 if (C < Min) in applyR1()
63 Min = C; in applyR1()
65 YCosts[i] += Min; in applyR1()
111 PBQPNum Min = (*YXECosts)[i][0] + (*ZXECosts)[j][0] + XCosts[0]; in applyR2() local
114 if (C < Min) { in applyR2()
[all …]
|
| /external/compiler-rt/lib/ubsan/ |
| D | ubsan_diag.cc | 251 MemoryLocation Min = subtractNoOverflow(Loc, MinBytesNearLoc); in PrintMemorySnippet() local
253 MemoryLocation OrigMin = Min; in PrintMemorySnippet()
255 Min = __sanitizer::Min(Ranges[I].getStart().getMemoryLocation(), Min); in PrintMemorySnippet()
261 if (Max - Min > BytesToShow) in PrintMemorySnippet()
262 Min = __sanitizer::Min(Max - BytesToShow, OrigMin); in PrintMemorySnippet()
263 Max = addNoOverflow(Min, BytesToShow); in PrintMemorySnippet()
265 if (!IsAccessibleMemoryRange(Min, Max - Min)) { in PrintMemorySnippet()
272 for (uptr P = Min; P != Max; ++P) { in PrintMemorySnippet()
280 Range *InRange = upperBound(Min, Ranges, NumRanges); in PrintMemorySnippet()
281 for (uptr P = Min; P != Max; ++P) { in PrintMemorySnippet()
[all …]
|
| /external/autotest/client/site_tests/firmware_TouchMTB/tests/data/ |
| D | two_finger_tap.vertical.dat | 17 Min 0
22 Min 0
27 Min 0
31 Min 0
35 Min 0
39 Min 0
43 Min 0
47 Min 0
52 Min 0
57 Min 0
[all …]
|
| D | one_finger_swipe_late_tid.dat | 17 Min 0
22 Min 0
27 Min 0
31 Min 0
35 Min 0
40 Min 0
45 Min 0
49 Min 0
|
| D | one_finger_swipe.dat | 17 Min 0
22 Min 0
27 Min 0
31 Min 0
35 Min 0
40 Min 0
45 Min 0
49 Min 0
|
| D | non_ready_events_in_final_state_packet.dat | 11 Min 0
16 Min 0
21 Min 0
25 Min 0
29 Min 0
33 Min 0
38 Min 0
43 Min 0
47 Min 0
|
| D | one_finger_without_slot_0.dat | 17 Min 0
22 Min 0
27 Min 0
31 Min 0
35 Min 0
39 Min 0
44 Min 0
49 Min 0
53 Min 0
|
| D | 1f_clickb.dat | 17 Min 0
22 Min 0
27 Min 0
31 Min 0
35 Min 0
39 Min 0
44 Min 0
48 Min 0
|
| D | one_finger_fast_swipe_id_split.dat | 17 Min 0
22 Min 0
27 Min 0
31 Min 0
35 Min 0
40 Min 0
45 Min 0
49 Min 0
|
| /external/autotest/client/tests/cyclictest/ |
| D | README | 5 T: 0 ( 2215) P:80 I: 1000 C: 10 Min: 31 Act: 33 Avg: 33 Max: 43
6 T: 1 ( 2216) P:79 I: 1500 C: 10 Min: 22 Act: 22 Avg: 36 Max: 61
7 T: 2 ( 2217) P:78 I: 2000 C: 10 Min: 27 Act: 33 Avg: 36 Max: 50
8 T: 3 ( 2218) P:77 I: 2500 C: 10 Min: 23 Act: 37 Avg: 38 Max: 59
9 T: 4 ( 2219) P:76 I: 3000 C: 10 Min: 26 Act: 48 Avg: 36 Max: 48
|
| /external/v8/src/compiler/ |
| D | operation-typer.cc | 105 double current_min = current_range.Min(); in WeakenRange()
109 if (current_min != previous_range.Min()) { in WeakenRange()
141 return Type::Range(type.Min(), type.Max(), zone()); in Rangify()
231 double lmin = lhs.AsRange()->Min(); in MultiplyRanger()
233 double rmin = rhs.AsRange()->Min(); in MultiplyRanger()
333 double const min = type.Min(); in NumberAbs()
474 } else if (type.Min() > 0.0) { in NumberSign()
476 } else if (type.Min() >= 0.0) { in NumberSign()
524 if (type.Is(Type::PlainNumber()) && (type.Max() < 0 || 0 < type.Min())) { in NumberToBoolean()
607 type = AddRanger(lhs.Min(), lhs.Max(), rhs.Min(), rhs.Max()); in NumberAdd()
[all …]
|
| /external/clang/include/clang/Frontend/ |
| D | VerifyDiagnosticConsumer.h | 152 unsigned Min, unsigned Max);
161 unsigned Min, Max; variable
175 bool MatchAnyLine, StringRef Text, unsigned Min, unsigned Max) in Directive() argument
177 Text(Text), Min(Min), Max(Max), MatchAnyLine(MatchAnyLine) { in Directive()
|