You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@commons.apache.org by lu...@apache.org on 2015/01/11 20:09:24 UTC

svn commit: r935839 [36/42] - in /websites/production/commons/content/proper/commons-math/jacoco: ./ org.apache.commons.math3.analysis.differentiation/ org.apache.commons.math3.analysis.interpolation/ org.apache.commons.math3.distribution/ org.apache.c...

Modified: websites/production/commons/content/proper/commons-math/jacoco/org.apache.commons.math3.optimization.linear/SimplexTableau.java.html
==============================================================================
--- websites/production/commons/content/proper/commons-math/jacoco/org.apache.commons.math3.optimization.linear/SimplexTableau.java.html (original)
+++ websites/production/commons/content/proper/commons-math/jacoco/org.apache.commons.math3.optimization.linear/SimplexTableau.java.html Sun Jan 11 19:09:22 2015
@@ -251,7 +251,7 @@ class SimplexTableau implements Serializ
 <span class="fc" id="L251">        List&lt;LinearConstraint&gt; normalized = new ArrayList&lt;LinearConstraint&gt;(originalConstraints.size());</span>
 <span class="fc bfc" id="L252" title="All 2 branches covered.">        for (LinearConstraint constraint : originalConstraints) {</span>
 <span class="fc" id="L253">            normalized.add(normalize(constraint));</span>
-<span class="fc" id="L254">        }</span>
+        }
 <span class="fc" id="L255">        return normalized;</span>
     }
 
@@ -289,7 +289,7 @@ class SimplexTableau implements Serializ
 <span class="fc bfc" id="L289" title="All 2 branches covered.">            if (constraint.getRelationship() == relationship) {</span>
 <span class="fc" id="L290">                ++count;</span>
             }
-<span class="fc" id="L292">        }</span>
+        }
 <span class="fc" id="L293">        return count;</span>
     }
 

Modified: websites/production/commons/content/proper/commons-math/jacoco/org.apache.commons.math3.optimization.linear/index.html
==============================================================================
--- websites/production/commons/content/proper/commons-math/jacoco/org.apache.commons.math3.optimization.linear/index.html (original)
+++ websites/production/commons/content/proper/commons-math/jacoco/org.apache.commons.math3.optimization.linear/index.html Sun Jan 11 19:09:22 2015
@@ -1 +1 @@
-<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd"><html xmlns="http://www.w3.org/1999/xhtml" lang="en"><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8"/><link rel="stylesheet" href="../.resources/report.css" type="text/css"/><link rel="shortcut icon" href="../.resources/report.gif" type="image/gif"/><title>org.apache.commons.math3.optimization.linear</title><script type="text/javascript" src="../.resources/sort.js"></script></head><body onload="initialSort(['breadcrumb', 'coveragetable'])"><div class="breadcrumb" id="breadcrumb"><span class="info"><a href="index.source.html" class="el_source">Source Files</a><a href="../.sessions.html" class="el_session">Sessions</a></span><a href="../index.html" class="el_report">Apache Commons Math</a> &gt; <span class="el_package">org.apache.commons.math3.optimization.linear</span></div><h1>org.apache.commons.math3.optimization.
 linear</h1><table class="coverage" cellspacing="0" id="coveragetable"><thead><tr><td class="sortable" id="a" onclick="toggleSort(this)">Element</td><td class="down sortable bar" id="b" onclick="toggleSort(this)">Missed Instructions</td><td class="sortable ctr2" id="c" onclick="toggleSort(this)">Cov.</td><td class="sortable bar" id="d" onclick="toggleSort(this)">Missed Branches</td><td class="sortable ctr2" id="e" onclick="toggleSort(this)">Cov.</td><td class="sortable ctr1" id="f" onclick="toggleSort(this)">Missed</td><td class="sortable ctr2" id="g" onclick="toggleSort(this)">Cxty</td><td class="sortable ctr1" id="h" onclick="toggleSort(this)">Missed</td><td class="sortable ctr2" id="i" onclick="toggleSort(this)">Lines</td><td class="sortable ctr1" id="j" onclick="toggleSort(this)">Missed</td><td class="sortable ctr2" id="k" onclick="toggleSort(this)">Methods</td><td class="sortable ctr1" id="l" onclick="toggleSort(this)">Missed</td><td class="sortable ctr2" id="m" onclick="toggleS
 ort(this)">Classes</td></tr></thead><tfoot><tr><td>Total</td><td class="bar">162 of 1,807</td><td class="ctr2">91%</td><td class="bar">23 of 207</td><td class="ctr2">89%</td><td class="ctr1">32</td><td class="ctr2">183</td><td class="ctr1">28</td><td class="ctr2">342</td><td class="ctr1">10</td><td class="ctr2">79</td><td class="ctr1">0</td><td class="ctr2">9</td></tr></tfoot><tbody><tr><td id="a1"><a href="LinearConstraint.html" class="el_class">LinearConstraint</a></td><td class="bar" id="b0"><img src="../.resources/redbar.gif" width="8" height="10" title="74" alt="74"/><img src="../.resources/greenbar.gif" width="8" height="10" title="73" alt="73"/></td><td class="ctr2" id="c8">50%</td><td class="bar" id="d1"><img src="../.resources/redbar.gif" width="6" height="10" title="7" alt="7"/><img src="../.resources/greenbar.gif" width="4" height="10" title="5" alt="5"/></td><td class="ctr2" id="e5">42%</td><td class="ctr1" id="f1">9</td><td class="ctr2" id="g2">17</td><td class="ctr1" i
 d="h0">16</td><td class="ctr2" id="i2">36</td><td class="ctr1" id="j0">3</td><td class="ctr2" id="k1">11</td><td class="ctr1" id="l0">0</td><td class="ctr2" id="m0">1</td></tr><tr><td id="a7"><a href="SimplexTableau.html" class="el_class">SimplexTableau</a></td><td class="bar" id="b1"><img src="../.resources/redbar.gif" width="5" height="10" title="49" alt="49"/><img src="../.resources/greenbar.gif" width="114" height="10" title="1,010" alt="1,010"/></td><td class="ctr2" id="c3">95%</td><td class="bar" id="d0"><img src="../.resources/redbar.gif" width="10" height="10" title="11" alt="11"/><img src="../.resources/greenbar.gif" width="109" height="10" title="117" alt="117"/></td><td class="ctr2" id="e2">91%</td><td class="ctr1" id="f0">14</td><td class="ctr2" id="g0">96</td><td class="ctr1" id="h1">6</td><td class="ctr2" id="i0">169</td><td class="ctr1" id="j1">3</td><td class="ctr2" id="k0">32</td><td class="ctr1" id="l1">0</td><td class="ctr2" id="m1">1</td></tr><tr><td id="a2"><a h
 ref="LinearObjectiveFunction.html" class="el_class">LinearObjectiveFunction</a></td><td class="bar" id="b2"><img src="../.resources/redbar.gif" width="2" height="10" title="22" alt="22"/><img src="../.resources/greenbar.gif" width="8" height="10" title="73" alt="73"/></td><td class="ctr2" id="c7">77%</td><td class="bar" id="d2"><img src="../.resources/redbar.gif" width="3" height="10" title="4" alt="4"/><img src="../.resources/greenbar.gif" width="3" height="10" title="4" alt="4"/></td><td class="ctr2" id="e3">50%</td><td class="ctr1" id="f2">6</td><td class="ctr2" id="g3">14</td><td class="ctr1" id="h2">4</td><td class="ctr2" id="i3">23</td><td class="ctr1" id="j2">2</td><td class="ctr2" id="k2">10</td><td class="ctr1" id="l2">0</td><td class="ctr2" id="m2">1</td></tr><tr><td id="a4"><a href="Relationship.html" class="el_class">Relationship</a></td><td class="bar" id="b3"><img src="../.resources/greenbar.gif" width="6" height="10" title="60" alt="60"/></td><td class="ctr2" id="c6">
 88%</td><td class="bar" id="d5"><img src="../.resources/greenbar.gif" width="2" height="10" title="3" alt="3"/></td><td class="ctr2" id="e0">100%</td><td class="ctr1" id="f3">2</td><td class="ctr2" id="g5">8</td><td class="ctr1" id="h3">1</td><td class="ctr2" id="i5">12</td><td class="ctr1" id="j3">2</td><td class="ctr2" id="k5">6</td><td class="ctr1" id="l3">0</td><td class="ctr2" id="m3">1</td></tr><tr><td id="a0"><a href="AbstractLinearOptimizer.html" class="el_class">AbstractLinearOptimizer</a></td><td class="bar" id="b4"><img src="../.resources/greenbar.gif" width="6" height="10" title="58" alt="58"/></td><td class="ctr2" id="c5">89%</td><td class="bar" id="d3"/><td class="ctr2" id="e4">50%</td><td class="ctr1" id="f4">1</td><td class="ctr2" id="g4">11</td><td class="ctr1" id="h4">1</td><td class="ctr2" id="i4">20</td><td class="ctr1" id="j4">0</td><td class="ctr2" id="k3">10</td><td class="ctr1" id="l4">0</td><td class="ctr2" id="m4">1</td></tr><tr><td id="a5"><a href="Relatio
 nship$1.html" class="el_class">Relationship.new Object() {...}</a></td><td class="bar" id="b5"><img src="../.resources/greenbar.gif" width="1" height="10" title="17" alt="17"/></td><td class="ctr2" id="c4">89%</td><td class="bar" id="d6"/><td class="ctr2" id="e6">n/a</td><td class="ctr1" id="f5">0</td><td class="ctr2" id="g6">1</td><td class="ctr1" id="h5">0</td><td class="ctr2" id="i8">1</td><td class="ctr1" id="j5">0</td><td class="ctr2" id="k6">1</td><td class="ctr1" id="l5">0</td><td class="ctr2" id="m5">1</td></tr><tr><td id="a6"><a href="SimplexSolver.html" class="el_class">SimplexSolver</a></td><td class="bar" id="b6"><img src="../.resources/greenbar.gif" width="38" height="10" title="342" alt="342"/></td><td class="ctr2" id="c0">100%</td><td class="bar" id="d4"><img src="../.resources/greenbar.gif" width="50" height="10" title="54" alt="54"/></td><td class="ctr2" id="e1">100%</td><td class="ctr1" id="f6">0</td><td class="ctr2" id="g1">34</td><td class="ctr1" id="h6">0</td><t
 d class="ctr2" id="i1">78</td><td class="ctr1" id="j6">0</td><td class="ctr2" id="k4">7</td><td class="ctr1" id="l6">0</td><td class="ctr2" id="m6">1</td></tr><tr><td id="a8"><a href="UnboundedSolutionException.html" class="el_class">UnboundedSolutionException</a></td><td class="bar" id="b7"/><td class="ctr2" id="c1">100%</td><td class="bar" id="d7"/><td class="ctr2" id="e7">n/a</td><td class="ctr1" id="f7">0</td><td class="ctr2" id="g7">1</td><td class="ctr1" id="h7">0</td><td class="ctr2" id="i6">2</td><td class="ctr1" id="j7">0</td><td class="ctr2" id="k7">1</td><td class="ctr1" id="l7">0</td><td class="ctr2" id="m7">1</td></tr><tr><td id="a3"><a href="NoFeasibleSolutionException.html" class="el_class">NoFeasibleSolutionException</a></td><td class="bar" id="b8"/><td class="ctr2" id="c2">100%</td><td class="bar" id="d8"/><td class="ctr2" id="e8">n/a</td><td class="ctr1" id="f8">0</td><td class="ctr2" id="g8">1</td><td class="ctr1" id="h8">0</td><td class="ctr2" id="i7">2</td><td c
 lass="ctr1" id="j8">0</td><td class="ctr2" id="k8">1</td><td class="ctr1" id="l8">0</td><td class="ctr2" id="m8">1</td></tr></tbody></table><div class="footer"><span class="right">Created with <a href="http://www.eclemma.org/jacoco">JaCoCo</a> 0.7.0.201403182114</span></div></body></html>
