commons-notifications mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From l..@apache.org
Subject svn commit: r961863 [9/34] - in /websites/production/commons/content/proper/commons-math: ./ apidocs/ apidocs/org/apache/commons/math3/analysis/class-use/ apidocs/org/apache/commons/math3/analysis/interpolation/ apidocs/org/apache/commons/math3/analysi...
Date Fri, 14 Aug 2015 19:12:44 GMT
Modified: websites/production/commons/content/proper/commons-math/apidocs/src-html/org/apache/commons/math3/util/MathArrays.Position.html
==============================================================================
--- websites/production/commons/content/proper/commons-math/apidocs/src-html/org/apache/commons/math3/util/MathArrays.Position.html (original)
+++ websites/production/commons/content/proper/commons-math/apidocs/src-html/org/apache/commons/math3/util/MathArrays.Position.html Fri Aug 14 19:12:42 2015
@@ -251,1514 +251,1525 @@
 <span class="sourceLineNo">243</span>    }<a name="line.243"></a>
 <span class="sourceLineNo">244</span><a name="line.244"></a>
 <span class="sourceLineNo">245</span>    /**<a name="line.245"></a>
-<span class="sourceLineNo">246</span>     * Calculates the L&lt;sub&gt;2&lt;/sub&gt; (Euclidean) distance between two points.<a name="line.246"></a>
+<span class="sourceLineNo">246</span>     * Calculates the cosine of the angle between two vectors.<a name="line.246"></a>
 <span class="sourceLineNo">247</span>     *<a name="line.247"></a>
-<span class="sourceLineNo">248</span>     * @param p1 the first point<a name="line.248"></a>
-<span class="sourceLineNo">249</span>     * @param p2 the second point<a name="line.249"></a>
-<span class="sourceLineNo">250</span>     * @return the L&lt;sub&gt;2&lt;/sub&gt; distance between the two points<a name="line.250"></a>
+<span class="sourceLineNo">248</span>     * @param v1 Cartesian coordinates of the first vector.<a name="line.248"></a>
+<span class="sourceLineNo">249</span>     * @param v2 Cartesian coordinates of the second vector.<a name="line.249"></a>
+<span class="sourceLineNo">250</span>     * @return the cosine of the angle between the vectors.<a name="line.250"></a>
 <span class="sourceLineNo">251</span>     */<a name="line.251"></a>
-<span class="sourceLineNo">252</span>    public static double distance(int[] p1, int[] p2) {<a name="line.252"></a>
-<span class="sourceLineNo">253</span>      double sum = 0;<a name="line.253"></a>
-<span class="sourceLineNo">254</span>      for (int i = 0; i &lt; p1.length; i++) {<a name="line.254"></a>
-<span class="sourceLineNo">255</span>          final double dp = p1[i] - p2[i];<a name="line.255"></a>
-<span class="sourceLineNo">256</span>          sum += dp * dp;<a name="line.256"></a>
-<span class="sourceLineNo">257</span>      }<a name="line.257"></a>
-<span class="sourceLineNo">258</span>      return FastMath.sqrt(sum);<a name="line.258"></a>
-<span class="sourceLineNo">259</span>    }<a name="line.259"></a>
-<span class="sourceLineNo">260</span><a name="line.260"></a>
-<span class="sourceLineNo">261</span>    /**<a name="line.261"></a>
-<span class="sourceLineNo">262</span>     * Calculates the L&lt;sub&gt;&amp;infin;&lt;/sub&gt; (max of abs) distance between two points.<a name="line.262"></a>
-<span class="sourceLineNo">263</span>     *<a name="line.263"></a>
-<span class="sourceLineNo">264</span>     * @param p1 the first point<a name="line.264"></a>
-<span class="sourceLineNo">265</span>     * @param p2 the second point<a name="line.265"></a>
-<span class="sourceLineNo">266</span>     * @return the L&lt;sub&gt;&amp;infin;&lt;/sub&gt; distance between the two points<a name="line.266"></a>
-<span class="sourceLineNo">267</span>     */<a name="line.267"></a>
-<span class="sourceLineNo">268</span>    public static double distanceInf(double[] p1, double[] p2) {<a name="line.268"></a>
-<span class="sourceLineNo">269</span>        double max = 0;<a name="line.269"></a>
-<span class="sourceLineNo">270</span>        for (int i = 0; i &lt; p1.length; i++) {<a name="line.270"></a>
-<span class="sourceLineNo">271</span>            max = FastMath.max(max, FastMath.abs(p1[i] - p2[i]));<a name="line.271"></a>
-<span class="sourceLineNo">272</span>        }<a name="line.272"></a>
-<span class="sourceLineNo">273</span>        return max;<a name="line.273"></a>
-<span class="sourceLineNo">274</span>    }<a name="line.274"></a>
-<span class="sourceLineNo">275</span><a name="line.275"></a>
-<span class="sourceLineNo">276</span>    /**<a name="line.276"></a>
-<span class="sourceLineNo">277</span>     * Calculates the L&lt;sub&gt;&amp;infin;&lt;/sub&gt; (max of abs) distance between two points.<a name="line.277"></a>
-<span class="sourceLineNo">278</span>     *<a name="line.278"></a>
-<span class="sourceLineNo">279</span>     * @param p1 the first point<a name="line.279"></a>
-<span class="sourceLineNo">280</span>     * @param p2 the second point<a name="line.280"></a>
-<span class="sourceLineNo">281</span>     * @return the L&lt;sub&gt;&amp;infin;&lt;/sub&gt; distance between the two points<a name="line.281"></a>
-<span class="sourceLineNo">282</span>     */<a name="line.282"></a>
-<span class="sourceLineNo">283</span>    public static int distanceInf(int[] p1, int[] p2) {<a name="line.283"></a>
-<span class="sourceLineNo">284</span>        int max = 0;<a name="line.284"></a>
-<span class="sourceLineNo">285</span>        for (int i = 0; i &lt; p1.length; i++) {<a name="line.285"></a>
-<span class="sourceLineNo">286</span>            max = FastMath.max(max, FastMath.abs(p1[i] - p2[i]));<a name="line.286"></a>
-<span class="sourceLineNo">287</span>        }<a name="line.287"></a>
-<span class="sourceLineNo">288</span>        return max;<a name="line.288"></a>
-<span class="sourceLineNo">289</span>    }<a name="line.289"></a>
-<span class="sourceLineNo">290</span><a name="line.290"></a>
-<span class="sourceLineNo">291</span>    /**<a name="line.291"></a>
-<span class="sourceLineNo">292</span>     * Specification of ordering direction.<a name="line.292"></a>
+<span class="sourceLineNo">252</span>    public static double cosAngle(double[] v1, double[] v2) {<a name="line.252"></a>
+<span class="sourceLineNo">253</span>        return linearCombination(v1, v2) / (safeNorm(v1) * safeNorm(v2));<a name="line.253"></a>
+<span class="sourceLineNo">254</span>    }<a name="line.254"></a>
+<span class="sourceLineNo">255</span><a name="line.255"></a>
+<span class="sourceLineNo">256</span>    /**<a name="line.256"></a>
+<span class="sourceLineNo">257</span>     * Calculates the L&lt;sub&gt;2&lt;/sub&gt; (Euclidean) distance between two points.<a name="line.257"></a>
+<span class="sourceLineNo">258</span>     *<a name="line.258"></a>
+<span class="sourceLineNo">259</span>     * @param p1 the first point<a name="line.259"></a>
+<span class="sourceLineNo">260</span>     * @param p2 the second point<a name="line.260"></a>
+<span class="sourceLineNo">261</span>     * @return the L&lt;sub&gt;2&lt;/sub&gt; distance between the two points<a name="line.261"></a>
+<span class="sourceLineNo">262</span>     */<a name="line.262"></a>
+<span class="sourceLineNo">263</span>    public static double distance(int[] p1, int[] p2) {<a name="line.263"></a>
+<span class="sourceLineNo">264</span>      double sum = 0;<a name="line.264"></a>
+<span class="sourceLineNo">265</span>      for (int i = 0; i &lt; p1.length; i++) {<a name="line.265"></a>
+<span class="sourceLineNo">266</span>          final double dp = p1[i] - p2[i];<a name="line.266"></a>
+<span class="sourceLineNo">267</span>          sum += dp * dp;<a name="line.267"></a>
+<span class="sourceLineNo">268</span>      }<a name="line.268"></a>
+<span class="sourceLineNo">269</span>      return FastMath.sqrt(sum);<a name="line.269"></a>
+<span class="sourceLineNo">270</span>    }<a name="line.270"></a>
+<span class="sourceLineNo">271</span><a name="line.271"></a>
+<span class="sourceLineNo">272</span>    /**<a name="line.272"></a>
+<span class="sourceLineNo">273</span>     * Calculates the L&lt;sub&gt;&amp;infin;&lt;/sub&gt; (max of abs) distance between two points.<a name="line.273"></a>
+<span class="sourceLineNo">274</span>     *<a name="line.274"></a>
+<span class="sourceLineNo">275</span>     * @param p1 the first point<a name="line.275"></a>
+<span class="sourceLineNo">276</span>     * @param p2 the second point<a name="line.276"></a>
+<span class="sourceLineNo">277</span>     * @return the L&lt;sub&gt;&amp;infin;&lt;/sub&gt; distance between the two points<a name="line.277"></a>
+<span class="sourceLineNo">278</span>     */<a name="line.278"></a>
+<span class="sourceLineNo">279</span>    public static double distanceInf(double[] p1, double[] p2) {<a name="line.279"></a>
+<span class="sourceLineNo">280</span>        double max = 0;<a name="line.280"></a>
+<span class="sourceLineNo">281</span>        for (int i = 0; i &lt; p1.length; i++) {<a name="line.281"></a>
+<span class="sourceLineNo">282</span>            max = FastMath.max(max, FastMath.abs(p1[i] - p2[i]));<a name="line.282"></a>
+<span class="sourceLineNo">283</span>        }<a name="line.283"></a>
+<span class="sourceLineNo">284</span>        return max;<a name="line.284"></a>
+<span class="sourceLineNo">285</span>    }<a name="line.285"></a>
+<span class="sourceLineNo">286</span><a name="line.286"></a>
+<span class="sourceLineNo">287</span>    /**<a name="line.287"></a>
+<span class="sourceLineNo">288</span>     * Calculates the L&lt;sub&gt;&amp;infin;&lt;/sub&gt; (max of abs) distance between two points.<a name="line.288"></a>
+<span class="sourceLineNo">289</span>     *<a name="line.289"></a>
+<span class="sourceLineNo">290</span>     * @param p1 the first point<a name="line.290"></a>
+<span class="sourceLineNo">291</span>     * @param p2 the second point<a name="line.291"></a>
+<span class="sourceLineNo">292</span>     * @return the L&lt;sub&gt;&amp;infin;&lt;/sub&gt; distance between the two points<a name="line.292"></a>
 <span class="sourceLineNo">293</span>     */<a name="line.293"></a>
