/** * Checks if the array is sorted */ public static boolean isSorted(final DefaultDomainElement1D[] domains) { if (domains == null) return true; for (int i = 1; i < domains.length; i++) { final DefaultDomainElement1D d1 = domains[i]; assert !(d1.getInputMinimum() > d1.getInputMaximum()) : d1; final DefaultDomainElement1D d0 = domains[i - 1]; assert !(d0.getInputMinimum() > d0.getInputMaximum()) : d0; if (compare(d0.getInputMaximum(), d1.getInputMinimum()) > 0) { return false; } } return true; }
/** * Checks if the array is sorted */ public static boolean isSorted(final DefaultDomainElement1D[] domains) { if (domains == null) return true; for (int i = 1; i < domains.length; i++) { final DefaultDomainElement1D d1 = domains[i]; assert !(d1.getInputMinimum() > d1.getInputMaximum()) : d1; final DefaultDomainElement1D d0 = domains[i - 1]; assert !(d0.getInputMinimum() > d0.getInputMaximum()) : d0; if (compare(d0.getInputMaximum(), d1.getInputMinimum()) > 0) { return false; } } return true; }
for (int i = 0; i < elements.length; i++) { final DefaultDomainElement1D c = elements[i]; final double inMinimum = minimums[i] = c.getInputMinimum(); if (i != 0) { assert !(inMinimum < minimums[i - 1]) : inMinimum; for (int i = elements.length; --i >= 0;) { final E candidate = elements[i]; if (Double.isInfinite(candidate.getInputMinimum()) && Double.isInfinite(candidate.getInputMaximum())) { range = Double.POSITIVE_INFINITY; continue; final double candidateRange = candidate.getInputMaximum() - candidate.getInputMinimum(); if (candidateRange >= range) { range = candidateRange;
for (int i = 0; i < elements.length; i++) { final DefaultDomainElement1D c = elements[i]; final double inMinimum = minimums[i] = c.getInputMinimum(); if (i != 0) { assert !(inMinimum < minimums[i - 1]) : inMinimum; for (int i = elements.length; --i >= 0;) { final E candidate = elements[i]; if (Double.isInfinite(candidate.getInputMinimum()) && Double.isInfinite(candidate.getInputMaximum())) { range = Double.POSITIVE_INFINITY; continue; final double candidateRange = candidate.getInputMaximum() - candidate.getInputMinimum(); if (candidateRange >= range) { range = candidateRange;