\ No newline at end of file
+<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd"><html xmlns="http://www.w3.org/1999/xhtml" lang="en"><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8"/><link rel="stylesheet" href="../.resources/report.css" type="text/css"/><link rel="shortcut icon" href="../.resources/report.gif" type="image/gif"/><title>org.apache.commons.math3.optimization.linear</title><script type="text/javascript" src="../.resources/sort.js"></script></head><body onload="initialSort(['breadcrumb', 'coveragetable'])"><div class="breadcrumb" id="breadcrumb"><span class="info"><a href="index.source.html" class="el_source">Source Files</a><a href="../.sessions.html" class="el_session">Sessions</a></span><a href="../index.html" class="el_report">Apache Commons Math</a> &gt; <span class="el_package">org.apache.commons.math3.optimization.linear</span></div><h1>org.apache.commons.math3.optimization.
 linear</h1><table class="coverage" cellspacing="0" id="coveragetable"><thead><tr><td class="sortable" id="a" onclick="toggleSort(this)">Element</td><td class="down sortable bar" id="b" onclick="toggleSort(this)">Missed Instructions</td><td class="sortable ctr2" id="c" onclick="toggleSort(this)">Cov.</td><td class="sortable bar" id="d" onclick="toggleSort(this)">Missed Branches</td><td class="sortable ctr2" id="e" onclick="toggleSort(this)">Cov.</td><td class="sortable ctr1" id="f" onclick="toggleSort(this)">Missed</td><td class="sortable ctr2" id="g" onclick="toggleSort(this)">Cxty</td><td class="sortable ctr1" id="h" onclick="toggleSort(this)">Missed</td><td class="sortable ctr2" id="i" onclick="toggleSort(this)">Lines</td><td class="sortable ctr1" id="j" onclick="toggleSort(this)">Missed</td><td class="sortable ctr2" id="k" onclick="toggleSort(this)">Methods</td><td class="sortable ctr1" id="l" onclick="toggleSort(this)">Missed</td><td class="sortable ctr2" id="m" onclick="toggleS
 ort(this)">Classes</td></tr></thead><tfoot><tr><td>Total</td><td class="bar">162 of 1,807</td><td class="ctr2">91%</td><td class="bar">23 of 207</td><td class="ctr2">89%</td><td class="ctr1">32</td><td class="ctr2">183</td><td class="ctr1">28</td><td class="ctr2">338</td><td class="ctr1">10</td><td class="ctr2">79</td><td class="ctr1">0</td><td class="ctr2">9</td></tr></tfoot><tbody><tr><td id="a1"><a href="LinearConstraint.html" class="el_class">LinearConstraint</a></td><td class="bar" id="b0"><img src="../.resources/redbar.gif" width="8" height="10" title="74" alt="74"/><img src="../.resources/greenbar.gif" width="8" height="10" title="73" alt="73"/></td><td class="ctr2" id="c8">50%</td><td class="bar" id="d1"><img src="../.resources/redbar.gif" width="6" height="10" title="7" alt="7"/><img src="../.resources/greenbar.gif" width="4" height="10" title="5" alt="5"/></td><td class="ctr2" id="e5">42%</td><td class="ctr1" id="f1">9</td><td class="ctr2" id="g2">17</td><td class="ctr1" i
 d="h0">16</td><td class="ctr2" id="i2">36</td><td class="ctr1" id="j0">3</td><td class="ctr2" id="k1">11</td><td class="ctr1" id="l0">0</td><td class="ctr2" id="m0">1</td></tr><tr><td id="a7"><a href="SimplexTableau.html" class="el_class">SimplexTableau</a></td><td class="bar" id="b1"><img src="../.resources/redbar.gif" width="5" height="10" title="49" alt="49"/><img src="../.resources/greenbar.gif" width="114" height="10" title="1,010" alt="1,010"/></td><td class="ctr2" id="c3">95%</td><td class="bar" id="d0"><img src="../.resources/redbar.gif" width="10" height="10" title="11" alt="11"/><img src="../.resources/greenbar.gif" width="109" height="10" title="117" alt="117"/></td><td class="ctr2" id="e2">91%</td><td class="ctr1" id="f0">14</td><td class="ctr2" id="g0">96</td><td class="ctr1" id="h1">6</td><td class="ctr2" id="i0">167</td><td class="ctr1" id="j1">3</td><td class="ctr2" id="k0">32</td><td class="ctr1" id="l1">0</td><td class="ctr2" id="m1">1</td></tr><tr><td id="a2"><a h
 ref="LinearObjectiveFunction.html" class="el_class">LinearObjectiveFunction</a></td><td class="bar" id="b2"><img src="../.resources/redbar.gif" width="2" height="10" title="22" alt="22"/><img src="../.resources/greenbar.gif" width="8" height="10" title="73" alt="73"/></td><td class="ctr2" id="c7">77%</td><td class="bar" id="d2"><img src="../.resources/redbar.gif" width="3" height="10" title="4" alt="4"/><img src="../.resources/greenbar.gif" width="3" height="10" title="4" alt="4"/></td><td class="ctr2" id="e3">50%</td><td class="ctr1" id="f2">6</td><td class="ctr2" id="g3">14</td><td class="ctr1" id="h2">4</td><td class="ctr2" id="i3">23</td><td class="ctr1" id="j2">2</td><td class="ctr2" id="k2">10</td><td class="ctr1" id="l2">0</td><td class="ctr2" id="m2">1</td></tr><tr><td id="a4"><a href="Relationship.html" class="el_class">Relationship</a></td><td class="bar" id="b3"><img src="../.resources/greenbar.gif" width="6" height="10" title="60" alt="60"/></td><td class="ctr2" id="c6">
 88%</td><td class="bar" id="d5"><img src="../.resources/greenbar.gif" width="2" height="10" title="3" alt="3"/></td><td class="ctr2" id="e0">100%</td><td class="ctr1" id="f3">2</td><td class="ctr2" id="g5">8</td><td class="ctr1" id="h3">1</td><td class="ctr2" id="i5">12</td><td class="ctr1" id="j3">2</td><td class="ctr2" id="k5">6</td><td class="ctr1" id="l3">0</td><td class="ctr2" id="m3">1</td></tr><tr><td id="a0"><a href="AbstractLinearOptimizer.html" class="el_class">AbstractLinearOptimizer</a></td><td class="bar" id="b4"><img src="../.resources/greenbar.gif" width="6" height="10" title="58" alt="58"/></td><td class="ctr2" id="c5">89%</td><td class="bar" id="d3"/><td class="ctr2" id="e4">50%</td><td class="ctr1" id="f4">1</td><td class="ctr2" id="g4">11</td><td class="ctr1" id="h4">1</td><td class="ctr2" id="i4">20</td><td class="ctr1" id="j4">0</td><td class="ctr2" id="k3">10</td><td class="ctr1" id="l4">0</td><td class="ctr2" id="m4">1</td></tr><tr><td id="a5"><a href="Relatio
 nship$1.html" class="el_class">Relationship.new Object() {...}</a></td><td class="bar" id="b5"><img src="../.resources/greenbar.gif" width="1" height="10" title="17" alt="17"/></td><td class="ctr2" id="c4">89%</td><td class="bar" id="d6"/><td class="ctr2" id="e6">n/a</td><td class="ctr1" id="f5">0</td><td class="ctr2" id="g6">1</td><td class="ctr1" id="h5">0</td><td class="ctr2" id="i8">1</td><td class="ctr1" id="j5">0</td><td class="ctr2" id="k6">1</td><td class="ctr1" id="l5">0</td><td class="ctr2" id="m5">1</td></tr><tr><td id="a6"><a href="SimplexSolver.html" class="el_class">SimplexSolver</a></td><td class="bar" id="b6"><img src="../.resources/greenbar.gif" width="38" height="10" title="342" alt="342"/></td><td class="ctr2" id="c0">100%</td><td class="bar" id="d4"><img src="../.resources/greenbar.gif" width="50" height="10" title="54" alt="54"/></td><td class="ctr2" id="e1">100%</td><td class="ctr1" id="f6">0</td><td class="ctr2" id="g1">34</td><td class="ctr1" id="h6">0</td><t
 d class="ctr2" id="i1">76</td><td class="ctr1" id="j6">0</td><td class="ctr2" id="k4">7</td><td class="ctr1" id="l6">0</td><td class="ctr2" id="m6">1</td></tr><tr><td id="a8"><a href="UnboundedSolutionException.html" class="el_class">UnboundedSolutionException</a></td><td class="bar" id="b7"/><td class="ctr2" id="c1">100%</td><td class="bar" id="d7"/><td class="ctr2" id="e7">n/a</td><td class="ctr1" id="f7">0</td><td class="ctr2" id="g7">1</td><td class="ctr1" id="h7">0</td><td class="ctr2" id="i6">2</td><td class="ctr1" id="j7">0</td><td class="ctr2" id="k7">1</td><td class="ctr1" id="l7">0</td><td class="ctr2" id="m7">1</td></tr><tr><td id="a3"><a href="NoFeasibleSolutionException.html" class="el_class">NoFeasibleSolutionException</a></td><td class="bar" id="b8"/><td class="ctr2" id="c2">100%</td><td class="bar" id="d8"/><td class="ctr2" id="e8">n/a</td><td class="ctr1" id="f8">0</td><td class="ctr2" id="g8">1</td><td class="ctr1" id="h8">0</td><td class="ctr2" id="i7">2</td><td c
 lass="ctr1" id="j8">0</td><td class="ctr2" id="k8">1</td><td class="ctr1" id="l8">0</td><td class="ctr2" id="m8">1</td></tr></tbody></table><div class="footer"><span class="right">Created with <a href="http://www.eclemma.org/jacoco">JaCoCo</a> 0.7.0.201403182114</span></div></body></html>
\ No newline at end of file