-<span class="sourceLineNo">294</span>    public static enum OrderDirection {<a name="line.294"></a>
-<span class="sourceLineNo">295</span>        /** Constant for increasing direction. */<a name="line.295"></a>
-<span class="sourceLineNo">296</span>        INCREASING,<a name="line.296"></a>
-<span class="sourceLineNo">297</span>        /** Constant for decreasing direction. */<a name="line.297"></a>
-<span class="sourceLineNo">298</span>        DECREASING<a name="line.298"></a>
-<span class="sourceLineNo">299</span>    }<a name="line.299"></a>
-<span class="sourceLineNo">300</span><a name="line.300"></a>
-<span class="sourceLineNo">301</span>    /**<a name="line.301"></a>
-<span class="sourceLineNo">302</span>     * Check that an array is monotonically increasing or decreasing.<a name="line.302"></a>
-<span class="sourceLineNo">303</span>     *<a name="line.303"></a>
-<span class="sourceLineNo">304</span>     * @param &lt;T&gt; the type of the elements in the specified array<a name="line.304"></a>
-<span class="sourceLineNo">305</span>     * @param val Values.<a name="line.305"></a>
-<span class="sourceLineNo">306</span>     * @param dir Ordering direction.<a name="line.306"></a>
-<span class="sourceLineNo">307</span>     * @param strict Whether the order should be strict.<a name="line.307"></a>
-<span class="sourceLineNo">308</span>     * @return {@code true} if sorted, {@code false} otherwise.<a name="line.308"></a>
-<span class="sourceLineNo">309</span>     */<a name="line.309"></a>
-<span class="sourceLineNo">310</span>    public static  &lt;T extends Comparable&lt;? super T&gt;&gt; boolean isMonotonic(T[] val,<a name="line.310"></a>
-<span class="sourceLineNo">311</span>                                      OrderDirection dir,<a name="line.311"></a>
-<span class="sourceLineNo">312</span>                                      boolean strict) {<a name="line.312"></a>
-<span class="sourceLineNo">313</span>        T previous = val[0];<a name="line.313"></a>
-<span class="sourceLineNo">314</span>        final int max = val.length;<a name="line.314"></a>
-<span class="sourceLineNo">315</span>        for (int i = 1; i &lt; max; i++) {<a name="line.315"></a>
-<span class="sourceLineNo">316</span>            final int comp;<a name="line.316"></a>
-<span class="sourceLineNo">317</span>            switch (dir) {<a name="line.317"></a>
-<span class="sourceLineNo">318</span>            case INCREASING:<a name="line.318"></a>
-<span class="sourceLineNo">319</span>                comp = previous.compareTo(val[i]);<a name="line.319"></a>
-<span class="sourceLineNo">320</span>                if (strict) {<a name="line.320"></a>
-<span class="sourceLineNo">321</span>                    if (comp &gt;= 0) {<a name="line.321"></a>
-<span class="sourceLineNo">322</span>                        return false;<a name="line.322"></a>
-<span class="sourceLineNo">323</span>                    }<a name="line.323"></a>
-<span class="sourceLineNo">324</span>                } else {<a name="line.324"></a>
-<span class="sourceLineNo">325</span>                    if (comp &gt; 0) {<a name="line.325"></a>
-<span class="sourceLineNo">326</span>                        return false;<a name="line.326"></a>
-<span class="sourceLineNo">327</span>                    }<a name="line.327"></a>
-<span class="sourceLineNo">328</span>                }<a name="line.328"></a>
-<span class="sourceLineNo">329</span>                break;<a name="line.329"></a>
-<span class="sourceLineNo">330</span>            case DECREASING:<a name="line.330"></a>
-<span class="sourceLineNo">331</span>                comp = val[i].compareTo(previous);<a name="line.331"></a>
-<span class="sourceLineNo">332</span>                if (strict) {<a name="line.332"></a>
-<span class="sourceLineNo">333</span>                    if (comp &gt;= 0) {<a name="line.333"></a>
-<span class="sourceLineNo">334</span>                        return false;<a name="line.334"></a>
-<span class="sourceLineNo">335</span>                    }<a name="line.335"></a>
-<span class="sourceLineNo">336</span>                } else {<a name="line.336"></a>
-<span class="sourceLineNo">337</span>                    if (comp &gt; 0) {<a name="line.337"></a>
-<span class="sourceLineNo">338</span>                       return false;<a name="line.338"></a>
-<span class="sourceLineNo">339</span>                    }<a name="line.339"></a>
-<span class="sourceLineNo">340</span>                }<a name="line.340"></a>
-<span class="sourceLineNo">341</span>                break;<a name="line.341"></a>
-<span class="sourceLineNo">342</span>            default:<a name="line.342"></a>
-<span class="sourceLineNo">343</span>                // Should never happen.<a name="line.343"></a>
-<span class="sourceLineNo">344</span>                throw new MathInternalError();<a name="line.344"></a>
-<span class="sourceLineNo">345</span>            }<a name="line.345"></a>
-<span class="sourceLineNo">346</span><a name="line.346"></a>
-<span class="sourceLineNo">347</span>            previous = val[i];<a name="line.347"></a>
-<span class="sourceLineNo">348</span>        }<a name="line.348"></a>
-<span class="sourceLineNo">349</span>        return true;<a name="line.349"></a>
-<span class="sourceLineNo">350</span>    }<a name="line.350"></a>
-<span class="sourceLineNo">351</span><a name="line.351"></a>
-<span class="sourceLineNo">352</span>    /**<a name="line.352"></a>
-<span class="sourceLineNo">353</span>     * Check that an array is monotonically increasing or decreasing.<a name="line.353"></a>
-<span class="sourceLineNo">354</span>     *<a name="line.354"></a>
-<span class="sourceLineNo">355</span>     * @param val Values.<a name="line.355"></a>
-<span class="sourceLineNo">356</span>     * @param dir Ordering direction.<a name="line.356"></a>
-<span class="sourceLineNo">357</span>     * @param strict Whether the order should be strict.<a name="line.357"></a>
-<span class="sourceLineNo">358</span>     * @return {@code true} if sorted, {@code false} otherwise.<a name="line.358"></a>
-<span class="sourceLineNo">359</span>     */<a name="line.359"></a>
-<span class="sourceLineNo">360</span>    public static boolean isMonotonic(double[] val, OrderDirection dir, boolean strict) {<a name="line.360"></a>
-<span class="sourceLineNo">361</span>        return checkOrder(val, dir, strict, false);<a name="line.361"></a>
-<span class="sourceLineNo">362</span>    }<a name="line.362"></a>
-<span class="sourceLineNo">363</span><a name="line.363"></a>
-<span class="sourceLineNo">364</span>    /**<a name="line.364"></a>
-<span class="sourceLineNo">365</span>     * Check that the given array is sorted.<a name="line.365"></a>
-<span class="sourceLineNo">366</span>     *<a name="line.366"></a>
-<span class="sourceLineNo">367</span>     * @param val Values.<a name="line.367"></a>
-<span class="sourceLineNo">368</span>     * @param dir Ordering direction.<a name="line.368"></a>
-<span class="sourceLineNo">369</span>     * @param strict Whether the order should be strict.<a name="line.369"></a>
-<span class="sourceLineNo">370</span>     * @param abort Whether to throw an exception if the check fails.<a name="line.370"></a>
-<span class="sourceLineNo">371</span>     * @return {@code true} if the array is sorted.<a name="line.371"></a>
-<span class="sourceLineNo">372</span>     * @throws NonMonotonicSequenceException if the array is not sorted<a name="line.372"></a>
-<span class="sourceLineNo">373</span>     * and {@code abort} is {@code true}.<a name="line.373"></a>
-<span class="sourceLineNo">374</span>     */<a name="line.374"></a>
-<span class="sourceLineNo">375</span>    public static boolean checkOrder(double[] val, OrderDirection dir,<a name="line.375"></a>
-<span class="sourceLineNo">376</span>                                     boolean strict, boolean abort)<a name="line.376"></a>
-<span class="sourceLineNo">377</span>        throws NonMonotonicSequenceException {<a name="line.377"></a>
-<span class="sourceLineNo">378</span>        double previous = val[0];<a name="line.378"></a>
-<span class="sourceLineNo">379</span>        final int max = val.length;<a name="line.379"></a>
-<span class="sourceLineNo">380</span><a name="line.380"></a>
-<span class="sourceLineNo">381</span>        int index;<a name="line.381"></a>
-<span class="sourceLineNo">382</span>        ITEM:<a name="line.382"></a>
-<span class="sourceLineNo">383</span>        for (index = 1; index &lt; max; index++) {<a name="line.383"></a>
-<span class="sourceLineNo">384</span>            switch (dir) {<a name="line.384"></a>
-<span class="sourceLineNo">385</span>            case INCREASING:<a name="line.385"></a>
-<span class="sourceLineNo">386</span>                if (strict) {<a name="line.386"></a>
-<span class="sourceLineNo">387</span>                    if (val[index] &lt;= previous) {<a name="line.387"></a>
-<span class="sourceLineNo">388</span>                        break ITEM;<a name="line.388"></a>
-<span class="sourceLineNo">389</span>                    }<a name="line.389"></a>
-<span class="sourceLineNo">390</span>                } else {<a name="line.390"></a>
-<span class="sourceLineNo">391</span>                    if (val[index] &lt; previous) {<a name="line.391"></a>
-<span class="sourceLineNo">392</span>                        break ITEM;<a name="line.392"></a>
-<span class="sourceLineNo">393</span>                    }<a name="line.393"></a>
-<span class="sourceLineNo">394</span>                }<a name="line.394"></a>
-<span class="sourceLineNo">395</span>                break;<a name="line.395"></a>
-<span class="sourceLineNo">396</span>            case DECREASING:<a name="line.396"></a>
+<span class="sourceLineNo">294</span>    public static int distanceInf(int[] p1, int[] p2) {<a name="line.294"></a>
+<span class="sourceLineNo">295</span>        int max = 0;<a name="line.295"></a>
+<span class="sourceLineNo">296</span>        for (int i = 0; i &lt; p1.length; i++) {<a name="line.296"></a>
+<span class="sourceLineNo">297</span>            max = FastMath.max(max, FastMath.abs(p1[i] - p2[i]));<a name="line.297"></a>
+<span class="sourceLineNo">298</span>        }<a name="line.298"></a>
+<span class="sourceLineNo">299</span>        return max;<a name="line.299"></a>
+<span class="sourceLineNo">300</span>    }<a name="line.300"></a>
+<span class="sourceLineNo">301</span><a name="line.301"></a>
+<span class="sourceLineNo">302</span>    /**<a name="line.302"></a>
+<span class="sourceLineNo">303</span>     * Specification of ordering direction.<a name="line.303"></a>
+<span class="sourceLineNo">304</span>     */<a name="line.304"></a>
+<span class="sourceLineNo">305</span>    public static enum OrderDirection {<a name="line.305"></a>
+<span class="sourceLineNo">306</span>        /** Constant for increasing direction. */<a name="line.306"></a>
+<span class="sourceLineNo">307</span>        INCREASING,<a name="line.307"></a>
+<span class="sourceLineNo">308</span>        /** Constant for decreasing direction. */<a name="line.308"></a>
+<span class="sourceLineNo">309</span>        DECREASING<a name="line.309"></a>
+<span class="sourceLineNo">310</span>    }<a name="line.310"></a>
+<span class="sourceLineNo">311</span><a name="line.311"></a>
+<span class="sourceLineNo">312</span>    /**<a name="line.312"></a>
+<span class="sourceLineNo">313</span>     * Check that an array is monotonically increasing or decreasing.<a name="line.313"></a>
+<span class="sourceLineNo">314</span>     *<a name="line.314"></a>
+<span class="sourceLineNo">315</span>     * @param &lt;T&gt; the type of the elements in the specified array<a name="line.315"></a>
+<span class="sourceLineNo">316</span>     * @param val Values.<a name="line.316"></a>
+<span class="sourceLineNo">317</span>     * @param dir Ordering direction.<a name="line.317"></a>
+<span class="sourceLineNo">318</span>     * @param strict Whether the order should be strict.<a name="line.318"></a>
+<span class="sourceLineNo">319</span>     * @return {@code true} if sorted, {@code false} otherwise.<a name="line.319"></a>
+<span class="sourceLineNo">320</span>     */<a name="line.320"></a>
+<span class="sourceLineNo">321</span>    public static  &lt;T extends Comparable&lt;? super T&gt;&gt; boolean isMonotonic(T[] val,<a name="line.321"></a>
+<span class="sourceLineNo">322</span>                                      OrderDirection dir,<a name="line.322"></a>
+<span class="sourceLineNo">323</span>                                      boolean strict) {<a name="line.323"></a>
+<span class="sourceLineNo">324</span>        T previous = val[0];<a name="line.324"></a>
+<span class="sourceLineNo">325</span>        final int max = val.length;<a name="line.325"></a>
+<span class="sourceLineNo">326</span>        for (int i = 1; i &lt; max; i++) {<a name="line.326"></a>
+<span class="sourceLineNo">327</span>            final int comp;<a name="line.327"></a>
+<span class="sourceLineNo">328</span>            switch (dir) {<a name="line.328"></a>
+<span class="sourceLineNo">329</span>            case INCREASING:<a name="line.329"></a>
+<span class="sourceLineNo">330</span>                comp = previous.compareTo(val[i]);<a name="line.330"></a>
+<span class="sourceLineNo">331</span>                if (strict) {<a name="line.331"></a>
+<span class="sourceLineNo">332</span>                    if (comp &gt;= 0) {<a name="line.332"></a>
+<span class="sourceLineNo">333</span>                        return false;<a name="line.333"></a>
+<span class="sourceLineNo">334</span>                    }<a name="line.334"></a>
+<span class="sourceLineNo">335</span>                } else {<a name="line.335"></a>
+<span class="sourceLineNo">336</span>                    if (comp &gt; 0) {<a name="line.336"></a>
+<span class="sourceLineNo">337</span>                        return false;<a name="line.337"></a>
+<span class="sourceLineNo">338</span>                    }<a name="line.338"></a>
+<span class="sourceLineNo">339</span>                }<a name="line.339"></a>
+<span class="sourceLineNo">340</span>                break;<a name="line.340"></a>
+<span class="sourceLineNo">341</span>            case DECREASING:<a name="line.341"></a>
+<span class="sourceLineNo">342</span>                comp = val[i].compareTo(previous);<a name="line.342"></a>
+<span class="sourceLineNo">343</span>                if (strict) {<a name="line.343"></a>
+<span class="sourceLineNo">344</span>                    if (comp &gt;= 0) {<a name="line.344"></a>
+<span class="sourceLineNo">345</span>                        return false;<a name="line.345"></a>
+<span class="sourceLineNo">346</span>                    }<a name="line.346"></a>
+<span class="sourceLineNo">347</span>                } else {<a name="line.347"></a>
+<span class="sourceLineNo">348</span>                    if (comp &gt; 0) {<a name="line.348"></a>
+<span class="sourceLineNo">349</span>                       return false;<a name="line.349"></a>
+<span class="sourceLineNo">350</span>                    }<a name="line.350"></a>
+<span class="sourceLineNo">351</span>                }<a name="line.351"></a>
+<span class="sourceLineNo">352</span>                break;<a name="line.352"></a>
+<span class="sourceLineNo">353</span>            default:<a name="line.353"></a>
+<span class="sourceLineNo">354</span>                // Should never happen.<a name="line.354"></a>
+<span class="sourceLineNo">355</span>                throw new MathInternalError();<a name="line.355"></a>
+<span class="sourceLineNo">356</span>            }<a name="line.356"></a>
+<span class="sourceLineNo">357</span><a name="line.357"></a>
+<span class="sourceLineNo">358</span>            previous = val[i];<a name="line.358"></a>
+<span class="sourceLineNo">359</span>        }<a name="line.359"></a>
+<span class="sourceLineNo">360</span>        return true;<a name="line.360"></a>
+<span class="sourceLineNo">361</span>    }<a name="line.361"></a>
+<span class="sourceLineNo">362</span><a name="line.362"></a>
+<span class="sourceLineNo">363</span>    /**<a name="line.363"></a>
+<span class="sourceLineNo">364</span>     * Check that an array is monotonically increasing or decreasing.<a name="line.364"></a>
+<span class="sourceLineNo">365</span>     *<a name="line.365"></a>
+<span class="sourceLineNo">366</span>     * @param val Values.<a name="line.366"></a>
+<span class="sourceLineNo">367</span>     * @param dir Ordering direction.<a name="line.367"></a>
+<span class="sourceLineNo">368</span>     * @param strict Whether the order should be strict.<a name="line.368"></a>
+<span class="sourceLineNo">369</span>     * @return {@code true} if sorted, {@code false} otherwise.<a name="line.369"></a>
+<span class="sourceLineNo">370</span>     */<a name="line.370"></a>
+<span class="sourceLineNo">371</span>    public static boolean isMonotonic(double[] val, OrderDirection dir, boolean strict) {<a name="line.371"></a>
+<span class="sourceLineNo">372</span>        return checkOrder(val, dir, strict, false);<a name="line.372"></a>
+<span class="sourceLineNo">373</span>    }<a name="line.373"></a>
+<span class="sourceLineNo">374</span><a name="line.374"></a>
+<span class="sourceLineNo">375</span>    /**<a name="line.375"></a>
+<span class="sourceLineNo">376</span>     * Check that the given array is sorted.<a name="line.376"></a>
+<span class="sourceLineNo">377</span>     *<a name="line.377"></a>
+<span class="sourceLineNo">378</span>     * @param val Values.<a name="line.378"></a>
+<span class="sourceLineNo">379</span>     * @param dir Ordering direction.<a name="line.379"></a>
+<span class="sourceLineNo">380</span>     * @param strict Whether the order should be strict.<a name="line.380"></a>
+<span class="sourceLineNo">381</span>     * @param abort Whether to throw an exception if the check fails.<a name="line.381"></a>
+<span class="sourceLineNo">382</span>     * @return {@code true} if the array is sorted.<a name="line.382"></a>
+<span class="sourceLineNo">383</span>     * @throws NonMonotonicSequenceException if the array is not sorted<a name="line.383"></a>
+<span class="sourceLineNo">384</span>     * and {@code abort} is {@code true}.<a name="line.384"></a>
+<span class="sourceLineNo">385</span>     */<a name="line.385"></a>
+<span class="sourceLineNo">386</span>    public static boolean checkOrder(double[] val, OrderDirection dir,<a name="line.386"></a>
+<span class="sourceLineNo">387</span>                                     boolean strict, boolean abort)<a name="line.387"></a>
+<span class="sourceLineNo">388</span>        throws NonMonotonicSequenceException {<a name="line.388"></a>
+<span class="sourceLineNo">389</span>        double previous = val[0];<a name="line.389"></a>
+<span class="sourceLineNo">390</span>        final int max = val.length;<a name="line.390"></a>
+<span class="sourceLineNo">391</span><a name="line.391"></a>
+<span class="sourceLineNo">392</span>        int index;<a name="line.392"></a>
+<span class="sourceLineNo">393</span>        ITEM:<a name="line.393"></a>
+<span class="sourceLineNo">394</span>        for (index = 1; index &lt; max; index++) {<a name="line.394"></a>
+<span class="sourceLineNo">395</span>            switch (dir) {<a name="line.395"></a>
+<span class="sourceLineNo">396</span>            case INCREASING:<a name="line.396"></a>
 <span class="sourceLineNo">397</span>                if (strict) {<a name="line.397"></a>
-<span class="sourceLineNo">398</span>                    if (val[index] &gt;= previous) {<a name="line.398"></a>
+<span class="sourceLineNo">398</span>                    if (val[index] &lt;= previous) {<a name="line.398"></a>
 <span class="sourceLineNo">399</span>                        break ITEM;<a name="line.399"></a>
 <span class="sourceLineNo">400</span>                    }<a name="line.400"></a>
 <span class="sourceLineNo">401</span>                } else {<a name="line.401"></a>
-<span class="sourceLineNo">402</span>                    if (val[index] &gt; previous) {<a name="line.402"></a>
+<span class="sourceLineNo">402</span>                    if (val[index] &lt; previous) {<a name="line.402"></a>
 <span class="sourceLineNo">403</span>                        break ITEM;<a name="line.403"></a>
 <span class="sourceLineNo">404</span>                    }<a name="line.404"></a>
 <span class="sourceLineNo">405</span>                }<a name="line.405"></a>
 <span class="sourceLineNo">406</span>                break;<a name="line.406"></a>
-<span class="sourceLineNo">407</span>            default:<a name="line.407"></a>
-<span class="sourceLineNo">408</span>                // Should never happen.<a name="line.408"></a>
-<span class="sourceLineNo">409</span>                throw new MathInternalError();<a name="line.409"></a>
-<span class="sourceLineNo">410</span>            }<a name="line.410"></a>
-<span class="sourceLineNo">411</span><a name="line.411"></a>
-<span class="sourceLineNo">412</span>            previous = val[index];<a name="line.412"></a>
-<span class="sourceLineNo">413</span>        }<a name="line.413"></a>
-<span class="sourceLineNo">414</span><a name="line.414"></a>
-<span class="sourceLineNo">415</span>        if (index == max) {<a name="line.415"></a>
-<span class="sourceLineNo">416</span>            // Loop completed.<a name="line.416"></a>
-<span class="sourceLineNo">417</span>            return true;<a name="line.417"></a>
-<span class="sourceLineNo">418</span>        }<a name="line.418"></a>
-<span class="sourceLineNo">419</span><a name="line.419"></a>
-<span class="sourceLineNo">420</span>        // Loop early exit means wrong ordering.<a name="line.420"></a>
-<span class="sourceLineNo">421</span>        if (abort) {<a name="line.421"></a>
-<span class="sourceLineNo">422</span>            throw new NonMonotonicSequenceException(val[index], previous, index, dir, strict);<a name="line.422"></a>
-<span class="sourceLineNo">423</span>        } else {<a name="line.423"></a>
-<span class="sourceLineNo">424</span>            return false;<a name="line.424"></a>
-<span class="sourceLineNo">425</span>        }<a name="line.425"></a>
-<span class="sourceLineNo">426</span>    }<a name="line.426"></a>
-<span class="sourceLineNo">427</span><a name="line.427"></a>
-<span class="sourceLineNo">428</span>    /**<a name="line.428"></a>
-<span class="sourceLineNo">429</span>     * Check that the given array is sorted.<a name="line.429"></a>
-<span class="sourceLineNo">430</span>     *<a name="line.430"></a>
-<span class="sourceLineNo">431</span>     * @param val Values.<a name="line.431"></a>
-<span class="sourceLineNo">432</span>     * @param dir Ordering direction.<a name="line.432"></a>
-<span class="sourceLineNo">433</span>     * @param strict Whether the order should be strict.<a name="line.433"></a>
-<span class="sourceLineNo">434</span>     * @throws NonMonotonicSequenceException if the array is not sorted.<a name="line.434"></a>
-<span class="sourceLineNo">435</span>     * @since 2.2<a name="line.435"></a>
-<span class="sourceLineNo">436</span>     */<a name="line.436"></a>
-<span class="sourceLineNo">437</span>    public static void checkOrder(double[] val, OrderDirection dir,<a name="line.437"></a>
-<span class="sourceLineNo">438</span>                                  boolean strict) throws NonMonotonicSequenceException {<a name="line.438"></a>
-<span class="sourceLineNo">439</span>        checkOrder(val, dir, strict, true);<a name="line.439"></a>
-<span class="sourceLineNo">440</span>    }<a name="line.440"></a>
-<span class="sourceLineNo">441</span><a name="line.441"></a>
-<span class="sourceLineNo">442</span>    /**<a name="line.442"></a>
-<span class="sourceLineNo">443</span>     * Check that the given array is sorted in strictly increasing order.<a name="line.443"></a>
-<span class="sourceLineNo">444</span>     *<a name="line.444"></a>
-<span class="sourceLineNo">445</span>     * @param val Values.<a name="line.445"></a>
-<span class="sourceLineNo">446</span>     * @throws NonMonotonicSequenceException if the array is not sorted.<a name="line.446"></a>
-<span class="sourceLineNo">447</span>     * @since 2.2<a name="line.447"></a>
-<span class="sourceLineNo">448</span>     */<a name="line.448"></a>
-<span class="sourceLineNo">449</span>    public static void checkOrder(double[] val) throws NonMonotonicSequenceException {<a name="line.449"></a>
-<span class="sourceLineNo">450</span>        checkOrder(val, OrderDirection.INCREASING, true);<a name="line.450"></a>
+<span class="sourceLineNo">407</span>            case DECREASING:<a name="line.407"></a>
+<span class="sourceLineNo">408</span>                if (strict) {<a name="line.408"></a>
+<span class="sourceLineNo">409</span>                    if (val[index] &gt;= previous) {<a name="line.409"></a>
+<span class="sourceLineNo">410</span>                        break ITEM;<a name="line.410"></a>
+<span class="sourceLineNo">411</span>                    }<a name="line.411"></a>
+<span class="sourceLineNo">412</span>                } else {<a name="line.412"></a>
+<span class="sourceLineNo">413</span>                    if (val[index] &gt; previous) {<a name="line.413"></a>
+<span class="sourceLineNo">414</span>                        break ITEM;<a name="line.414"></a>
+<span class="sourceLineNo">415</span>                    }<a name="line.415"></a>
+<span class="sourceLineNo">416</span>                }<a name="line.416"></a>
+<span class="sourceLineNo">417</span>                break;<a name="line.417"></a>
+<span class="sourceLineNo">418</span>            default:<a name="line.418"></a>
+<span class="sourceLineNo">419</span>                // Should never happen.<a name="line.419"></a>
+<span class="sourceLineNo">420</span>                throw new MathInternalError();<a name="line.420"></a>
+<span class="sourceLineNo">421</span>            }<a name="line.421"></a>
+<span class="sourceLineNo">422</span><a name="line.422"></a>
+<span class="sourceLineNo">423</span>            previous = val[index];<a name="line.423"></a>
+<span class="sourceLineNo">424</span>        }<a name="line.424"></a>
+<span class="sourceLineNo">425</span><a name="line.425"></a>
+<span class="sourceLineNo">426</span>        if (index == max) {<a name="line.426"></a>
+<span class="sourceLineNo">427</span>            // Loop completed.<a name="line.427"></a>
+<span class="sourceLineNo">428</span>            return true;<a name="line.428"></a>
+<span class="sourceLineNo">429</span>        }<a name="line.429"></a>
+<span class="sourceLineNo">430</span><a name="line.430"></a>
+<span class="sourceLineNo">431</span>        // Loop early exit means wrong ordering.<a name="line.431"></a>
+<span class="sourceLineNo">432</span>        if (abort) {<a name="line.432"></a>
+<span class="sourceLineNo">433</span>            throw new NonMonotonicSequenceException(val[index], previous, index, dir, strict);<a name="line.433"></a>
+<span class="sourceLineNo">434</span>        } else {<a name="line.434"></a>
+<span class="sourceLineNo">435</span>            return false;<a name="line.435"></a>
+<span class="sourceLineNo">436</span>        }<a name="line.436"></a>
+<span class="sourceLineNo">437</span>    }<a name="line.437"></a>
+<span class="sourceLineNo">438</span><a name="line.438"></a>
+<span class="sourceLineNo">439</span>    /**<a name="line.439"></a>
+<span class="sourceLineNo">440</span>     * Check that the given array is sorted.<a name="line.440"></a>
+<span class="sourceLineNo">441</span>     *<a name="line.441"></a>
+<span class="sourceLineNo">442</span>     * @param val Values.<a name="line.442"></a>
+<span class="sourceLineNo">443</span>     * @param dir Ordering direction.<a name="line.443"></a>
+<span class="sourceLineNo">444</span>     * @param strict Whether the order should be strict.<a name="line.444"></a>
+<span class="sourceLineNo">445</span>     * @throws NonMonotonicSequenceException if the array is not sorted.<a name="line.445"></a>
+<span class="sourceLineNo">446</span>     * @since 2.2<a name="line.446"></a>
+<span class="sourceLineNo">447</span>     */<a name="line.447"></a>
+<span class="sourceLineNo">448</span>    public static void checkOrder(double[] val, OrderDirection dir,<a name="line.448"></a>
+<span class="sourceLineNo">449</span>                                  boolean strict) throws NonMonotonicSequenceException {<a name="line.449"></a>
+<span class="sourceLineNo">450</span>        checkOrder(val, dir, strict, true);<a name="line.450"></a>
 <span class="sourceLineNo">451</span>    }<a name="line.451"></a>
 <span class="sourceLineNo">452</span><a name="line.452"></a>
 <span class="sourceLineNo">453</span>    /**<a name="line.453"></a>
-<span class="sourceLineNo">454</span>     * Throws DimensionMismatchException if the input array is not rectangular.<a name="line.454"></a>
+<span class="sourceLineNo">454</span>     * Check that the given array is sorted in strictly increasing order.<a name="line.454"></a>
 <span class="sourceLineNo">455</span>     *<a name="line.455"></a>
-<span class="sourceLineNo">456</span>     * @param in array to be tested<a name="line.456"></a>
-<span class="sourceLineNo">457</span>     * @throws NullArgumentException if input array is null<a name="line.457"></a>
-<span class="sourceLineNo">458</span>     * @throws DimensionMismatchException if input array is not rectangular<a name="line.458"></a>
-<span class="sourceLineNo">459</span>     * @since 3.1<a name="line.459"></a>
-<span class="sourceLineNo">460</span>     */<a name="line.460"></a>
-<span class="sourceLineNo">461</span>    public static void checkRectangular(final long[][] in)<a name="line.461"></a>
-<span class="sourceLineNo">462</span>        throws NullArgumentException, DimensionMismatchException {<a name="line.462"></a>
-<span class="sourceLineNo">463</span>        MathUtils.checkNotNull(in);<a name="line.463"></a>
-<span class="sourceLineNo">464</span>        for (int i = 1; i &lt; in.length; i++) {<a name="line.464"></a>
-<span class="sourceLineNo">465</span>            if (in[i].length != in[0].length) {<a name="line.465"></a>
-<span class="sourceLineNo">466</span>                throw new DimensionMismatchException(<a name="line.466"></a>
-<span class="sourceLineNo">467</span>                        LocalizedFormats.DIFFERENT_ROWS_LENGTHS,<a name="line.467"></a>
-<span class="sourceLineNo">468</span>                        in[i].length, in[0].length);<a name="line.468"></a>
-<span class="sourceLineNo">469</span>            }<a name="line.469"></a>
-<span class="sourceLineNo">470</span>        }<a name="line.470"></a>
-<span class="sourceLineNo">471</span>    }<a name="line.471"></a>
-<span class="sourceLineNo">472</span><a name="line.472"></a>
-<span class="sourceLineNo">473</span>    /**<a name="line.473"></a>
-<span class="sourceLineNo">474</span>     * Check that all entries of the input array are strictly positive.<a name="line.474"></a>
-<span class="sourceLineNo">475</span>     *<a name="line.475"></a>
-<span class="sourceLineNo">476</span>     * @param in Array to be tested<a name="line.476"></a>
-<span class="sourceLineNo">477</span>     * @throws NotStrictlyPositiveException if any entries of the array are not<a name="line.477"></a>
-<span class="sourceLineNo">478</span>     * strictly positive.<a name="line.478"></a>
-<span class="sourceLineNo">479</span>     * @since 3.1<a name="line.479"></a>
-<span class="sourceLineNo">480</span>     */<a name="line.480"></a>
-<span class="sourceLineNo">481</span>    public static void checkPositive(final double[] in)<a name="line.481"></a>
-<span class="sourceLineNo">482</span>        throws NotStrictlyPositiveException {<a name="line.482"></a>
-<span class="sourceLineNo">483</span>        for (int i = 0; i &lt; in.length; i++) {<a name="line.483"></a>
-<span class="sourceLineNo">484</span>            if (in[i] &lt;= 0) {<a name="line.484"></a>
-<span class="sourceLineNo">485</span>                throw new NotStrictlyPositiveException(in[i]);<a name="line.485"></a>
-<span class="sourceLineNo">486</span>            }<a name="line.486"></a>
-<span class="sourceLineNo">487</span>        }<a name="line.487"></a>
-<span class="sourceLineNo">488</span>    }<a name="line.488"></a>
-<span class="sourceLineNo">489</span><a name="line.489"></a>
-<span class="sourceLineNo">490</span>    /**<a name="line.490"></a>
-<span class="sourceLineNo">491</span>     * Check that no entry of the input array is {@code NaN}.<a name="line.491"></a>
-<span class="sourceLineNo">492</span>     *<a name="line.492"></a>
-<span class="sourceLineNo">493</span>     * @param in Array to be tested.<a name="line.493"></a>
-<span class="sourceLineNo">494</span>     * @throws NotANumberException if an entry is {@code NaN}.<a name="line.494"></a>
-<span class="sourceLineNo">495</span>     * @since 3.4<a name="line.495"></a>
-<span class="sourceLineNo">496</span>     */<a name="line.496"></a>
-<span class="sourceLineNo">497</span>    public static void checkNotNaN(final double[] in)<a name="line.497"></a>
-<span class="sourceLineNo">498</span>        throws NotANumberException {<a name="line.498"></a>
-<span class="sourceLineNo">499</span>        for(int i = 0; i &lt; in.length; i++) {<a name="line.499"></a>
-<span class="sourceLineNo">500</span>            if (Double.isNaN(in[i])) {<a name="line.500"></a>
-<span class="sourceLineNo">501</span>                throw new NotANumberException();<a name="line.501"></a>
-<span class="sourceLineNo">502</span>            }<a name="line.502"></a>
-<span class="sourceLineNo">503</span>        }<a name="line.503"></a>
-<span class="sourceLineNo">504</span>    }<a name="line.504"></a>
-<span class="sourceLineNo">505</span><a name="line.505"></a>
-<span class="sourceLineNo">506</span>    /**<a name="line.506"></a>
-<span class="sourceLineNo">507</span>     * Check that all entries of the input array are &gt;= 0.<a name="line.507"></a>
-<span class="sourceLineNo">508</span>     *<a name="line.508"></a>
-<span class="sourceLineNo">509</span>     * @param in Array to be tested<a name="line.509"></a>
-<span class="sourceLineNo">510</span>     * @throws NotPositiveException if any array entries are less than 0.<a name="line.510"></a>
-<span class="sourceLineNo">511</span>     * @since 3.1<a name="line.511"></a>
-<span class="sourceLineNo">512</span>     */<a name="line.512"></a>
-<span class="sourceLineNo">513</span>    public static void checkNonNegative(final long[] in)<a name="line.513"></a>
-<span class="sourceLineNo">514</span>        throws NotPositiveException {<a name="line.514"></a>
-<span class="sourceLineNo">515</span>        for (int i = 0; i &lt; in.length; i++) {<a name="line.515"></a>
-<span class="sourceLineNo">516</span>            if (in[i] &lt; 0) {<a name="line.516"></a>
-<span class="sourceLineNo">517</span>                throw new NotPositiveException(in[i]);<a name="line.517"></a>
-<span class="sourceLineNo">518</span>            }<a name="line.518"></a>
-<span class="sourceLineNo">519</span>        }<a name="line.519"></a>
-<span class="sourceLineNo">520</span>    }<a name="line.520"></a>
-<span class="sourceLineNo">521</span><a name="line.521"></a>
-<span class="sourceLineNo">522</span>    /**<a name="line.522"></a>
-<span class="sourceLineNo">523</span>     * Check all entries of the input array are &gt;= 0.<a name="line.523"></a>
-<span class="sourceLineNo">524</span>     *<a name="line.524"></a>
-<span class="sourceLineNo">525</span>     * @param in Array to be tested<a name="line.525"></a>
-<span class="sourceLineNo">526</span>     * @throws NotPositiveException if any array entries are less than 0.<a name="line.526"></a>
-<span class="sourceLineNo">527</span>     * @since 3.1<a name="line.527"></a>
-<span class="sourceLineNo">528</span>     */<a name="line.528"></a>
-<span class="sourceLineNo">529</span>    public static void checkNonNegative(final long[][] in)<a name="line.529"></a>
-<span class="sourceLineNo">530</span>        throws NotPositiveException {<a name="line.530"></a>
-<span class="sourceLineNo">531</span>        for (int i = 0; i &lt; in.length; i ++) {<a name="line.531"></a>
-<span class="sourceLineNo">532</span>            for (int j = 0; j &lt; in[i].length; j++) {<a name="line.532"></a>
-<span class="sourceLineNo">533</span>                if (in[i][j] &lt; 0) {<a name="line.533"></a>
-<span class="sourceLineNo">534</span>                    throw new NotPositiveException(in[i][j]);<a name="line.534"></a>
-<span class="sourceLineNo">535</span>                }<a name="line.535"></a>
-<span class="sourceLineNo">536</span>            }<a name="line.536"></a>
-<span class="sourceLineNo">537</span>        }<a name="line.537"></a>
-<span class="sourceLineNo">538</span>    }<a name="line.538"></a>
-<span class="sourceLineNo">539</span><a name="line.539"></a>
-<span class="sourceLineNo">540</span>    /**<a name="line.540"></a>
-<span class="sourceLineNo">541</span>     * Returns the Cartesian norm (2-norm), handling both overflow and underflow.<a name="line.541"></a>
-<span class="sourceLineNo">542</span>     * Translation of the minpack enorm subroutine.<a name="line.542"></a>
-<span class="sourceLineNo">543</span>     *<a name="line.543"></a>
-<span class="sourceLineNo">544</span>     * The redistribution policy for MINPACK is available<a name="line.544"></a>
-<span class="sourceLineNo">545</span>     * &lt;a href="http://www.netlib.org/minpack/disclaimer"&gt;here&lt;/a&gt;, for<a name="line.545"></a>
-<span class="sourceLineNo">546</span>     * convenience, it is reproduced below.&lt;/p&gt;<a name="line.546"></a>
-<span class="sourceLineNo">547</span>     *<a name="line.547"></a>
-<span class="sourceLineNo">548</span>     * &lt;table border="0" width="80%" cellpadding="10" align="center" bgcolor="#E0E0E0"&gt;<a name="line.548"></a>
-<span class="sourceLineNo">549</span>     * &lt;tr&gt;&lt;td&gt;<a name="line.549"></a>
-<span class="sourceLineNo">550</span>     *    Minpack Copyright Notice (1999) University of Chicago.<a name="line.550"></a>
-<span class="sourceLineNo">551</span>     *    All rights reserved<a name="line.551"></a>
-<span class="sourceLineNo">552</span>     * &lt;/td&gt;&lt;/tr&gt;<a name="line.552"></a>
-<span class="sourceLineNo">553</span>     * &lt;tr&gt;&lt;td&gt;<a name="line.553"></a>
-<span class="sourceLineNo">554</span>     * Redistribution and use in source and binary forms, with or without<a name="line.554"></a>
-<span class="sourceLineNo">555</span>     * modification, are permitted provided that the following conditions<a name="line.555"></a>
-<span class="sourceLineNo">556</span>     * are met:<a name="line.556"></a>
-<span class="sourceLineNo">557</span>     * &lt;ol&gt;<a name="line.557"></a>
-<span class="sourceLineNo">558</span>     *  &lt;li&gt;Redistributions of source code must retain the above copyright<a name="line.558"></a>
-<span class="sourceLineNo">559</span>     *      notice, this list of conditions and the following disclaimer.&lt;/li&gt;<a name="line.559"></a>
-<span class="sourceLineNo">560</span>     * &lt;li&gt;Redistributions in binary form must reproduce the above<a name="line.560"></a>
-<span class="sourceLineNo">561</span>     *     copyright notice, this list of conditions and the following<a name="line.561"></a>
-<span class="sourceLineNo">562</span>     *     disclaimer in the documentation and/or other materials provided<a name="line.562"></a>
-<span class="sourceLineNo">563</span>     *     with the distribution.&lt;/li&gt;<a name="line.563"></a>
-<span class="sourceLineNo">564</span>     * &lt;li&gt;The end-user documentation included with the redistribution, if any,<a name="line.564"></a>
-<span class="sourceLineNo">565</span>     *     must include the following acknowledgment:<a name="line.565"></a>
-<span class="sourceLineNo">566</span>     *     {@code This product includes software developed by the University of<a name="line.566"></a>
-<span class="sourceLineNo">567</span>     *           Chicago, as Operator of Argonne National Laboratory.}<a name="line.567"></a>
-<span class="sourceLineNo">568</span>     *     Alternately, this acknowledgment may appear in the software itself,<a name="line.568"></a>
-<span class="sourceLineNo">569</span>     *     if and wherever such third-party acknowledgments normally appear.&lt;/li&gt;<a name="line.569"></a>
-<span class="sourceLineNo">570</span>     * &lt;li&gt;&lt;strong&gt;WARRANTY DISCLAIMER. THE SOFTWARE IS SUPPLIED "AS IS"<a name="line.570"></a>
-<span class="sourceLineNo">571</span>     *     WITHOUT WARRANTY OF ANY KIND. THE COPYRIGHT HOLDER, THE<a name="line.571"></a>
-<span class="sourceLineNo">572</span>     *     UNITED STATES, THE UNITED STATES DEPARTMENT OF ENERGY, AND<a name="line.572"></a>
-<span class="sourceLineNo">573</span>     *     THEIR EMPLOYEES: (1) DISCLAIM ANY WARRANTIES, EXPRESS OR<a name="line.573"></a>
-<span class="sourceLineNo">574</span>     *     IMPLIED, INCLUDING BUT NOT LIMITED TO ANY IMPLIED WARRANTIES<a name="line.574"></a>
-<span class="sourceLineNo">575</span>     *     OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, TITLE<a name="line.575"></a>
-<span class="sourceLineNo">576</span>     *     OR NON-INFRINGEMENT, (2) DO NOT ASSUME ANY LEGAL LIABILITY<a name="line.576"></a>
-<span class="sourceLineNo">577</span>     *     OR RESPONSIBILITY FOR THE ACCURACY, COMPLETENESS, OR<a name="line.577"></a>
-<span class="sourceLineNo">578</span>     *     USEFULNESS OF THE SOFTWARE, (3) DO NOT REPRESENT THAT USE OF<a name="line.578"></a>
-<span class="sourceLineNo">579</span>     *     THE SOFTWARE WOULD NOT INFRINGE PRIVATELY OWNED RIGHTS, (4)<a name="line.579"></a>
-<span class="sourceLineNo">580</span>     *     DO NOT WARRANT THAT THE SOFTWARE WILL FUNCTION<a name="line.580"></a>
-<span class="sourceLineNo">581</span>     *     UNINTERRUPTED, THAT IT IS ERROR-FREE OR THAT ANY ERRORS WILL<a name="line.581"></a>
-<span class="sourceLineNo">582</span>     *     BE CORRECTED.&lt;/strong&gt;&lt;/li&gt;<a name="line.582"></a>
-<span class="sourceLineNo">583</span>     * &lt;li&gt;&lt;strong&gt;LIMITATION OF LIABILITY. IN NO EVENT WILL THE COPYRIGHT<a name="line.583"></a>
-<span class="sourceLineNo">584</span>     *     HOLDER, THE UNITED STATES, THE UNITED STATES DEPARTMENT OF<a name="line.584"></a>
-<span class="sourceLineNo">585</span>     *     ENERGY, OR THEIR EMPLOYEES: BE LIABLE FOR ANY INDIRECT,<a name="line.585"></a>
-<span class="sourceLineNo">586</span>     *     INCIDENTAL, CONSEQUENTIAL, SPECIAL OR PUNITIVE DAMAGES OF<a name="line.586"></a>
-<span class="sourceLineNo">587</span>     *     ANY KIND OR NATURE, INCLUDING BUT NOT LIMITED TO LOSS OF<a name="line.587"></a>
-<span class="sourceLineNo">588</span>     *     PROFITS OR LOSS OF DATA, FOR ANY REASON WHATSOEVER, WHETHER<a name="line.588"></a>
-<span class="sourceLineNo">589</span>     *     SUCH LIABILITY IS ASSERTED ON THE BASIS OF CONTRACT, TORT<a name="line.589"></a>
-<span class="sourceLineNo">590</span>     *     (INCLUDING NEGLIGENCE OR STRICT LIABILITY), OR OTHERWISE,<a name="line.590"></a>
-<span class="sourceLineNo">591</span>     *     EVEN IF ANY OF SAID PARTIES HAS BEEN WARNED OF THE<a name="line.591"></a>
-<span class="sourceLineNo">592</span>     *     POSSIBILITY OF SUCH LOSS OR DAMAGES.&lt;/strong&gt;&lt;/li&gt;<a name="line.592"></a>
-<span class="sourceLineNo">593</span>     * &lt;ol&gt;&lt;/td&gt;&lt;/tr&gt;<a name="line.593"></a>
-<span class="sourceLineNo">594</span>     * &lt;/table&gt;<a name="line.594"></a>
-<span class="sourceLineNo">595</span>     *<a name="line.595"></a>
-<span class="sourceLineNo">596</span>     * @param v Vector of doubles.<a name="line.596"></a>
-<span class="sourceLineNo">597</span>     * @return the 2-norm of the vector.<a name="line.597"></a>
-<span class="sourceLineNo">598</span>     * @since 2.2<a name="line.598"></a>
-<span class="sourceLineNo">599</span>     */<a name="line.599"></a>
-<span class="sourceLineNo">600</span>    public static double safeNorm(double[] v) {<a name="line.600"></a>
-<span class="sourceLineNo">601</span>        double rdwarf = 3.834e-20;<a name="line.601"></a>
-<span class="sourceLineNo">602</span>        double rgiant = 1.304e+19;<a name="line.602"></a>
-<span class="sourceLineNo">603</span>        double s1 = 0;<a name="line.603"></a>
-<span class="sourceLineNo">604</span>        double s2 = 0;<a name="line.604"></a>
-<span class="sourceLineNo">605</span>        double s3 = 0;<a name="line.605"></a>
-<span class="sourceLineNo">606</span>        double x1max = 0;<a name="line.606"></a>
-<span class="sourceLineNo">607</span>        double x3max = 0;<a name="line.607"></a>
-<span class="sourceLineNo">608</span>        double floatn = v.length;<a name="line.608"></a>
-<span class="sourceLineNo">609</span>        double agiant = rgiant / floatn;<a name="line.609"></a>
-<span class="sourceLineNo">610</span>        for (int i = 0; i &lt; v.length; i++) {<a name="line.610"></a>
-<span class="sourceLineNo">611</span>            double xabs = FastMath.abs(v[i]);<a name="line.611"></a>
-<span class="sourceLineNo">612</span>            if (xabs &lt; rdwarf || xabs &gt; agiant) {<a name="line.612"></a>
-<span class="sourceLineNo">613</span>                if (xabs &gt; rdwarf) {<a name="line.613"></a>
-<span class="sourceLineNo">614</span>                    if (xabs &gt; x1max) {<a name="line.614"></a>
-<span class="sourceLineNo">615</span>                        double r = x1max / xabs;<a name="line.615"></a>
-<span class="sourceLineNo">616</span>                        s1= 1 + s1 * r * r;<a name="line.616"></a>
-<span class="sourceLineNo">617</span>                        x1max = xabs;<a name="line.617"></a>
-<span class="sourceLineNo">618</span>                    } else {<a name="line.618"></a>
-<span class="sourceLineNo">619</span>                        double r = xabs / x1max;<a name="line.619"></a>
-<span class="sourceLineNo">620</span>                        s1 += r * r;<a name="line.620"></a>
-<span class="sourceLineNo">621</span>                    }<a name="line.621"></a>
-<span class="sourceLineNo">622</span>                } else {<a name="line.622"></a>
-<span class="sourceLineNo">623</span>                    if (xabs &gt; x3max) {<a name="line.623"></a>
-<span class="sourceLineNo">624</span>                        double r = x3max / xabs;<a name="line.624"></a>
-<span class="sourceLineNo">625</span>                        s3= 1 + s3 * r * r;<a name="line.625"></a>
-<span class="sourceLineNo">626</span>                        x3max = xabs;<a name="line.626"></a>
-<span class="sourceLineNo">627</span>                    } else {<a name="line.627"></a>
-<span class="sourceLineNo">628</span>                        if (xabs != 0) {<a name="line.628"></a>
-<span class="sourceLineNo">629</span>                            double r = xabs / x3max;<a name="line.629"></a>
-<span class="sourceLineNo">630</span>                            s3 += r * r;<a name="line.630"></a>
-<span class="sourceLineNo">631</span>                        }<a name="line.631"></a>
+<span class="sourceLineNo">456</span>     * @param val Values.<a name="line.456"></a>
+<span class="sourceLineNo">457</span>     * @throws NonMonotonicSequenceException if the array is not sorted.<a name="line.457"></a>
+<span class="sourceLineNo">458</span>     * @since 2.2<a name="line.458"></a>
+<span class="sourceLineNo">459</span>     */<a name="line.459"></a>
+<span class="sourceLineNo">460</span>    public static void checkOrder(double[] val) throws NonMonotonicSequenceException {<a name="line.460"></a>
+<span class="sourceLineNo">461</span>        checkOrder(val, OrderDirection.INCREASING, true);<a name="line.461"></a>
+<span class="sourceLineNo">462</span>    }<a name="line.462"></a>
+<span class="sourceLineNo">463</span><a name="line.463"></a>
+<span class="sourceLineNo">464</span>    /**<a name="line.464"></a>
+<span class="sourceLineNo">465</span>     * Throws DimensionMismatchException if the input array is not rectangular.<a name="line.465"></a>
+<span class="sourceLineNo">466</span>     *<a name="line.466"></a>
+<span class="sourceLineNo">467</span>     * @param in array to be tested<a name="line.467"></a>
+<span class="sourceLineNo">468</span>     * @throws NullArgumentException if input array is null<a name="line.468"></a>
+<span class="sourceLineNo">469</span>     * @throws DimensionMismatchException if input array is not rectangular<a name="line.469"></a>
+<span class="sourceLineNo">470</span>     * @since 3.1<a name="line.470"></a>
+<span class="sourceLineNo">471</span>     */<a name="line.471"></a>
+<span class="sourceLineNo">472</span>    public static void checkRectangular(final long[][] in)<a name="line.472"></a>
+<span class="sourceLineNo">473</span>        throws NullArgumentException, DimensionMismatchException {<a name="line.473"></a>
+<span class="sourceLineNo">474</span>        MathUtils.checkNotNull(in);<a name="line.474"></a>
+<span class="sourceLineNo">475</span>        for (int i = 1; i &lt; in.length; i++) {<a name="line.475"></a>
+<span class="sourceLineNo">476</span>            if (in[i].length != in[0].length) {<a name="line.476"></a>
+<span class="sourceLineNo">477</span>                throw new DimensionMismatchException(<a name="line.477"></a>
+<span class="sourceLineNo">478</span>                        LocalizedFormats.DIFFERENT_ROWS_LENGTHS,<a name="line.478"></a>
+<span class="sourceLineNo">479</span>                        in[i].length, in[0].length);<a name="line.479"></a>
+<span class="sourceLineNo">480</span>            }<a name="line.480"></a>
+<span class="sourceLineNo">481</span>        }<a name="line.481"></a>
+<span class="sourceLineNo">482</span>    }<a name="line.482"></a>
+<span class="sourceLineNo">483</span><a name="line.483"></a>
+<span class="sourceLineNo">484</span>    /**<a name="line.484"></a>
+<span class="sourceLineNo">485</span>     * Check that all entries of the input array are strictly positive.<a name="line.485"></a>
+<span class="sourceLineNo">486</span>     *<a name="line.486"></a>
+<span class="sourceLineNo">487</span>     * @param in Array to be tested<a name="line.487"></a>
+<span class="sourceLineNo">488</span>     * @throws NotStrictlyPositiveException if any entries of the array are not<a name="line.488"></a>
+<span class="sourceLineNo">489</span>     * strictly positive.<a name="line.489"></a>
+<span class="sourceLineNo">490</span>     * @since 3.1<a name="line.490"></a>
+<span class="sourceLineNo">491</span>     */<a name="line.491"></a>
+<span class="sourceLineNo">492</span>    public static void checkPositive(final double[] in)<a name="line.492"></a>
+<span class="sourceLineNo">493</span>        throws NotStrictlyPositiveException {<a name="line.493"></a>
+<span class="sourceLineNo">494</span>        for (int i = 0; i &lt; in.length; i++) {<a name="line.494"></a>
+<span class="sourceLineNo">495</span>            if (in[i] &lt;= 0) {<a name="line.495"></a>
+<span class="sourceLineNo">496</span>                throw new NotStrictlyPositiveException(in[i]);<a name="line.496"></a>
+<span class="sourceLineNo">497</span>            }<a name="line.497"></a>
+<span class="sourceLineNo">498</span>        }<a name="line.498"></a>
+<span class="sourceLineNo">499</span>    }<a name="line.499"></a>
+<span class="sourceLineNo">500</span><a name="line.500"></a>
+<span class="sourceLineNo">501</span>    /**<a name="line.501"></a>
+<span class="sourceLineNo">502</span>     * Check that no entry of the input array is {@code NaN}.<a name="line.502"></a>
+<span class="sourceLineNo">503</span>     *<a name="line.503"></a>
+<span class="sourceLineNo">504</span>     * @param in Array to be tested.<a name="line.504"></a>
+<span class="sourceLineNo">505</span>     * @throws NotANumberException if an entry is {@code NaN}.<a name="line.505"></a>
+<span class="sourceLineNo">506</span>     * @since 3.4<a name="line.506"></a>
+<span class="sourceLineNo">507</span>     */<a name="line.507"></a>
+<span class="sourceLineNo">508</span>    public static void checkNotNaN(final double[] in)<a name="line.508"></a>
+<span class="sourceLineNo">509</span>        throws NotANumberException {<a name="line.509"></a>
+<span class="sourceLineNo">510</span>        for(int i = 0; i &lt; in.length; i++) {<a name="line.510"></a>
+<span class="sourceLineNo">511</span>            if (Double.isNaN(in[i])) {<a name="line.511"></a>
+<span class="sourceLineNo">512</span>                throw new NotANumberException();<a name="line.512"></a>
+<span class="sourceLineNo">513</span>            }<a name="line.513"></a>
+<span class="sourceLineNo">514</span>        }<a name="line.514"></a>
+<span class="sourceLineNo">515</span>    }<a name="line.515"></a>
+<span class="sourceLineNo">516</span><a name="line.516"></a>
+<span class="sourceLineNo">517</span>    /**<a name="line.517"></a>
+<span class="sourceLineNo">518</span>     * Check that all entries of the input array are &gt;= 0.<a name="line.518"></a>
+<span class="sourceLineNo">519</span>     *<a name="line.519"></a>
+<span class="sourceLineNo">520</span>     * @param in Array to be tested<a name="line.520"></a>
+<span class="sourceLineNo">521</span>     * @throws NotPositiveException if any array entries are less than 0.<a name="line.521"></a>
+<span class="sourceLineNo">522</span>     * @since 3.1<a name="line.522"></a>
+<span class="sourceLineNo">523</span>     */<a name="line.523"></a>
+<span class="sourceLineNo">524</span>    public static void checkNonNegative(final long[] in)<a name="line.524"></a>
+<span class="sourceLineNo">525</span>        throws NotPositiveException {<a name="line.525"></a>
+<span class="sourceLineNo">526</span>        for (int i = 0; i &lt; in.length; i++) {<a name="line.526"></a>
+<span class="sourceLineNo">527</span>            if (in[i] &lt; 0) {<a name="line.527"></a>
+<span class="sourceLineNo">528</span>                throw new NotPositiveException(in[i]);<a name="line.528"></a>
+<span class="sourceLineNo">529</span>            }<a name="line.529"></a>
+<span class="sourceLineNo">530</span>        }<a name="line.530"></a>
+<span class="sourceLineNo">531</span>    }<a name="line.531"></a>
+<span class="sourceLineNo">532</span><a name="line.532"></a>
+<span class="sourceLineNo">533</span>    /**<a name="line.533"></a>
+<span class="sourceLineNo">534</span>     * Check all entries of the input array are &gt;= 0.<a name="line.534"></a>
+<span class="sourceLineNo">535</span>     *<a name="line.535"></a>
+<span class="sourceLineNo">536</span>     * @param in Array to be tested<a name="line.536"></a>
+<span class="sourceLineNo">537</span>     * @throws NotPositiveException if any array entries are less than 0.<a name="line.537"></a>
+<span class="sourceLineNo">538</span>     * @since 3.1<a name="line.538"></a>
+<span class="sourceLineNo">539</span>     */<a name="line.539"></a>
+<span class="sourceLineNo">540</span>    public static void checkNonNegative(final long[][] in)<a name="line.540"></a>
+<span class="sourceLineNo">541</span>        throws NotPositiveException {<a name="line.541"></a>
+<span class="sourceLineNo">542</span>        for (int i = 0; i &lt; in.length; i ++) {<a name="line.542"></a>
+<span class="sourceLineNo">543</span>            for (int j = 0; j &lt; in[i].length; j++) {<a name="line.543"></a>
+<span class="sourceLineNo">544</span>                if (in[i][j] &lt; 0) {<a name="line.544"></a>
+<span class="sourceLineNo">545</span>                    throw new NotPositiveException(in[i][j]);<a name="line.545"></a>
+<span class="sourceLineNo">546</span>                }<a name="line.546"></a>
+<span class="sourceLineNo">547</span>            }<a name="line.547"></a>
+<span class="sourceLineNo">548</span>        }<a name="line.548"></a>
+<span class="sourceLineNo">549</span>    }<a name="line.549"></a>
+<span class="sourceLineNo">550</span><a name="line.550"></a>
+<span class="sourceLineNo">551</span>    /**<a name="line.551"></a>
+<span class="sourceLineNo">552</span>     * Returns the Cartesian norm (2-norm), handling both overflow and underflow.<a name="line.552"></a>
+<span class="sourceLineNo">553</span>     * Translation of the minpack enorm subroutine.<a name="line.553"></a>
+<span class="sourceLineNo">554</span>     *<a name="line.554"></a>
+<span class="sourceLineNo">555</span>     * The redistribution policy for MINPACK is available<a name="line.555"></a>
+<span class="sourceLineNo">556</span>     * &lt;a href="http://www.netlib.org/minpack/disclaimer"&gt;here&lt;/a&gt;, for<a name="line.556"></a>
+<span class="sourceLineNo">557</span>     * convenience, it is reproduced below.&lt;/p&gt;<a name="line.557"></a>
+<span class="sourceLineNo">558</span>     *<a name="line.558"></a>
+<span class="sourceLineNo">559</span>     * &lt;table border="0" width="80%" cellpadding="10" align="center" bgcolor="#E0E0E0"&gt;<a name="line.559"></a>
+<span class="sourceLineNo">560</span>     * &lt;tr&gt;&lt;td&gt;<a name="line.560"></a>
+<span class="sourceLineNo">561</span>     *    Minpack Copyright Notice (1999) University of Chicago.<a name="line.561"></a>
+<span class="sourceLineNo">562</span>     *    All rights reserved<a name="line.562"></a>
+<span class="sourceLineNo">563</span>     * &lt;/td&gt;&lt;/tr&gt;<a name="line.563"></a>
+<span class="sourceLineNo">564</span>     * &lt;tr&gt;&lt;td&gt;<a name="line.564"></a>
+<span class="sourceLineNo">565</span>     * Redistribution and use in source and binary forms, with or without<a name="line.565"></a>
+<span class="sourceLineNo">566</span>     * modification, are permitted provided that the following conditions<a name="line.566"></a>
+<span class="sourceLineNo">567</span>     * are met:<a name="line.567"></a>
+<span class="sourceLineNo">568</span>     * &lt;ol&gt;<a name="line.568"></a>
+<span class="sourceLineNo">569</span>     *  &lt;li&gt;Redistributions of source code must retain the above copyright<a name="line.569"></a>
+<span class="sourceLineNo">570</span>     *      notice, this list of conditions and the following disclaimer.&lt;/li&gt;<a name="line.570"></a>
+<span class="sourceLineNo">571</span>     * &lt;li&gt;Redistributions in binary form must reproduce the above<a name="line.571"></a>
+<span class="sourceLineNo">572</span>     *     copyright notice, this list of conditions and the following<a name="line.572"></a>
+<span class="sourceLineNo">573</span>     *     disclaimer in the documentation and/or other materials provided<a name="line.573"></a>
+<span class="sourceLineNo">574</span>     *     with the distribution.&lt;/li&gt;<a name="line.574"></a>
+<span class="sourceLineNo">575</span>     * &lt;li&gt;The end-user documentation included with the redistribution, if any,<a name="line.575"></a>
+<span class="sourceLineNo">576</span>     *     must include the following acknowledgment:<a name="line.576"></a>
+<span class="sourceLineNo">577</span>     *     {@code This product includes software developed by the University of<a name="line.577"></a>
+<span class="sourceLineNo">578</span>     *           Chicago, as Operator of Argonne National Laboratory.}<a name="line.578"></a>
+<span class="sourceLineNo">579</span>     *     Alternately, this acknowledgment may appear in the software itself,<a name="line.579"></a>
+<span class="sourceLineNo">580</span>     *     if and wherever such third-party acknowledgments normally appear.&lt;/li&gt;<a name="line.580"></a>
+<span class="sourceLineNo">581</span>     * &lt;li&gt;&lt;strong&gt;WARRANTY DISCLAIMER. THE SOFTWARE IS SUPPLIED "AS IS"<a name="line.581"></a>
+<span class="sourceLineNo">582</span>     *     WITHOUT WARRANTY OF ANY KIND. THE COPYRIGHT HOLDER, THE<a name="line.582"></a>
+<span class="sourceLineNo">583</span>     *     UNITED STATES, THE UNITED STATES DEPARTMENT OF ENERGY, AND<a name="line.583"></a>
+<span class="sourceLineNo">584</span>     *     THEIR EMPLOYEES: (1) DISCLAIM ANY WARRANTIES, EXPRESS OR<a name="line.584"></a>
+<span class="sourceLineNo">585</span>     *     IMPLIED, INCLUDING BUT NOT LIMITED TO ANY IMPLIED WARRANTIES<a name="line.585"></a>
+<span class="sourceLineNo">586</span>     *     OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, TITLE<a name="line.586"></a>
+<span class="sourceLineNo">587</span>     *     OR NON-INFRINGEMENT, (2) DO NOT ASSUME ANY LEGAL LIABILITY<a name="line.587"></a>
+<span class="sourceLineNo">588</span>     *     OR RESPONSIBILITY FOR THE ACCURACY, COMPLETENESS, OR<a name="line.588"></a>
+<span class="sourceLineNo">589</span>     *     USEFULNESS OF THE SOFTWARE, (3) DO NOT REPRESENT THAT USE OF<a name="line.589"></a>
+<span class="sourceLineNo">590</span>     *     THE SOFTWARE WOULD NOT INFRINGE PRIVATELY OWNED RIGHTS, (4)<a name="line.590"></a>
+<span class="sourceLineNo">591</span>     *     DO NOT WARRANT THAT THE SOFTWARE WILL FUNCTION<a name="line.591"></a>
+<span class="sourceLineNo">592</span>     *     UNINTERRUPTED, THAT IT IS ERROR-FREE OR THAT ANY ERRORS WILL<a name="line.592"></a>
+<span class="sourceLineNo">593</span>     *     BE CORRECTED.&lt;/strong&gt;&lt;/li&gt;<a name="line.593"></a>
+<span class="sourceLineNo">594</span>     * &lt;li&gt;&lt;strong&gt;LIMITATION OF LIABILITY. IN NO EVENT WILL THE COPYRIGHT<a name="line.594"></a>
+<span class="sourceLineNo">595</span>     *     HOLDER, THE UNITED STATES, THE UNITED STATES DEPARTMENT OF<a name="line.595"></a>
+<span class="sourceLineNo">596</span>     *     ENERGY, OR THEIR EMPLOYEES: BE LIABLE FOR ANY INDIRECT,<a name="line.596"></a>
+<span class="sourceLineNo">597</span>     *     INCIDENTAL, CONSEQUENTIAL, SPECIAL OR PUNITIVE DAMAGES OF<a name="line.597"></a>
+<span class="sourceLineNo">598</span>     *     ANY KIND OR NATURE, INCLUDING BUT NOT LIMITED TO LOSS OF<a name="line.598"></a>
+<span class="sourceLineNo">599</span>     *     PROFITS OR LOSS OF DATA, FOR ANY REASON WHATSOEVER, WHETHER<a name="line.599"></a>
+<span class="sourceLineNo">600</span>     *     SUCH LIABILITY IS ASSERTED ON THE BASIS OF CONTRACT, TORT<a name="line.600"></a>
+<span class="sourceLineNo">601</span>     *     (INCLUDING NEGLIGENCE OR STRICT LIABILITY), OR OTHERWISE,<a name="line.601"></a>
+<span class="sourceLineNo">602</span>     *     EVEN IF ANY OF SAID PARTIES HAS BEEN WARNED OF THE<a name="line.602"></a>
+<span class="sourceLineNo">603</span>     *     POSSIBILITY OF SUCH LOSS OR DAMAGES.&lt;/strong&gt;&lt;/li&gt;<a name="line.603"></a>
+<span class="sourceLineNo">604</span>     * &lt;ol&gt;&lt;/td&gt;&lt;/tr&gt;<a name="line.604"></a>
+<span class="sourceLineNo">605</span>     * &lt;/table&gt;<a name="line.605"></a>
+<span class="sourceLineNo">606</span>     *<a name="line.606"></a>
+<span class="sourceLineNo">607</span>     * @param v Vector of doubles.<a name="line.607"></a>
+<span class="sourceLineNo">608</span>     * @return the 2-norm of the vector.<a name="line.608"></a>
+<span class="sourceLineNo">609</span>     * @since 2.2<a name="line.609"></a>
+<span class="sourceLineNo">610</span>     */<a name="line.610"></a>
+<span class="sourceLineNo">611</span>    public static double safeNorm(double[] v) {<a name="line.611"></a>
+<span class="sourceLineNo">612</span>        double rdwarf = 3.834e-20;<a name="line.612"></a>
+<span class="sourceLineNo">613</span>        double rgiant = 1.304e+19;<a name="line.613"></a>
+<span class="sourceLineNo">614</span>        double s1 = 0;<a name="line.614"></a>
+<span class="sourceLineNo">615</span>        double s2 = 0;<a name="line.615"></a>
+<span class="sourceLineNo">616</span>        double s3 = 0;<a name="line.616"></a>
+<span class="sourceLineNo">617</span>        double x1max = 0;<a name="line.617"></a>
+<span class="sourceLineNo">618</span>        double x3max = 0;<a name="line.618"></a>
+<span class="sourceLineNo">619</span>        double floatn = v.length;<a name="line.619"></a>
+<span class="sourceLineNo">620</span>        double agiant = rgiant / floatn;<a name="line.620"></a>
+<span class="sourceLineNo">621</span>        for (int i = 0; i &lt; v.length; i++) {<a name="line.621"></a>
+<span class="sourceLineNo">622</span>            double xabs = FastMath.abs(v[i]);<a name="line.622"></a>
+<span class="sourceLineNo">623</span>            if (xabs &lt; rdwarf || xabs &gt; agiant) {<a name="line.623"></a>
+<span class="sourceLineNo">624</span>                if (xabs &gt; rdwarf) {<a name="line.624"></a>
+<span class="sourceLineNo">625</span>                    if (xabs &gt; x1max) {<a name="line.625"></a>
+<span class="sourceLineNo">626</span>                        double r = x1max / xabs;<a name="line.626"></a>
+<span class="sourceLineNo">627</span>                        s1= 1 + s1 * r * r;<a name="line.627"></a>
+<span class="sourceLineNo">628</span>                        x1max = xabs;<a name="line.628"></a>
+<span class="sourceLineNo">629</span>                    } else {<a name="line.629"></a>
+<span class="sourceLineNo">630</span>                        double r = xabs / x1max;<a name="line.630"></a>
+<span class="sourceLineNo">631</span>                        s1 += r * r;<a name="line.631"></a>
 <span class="sourceLineNo">632</span>                    }<a name="line.632"></a>
-<span class="sourceLineNo">633</span>                }<a name="line.633"></a>
-<span class="sourceLineNo">634</span>            } else {<a name="line.634"></a>
-<span class="sourceLineNo">635</span>                s2 += xabs * xabs;<a name="line.635"></a>
-<span class="sourceLineNo">636</span>            }<a name="line.636"></a>
-<span class="sourceLineNo">637</span>        }<a name="line.637"></a>
-<span class="sourceLineNo">638</span>        double norm;<a name="line.638"></a>
-<span class="sourceLineNo">639</span>        if (s1 != 0) {<a name="line.639"></a>
-<span class="sourceLineNo">640</span>            norm = x1max * Math.sqrt(s1 + (s2 / x1max) / x1max);<a name="line.640"></a>
-<span class="sourceLineNo">641</span>        } else {<a name="line.641"></a>
-<span class="sourceLineNo">642</span>            if (s2 == 0) {<a name="line.642"></a>
-<span class="sourceLineNo">643</span>                norm = x3max * Math.sqrt(s3);<a name="line.643"></a>
-<span class="sourceLineNo">644</span>            } else {<a name="line.644"></a>
-<span class="sourceLineNo">645</span>                if (s2 &gt;= x3max) {<a name="line.645"></a>
-<span class="sourceLineNo">646</span>                    norm = Math.sqrt(s2 * (1 + (x3max / s2) * (x3max * s3)));<a name="line.646"></a>
-<span class="sourceLineNo">647</span>                } else {<a name="line.647"></a>
-<span class="sourceLineNo">648</span>                    norm = Math.sqrt(x3max * ((s2 / x3max) + (x3max * s3)));<a name="line.648"></a>
-<span class="sourceLineNo">649</span>                }<a name="line.649"></a>
-<span class="sourceLineNo">650</span>            }<a name="line.650"></a>
-<span class="sourceLineNo">651</span>        }<a name="line.651"></a>
-<span class="sourceLineNo">652</span>        return norm;<a name="line.652"></a>
-<span class="sourceLineNo">653</span>    }<a name="line.653"></a>
-<span class="sourceLineNo">654</span><a name="line.654"></a>
-<span class="sourceLineNo">655</span>    /**<a name="line.655"></a>
-<span class="sourceLineNo">656</span>     * Sort an array in ascending order in place and perform the same reordering<a name="line.656"></a>
-<span class="sourceLineNo">657</span>     * of entries on other arrays. For example, if<a name="line.657"></a>
-<span class="sourceLineNo">658</span>     * {@code x = [3, 1, 2], y = [1, 2, 3]} and {@code z = [0, 5, 7]}, then<a name="line.658"></a>
-<span class="sourceLineNo">659</span>     * {@code sortInPlace(x, y, z)} will update {@code x} to {@code [1, 2, 3]},<a name="line.659"></a>
-<span class="sourceLineNo">660</span>     * {@code y} to {@code [2, 3, 1]} and {@code z} to {@code [5, 7, 0]}.<a name="line.660"></a>
-<span class="sourceLineNo">661</span>     *<a name="line.661"></a>
-<span class="sourceLineNo">662</span>     * @param x Array to be sorted and used as a pattern for permutation<a name="line.662"></a>
-<span class="sourceLineNo">663</span>     * of the other arrays.<a name="line.663"></a>
-<span class="sourceLineNo">664</span>     * @param yList Set of arrays whose permutations of entries will follow<a name="line.664"></a>
-<span class="sourceLineNo">665</span>     * those performed on {@code x}.<a name="line.665"></a>
-<span class="sourceLineNo">666</span>     * @throws DimensionMismatchException if any {@code y} is not the same<a name="line.666"></a>
-<span class="sourceLineNo">667</span>     * size as {@code x}.<a name="line.667"></a>
-<span class="sourceLineNo">668</span>     * @throws NullArgumentException if {@code x} or any {@code y} is null.<a name="line.668"></a>
-<span class="sourceLineNo">669</span>     * @since 3.0<a name="line.669"></a>
-<span class="sourceLineNo">670</span>     */<a name="line.670"></a>
-<span class="sourceLineNo">671</span>    public static void sortInPlace(double[] x, double[] ... yList)<a name="line.671"></a>
-<span class="sourceLineNo">672</span>        throws DimensionMismatchException, NullArgumentException {<a name="line.672"></a>
-<span class="sourceLineNo">673</span>        sortInPlace(x, OrderDirection.INCREASING, yList);<a name="line.673"></a>
-<span class="sourceLineNo">674</span>    }<a name="line.674"></a>
-<span class="sourceLineNo">675</span><a name="line.675"></a>
-<span class="sourceLineNo">676</span>    /**<a name="line.676"></a>
-<span class="sourceLineNo">677</span>     * Sort an array in place and perform the same reordering of entries on<a name="line.677"></a>
-<span class="sourceLineNo">678</span>     * other arrays.  This method works the same as the other<a name="line.678"></a>
-<span class="sourceLineNo">679</span>     * {@link #sortInPlace(double[], double[][]) sortInPlace} method, but<a name="line.679"></a>
-<span class="sourceLineNo">680</span>     * allows the order of the sort to be provided in the {@code dir}<a name="line.680"></a>
-<span class="sourceLineNo">681</span>     * parameter.<a name="line.681"></a>
-<span class="sourceLineNo">682</span>     *<a name="line.682"></a>
-<span class="sourceLineNo">683</span>     * @param x Array to be sorted and used as a pattern for permutation<a name="line.683"></a>
-<span class="sourceLineNo">684</span>     * of the other arrays.<a name="line.684"></a>
-<span class="sourceLineNo">685</span>     * @param dir Order direction.<a name="line.685"></a>
-<span class="sourceLineNo">686</span>     * @param yList Set of arrays whose permutations of entries will follow<a name="line.686"></a>
-<span class="sourceLineNo">687</span>     * those performed on {@code x}.<a name="line.687"></a>
-<span class="sourceLineNo">688</span>     * @throws DimensionMismatchException if any {@code y} is not the same<a name="line.688"></a>
-<span class="sourceLineNo">689</span>     * size as {@code x}.<a name="line.689"></a>
-<span class="sourceLineNo">690</span>     * @throws NullArgumentException if {@code x} or any {@code y} is null<a name="line.690"></a>
-<span class="sourceLineNo">691</span>     * @since 3.0<a name="line.691"></a>
-<span class="sourceLineNo">692</span>     */<a name="line.692"></a>
-<span class="sourceLineNo">693</span>    public static void sortInPlace(double[] x,<a name="line.693"></a>
-<span class="sourceLineNo">694</span>                                   final OrderDirection dir,<a name="line.694"></a>
-<span class="sourceLineNo">695</span>                                   double[] ... yList)<a name="line.695"></a>
-<span class="sourceLineNo">696</span>        throws NullArgumentException,<a name="line.696"></a>
-<span class="sourceLineNo">697</span>               DimensionMismatchException {<a name="line.697"></a>
-<span class="sourceLineNo">698</span><a name="line.698"></a>
-<span class="sourceLineNo">699</span>        // Consistency checks.<a name="line.699"></a>
-<span class="sourceLineNo">700</span>        if (x == null) {<a name="line.700"></a>
-<span class="sourceLineNo">701</span>            throw new NullArgumentException();<a name="line.701"></a>
-<span class="sourceLineNo">702</span>        }<a name="line.702"></a>
-<span class="sourceLineNo">703</span><a name="line.703"></a>
-<span class="sourceLineNo">704</span>        final int yListLen = yList.length;<a name="line.704"></a>
-<span class="sourceLineNo">705</span>        final int len = x.length;<a name="line.705"></a>
-<span class="sourceLineNo">706</span><a name="line.706"></a>
-<span class="sourceLineNo">707</span>        for (int j = 0; j &lt; yListLen; j++) {<a name="line.707"></a>
-<span class="sourceLineNo">708</span>            final double[] y = yList[j];<a name="line.708"></a>
-<span class="sourceLineNo">709</span>            if (y == null) {<a name="line.709"></a>
-<span class="sourceLineNo">710</span>                throw new NullArgumentException();<a name="line.710"></a>
-<span class="sourceLineNo">711</span>            }<a name="line.711"></a>
-<span class="sourceLineNo">712</span>            if (y.length != len) {<a name="line.712"></a>
-<span class="sourceLineNo">713</span>                throw new DimensionMismatchException(y.length, len);<a name="line.713"></a>
-<span class="sourceLineNo">714</span>            }<a name="line.714"></a>
-<span class="sourceLineNo">715</span>        }<a name="line.715"></a>
-<span class="sourceLineNo">716</span><a name="line.716"></a>
-<span class="sourceLineNo">717</span>        // Associate each abscissa "x[i]" with its index "i".<a name="line.717"></a>
-<span class="sourceLineNo">718</span>        final List&lt;Pair&lt;Double, Integer&gt;&gt; list<a name="line.718"></a>
-<span class="sourceLineNo">719</span>            = new ArrayList&lt;Pair&lt;Double, Integer&gt;&gt;(len);<a name="line.719"></a>
-<span class="sourceLineNo">720</span>        for (int i = 0; i &lt; len; i++) {<a name="line.720"></a>
-<span class="sourceLineNo">721</span>            list.add(new Pair&lt;Double, Integer&gt;(x[i], i));<a name="line.721"></a>
-<span class="sourceLineNo">722</span>        }<a name="line.722"></a>
-<span class="sourceLineNo">723</span><a name="line.723"></a>
-<span class="sourceLineNo">724</span>        // Create comparators for increasing and decreasing orders.<a name="line.724"></a>
-<span class="sourceLineNo">725</span>        final Comparator&lt;Pair&lt;Double, Integer&gt;&gt; comp<a name="line.725"></a>
-<span class="sourceLineNo">726</span>            = dir == MathArrays.OrderDirection.INCREASING ?<a name="line.726"></a>
-<span class="sourceLineNo">727</span>            new Comparator&lt;Pair&lt;Double, Integer&gt;&gt;() {<a name="line.727"></a>
-<span class="sourceLineNo">728</span>            public int compare(Pair&lt;Double, Integer&gt; o1,<a name="line.728"></a>
-<span class="sourceLineNo">729</span>                               Pair&lt;Double, Integer&gt; o2) {<a name="line.729"></a>
-<span class="sourceLineNo">730</span>                return o1.getKey().compareTo(o2.getKey());<a name="line.730"></a>
-<span class="sourceLineNo">731</span>            }<a name="line.731"></a>
-<span class="sourceLineNo">732</span>        } : new Comparator&lt;Pair&lt;Double,Integer&gt;&gt;() {<a name="line.732"></a>
-<span class="sourceLineNo">733</span>            public int compare(Pair&lt;Double, Integer&gt; o1,<a name="line.733"></a>
-<span class="sourceLineNo">734</span>                               Pair&lt;Double, Integer&gt; o2) {<a name="line.734"></a>
-<span class="sourceLineNo">735</span>                return o2.getKey().compareTo(o1.getKey());<a name="line.735"></a>
-<span class="sourceLineNo">736</span>            }<a name="line.736"></a>
-<span class="sourceLineNo">737</span>        };<a name="line.737"></a>
-<span class="sourceLineNo">738</span><a name="line.738"></a>
-<span class="sourceLineNo">739</span>        // Sort.<a name="line.739"></a>
-<span class="sourceLineNo">740</span>        Collections.sort(list, comp);<a name="line.740"></a>
-<span class="sourceLineNo">741</span><a name="line.741"></a>
-<span class="sourceLineNo">742</span>        // Modify the original array so that its elements are in<a name="line.742"></a>
-<span class="sourceLineNo">743</span>        // the prescribed order.<a name="line.743"></a>
-<span class="sourceLineNo">744</span>        // Retrieve indices of original locations.<a name="line.744"></a>
-<span class="sourceLineNo">745</span>        final int[] indices = new int[len];<a name="line.745"></a>
-<span class="sourceLineNo">746</span>        for (int i = 0; i &lt; len; i++) {<a name="line.746"></a>
-<span class="sourceLineNo">747</span>            final Pair&lt;Double, Integer&gt; e = list.get(i);<a name="line.747"></a>
-<span class="sourceLineNo">748</span>            x[i] = e.getKey();<a name="line.748"></a>
-<span class="sourceLineNo">749</span>            indices[i] = e.getValue();<a name="line.749"></a>
-<span class="sourceLineNo">750</span>        }<a name="line.750"></a>
-<span class="sourceLineNo">751</span><a name="line.751"></a>
-<span class="sourceLineNo">752</span>        // In each of the associated arrays, move the<a name="line.752"></a>
-<span class="sourceLineNo">753</span>        // elements to their new location.<a name="line.753"></a>
-<span class="sourceLineNo">754</span>        for (int j = 0; j &lt; yListLen; j++) {<a name="line.754"></a>
-<span class="sourceLineNo">755</span>            // Input array will be modified in place.<a name="line.755"></a>
-<span class="sourceLineNo">756</span>            final double[] yInPlace = yList[j];<a name="line.756"></a>
-<span class="sourceLineNo">757</span>            final double[] yOrig = yInPlace.clone();<a name="line.757"></a>
-<span class="sourceLineNo">758</span><a name="line.758"></a>
-<span class="sourceLineNo">759</span>            for (int i = 0; i &lt; len; i++) {<a name="line.759"></a>
-<span class="sourceLineNo">760</span>                yInPlace[i] = yOrig[indices[i]];<a name="line.760"></a>
-<span class="sourceLineNo">761</span>            }<a name="line.761"></a>
-<span class="sourceLineNo">762</span>        }<a name="line.762"></a>
-<span class="sourceLineNo">763</span>    }<a name="line.763"></a>
-<span class="sourceLineNo">764</span><a name="line.764"></a>
-<span class="sourceLineNo">765</span>    /**<a name="line.765"></a>
-<span class="sourceLineNo">766</span>     * Creates a copy of the {@code source} array.<a name="line.766"></a>
-<span class="sourceLineNo">767</span>     *<a name="line.767"></a>
-<span class="sourceLineNo">768</span>     * @param source Array to be copied.<a name="line.768"></a>
-<span class="sourceLineNo">769</span>     * @return the copied array.<a name="line.769"></a>
-<span class="sourceLineNo">770</span>     */<a name="line.770"></a>
-<span class="sourceLineNo">771</span>     public static int[] copyOf(int[] source) {<a name="line.771"></a>
-<span class="sourceLineNo">772</span>         return copyOf(source, source.length);<a name="line.772"></a>
-<span class="sourceLineNo">773</span>     }<a name="line.773"></a>
-<span class="sourceLineNo">774</span><a name="line.774"></a>
-<span class="sourceLineNo">775</span>    /**<a name="line.775"></a>
-<span class="sourceLineNo">776</span>     * Creates a copy of the {@code source} array.<a name="line.776"></a>
-<span class="sourceLineNo">777</span>     *<a name="line.777"></a>
-<span class="sourceLineNo">778</span>     * @param source Array to be copied.<a name="line.778"></a>
-<span class="sourceLineNo">779</span>     * @return the copied array.<a name="line.779"></a>
-<span class="sourceLineNo">780</span>     */<a name="line.780"></a>
-<span class="sourceLineNo">781</span>     public static double[] copyOf(double[] source) {<a name="line.781"></a>
-<span class="sourceLineNo">782</span>         return copyOf(source, source.length);<a name="line.782"></a>
-<span class="sourceLineNo">783</span>     }<a name="line.783"></a>
-<span class="sourceLineNo">784</span><a name="line.784"></a>
-<span class="sourceLineNo">785</span>    /**<a name="line.785"></a>
-<span class="sourceLineNo">786</span>     * Creates a copy of the {@code source} array.<a name="line.786"></a>

[... 2083 lines stripped ...]


Mime
View raw message