Home
last modified time | relevance | path

Searched refs:mi (Results 1 – 2 of 2) sorted by relevance

/libcore/ojluni/src/test/java/time/tck/java/time/
DTCKLocalDateTime.java228 private void check(LocalDateTime test, int y, int m, int d, int h, int mi, int s, int n) { in check() argument
233 assertEquals(test.getMinute(), mi); in check() local
238 assertEquals(LocalDateTime.of(y, m, d, h, mi, s, n), test); in check()
3172 public void test_equals_true(int y, int m, int d, int h, int mi, int s, int n) {
3173 LocalDateTime a = LocalDateTime.of(y, m, d, h, mi, s, n);
3174 LocalDateTime b = LocalDateTime.of(y, m, d, h, mi, s, n);
3179 public void test_equals_false_year_differs(int y, int m, int d, int h, int mi, int s, int n) {
3180 LocalDateTime a = LocalDateTime.of(y, m, d, h, mi, s, n);
3181 LocalDateTime b = LocalDateTime.of(y + 1, m, d, h, mi, s, n);
3186 public void test_equals_false_month_differs(int y, int m, int d, int h, int mi, int s, int n) {
[all …]
/libcore/ojluni/src/main/java/java/util/
DDualPivotQuicksort.java185 int hi = run[k], mi = run[k - 1]; in sort() local
186 for (int i = run[k - 2], p = i, q = mi; i < hi; ++i) { in sort()
187 if (q >= hi || p < mi && a[p + ao] <= a[q + ao]) { in sort()
633 int hi = run[k], mi = run[k - 1]; in sort() local
634 for (int i = run[k - 2], p = i, q = mi; i < hi; ++i) { in sort()
635 if (q >= hi || p < mi && a[p + ao] <= a[q + ao]) { in sort()
1117 int hi = run[k], mi = run[k - 1]; in doSort() local
1118 for (int i = run[k - 2], p = i, q = mi; i < hi; ++i) { in doSort()
1119 if (q >= hi || p < mi && a[p + ao] <= a[q + ao]) { in doSort()
1601 int hi = run[k], mi = run[k - 1]; in doSort() local
[all …]