Modified: websites/production/commons/content/proper/commons-math/jacoco/org.apache.commons.math3.optimization.linear/index.source.html
==============================================================================
--- websites/production/commons/content/proper/commons-math/jacoco/org.apache.commons.math3.optimization.linear/index.source.html (original)
+++ websites/production/commons/content/proper/commons-math/jacoco/org.apache.commons.math3.optimization.linear/index.source.html Sun Jan 11 19:09:22 2015
@@ -1 +1 @@
-<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd"><html xmlns="http://www.w3.org/1999/xhtml" lang="en"><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8"/><link rel="stylesheet" href="../.resources/report.css" type="text/css"/><link rel="shortcut icon" href="../.resources/report.gif" type="image/gif"/><title>org.apache.commons.math3.optimization.linear</title><script type="text/javascript" src="../.resources/sort.js"></script></head><body onload="initialSort(['breadcrumb', 'coveragetable'])"><div class="breadcrumb" id="breadcrumb"><span class="info"><a href="index.html" class="el_class">Classes</a><a href="../.sessions.html" class="el_session">Sessions</a></span><a href="../index.html" class="el_report">Apache Commons Math</a> &gt; <span class="el_package">org.apache.commons.math3.optimization.linear</span></div><h1>org.apache.commons.math3.optimization.linear</h1><t
 able class="coverage" cellspacing="0" id="coveragetable"><thead><tr><td class="sortable" id="a" onclick="toggleSort(this)">Element</td><td class="down sortable bar" id="b" onclick="toggleSort(this)">Missed Instructions</td><td class="sortable ctr2" id="c" onclick="toggleSort(this)">Cov.</td><td class="sortable bar" id="d" onclick="toggleSort(this)">Missed Branches</td><td class="sortable ctr2" id="e" onclick="toggleSort(this)">Cov.</td><td class="sortable ctr1" id="f" onclick="toggleSort(this)">Missed</td><td class="sortable ctr2" id="g" onclick="toggleSort(this)">Cxty</td><td class="sortable ctr1" id="h" onclick="toggleSort(this)">Missed</td><td class="sortable ctr2" id="i" onclick="toggleSort(this)">Lines</td><td class="sortable ctr1" id="j" onclick="toggleSort(this)">Missed</td><td class="sortable ctr2" id="k" onclick="toggleSort(this)">Methods</td><td class="sortable ctr1" id="l" onclick="toggleSort(this)">Missed</td><td class="sortable ctr2" id="m" onclick="toggleSort(this)">Cl
 asses</td></tr></thead><tfoot><tr><td>Total</td><td class="bar">162 of 1,807</td><td class="ctr2">91%</td><td class="bar">23 of 207</td><td class="ctr2">89%</td><td class="ctr1">32</td><td class="ctr2">183</td><td class="ctr1">28</td><td class="ctr2">342</td><td class="ctr1">10</td><td class="ctr2">79</td><td class="ctr1">0</td><td class="ctr2">9</td></tr></tfoot><tbody><tr><td id="a1"><a href="LinearConstraint.java.html" class="el_source">LinearConstraint.java</a></td><td class="bar" id="b0"><img src="../.resources/redbar.gif" width="8" height="10" title="74" alt="74"/><img src="../.resources/greenbar.gif" width="8" height="10" title="73" alt="73"/></td><td class="ctr2" id="c7">50%</td><td class="bar" id="d1"><img src="../.resources/redbar.gif" width="6" height="10" title="7" alt="7"/><img src="../.resources/greenbar.gif" width="4" height="10" title="5" alt="5"/></td><td class="ctr2" id="e5">42%</td><td class="ctr1" id="f1">9</td><td class="ctr2" id="g2">17</td><td class="ctr1" id=
 "h0">16</td><td class="ctr2" id="i2">36</td><td class="ctr1" id="j0">3</td><td class="ctr2" id="k1">11</td><td class="ctr1" id="l0">0</td><td class="ctr2" id="m1">1</td></tr><tr><td id="a6"><a href="SimplexTableau.java.html" class="el_source">SimplexTableau.java</a></td><td class="bar" id="b1"><img src="../.resources/redbar.gif" width="5" height="10" title="49" alt="49"/><img src="../.resources/greenbar.gif" width="114" height="10" title="1,010" alt="1,010"/></td><td class="ctr2" id="c3">95%</td><td class="bar" id="d0"><img src="../.resources/redbar.gif" width="10" height="10" title="11" alt="11"/><img src="../.resources/greenbar.gif" width="109" height="10" title="117" alt="117"/></td><td class="ctr2" id="e2">91%</td><td class="ctr1" id="f0">14</td><td class="ctr2" id="g0">96</td><td class="ctr1" id="h1">6</td><td class="ctr2" id="i0">169</td><td class="ctr1" id="j1">3</td><td class="ctr2" id="k0">32</td><td class="ctr1" id="l1">0</td><td class="ctr2" id="m2">1</td></tr><tr><td id=
 "a2"><a href="LinearObjectiveFunction.java.html" class="el_source">LinearObjectiveFunction.java</a></td><td class="bar" id="b2"><img src="../.resources/redbar.gif" width="2" height="10" title="22" alt="22"/><img src="../.resources/greenbar.gif" width="8" height="10" title="73" alt="73"/></td><td class="ctr2" id="c6">77%</td><td class="bar" id="d2"><img src="../.resources/redbar.gif" width="3" height="10" title="4" alt="4"/><img src="../.resources/greenbar.gif" width="3" height="10" title="4" alt="4"/></td><td class="ctr2" id="e3">50%</td><td class="ctr1" id="f2">6</td><td class="ctr2" id="g3">14</td><td class="ctr1" id="h2">4</td><td class="ctr2" id="i3">23</td><td class="ctr1" id="j2">2</td><td class="ctr2" id="k2">10</td><td class="ctr1" id="l2">0</td><td class="ctr2" id="m3">1</td></tr><tr><td id="a4"><a href="Relationship.java.html" class="el_source">Relationship.java</a></td><td class="bar" id="b3"><img src="../.resources/redbar.gif" width="1" height="10" title="10" alt="10"/><
 img src="../.resources/greenbar.gif" width="8" height="10" title="77" alt="77"/></td><td class="ctr2" id="c5">89%</td><td class="bar" id="d5"><img src="../.resources/greenbar.gif" width="2" height="10" title="3" alt="3"/></td><td class="ctr2" id="e0">100%</td><td class="ctr1" id="f3">2</td><td class="ctr2" id="g5">9</td><td class="ctr1" id="h3">1</td><td class="ctr2" id="i5">12</td><td class="ctr1" id="j3">2</td><td class="ctr2" id="k4">7</td><td class="ctr1" id="l3">0</td><td class="ctr2" id="m0">2</td></tr><tr><td id="a0"><a href="AbstractLinearOptimizer.java.html" class="el_source">AbstractLinearOptimizer.java</a></td><td class="bar" id="b4"><img src="../.resources/greenbar.gif" width="6" height="10" title="58" alt="58"/></td><td class="ctr2" id="c4">89%</td><td class="bar" id="d3"/><td class="ctr2" id="e4">50%</td><td class="ctr1" id="f4">1</td><td class="ctr2" id="g4">11</td><td class="ctr1" id="h4">1</td><td class="ctr2" id="i4">20</td><td class="ctr1" id="j4">0</td><td class=
 "ctr2" id="k3">10</td><td class="ctr1" id="l4">0</td><td class="ctr2" id="m4">1</td></tr><tr><td id="a5"><a href="SimplexSolver.java.html" class="el_source">SimplexSolver.java</a></td><td class="bar" id="b5"><img src="../.resources/greenbar.gif" width="38" height="10" title="342" alt="342"/></td><td class="ctr2" id="c0">100%</td><td class="bar" id="d4"><img src="../.resources/greenbar.gif" width="50" height="10" title="54" alt="54"/></td><td class="ctr2" id="e1">100%</td><td class="ctr1" id="f5">0</td><td class="ctr2" id="g1">34</td><td class="ctr1" id="h5">0</td><td class="ctr2" id="i1">78</td><td class="ctr1" id="j5">0</td><td class="ctr2" id="k5">7</td><td class="ctr1" id="l5">0</td><td class="ctr2" id="m5">1</td></tr><tr><td id="a7"><a href="UnboundedSolutionException.java.html" class="el_source">UnboundedSolutionException.java</a></td><td class="bar" id="b6"/><td class="ctr2" id="c1">100%</td><td class="bar" id="d6"/><td class="ctr2" id="e6">n/a</td><td class="ctr1" id="f6">0</
 td><td class="ctr2" id="g6">1</td><td class="ctr1" id="h6">0</td><td class="ctr2" id="i6">2</td><td class="ctr1" id="j6">0</td><td class="ctr2" id="k6">1</td><td class="ctr1" id="l6">0</td><td class="ctr2" id="m6">1</td></tr><tr><td id="a3"><a href="NoFeasibleSolutionException.java.html" class="el_source">NoFeasibleSolutionException.java</a></td><td class="bar" id="b7"/><td class="ctr2" id="c2">100%</td><td class="bar" id="d7"/><td class="ctr2" id="e7">n/a</td><td class="ctr1" id="f7">0</td><td class="ctr2" id="g7">1</td><td class="ctr1" id="h7">0</td><td class="ctr2" id="i7">2</td><td class="ctr1" id="j7">0</td><td class="ctr2" id="k7">1</td><td class="ctr1" id="l7">0</td><td class="ctr2" id="m7">1</td></tr></tbody></table><div class="footer"><span class="right">Created with <a href="http://www.eclemma.org/jacoco">JaCoCo</a> 0.7.0.201403182114</span></div></body></html>
