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.java227 private void check(LocalDateTime test, int y, int m, int d, int h, int mi, int s, int n) { in check() argument
232 assertEquals(test.getMinute(), mi); in check() local
237 assertEquals(LocalDateTime.of(y, m, d, h, mi, s, n), test); in check()
3166 public void test_equals_true(int y, int m, int d, int h, int mi, int s, int n) {
3167 LocalDateTime a = LocalDateTime.of(y, m, d, h, mi, s, n);
3168 LocalDateTime b = LocalDateTime.of(y, m, d, h, mi, s, n);
3173 public void test_equals_false_year_differs(int y, int m, int d, int h, int mi, int s, int n) {
3174 LocalDateTime a = LocalDateTime.of(y, m, d, h, mi, s, n);
3175 LocalDateTime b = LocalDateTime.of(y + 1, m, d, h, mi, s, n);
3180 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.java198 int hi = run[k], mi = run[k - 1]; in sort() local
199 for (int i = run[k - 2], p = i, q = mi; i < hi; ++i) { in sort()
200 if (q >= hi || p < mi && a[p + ao] <= a[q + ao]) { in sort()
664 int hi = run[k], mi = run[k - 1]; in sort() local
665 for (int i = run[k - 2], p = i, q = mi; i < hi; ++i) { in sort()
666 if (q >= hi || p < mi && a[p + ao] <= a[q + ao]) { in sort()
1166 int hi = run[k], mi = run[k - 1]; in doSort() local
1167 for (int i = run[k - 2], p = i, q = mi; i < hi; ++i) { in doSort()
1168 if (q >= hi || p < mi && a[p + ao] <= a[q + ao]) { in doSort()
1668 int hi = run[k], mi = run[k - 1]; in doSort() local
[all …]