\ No newline at end of file
+<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd"><html xmlns="http://www.w3.org/1999/xhtml" lang="en"><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8"/><link rel="stylesheet" href="../.resources/report.css" type="text/css"/><link rel="shortcut icon" href="../.resources/report.gif" type="image/gif"/><title>org.apache.commons.math3.optimization.linear</title><script type="text/javascript" src="../.resources/sort.js"></script></head><body onload="initialSort(['breadcrumb', 'coveragetable'])"><div class="breadcrumb" id="breadcrumb"><span class="info"><a href="index.html" class="el_class">Classes</a><a href="../.sessions.html" class="el_session">Sessions</a></span><a href="../index.html" class="el_report">Apache Commons Math</a> &gt; <span class="el_package">org.apache.commons.math3.optimization.linear</span></div><h1>org.apache.commons.math3.optimization.linear</h1><t
 able class="coverage" cellspacing="0" id="coveragetable"><thead><tr><td class="sortable" id="a" onclick="toggleSort(this)">Element</td><td class="down sortable bar" id="b" onclick="toggleSort(this)">Missed Instructions</td><td class="sortable ctr2" id="c" onclick="toggleSort(this)">Cov.</td><td class="sortable bar" id="d" onclick="toggleSort(this)">Missed Branches</td><td class="sortable ctr2" id="e" onclick="toggleSort(this)">Cov.</td><td class="sortable ctr1" id="f" onclick="toggleSort(this)">Missed</td><td class="sortable ctr2" id="g" onclick="toggleSort(this)">Cxty</td><td class="sortable ctr1" id="h" onclick="toggleSort(this)">Missed</td><td class="sortable ctr2" id="i" onclick="toggleSort(this)">Lines</td><td class="sortable ctr1" id="j" onclick="toggleSort(this)">Missed</td><td class="sortable ctr2" id="k" onclick="toggleSort(this)">Methods</td><td class="sortable ctr1" id="l" onclick="toggleSort(this)">Missed</td><td class="sortable ctr2" id="m" onclick="toggleSort(this)">Cl
 asses</td></tr></thead><tfoot><tr><td>Total</td><td class="bar">162 of 1,807</td><td class="ctr2">91%</td><td class="bar">23 of 207</td><td class="ctr2">89%</td><td class="ctr1">32</td><td class="ctr2">183</td><td class="ctr1">28</td><td class="ctr2">338</td><td class="ctr1">10</td><td class="ctr2">79</td><td class="ctr1">0</td><td class="ctr2">9</td></tr></tfoot><tbody><tr><td id="a1"><a href="LinearConstraint.java.html" class="el_source">LinearConstraint.java</a></td><td class="bar" id="b0"><img src="../.resources/redbar.gif" width="8" height="10" title="74" alt="74"/><img src="../.resources/greenbar.gif" width="8" height="10" title="73" alt="73"/></td><td class="ctr2" id="c7">50%</td><td class="bar" id="d1"><img src="../.resources/redbar.gif" width="6" height="10" title="7" alt="7"/><img src="../.resources/greenbar.gif" width="4" height="10" title="5" alt="5"/></td><td class="ctr2" id="e5">42%</td><td class="ctr1" id="f1">9</td><td class="ctr2" id="g2">17</td><td class="ctr1" id=
 "h0">16</td><td class="ctr2" id="i2">36</td><td class="ctr1" id="j0">3</td><td class="ctr2" id="k1">11</td><td class="ctr1" id="l0">0</td><td class="ctr2" id="m1">1</td></tr><tr><td id="a6"><a href="SimplexTableau.java.html" class="el_source">SimplexTableau.java</a></td><td class="bar" id="b1"><img src="../.resources/redbar.gif" width="5" height="10" title="49" alt="49"/><img src="../.resources/greenbar.gif" width="114" height="10" title="1,010" alt="1,010"/></td><td class="ctr2" id="c3">95%</td><td class="bar" id="d0"><img src="../.resources/redbar.gif" width="10" height="10" title="11" alt="11"/><img src="../.resources/greenbar.gif" width="109" height="10" title="117" alt="117"/></td><td class="ctr2" id="e2">91%</td><td class="ctr1" id="f0">14</td><td class="ctr2" id="g0">96</td><td class="ctr1" id="h1">6</td><td class="ctr2" id="i0">167</td><td class="ctr1" id="j1">3</td><td class="ctr2" id="k0">32</td><td class="ctr1" id="l1">0</td><td class="ctr2" id="m2">1</td></tr><tr><td id=
 "a2"><a href="LinearObjectiveFunction.java.html" class="el_source">LinearObjectiveFunction.java</a></td><td class="bar" id="b2"><img src="../.resources/redbar.gif" width="2" height="10" title="22" alt="22"/><img src="../.resources/greenbar.gif" width="8" height="10" title="73" alt="73"/></td><td class="ctr2" id="c6">77%</td><td class="bar" id="d2"><img src="../.resources/redbar.gif" width="3" height="10" title="4" alt="4"/><img src="../.resources/greenbar.gif" width="3" height="10" title="4" alt="4"/></td><td class="ctr2" id="e3">50%</td><td class="ctr1" id="f2">6</td><td class="ctr2" id="g3">14</td><td class="ctr1" id="h2">4</td><td class="ctr2" id="i3">23</td><td class="ctr1" id="j2">2</td><td class="ctr2" id="k2">10</td><td class="ctr1" id="l2">0</td><td class="ctr2" id="m3">1</td></tr><tr><td id="a4"><a href="Relationship.java.html" class="el_source">Relationship.java</a></td><td class="bar" id="b3"><img src="../.resources/redbar.gif" width="1" height="10" title="10" alt="10"/><
 img src="../.resources/greenbar.gif" width="8" height="10" title="77" alt="77"/></td><td class="ctr2" id="c5">89%</td><td class="bar" id="d5"><img src="../.resources/greenbar.gif" width="2" height="10" title="3" alt="3"/></td><td class="ctr2" id="e0">100%</td><td class="ctr1" id="f3">2</td><td class="ctr2" id="g5">9</td><td class="ctr1" id="h3">1</td><td class="ctr2" id="i5">12</td><td class="ctr1" id="j3">2</td><td class="ctr2" id="k4">7</td><td class="ctr1" id="l3">0</td><td class="ctr2" id="m0">2</td></tr><tr><td id="a0"><a href="AbstractLinearOptimizer.java.html" class="el_source">AbstractLinearOptimizer.java</a></td><td class="bar" id="b4"><img src="../.resources/greenbar.gif" width="6" height="10" title="58" alt="58"/></td><td class="ctr2" id="c4">89%</td><td class="bar" id="d3"/><td class="ctr2" id="e4">50%</td><td class="ctr1" id="f4">1</td><td class="ctr2" id="g4">11</td><td class="ctr1" id="h4">1</td><td class="ctr2" id="i4">20</td><td class="ctr1" id="j4">0</td><td class=
 "ctr2" id="k3">10</td><td class="ctr1" id="l4">0</td><td class="ctr2" id="m4">1</td></tr><tr><td id="a5"><a href="SimplexSolver.java.html" class="el_source">SimplexSolver.java</a></td><td class="bar" id="b5"><img src="../.resources/greenbar.gif" width="38" height="10" title="342" alt="342"/></td><td class="ctr2" id="c0">100%</td><td class="bar" id="d4"><img src="../.resources/greenbar.gif" width="50" height="10" title="54" alt="54"/></td><td class="ctr2" id="e1">100%</td><td class="ctr1" id="f5">0</td><td class="ctr2" id="g1">34</td><td class="ctr1" id="h5">0</td><td class="ctr2" id="i1">76</td><td class="ctr1" id="j5">0</td><td class="ctr2" id="k5">7</td><td class="ctr1" id="l5">0</td><td class="ctr2" id="m5">1</td></tr><tr><td id="a7"><a href="UnboundedSolutionException.java.html" class="el_source">UnboundedSolutionException.java</a></td><td class="bar" id="b6"/><td class="ctr2" id="c1">100%</td><td class="bar" id="d6"/><td class="ctr2" id="e6">n/a</td><td class="ctr1" id="f6">0</
 td><td class="ctr2" id="g6">1</td><td class="ctr1" id="h6">0</td><td class="ctr2" id="i6">2</td><td class="ctr1" id="j6">0</td><td class="ctr2" id="k6">1</td><td class="ctr1" id="l6">0</td><td class="ctr2" id="m6">1</td></tr><tr><td id="a3"><a href="NoFeasibleSolutionException.java.html" class="el_source">NoFeasibleSolutionException.java</a></td><td class="bar" id="b7"/><td class="ctr2" id="c2">100%</td><td class="bar" id="d7"/><td class="ctr2" id="e7">n/a</td><td class="ctr1" id="f7">0</td><td class="ctr2" id="g7">1</td><td class="ctr1" id="h7">0</td><td class="ctr2" id="i7">2</td><td class="ctr1" id="j7">0</td><td class="ctr2" id="k7">1</td><td class="ctr1" id="l7">0</td><td class="ctr2" id="m7">1</td></tr></tbody></table><div class="footer"><span class="right">Created with <a href="http://www.eclemma.org/jacoco">JaCoCo</a> 0.7.0.201403182114</span></div></body></html>
\ No newline at end of file

Added: websites/production/commons/content/proper/commons-math/jacoco/org.apache.commons.math3.special/BesselJ$BesselJResult.html
==============================================================================
--- websites/production/commons/content/proper/commons-math/jacoco/org.apache.commons.math3.special/BesselJ$BesselJResult.html (added)
+++ websites/production/commons/content/proper/commons-math/jacoco/org.apache.commons.math3.special/BesselJ$BesselJResult.html Sun Jan 11 19:09:22 2015
@@ -0,0 +1 @@
+<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd"><html xmlns="http://www.w3.org/1999/xhtml" lang="en"><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8"/><link rel="stylesheet" href="../.resources/report.css" type="text/css"/><link rel="shortcut icon" href="../.resources/report.gif" type="image/gif"/><title>BesselJ.BesselJResult</title><script type="text/javascript" src="../.resources/sort.js"></script></head><body onload="initialSort(['breadcrumb'])"><div class="breadcrumb" id="breadcrumb"><span class="info"><a href="../.sessions.html" class="el_session">Sessions</a></span><a href="../index.html" class="el_report">Apache Commons Math</a> &gt; <a href="index.html" class="el_package">org.apache.commons.math3.special</a> &gt; <span class="el_class">BesselJ.BesselJResult</span></div><h1>BesselJ.BesselJResult</h1><table class="coverage" cellspacing="0" id="coveragetable
 "><thead><tr><td class="sortable" id="a" onclick="toggleSort(this)">Element</td><td class="down sortable bar" id="b" onclick="toggleSort(this)">Missed Instructions</td><td class="sortable ctr2" id="c" onclick="toggleSort(this)">Cov.</td><td class="sortable bar" id="d" onclick="toggleSort(this)">Missed Branches</td><td class="sortable ctr2" id="e" onclick="toggleSort(this)">Cov.</td><td class="sortable ctr1" id="f" onclick="toggleSort(this)">Missed</td><td class="sortable ctr2" id="g" onclick="toggleSort(this)">Cxty</td><td class="sortable ctr1" id="h" onclick="toggleSort(this)">Missed</td><td class="sortable ctr2" id="i" onclick="toggleSort(this)">Lines</td><td class="sortable ctr1" id="j" onclick="toggleSort(this)">Missed</td><td class="sortable ctr2" id="k" onclick="toggleSort(this)">Methods</td></tr></thead><tfoot><tr><td>Total</td><td class="bar">10 of 22</td><td class="ctr2">55%</td><td class="bar">0 of 0</td><td class="ctr2">n/a</td><td class="ctr1">2</td><td class="ctr2">3</t
 d><td class="ctr1">2</td><td class="ctr2">6</td><td class="ctr1">2</td><td class="ctr2">3</td></tr></tfoot><tbody><tr><td id="a2"><a href="BesselJ.java.html#L216" class="el_method">getVals()</a></td><td class="bar" id="b0"><img src="../.resources/redbar.gif" width="70" height="10" title="7" alt="7"/></td><td class="ctr2" id="c1">0%</td><td class="bar" id="d0"/><td class="ctr2" id="e0">n/a</td><td class="ctr1" id="f0">1</td><td class="ctr2" id="g0">1</td><td class="ctr1" id="h0">1</td><td class="ctr2" id="i1">1</td><td class="ctr1" id="j0">1</td><td class="ctr2" id="k0">1</td></tr><tr><td id="a1"><a href="BesselJ.java.html#L224" class="el_method">getnVals()</a></td><td class="bar" id="b1"><img src="../.resources/redbar.gif" width="30" height="10" title="3" alt="3"/></td><td class="ctr2" id="c2">0%</td><td class="bar" id="d1"/><td class="ctr2" id="e1">n/a</td><td class="ctr1" id="f1">1</td><td class="ctr2" id="g1">1</td><td class="ctr1" id="h1">1</td><td class="ctr2" id="i2">1</td><td
  class="ctr1" id="j1">1</td><td class="ctr2" id="k1">1</td></tr><tr><td id="a0"><a href="BesselJ.java.html#L207" class="el_method">BesselJ.BesselJResult(double[], int)</a></td><td class="bar" id="b2"><img src="../.resources/greenbar.gif" width="120" height="10" title="12" alt="12"/></td><td class="ctr2" id="c0">100%</td><td class="bar" id="d2"/><td class="ctr2" id="e2">n/a</td><td class="ctr1" id="f2">0</td><td class="ctr2" id="g2">1</td><td class="ctr1" id="h2">0</td><td class="ctr2" id="i0">4</td><td class="ctr1" id="j2">0</td><td class="ctr2" id="k2">1</td></tr></tbody></table><div class="footer"><span class="right">Created with <a href="http://www.eclemma.org/jacoco">JaCoCo</a> 0.7.0.201403182114</span></div></body></html>
\ No newline at end of file

Propchange: websites/production/commons/content/proper/commons-math/jacoco/org.apache.commons.math3.special/BesselJ$BesselJResult.html
------------------------------------------------------------------------------
    svn:eol-style = native

Propchange: websites/production/commons/content/proper/commons-math/jacoco/org.apache.commons.math3.special/BesselJ$BesselJResult.html
------------------------------------------------------------------------------
    svn:keywords = Author Date Id Revision

Added: websites/production/commons/content/proper/commons-math/jacoco/org.apache.commons.math3.special/BesselJ.html
==============================================================================
--- websites/production/commons/content/proper/commons-math/jacoco/org.apache.commons.math3.special/BesselJ.html (added)
+++ websites/production/commons/content/proper/commons-math/jacoco/org.apache.commons.math3.special/BesselJ.html Sun Jan 11 19:09:22 2015
@@ -0,0 +1 @@
+<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd"><html xmlns="http://www.w3.org/1999/xhtml" lang="en"><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8"/><link rel="stylesheet" href="../.resources/report.css" type="text/css"/><link rel="shortcut icon" href="../.resources/report.gif" type="image/gif"/><title>BesselJ</title><script type="text/javascript" src="../.resources/sort.js"></script></head><body onload="initialSort(['breadcrumb'])"><div class="breadcrumb" id="breadcrumb"><span class="info"><a href="../.sessions.html" class="el_session">Sessions</a></span><a href="../index.html" class="el_report">Apache Commons Math</a> &gt; <a href="index.html" class="el_package">org.apache.commons.math3.special</a> &gt; <span class="el_class">BesselJ</span></div><h1>BesselJ</h1><table class="coverage" cellspacing="0" id="coveragetable"><thead><tr><td class="sortable" id="a" o
 nclick="toggleSort(this)">Element</td><td class="down sortable bar" id="b" onclick="toggleSort(this)">Missed Instructions</td><td class="sortable ctr2" id="c" onclick="toggleSort(this)">Cov.</td><td class="sortable bar" id="d" onclick="toggleSort(this)">Missed Branches</td><td class="sortable ctr2" id="e" onclick="toggleSort(this)">Cov.</td><td class="sortable ctr1" id="f" onclick="toggleSort(this)">Missed</td><td class="sortable ctr2" id="g" onclick="toggleSort(this)">Cxty</td><td class="sortable ctr1" id="h" onclick="toggleSort(this)">Missed</td><td class="sortable ctr2" id="i" onclick="toggleSort(this)">Lines</td><td class="sortable ctr1" id="j" onclick="toggleSort(this)">Missed</td><td class="sortable ctr2" id="k" onclick="toggleSort(this)">Methods</td></tr></thead><tfoot><tr><td>Total</td><td class="bar">68 of 1,366</td><td class="ctr2">95%</td><td class="bar">19 of 132</td><td class="ctr2">86%</td><td class="ctr1">20</td><td class="ctr2">71</td><td class="ctr1">11</td><td clas
 s="ctr2">252</td><td class="ctr1">2</td><td class="ctr2">5</td></tr></tfoot><tbody><tr><td id="a1"><a href="BesselJ.java.html#L247" class="el_method">rjBesl(double, double, int)</a></td><td class="bar" id="b0"><img src="../.resources/redbar.gif" width="4" height="10" title="40" alt="40"/><img src="../.resources/greenbar.gif" width="115" height="10" title="1,132" alt="1,132"/></td><td class="ctr2" id="c1">97%</td><td class="bar" id="d0"><img src="../.resources/redbar.gif" width="17" height="10" title="18" alt="18"/><img src="../.resources/greenbar.gif" width="102" height="10" title="108" alt="108"/></td><td class="ctr2" id="e0">86%</td><td class="ctr1" id="f0">17</td><td class="ctr2" id="g0">64</td><td class="ctr1" id="h0">6</td><td class="ctr2" id="i0">236</td><td class="ctr1" id="j2">0</td><td class="ctr2" id="k0">1</td></tr><tr><td id="a4"><a href="BesselJ.java.html#L158" class="el_method">value(double, double)</a></td><td class="bar" id="b1"><img src="../.resources/redbar.gif" wi
 dth="1" height="10" title="17" alt="17"/><img src="../.resources/greenbar.gif" width="6" height="10" title="62" alt="62"/></td><td class="ctr2" id="c2">78%</td><td class="bar" id="d1"><img src="../.resources/greenbar.gif" width="4" height="10" title="5" alt="5"/></td><td class="ctr2" id="e1">83%</td><td class="ctr1" id="f1">1</td><td class="ctr2" id="g1">4</td><td class="ctr1" id="h2">1</td><td class="ctr2" id="i1">11</td><td class="ctr1" id="j3">0</td><td class="ctr2" id="k1">1</td></tr><tr><td id="a0"><a href="BesselJ.java.html#L129" class="el_method">BesselJ(double)</a></td><td class="bar" id="b2"/><td class="ctr2" id="c3">0%</td><td class="bar" id="d2"/><td class="ctr2" id="e2">n/a</td><td class="ctr1" id="f2">1</td><td class="ctr2" id="g2">1</td><td class="ctr1" id="h1">3</td><td class="ctr2" id="i2">3</td><td class="ctr1" id="j0">1</td><td class="ctr2" id="k2">1</td></tr><tr><td id="a3"><a href="BesselJ.java.html#L144" class="el_method">value(double)</a></td><td class="bar" id
 ="b3"/><td class="ctr2" id="c4">0%</td><td class="bar" id="d3"/><td class="ctr2" id="e3">n/a</td><td class="ctr1" id="f3">1</td><td class="ctr2" id="g3">1</td><td class="ctr1" id="h3">1</td><td class="ctr2" id="i3">1</td><td class="ctr1" id="j1">1</td><td class="ctr2" id="k3">1</td></tr><tr><td id="a2"><a href="BesselJ.java.html#L112" class="el_method">static {...}</a></td><td class="bar" id="b4"><img src="../.resources/greenbar.gif" width="10" height="10" title="104" alt="104"/></td><td class="ctr2" id="c0">100%</td><td class="bar" id="d4"/><td class="ctr2" id="e4">n/a</td><td class="ctr1" id="f4">0</td><td class="ctr2" id="g4">1</td><td class="ctr1" id="h4">0</td><td class="ctr2" id="i4">1</td><td class="ctr1" id="j4">0</td><td class="ctr2" id="k4">1</td></tr></tbody></table><div class="footer"><span class="right">Created with <a href="http://www.eclemma.org/jacoco">JaCoCo</a> 0.7.0.201403182114</span></div></body></html>
\ No newline at end of file

Propchange: websites/production/commons/content/proper/commons-math/jacoco/org.apache.commons.math3.special/BesselJ.html
------------------------------------------------------------------------------
    svn:eol-style = native

Propchange: websites/production/commons/content/proper/commons-math/jacoco/org.apache.commons.math3.special/BesselJ.html
------------------------------------------------------------------------------
    svn:keywords = Author Date Id Revision

Added: websites/production/commons/content/proper/commons-math/jacoco/org.apache.commons.math3.special/BesselJ.java.html
==============================================================================
--- websites/production/commons/content/proper/commons-math/jacoco/org.apache.commons.math3.special/BesselJ.java.html (added)
+++ websites/production/commons/content/proper/commons-math/jacoco/org.apache.commons.math3.special/BesselJ.java.html Sun Jan 11 19:09:22 2015
@@ -0,0 +1,650 @@
+<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd"><html xmlns="http://www.w3.org/1999/xhtml" lang="en"><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8"/><link rel="stylesheet" href="../.resources/report.css" type="text/css"/><link rel="shortcut icon" href="../.resources/report.gif" type="image/gif"/><title>BesselJ.java</title><link rel="stylesheet" href="../.resources/prettify.css" type="text/css"/><script type="text/javascript" src="../.resources/prettify.js"></script></head><body onload="window['PR_TAB_WIDTH']=4;prettyPrint()"><div class="breadcrumb" id="breadcrumb"><span class="info"><a href="../.sessions.html" class="el_session">Sessions</a></span><a href="../index.html" class="el_report">Apache Commons Math</a> &gt; <a href="index.source.html" class="el_package">org.apache.commons.math3.special</a> &gt; <span class="el_source">BesselJ.java</span></div><h1>Bess
 elJ.java</h1><pre class="source lang-java linenums">/*
+ * Licensed to the Apache Software Foundation (ASF) under one or more
+ * contributor license agreements.  See the NOTICE file distributed with
+ * this work for additional information regarding copyright ownership.
+ * The ASF licenses this file to You under the Apache License, Version 2.0
+ * (the &quot;License&quot;); you may not use this file except in compliance with
+ * the License.  You may obtain a copy of the License at
+ *
+ *      http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an &quot;AS IS&quot; BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+package org.apache.commons.math3.special;
+
+import org.apache.commons.math3.analysis.UnivariateFunction;
+import org.apache.commons.math3.exception.ConvergenceException;
+import org.apache.commons.math3.exception.MathIllegalArgumentException;
+import org.apache.commons.math3.exception.util.LocalizedFormats;
+import org.apache.commons.math3.special.Gamma;
+import org.apache.commons.math3.util.FastMath;
+import org.apache.commons.math3.util.MathArrays;
+
+/**
+ * This class provides computation methods related to Bessel
+ * functions of the first kind. Detailed descriptions of these functions are
+ * available in &lt;a
+ * href=&quot;http://en.wikipedia.org/wiki/Bessel_function&quot;&gt;Wikipedia&lt;/a&gt;, &lt;a
+ * href=&quot;http://en.wikipedia.org/wiki/Abramowitz_and_Stegun&quot;&gt;Abrabowitz and
+ * Stegun&lt;/a&gt; (Ch. 9-11), and &lt;a href=&quot;http://dlmf.nist.gov/&quot;&gt;DLMF&lt;/a&gt; (Ch. 10).
+ * &lt;p&gt;
+ * This implementation is based on the rjbesl Fortran routine at
+ * &lt;a href=&quot;http://www.netlib.org/specfun/rjbesl&quot;&gt;Netlib&lt;/a&gt;.&lt;/p&gt;
+ * &lt;p&gt;
+ * From the Fortran code: &lt;/p&gt;
+ * &lt;p&gt;
+ * This program is based on a program written by David J. Sookne (2) that
+ * computes values of the Bessel functions J or I of real argument and integer
+ * order. Modifications include the restriction of the computation to the J
+ * Bessel function of non-negative real argument, the extension of the
+ * computation to arbitrary positive order, and the elimination of most
+ * underflow.&lt;/p&gt;
+ * &lt;p&gt;
+ * References:&lt;/p&gt;
+ * &lt;ul&gt;
+ * &lt;li&gt;&quot;A Note on Backward Recurrence Algorithms,&quot; Olver, F. W. J., and Sookne,
+ * D. J., Math. Comp. 26, 1972, pp 941-947.&lt;/li&gt;
+ * &lt;li&gt;&quot;Bessel Functions of Real Argument and Integer Order,&quot; Sookne, D. J., NBS
+ * Jour. of Res. B. 77B, 1973, pp 125-132.&lt;/li&gt;
+ * &lt;/ul&gt; &lt;/p&gt;
+ * @since 3.4
+ */
+public class BesselJ
+    implements UnivariateFunction {
+
+    // ---------------------------------------------------------------------
+    // Mathematical constants
+    // ---------------------------------------------------------------------
+
+    /** -2 / pi */
+    private static final double PI2 = 0.636619772367581343075535;
+
+    /** first few significant digits of 2pi */
+    private static final double TOWPI1 = 6.28125;
+
+    /** 2pi - TWOPI1 to working precision */
+    private static final double TWOPI2 = 1.935307179586476925286767e-3;
+
+    /** TOWPI1 + TWOPI2 */
+    private static final double TWOPI = TOWPI1 + TWOPI2;
+
+    // ---------------------------------------------------------------------
+    // Machine-dependent parameters
+    // ---------------------------------------------------------------------
+
+    /**
+     * 10.0^K, where K is the largest integer such that ENTEN is
+     * machine-representable in working precision
+     */
+    private static final double ENTEN = 1.0e308;
+
+    /**
+     * Decimal significance desired. Should be set to (INT(log_{10}(2) * (it)+1)).
+     * Setting NSIG lower will result in decreased accuracy while setting
+     * NSIG higher will increase CPU time without increasing accuracy.
+     * The truncation error is limited to a relative error of
+     * T=.5(10^(-NSIG)).
+     */
+    private static final double ENSIG = 1.0e16;
+
+    /** 10.0 ** (-K) for the smallest integer K such that K &gt;= NSIG/4 */
+    private static final double RTNSIG = 1.0e-4;
+
+    /** Smallest ABS(X) such that X/4 does not underflow */
+    private static final double ENMTEN = 8.90e-308;
+
+    /** Minimum acceptable value for x */
+    private static final double X_MIN = 0.0;
+
+    /**
+     * Upper limit on the magnitude of x. If abs(x) = n, then at least
+     * n iterations of the backward recursion will be executed. The value of
+     * 10.0 ** 4 is used on every machine.
+     */
+    private static final double X_MAX = 1.0e4;
+
+    /** First 25 factorials as doubles */
+<span class="fc" id="L112">    private static final double[] FACT = {</span>
+        1.0, 1.0, 2.0, 6.0, 24.0, 120.0, 720.0, 5040.0, 40320.0, 362880.0,
+        3628800.0, 39916800.0, 479001600.0, 6227020800.0, 87178291200.0,
+        1.307674368e12, 2.0922789888e13, 3.55687428096e14, 6.402373705728e15,
+        1.21645100408832e17, 2.43290200817664e18, 5.109094217170944e19,
+        1.12400072777760768e21, 2.585201673888497664e22,
+        6.2044840173323943936e23
+    };
+
+    /** Order of the function computed when {@link #value(double)} is used */
+    private final double order;
+
+    /**
+     * Create a new BesselJ with the given order.
+     *
+     * @param order order of the function computed when using {@link #value(double)}.
+     */
+<span class="nc" id="L129">    public BesselJ(double order) {</span>
+<span class="nc" id="L130">        this.order = order;</span>
+<span class="nc" id="L131">    }</span>
+
+    /**
+     * Returns the value of the constructed Bessel function of the first kind,
+     * for the passed argument.
+     *
+     * @param x Argument
+     * @return Value of the Bessel function at x
+     * @throws MathIllegalArgumentException if {@code x} is too large relative to {@code order}
+     * @throws ConvergenceException if the algorithm fails to converge
+     */
+    public double value(double x)
+        throws MathIllegalArgumentException, ConvergenceException {
+<span class="nc" id="L144">        return BesselJ.value(order, x);</span>
+    }
+
+    /**
+     * Returns the first Bessel function, \(J_{order}(x)\).
+     *
+     * @param order Order of the Bessel function
+     * @param x Argument
+     * @return Value of the Bessel function of the first kind, \(J_{order}(x)\)
+     * @throws MathIllegalArgumentException if {@code x} is too large relative to {@code order}
+     * @throws ConvergenceException if the algorithm fails to converge
+     */
+    public static double value(double order, double x)
+        throws MathIllegalArgumentException, ConvergenceException {
+<span class="fc" id="L158">        final int n = (int) order;</span>
+<span class="fc" id="L159">        final double alpha = order - n;</span>
+<span class="fc" id="L160">        final int nb = n + 1;</span>
+<span class="fc" id="L161">        final BesselJResult res = rjBesl(x, alpha, nb);</span>
+
+<span class="fc bfc" id="L163" title="All 2 branches covered.">        if (res.nVals &gt;= nb) {</span>
+<span class="fc" id="L164">            return res.vals[n];</span>
+<span class="fc bfc" id="L165" title="All 2 branches covered.">        } else if (res.nVals &lt; 0) {</span>
+<span class="fc" id="L166">            throw new MathIllegalArgumentException(LocalizedFormats.BESSEL_FUNCTION_BAD_ARGUMENT,order, x);</span>
+<span class="pc bpc" id="L167" title="1 of 2 branches missed.">        } else if (FastMath.abs(res.vals[res.nVals - 1]) &lt; 1e-100) {</span>
+<span class="fc" id="L168">            return res.vals[n]; // underflow; return value (will be zero)</span>
+        }
+<span class="nc" id="L170">        throw new ConvergenceException(LocalizedFormats.BESSEL_FUNCTION_FAILED_CONVERGENCE, order, x);</span>
+    }
+
+    /**
+     * Encapsulates the results returned by {@link BesselJ#rjBesl(double, double, int)}.
+     * &lt;p&gt;
+     * {@link #getVals()} returns the computed function values.
+     * {@link #getnVals()} is the number of values among those returned by {@link #getnVals()}
+     * that can be considered accurate.
+     * &lt;/p&gt;&lt;p&gt;
+     * &lt;ul&gt;
+     * &lt;li&gt;nVals &lt; 0: An argument is out of range. For example, nb &lt;= 0, alpha
+     * &lt; 0 or &gt; 1, or x is too large. In this case, b(0) is set to zero, the
+     * remainder of the b-vector is not calculated, and nVals is set to
+     * MIN(nb,0) - 1 so that nVals != nb.&lt;/li&gt;
+     * &lt;li&gt;nb &gt; nVals &gt; 0: Not all requested function values could be calculated
+     * accurately. This usually occurs because nb is much larger than abs(x). In
+     * this case, b(n) is calculated to the desired accuracy for n &lt; nVals, but
+     * precision is lost for nVals &lt; n &lt;= nb. If b(n) does not vanish for n &gt;
+     * nVals (because it is too small to be represented), and b(n)/b(nVals) =
+     * \(10^{-k}\), then only the first NSIG-k significant figures of b(n) can be
+     * trusted.&lt;/li&gt;&lt;/ul&gt;&lt;/p&gt;
+     */
+    public static class BesselJResult {
+
+        /** Bessel function values */
+        private final double[] vals;
+
+        /** Valid value count */
+        private final int nVals;
+
+        /**
+         * Create a new BesselJResult with the given values and valid value count.
+         *
+         * @param b values
+         * @param n count of valid values
+         */
+<span class="fc" id="L207">        public BesselJResult(double[] b, int n) {</span>
+<span class="fc" id="L208">            vals = MathArrays.copyOf(b, b.length);</span>
+<span class="fc" id="L209">            nVals = n;</span>
+<span class="fc" id="L210">        }</span>
+
+        /**
+         * @return the computed function values
+         */
+        public double[] getVals() {
+<span class="nc" id="L216">            return MathArrays.copyOf(vals, vals.length);</span>
+        }
+
+        /**
+         * @return the number of valid function values (normally the same as the
+         *         length of the array returned by {@link #getnVals()})
+         */
+        public int getnVals() {
+<span class="nc" id="L224">            return nVals;</span>
+        }
+    }
+
+    /**
+     * Calculates Bessel functions \(J_{n+alpha}(x)\) for
+     * non-negative argument x, and non-negative order n + alpha.
+     * &lt;p&gt;
+     * Before using the output vector, the user should check that
+     * nVals = nb, i.e., all orders have been calculated to the desired accuracy.
+     * See BesselResult class javadoc for details on return values.
+     * &lt;/p&gt;
+     * @param x non-negative real argument for which J's are to be calculated
+     * @param alpha fractional part of order for which J's or exponentially
+     * scaled J's (\(J\cdot e^{x}\)) are to be calculated. 0 &lt;= alpha &lt; 1.0.
+     * @param nb integer number of functions to be calculated, nb &gt; 0. The first
+     * function calculated is of order alpha, and the last is of order
+     * nb - 1 + alpha.
+     * @return BesselJResult a vector of the functions
+     * \(J_{alpha}(x)\) through \(J_{nb-1+alpha}(x)\), or the corresponding exponentially
+     * scaled functions and an integer output variable indicating possible errors
+     */
+    public static BesselJResult rjBesl(double x, double alpha, int nb) {
+<span class="fc" id="L247">        final double[] b = new double[nb];</span>
+
+<span class="fc" id="L249">        int ncalc = 0;</span>
+<span class="fc" id="L250">        double alpem = 0;</span>
+<span class="fc" id="L251">        double alp2em = 0;</span>
+
+        // ---------------------------------------------------------------------
+        // Check for out of range arguments.
+        // ---------------------------------------------------------------------
+<span class="fc" id="L256">        final int magx = (int) x;</span>
+<span class="pc bpc" id="L257" title="3 of 10 branches missed.">        if ((nb &gt; 0) &amp;&amp; (x &gt;= X_MIN) &amp;&amp; (x &lt;= X_MAX) &amp;&amp; (alpha &gt;= 0) &amp;&amp;</span>
+            (alpha &lt; 1)) {
+            // ---------------------------------------------------------------------
+            // Initialize result array to zero.
+            // ---------------------------------------------------------------------
+<span class="fc" id="L262">            ncalc = nb;</span>
+<span class="fc bfc" id="L263" title="All 2 branches covered.">            for (int i = 0; i &lt; nb; ++i) {</span>
+<span class="fc" id="L264">                b[i] = 0;</span>
+            }
+
+            // ---------------------------------------------------------------------
+            // Branch to use 2-term ascending series for small X and asymptotic
+            // form for large X when NB is not too large.
+            // ---------------------------------------------------------------------
+            double tempa;
+            double tempb;
+            double tempc;
+            double tover;
+<span class="fc bfc" id="L275" title="All 2 branches covered.">            if (x &lt; RTNSIG) {</span>
+                // ---------------------------------------------------------------------
+                // Two-term ascending series for small X.
+                // ---------------------------------------------------------------------
+<span class="fc" id="L279">                tempa = 1;</span>
+<span class="fc" id="L280">                alpem = 1 + alpha;</span>
+<span class="fc" id="L281">                double halfx = 0;</span>
+<span class="pc bpc" id="L282" title="1 of 2 branches missed.">                if (x &gt; ENMTEN) {</span>
+<span class="fc" id="L283">                    halfx = 0.5 * x;</span>
+                }
+<span class="pc bpc" id="L285" title="1 of 2 branches missed.">                if (alpha != 0) {</span>
+<span class="nc" id="L286">                    tempa = FastMath.pow(halfx, alpha) /</span>
+                            (alpha * Gamma.gamma(alpha));
+                }
+<span class="fc" id="L289">                tempb = 0;</span>
+<span class="pc bpc" id="L290" title="1 of 2 branches missed.">                if (x + 1 &gt; 1) {</span>
+<span class="fc" id="L291">                    tempb = -halfx * halfx;</span>
+                }
+<span class="fc" id="L293">                b[0] = tempa + (tempa * tempb / alpem);</span>
+<span class="pc bpc" id="L294" title="2 of 4 branches missed.">                if ((x != 0) &amp;&amp; (b[0] == 0)) {</span>
+<span class="nc" id="L295">                    ncalc = 0;</span>
+                }
+<span class="fc bfc" id="L297" title="All 2 branches covered.">                if (nb != 1) {</span>
+<span class="pc bpc" id="L298" title="1 of 2 branches missed.">                    if (x &lt;= 0) {</span>
+<span class="nc bnc" id="L299" title="All 2 branches missed.">                        for (int n = 1; n &lt; nb; ++n) {</span>
+<span class="nc" id="L300">                            b[n] = 0;</span>
+                        }
+                    } else {
+                        // ---------------------------------------------------------------------
+                        // Calculate higher order functions.
+                        // ---------------------------------------------------------------------
+<span class="fc" id="L306">                        tempc = halfx;</span>
+<span class="pc bpc" id="L307" title="1 of 2 branches missed.">                        tover = tempb != 0 ? ENMTEN / tempb :  2 * ENMTEN / x;</span>
+<span class="fc bfc" id="L308" title="All 2 branches covered.">                        for (int n = 1; n &lt; nb; ++n) {</span>
+<span class="fc" id="L309">                            tempa /= alpem;</span>
+<span class="fc" id="L310">                            alpem += 1;</span>
+<span class="fc" id="L311">                            tempa *= tempc;</span>
+<span class="pc bpc" id="L312" title="1 of 2 branches missed.">                            if (tempa &lt;= tover * alpem) {</span>
+<span class="nc" id="L313">                                tempa = 0;</span>
+                            }
+<span class="fc" id="L315">                            b[n] = tempa + (tempa * tempb / alpem);</span>
+<span class="fc bfc" id="L316" title="All 4 branches covered.">                            if ((b[n] == 0) &amp;&amp; (ncalc &gt; n)) {</span>
+<span class="fc" id="L317">                                ncalc = n;</span>
+                            }
+                        }
+                    }
+                }
+<span class="fc bfc" id="L322" title="All 4 branches covered.">            } else if ((x &gt; 25.0) &amp;&amp; (nb &lt;= magx + 1)) {</span>
+                // ---------------------------------------------------------------------
+                // Asymptotic series for X &gt; 25
+                // ---------------------------------------------------------------------
+<span class="fc" id="L326">                final double xc = FastMath.sqrt(PI2 / x);</span>
+<span class="fc" id="L327">                final double mul = 0.125 / x;</span>
+<span class="fc" id="L328">                final double xin = mul * mul;</span>
+<span class="fc" id="L329">                int m = 0;</span>
+<span class="fc bfc" id="L330" title="All 2 branches covered.">                if (x &gt;= 130.0) {</span>
+<span class="fc" id="L331">                    m = 4;</span>
+<span class="fc bfc" id="L332" title="All 2 branches covered.">                } else if (x &gt;= 35.0) {</span>
+<span class="fc" id="L333">                    m = 8;</span>
+                } else {
+<span class="fc" id="L335">                    m = 11;</span>
+                }
+
+<span class="fc" id="L338">                final double xm = 4.0 * m;</span>
+                // ---------------------------------------------------------------------
+                // Argument reduction for SIN and COS routines.
+                // ---------------------------------------------------------------------
+<span class="fc" id="L342">                double t = (double) ((int) ((x / TWOPI) + 0.5));</span>
+<span class="fc" id="L343">                final double z = x - t * TOWPI1 - t * TWOPI2 - (alpha + 0.5) / PI2;</span>
+<span class="fc" id="L344">                double vsin = FastMath.sin(z);</span>
+<span class="fc" id="L345">                double vcos = FastMath.cos(z);</span>
+<span class="fc" id="L346">                double gnu = 2 * alpha;</span>
+                double capq;
+                double capp;
+                double s;
+                double t1;
+                double xk;
+<span class="fc bfc" id="L352" title="All 2 branches covered.">                for (int i = 1; i &lt;= 2; i++) {</span>
+<span class="fc" id="L353">                    s = (xm - 1 - gnu) * (xm - 1 + gnu) * xin * 0.5;</span>
+<span class="fc" id="L354">                    t = (gnu - (xm - 3.0)) * (gnu + (xm - 3.0));</span>
+<span class="fc" id="L355">                    capp = (s * t) / FACT[2 * m];</span>
+<span class="fc" id="L356">                    t1 = (gnu - (xm + 1)) * (gnu + (xm + 1));</span>
+<span class="fc" id="L357">                    capq = (s * t1) / FACT[2 * m + 1];</span>
+<span class="fc" id="L358">                    xk = xm;</span>
+<span class="fc" id="L359">                    int k = 2 * m;</span>
+<span class="fc" id="L360">                    t1 = t;</span>
+
+<span class="fc bfc" id="L362" title="All 2 branches covered.">                    for (int j = 2; j &lt;= m; j++) {</span>
+<span class="fc" id="L363">                        xk -= 4.0;</span>
+<span class="fc" id="L364">                        s = (xk - 1 - gnu) * (xk - 1 + gnu);</span>
+<span class="fc" id="L365">                        t = (gnu - (xk - 3.0)) * (gnu + (xk - 3.0));</span>
+<span class="fc" id="L366">                        capp = (capp + 1 / FACT[k - 2]) * s * t * xin;</span>
+<span class="fc" id="L367">                        capq = (capq + 1 / FACT[k - 1]) * s * t1 * xin;</span>
+<span class="fc" id="L368">                        k -= 2;</span>
+<span class="fc" id="L369">                        t1 = t;</span>
+                    }
+
+<span class="fc" id="L372">                    capp += 1;</span>
+<span class="fc" id="L373">                    capq = (capq + 1) * ((gnu * gnu) - 1) * (0.125 / x);</span>
+<span class="fc" id="L374">                    b[i - 1] = xc * (capp * vcos - capq * vsin);</span>
+<span class="fc bfc" id="L375" title="All 2 branches covered.">                    if (nb == 1) {</span>
+<span class="fc" id="L376">                        return new BesselJResult(MathArrays.copyOf(b, b.length),</span>
+                                                 ncalc);
+                    }
+<span class="fc" id="L379">                    t = vsin;</span>
+<span class="fc" id="L380">                    vsin = -vcos;</span>
+<span class="fc" id="L381">                    vcos = t;</span>
+<span class="fc" id="L382">                    gnu += 2.0;</span>
+                }
+
+                // ---------------------------------------------------------------------
+                // If NB &gt; 2, compute J(X,ORDER+I) I = 2, NB-1
+                // ---------------------------------------------------------------------
+<span class="fc bfc" id="L388" title="All 2 branches covered.">                if (nb &gt; 2) {</span>
+<span class="fc" id="L389">                    gnu = 2 * alpha + 2.0;</span>
+<span class="fc bfc" id="L390" title="All 2 branches covered.">                    for (int j = 2; j &lt; nb; ++j) {</span>
+<span class="fc" id="L391">                        b[j] = gnu * b[j - 1] / x - b[j - 2];</span>
+<span class="fc" id="L392">                        gnu += 2.0;</span>
+                    }
+                }
+<span class="fc" id="L395">            } else {</span>
+                // ---------------------------------------------------------------------
+                // Use recurrence to generate results. First initialize the
+                // calculation of P*S.
+                // ---------------------------------------------------------------------
+<span class="fc" id="L400">                final int nbmx = nb - magx;</span>
+<span class="fc" id="L401">                int n = magx + 1;</span>
+<span class="fc" id="L402">                int nstart = 0;</span>
+<span class="fc" id="L403">                int nend = 0;</span>
+<span class="fc" id="L404">                double en = 2 * (n + alpha);</span>
+<span class="fc" id="L405">                double plast = 1;</span>
+<span class="fc" id="L406">                double p = en / x;</span>
+                double pold;
+                // ---------------------------------------------------------------------
+                // Calculate general significance test.
+                // ---------------------------------------------------------------------
+<span class="fc" id="L411">                double test = 2 * ENSIG;</span>
+<span class="fc" id="L412">                boolean readyToInitialize = false;</span>
+<span class="fc bfc" id="L413" title="All 2 branches covered.">                if (nbmx &gt;= 3) {</span>
+                    // ---------------------------------------------------------------------
+                    // Calculate P*S until N = NB-1. Check for possible
+                    // overflow.
+                    // ---------------------------------------------------------------------
+<span class="fc" id="L418">                    tover = ENTEN / ENSIG;</span>
+<span class="fc" id="L419">                    nstart = magx + 2;</span>
+<span class="fc" id="L420">                    nend = nb - 1;</span>
+<span class="fc" id="L421">                    en = 2 * (nstart - 1 + alpha);</span>
+                    double psave;
+                    double psavel;
+<span class="fc bfc" id="L424" title="All 2 branches covered.">                    for (int k = nstart; k &lt;= nend; k++) {</span>
+<span class="fc" id="L425">                        n = k;</span>
+<span class="fc" id="L426">                        en += 2.0;</span>
+<span class="fc" id="L427">                        pold = plast;</span>
+<span class="fc" id="L428">                        plast = p;</span>
+<span class="fc" id="L429">                        p = (en * plast / x) - pold;</span>
+<span class="fc bfc" id="L430" title="All 2 branches covered.">                        if (p &gt; tover) {</span>
+                            // ---------------------------------------------------------------------
+                            // To avoid overflow, divide P*S by TOVER. Calculate
+                            // P*S until
+                            // ABS(P) &gt; 1.
+                            // ---------------------------------------------------------------------
+<span class="fc" id="L436">                            tover = ENTEN;</span>
+<span class="fc" id="L437">                            p /= tover;</span>
+<span class="fc" id="L438">                            plast /= tover;</span>
+<span class="fc" id="L439">                            psave = p;</span>
+<span class="fc" id="L440">                            psavel = plast;</span>
+<span class="fc" id="L441">                            nstart = n + 1;</span>
+                            do {
+<span class="fc" id="L443">                                n += 1;</span>
+<span class="fc" id="L444">                                en += 2.0;</span>
+<span class="fc" id="L445">                                pold = plast;</span>
+<span class="fc" id="L446">                                plast = p;</span>
+<span class="fc" id="L447">                                p = (en * plast / x) - pold;</span>
+<span class="fc bfc" id="L448" title="All 2 branches covered.">                            } while (p &lt;= 1);</span>
+<span class="fc" id="L449">                            tempb = en / x;</span>
+                            // ---------------------------------------------------------------------
+                            // Calculate backward test and find NCALC, the
+                            // highest N such that
+                            // the test is passed.
+                            // ---------------------------------------------------------------------
+<span class="fc" id="L455">                            test = pold * plast * (0.5 - 0.5 / (tempb * tempb));</span>
+<span class="fc" id="L456">                            test /= ENSIG;</span>
+<span class="fc" id="L457">                            p = plast * tover;</span>
+<span class="fc" id="L458">                            n -= 1;</span>
+<span class="fc" id="L459">                            en -= 2.0;</span>
+<span class="fc" id="L460">                            nend = FastMath.min(nb, n);</span>
+<span class="pc bpc" id="L461" title="1 of 2 branches missed.">                            for (int l = nstart; l &lt;= nend; l++) {</span>
+<span class="fc" id="L462">                                pold = psavel;</span>
+<span class="fc" id="L463">                                psavel = psave;</span>
+<span class="fc" id="L464">                                psave = (en * psavel / x) - pold;</span>
+<span class="fc bfc" id="L465" title="All 2 branches covered.">                                if (psave * psavel &gt; test) {</span>
+<span class="fc" id="L466">                                    ncalc = l - 1;</span>
+<span class="fc" id="L467">                                    readyToInitialize = true;</span>
+<span class="fc" id="L468">                                    break;</span>
+                                }
+                            }
+<span class="fc" id="L471">                            ncalc = nend;</span>
+<span class="fc" id="L472">                            readyToInitialize = true;</span>
+<span class="fc" id="L473">                            break;</span>
+                        }
+                    }
+<span class="fc bfc" id="L476" title="All 2 branches covered.">                    if (!readyToInitialize) {</span>
+<span class="fc" id="L477">                        n = nend;</span>
+<span class="fc" id="L478">                        en = 2 * (n + alpha);</span>
+                        // ---------------------------------------------------------------------
+                        // Calculate special significance test for NBMX &gt; 2.
+                        // ---------------------------------------------------------------------
+<span class="fc" id="L482">                        test = FastMath.max(test, FastMath.sqrt(plast * ENSIG) *</span>
+                                                  FastMath.sqrt(2 * p));
+                    }
+                }
+                // ---------------------------------------------------------------------
+                // Calculate P*S until significance test passes.
+                // ---------------------------------------------------------------------
+<span class="fc bfc" id="L489" title="All 2 branches covered.">                if (!readyToInitialize) {</span>
+                    do {
+<span class="fc" id="L491">                        n += 1;</span>
+<span class="fc" id="L492">                        en += 2.0;</span>
+<span class="fc" id="L493">                        pold = plast;</span>
+<span class="fc" id="L494">                        plast = p;</span>
+<span class="fc" id="L495">                        p = (en * plast / x) - pold;</span>
+<span class="fc bfc" id="L496" title="All 2 branches covered.">                    } while (p &lt; test);</span>
+                }
+                // ---------------------------------------------------------------------
+                // Initialize the backward recursion and the normalization sum.
+                // ---------------------------------------------------------------------
+<span class="fc" id="L501">                n += 1;</span>
+<span class="fc" id="L502">                en += 2.0;</span>
+<span class="fc" id="L503">                tempb = 0;</span>
+<span class="fc" id="L504">                tempa = 1 / p;</span>
+<span class="fc" id="L505">                int m = (2 * n) - 4 * (n / 2);</span>
+<span class="fc" id="L506">                double sum = 0;</span>
+<span class="fc" id="L507">                double em = (double) (n / 2);</span>
+<span class="fc" id="L508">                alpem = em - 1 + alpha;</span>
+<span class="fc" id="L509">                alp2em = 2 * em + alpha;</span>
+<span class="fc bfc" id="L510" title="All 2 branches covered.">                if (m != 0) {</span>
+<span class="fc" id="L511">                    sum = tempa * alpem * alp2em / em;</span>
+                }
+<span class="fc" id="L513">                nend = n - nb;</span>
+
+<span class="fc" id="L515">                boolean readyToNormalize = false;</span>
+<span class="fc" id="L516">                boolean calculatedB0 = false;</span>
+
+                // ---------------------------------------------------------------------
+                // Recur backward via difference equation, calculating (but not
+                // storing) B(N), until N = NB.
+                // ---------------------------------------------------------------------
+<span class="fc bfc" id="L522" title="All 2 branches covered.">                for (int l = 1; l &lt;= nend; l++) {</span>
+<span class="fc" id="L523">                    n -= 1;</span>
+<span class="fc" id="L524">                    en -= 2.0;</span>
+<span class="fc" id="L525">                    tempc = tempb;</span>
+<span class="fc" id="L526">                    tempb = tempa;</span>
+<span class="fc" id="L527">                    tempa = (en * tempb / x) - tempc;</span>
+<span class="fc" id="L528">                    m = 2 - m;</span>
+<span class="fc bfc" id="L529" title="All 2 branches covered.">                    if (m != 0) {</span>
+<span class="fc" id="L530">                        em -= 1;</span>
+<span class="fc" id="L531">                        alp2em = 2 * em + alpha;</span>
+<span class="fc bfc" id="L532" title="All 2 branches covered.">                        if (n == 1) {</span>
+<span class="fc" id="L533">                            break;</span>
+                        }
+<span class="fc" id="L535">                        alpem = em - 1 + alpha;</span>
+<span class="fc bfc" id="L536" title="All 2 branches covered.">                        if (alpem == 0) {</span>
+<span class="fc" id="L537">                            alpem = 1;</span>
+                        }
+<span class="fc" id="L539">                        sum = (sum + tempa * alp2em) * alpem / em;</span>
+                    }
+                }
+
+                // ---------------------------------------------------------------------
+                // Store B(NB).
+                // ---------------------------------------------------------------------
+<span class="fc" id="L546">                b[n - 1] = tempa;</span>
+<span class="fc bfc" id="L547" title="All 2 branches covered.">                if (nend &gt;= 0) {</span>
+<span class="fc bfc" id="L548" title="All 2 branches covered.">                    if (nb &lt;= 1) {</span>
+<span class="fc" id="L549">                        alp2em = alpha;</span>
+<span class="pc bpc" id="L550" title="1 of 2 branches missed.">                        if (alpha + 1 == 1) {</span>
+<span class="fc" id="L551">                            alp2em = 1;</span>
+                        }
+<span class="fc" id="L553">                        sum += b[0] * alp2em;</span>
+<span class="fc" id="L554">                        readyToNormalize = true;</span>
+                    } else {
+                        // ---------------------------------------------------------------------
+                        // Calculate and store B(NB-1).
+                        // ---------------------------------------------------------------------
+<span class="fc" id="L559">                        n -= 1;</span>
+<span class="fc" id="L560">                        en -= 2.0;</span>
+<span class="fc" id="L561">                        b[n - 1] = (en * tempa / x) - tempb;</span>
+<span class="fc bfc" id="L562" title="All 2 branches covered.">                        if (n == 1) {</span>
+<span class="fc" id="L563">                            calculatedB0 = true;</span>
+                        } else {
+<span class="fc" id="L565">                            m = 2 - m;</span>
+<span class="fc bfc" id="L566" title="All 2 branches covered.">                            if (m != 0) {</span>
+<span class="fc" id="L567">                                em -= 1;</span>
+<span class="fc" id="L568">                                alp2em = 2 * em + alpha;</span>
+<span class="fc" id="L569">                                alpem = em - 1 + alpha;</span>
+<span class="fc bfc" id="L570" title="All 2 branches covered.">                                if (alpem == 0) {</span>
+<span class="fc" id="L571">                                    alpem = 1;</span>
+                                }
+
+<span class="fc" id="L574">                                sum = (sum + (b[n - 1] * alp2em)) * alpem / em;</span>
+                            }
+                        }
+                    }
+                }
+<span class="fc bfc" id="L579" title="All 4 branches covered.">                if (!readyToNormalize &amp;&amp; !calculatedB0) {</span>
+<span class="fc" id="L580">                    nend = n - 2;</span>
+<span class="fc bfc" id="L581" title="All 2 branches covered.">                    if (nend != 0) {</span>
+                        // ---------------------------------------------------------------------
+                        // Calculate via difference equation and store B(N),
+                        // until N = 2.
+                        // ---------------------------------------------------------------------
+
+<span class="fc bfc" id="L587" title="All 2 branches covered.">                        for (int l = 1; l &lt;= nend; l++) {</span>
+<span class="fc" id="L588">                            n -= 1;</span>
+<span class="fc" id="L589">                            en -= 2.0;</span>
+<span class="fc" id="L590">                            b[n - 1] = (en * b[n] / x) - b[n + 1];</span>
+<span class="fc" id="L591">                            m = 2 - m;</span>
+<span class="fc bfc" id="L592" title="All 2 branches covered.">                            if (m != 0) {</span>
+<span class="fc" id="L593">                                em -= 1;</span>
+<span class="fc" id="L594">                                alp2em = 2 * em + alpha;</span>
+<span class="fc" id="L595">                                alpem = em - 1 + alpha;</span>
+<span class="fc bfc" id="L596" title="All 2 branches covered.">                                if (alpem == 0) {</span>
+<span class="fc" id="L597">                                    alpem = 1;</span>
+                                }
+
+<span class="fc" id="L600">                                sum = (sum + b[n - 1] * alp2em) * alpem / em;</span>
+                            }
+                        }
+                    }
+                }
+                // ---------------------------------------------------------------------
+                // Calculate b[0]
+                // ---------------------------------------------------------------------
+<span class="fc bfc" id="L608" title="All 2 branches covered.">                if (!readyToNormalize) {</span>
+<span class="fc bfc" id="L609" title="All 2 branches covered.">                    if (!calculatedB0) {</span>
+<span class="fc" id="L610">                        b[0] = 2.0 * (alpha + 1) * b[1] / x - b[2];</span>
+                    }
+<span class="fc" id="L612">                    em -= 1;</span>
+<span class="fc" id="L613">                    alp2em = 2 * em + alpha;</span>
+<span class="pc bpc" id="L614" title="1 of 2 branches missed.">                    if (alp2em == 0) {</span>
+<span class="fc" id="L615">                        alp2em = 1;</span>
+                    }
+<span class="fc" id="L617">                    sum += b[0] * alp2em;</span>
+                }
+                // ---------------------------------------------------------------------
+                // Normalize. Divide all B(N) by sum.
+                // ---------------------------------------------------------------------
+
+<span class="pc bpc" id="L623" title="1 of 2 branches missed.">                if (FastMath.abs(alpha) &gt; 1e-16) {</span>
+<span class="nc" id="L624">                    sum *= Gamma.gamma(alpha) * FastMath.pow(x * 0.5, -alpha);</span>
+                }
+<span class="fc" id="L626">                tempa = ENMTEN;</span>
+<span class="pc bpc" id="L627" title="1 of 2 branches missed.">                if (sum &gt; 1) {</span>
+<span class="fc" id="L628">                    tempa *= sum;</span>
+                }
+
+<span class="fc bfc" id="L631" title="All 2 branches covered.">                for (n = 0; n &lt; nb; n++) {</span>
+<span class="fc bfc" id="L632" title="All 2 branches covered.">                    if (FastMath.abs(b[n]) &lt; tempa) {</span>
+<span class="fc" id="L633">                        b[n] = 0;</span>
+                    }
+<span class="fc" id="L635">                    b[n] /= sum;</span>
+                }
+            }
+            // ---------------------------------------------------------------------
+            // Error return -- X, NB, or ALPHA is out of range.
+            // ---------------------------------------------------------------------
+<span class="fc" id="L641">        } else {</span>
+<span class="fc bfc" id="L642" title="All 2 branches covered.">            if (b.length &gt; 0) {</span>
+<span class="fc" id="L643">                b[0] = 0;</span>
+            }
+<span class="fc" id="L645">            ncalc = FastMath.min(nb, 0) - 1;</span>
+        }
+<span class="fc" id="L647">        return new BesselJResult(MathArrays.copyOf(b, b.length), ncalc);</span>
+    }
+}
+</pre><div class="footer"><span class="right">Created with <a href="http://www.eclemma.org/jacoco">JaCoCo</a> 0.7.0.201403182114</span></div></body></html>
\ No newline at end of file

Propchange: websites/production/commons/content/proper/commons-math/jacoco/org.apache.commons.math3.special/BesselJ.java.html
------------------------------------------------------------------------------
    svn:eol-style = native

Propchange: websites/production/commons/content/proper/commons-math/jacoco/org.apache.commons.math3.special/BesselJ.java.html
------------------------------------------------------------------------------
    svn:keywords = Author Date Id Revision