| <!DOCTYPE html><html lang="en"><head><meta charset="utf-8"><meta name="viewport" content="width=device-width, initial-scale=1.0"><meta name="generator" content="rustdoc"><meta name="description" content="Source of the Rust file `/root/.cargo/registry/src/github.com-1ecc6299db9ec823/libm-0.2.7/src/math/jn.rs`."><meta name="keywords" content="rust, rustlang, rust-lang"><title>jn.rs - source</title><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../SourceSerif4-Regular.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../FiraSans-Regular.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../FiraSans-Medium.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../SourceCodePro-Regular.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../SourceSerif4-Bold.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../SourceCodePro-Semibold.ttf.woff2"><link rel="stylesheet" href="../../../normalize.css"><link rel="stylesheet" href="../../../rustdoc.css" id="mainThemeStyle"><link rel="stylesheet" href="../../../ayu.css" disabled><link rel="stylesheet" href="../../../dark.css" disabled><link rel="stylesheet" href="../../../light.css" id="themeStyle"><script id="default-settings" ></script><script src="../../../storage.js"></script><script defer src="../../../source-script.js"></script><script defer src="../../../source-files.js"></script><script defer src="../../../main.js"></script><noscript><link rel="stylesheet" href="../../../noscript.css"></noscript><link rel="alternate icon" type="image/png" href="../../../favicon-16x16.png"><link rel="alternate icon" type="image/png" href="../../../favicon-32x32.png"><link rel="icon" type="image/svg+xml" href="../../../favicon.svg"></head><body class="rustdoc source"><!--[if lte IE 11]><div class="warning">This old browser is unsupported and will most likely display funky things.</div><![endif]--><nav class="sidebar"><a class="sidebar-logo" href="../../../libm/index.html"><div class="logo-container"><img class="rust-logo" src="../../../rust-logo.svg" alt="logo"></div></a></nav><main><div class="width-limiter"><nav class="sub"><a class="sub-logo-container" href="../../../libm/index.html"><img class="rust-logo" src="../../../rust-logo.svg" alt="logo"></a><form class="search-form"><div class="search-container"><span></span><input class="search-input" name="search" autocomplete="off" spellcheck="false" placeholder="Click or press ‘S’ to search, ‘?’ for more options…" type="search"><div id="help-button" title="help" tabindex="-1"><a href="../../../help.html">?</a></div><div id="settings-menu" tabindex="-1"><a href="../../../settings.html" title="settings"><img width="22" height="22" alt="Change settings" src="../../../wheel.svg"></a></div></div></form></nav><section id="main-content" class="content"><div class="example-wrap"><pre class="src-line-numbers"><span id="1">1</span> |
| <span id="2">2</span> |
| <span id="3">3</span> |
| <span id="4">4</span> |
| <span id="5">5</span> |
| <span id="6">6</span> |
| <span id="7">7</span> |
| <span id="8">8</span> |
| <span id="9">9</span> |
| <span id="10">10</span> |
| <span id="11">11</span> |
| <span id="12">12</span> |
| <span id="13">13</span> |
| <span id="14">14</span> |
| <span id="15">15</span> |
| <span id="16">16</span> |
| <span id="17">17</span> |
| <span id="18">18</span> |
| <span id="19">19</span> |
| <span id="20">20</span> |
| <span id="21">21</span> |
| <span id="22">22</span> |
| <span id="23">23</span> |
| <span id="24">24</span> |
| <span id="25">25</span> |
| <span id="26">26</span> |
| <span id="27">27</span> |
| <span id="28">28</span> |
| <span id="29">29</span> |
| <span id="30">30</span> |
| <span id="31">31</span> |
| <span id="32">32</span> |
| <span id="33">33</span> |
| <span id="34">34</span> |
| <span id="35">35</span> |
| <span id="36">36</span> |
| <span id="37">37</span> |
| <span id="38">38</span> |
| <span id="39">39</span> |
| <span id="40">40</span> |
| <span id="41">41</span> |
| <span id="42">42</span> |
| <span id="43">43</span> |
| <span id="44">44</span> |
| <span id="45">45</span> |
| <span id="46">46</span> |
| <span id="47">47</span> |
| <span id="48">48</span> |
| <span id="49">49</span> |
| <span id="50">50</span> |
| <span id="51">51</span> |
| <span id="52">52</span> |
| <span id="53">53</span> |
| <span id="54">54</span> |
| <span id="55">55</span> |
| <span id="56">56</span> |
| <span id="57">57</span> |
| <span id="58">58</span> |
| <span id="59">59</span> |
| <span id="60">60</span> |
| <span id="61">61</span> |
| <span id="62">62</span> |
| <span id="63">63</span> |
| <span id="64">64</span> |
| <span id="65">65</span> |
| <span id="66">66</span> |
| <span id="67">67</span> |
| <span id="68">68</span> |
| <span id="69">69</span> |
| <span id="70">70</span> |
| <span id="71">71</span> |
| <span id="72">72</span> |
| <span id="73">73</span> |
| <span id="74">74</span> |
| <span id="75">75</span> |
| <span id="76">76</span> |
| <span id="77">77</span> |
| <span id="78">78</span> |
| <span id="79">79</span> |
| <span id="80">80</span> |
| <span id="81">81</span> |
| <span id="82">82</span> |
| <span id="83">83</span> |
| <span id="84">84</span> |
| <span id="85">85</span> |
| <span id="86">86</span> |
| <span id="87">87</span> |
| <span id="88">88</span> |
| <span id="89">89</span> |
| <span id="90">90</span> |
| <span id="91">91</span> |
| <span id="92">92</span> |
| <span id="93">93</span> |
| <span id="94">94</span> |
| <span id="95">95</span> |
| <span id="96">96</span> |
| <span id="97">97</span> |
| <span id="98">98</span> |
| <span id="99">99</span> |
| <span id="100">100</span> |
| <span id="101">101</span> |
| <span id="102">102</span> |
| <span id="103">103</span> |
| <span id="104">104</span> |
| <span id="105">105</span> |
| <span id="106">106</span> |
| <span id="107">107</span> |
| <span id="108">108</span> |
| <span id="109">109</span> |
| <span id="110">110</span> |
| <span id="111">111</span> |
| <span id="112">112</span> |
| <span id="113">113</span> |
| <span id="114">114</span> |
| <span id="115">115</span> |
| <span id="116">116</span> |
| <span id="117">117</span> |
| <span id="118">118</span> |
| <span id="119">119</span> |
| <span id="120">120</span> |
| <span id="121">121</span> |
| <span id="122">122</span> |
| <span id="123">123</span> |
| <span id="124">124</span> |
| <span id="125">125</span> |
| <span id="126">126</span> |
| <span id="127">127</span> |
| <span id="128">128</span> |
| <span id="129">129</span> |
| <span id="130">130</span> |
| <span id="131">131</span> |
| <span id="132">132</span> |
| <span id="133">133</span> |
| <span id="134">134</span> |
| <span id="135">135</span> |
| <span id="136">136</span> |
| <span id="137">137</span> |
| <span id="138">138</span> |
| <span id="139">139</span> |
| <span id="140">140</span> |
| <span id="141">141</span> |
| <span id="142">142</span> |
| <span id="143">143</span> |
| <span id="144">144</span> |
| <span id="145">145</span> |
| <span id="146">146</span> |
| <span id="147">147</span> |
| <span id="148">148</span> |
| <span id="149">149</span> |
| <span id="150">150</span> |
| <span id="151">151</span> |
| <span id="152">152</span> |
| <span id="153">153</span> |
| <span id="154">154</span> |
| <span id="155">155</span> |
| <span id="156">156</span> |
| <span id="157">157</span> |
| <span id="158">158</span> |
| <span id="159">159</span> |
| <span id="160">160</span> |
| <span id="161">161</span> |
| <span id="162">162</span> |
| <span id="163">163</span> |
| <span id="164">164</span> |
| <span id="165">165</span> |
| <span id="166">166</span> |
| <span id="167">167</span> |
| <span id="168">168</span> |
| <span id="169">169</span> |
| <span id="170">170</span> |
| <span id="171">171</span> |
| <span id="172">172</span> |
| <span id="173">173</span> |
| <span id="174">174</span> |
| <span id="175">175</span> |
| <span id="176">176</span> |
| <span id="177">177</span> |
| <span id="178">178</span> |
| <span id="179">179</span> |
| <span id="180">180</span> |
| <span id="181">181</span> |
| <span id="182">182</span> |
| <span id="183">183</span> |
| <span id="184">184</span> |
| <span id="185">185</span> |
| <span id="186">186</span> |
| <span id="187">187</span> |
| <span id="188">188</span> |
| <span id="189">189</span> |
| <span id="190">190</span> |
| <span id="191">191</span> |
| <span id="192">192</span> |
| <span id="193">193</span> |
| <span id="194">194</span> |
| <span id="195">195</span> |
| <span id="196">196</span> |
| <span id="197">197</span> |
| <span id="198">198</span> |
| <span id="199">199</span> |
| <span id="200">200</span> |
| <span id="201">201</span> |
| <span id="202">202</span> |
| <span id="203">203</span> |
| <span id="204">204</span> |
| <span id="205">205</span> |
| <span id="206">206</span> |
| <span id="207">207</span> |
| <span id="208">208</span> |
| <span id="209">209</span> |
| <span id="210">210</span> |
| <span id="211">211</span> |
| <span id="212">212</span> |
| <span id="213">213</span> |
| <span id="214">214</span> |
| <span id="215">215</span> |
| <span id="216">216</span> |
| <span id="217">217</span> |
| <span id="218">218</span> |
| <span id="219">219</span> |
| <span id="220">220</span> |
| <span id="221">221</span> |
| <span id="222">222</span> |
| <span id="223">223</span> |
| <span id="224">224</span> |
| <span id="225">225</span> |
| <span id="226">226</span> |
| <span id="227">227</span> |
| <span id="228">228</span> |
| <span id="229">229</span> |
| <span id="230">230</span> |
| <span id="231">231</span> |
| <span id="232">232</span> |
| <span id="233">233</span> |
| <span id="234">234</span> |
| <span id="235">235</span> |
| <span id="236">236</span> |
| <span id="237">237</span> |
| <span id="238">238</span> |
| <span id="239">239</span> |
| <span id="240">240</span> |
| <span id="241">241</span> |
| <span id="242">242</span> |
| <span id="243">243</span> |
| <span id="244">244</span> |
| <span id="245">245</span> |
| <span id="246">246</span> |
| <span id="247">247</span> |
| <span id="248">248</span> |
| <span id="249">249</span> |
| <span id="250">250</span> |
| <span id="251">251</span> |
| <span id="252">252</span> |
| <span id="253">253</span> |
| <span id="254">254</span> |
| <span id="255">255</span> |
| <span id="256">256</span> |
| <span id="257">257</span> |
| <span id="258">258</span> |
| <span id="259">259</span> |
| <span id="260">260</span> |
| <span id="261">261</span> |
| <span id="262">262</span> |
| <span id="263">263</span> |
| <span id="264">264</span> |
| <span id="265">265</span> |
| <span id="266">266</span> |
| <span id="267">267</span> |
| <span id="268">268</span> |
| <span id="269">269</span> |
| <span id="270">270</span> |
| <span id="271">271</span> |
| <span id="272">272</span> |
| <span id="273">273</span> |
| <span id="274">274</span> |
| <span id="275">275</span> |
| <span id="276">276</span> |
| <span id="277">277</span> |
| <span id="278">278</span> |
| <span id="279">279</span> |
| <span id="280">280</span> |
| <span id="281">281</span> |
| <span id="282">282</span> |
| <span id="283">283</span> |
| <span id="284">284</span> |
| <span id="285">285</span> |
| <span id="286">286</span> |
| <span id="287">287</span> |
| <span id="288">288</span> |
| <span id="289">289</span> |
| <span id="290">290</span> |
| <span id="291">291</span> |
| <span id="292">292</span> |
| <span id="293">293</span> |
| <span id="294">294</span> |
| <span id="295">295</span> |
| <span id="296">296</span> |
| <span id="297">297</span> |
| <span id="298">298</span> |
| <span id="299">299</span> |
| <span id="300">300</span> |
| <span id="301">301</span> |
| <span id="302">302</span> |
| <span id="303">303</span> |
| <span id="304">304</span> |
| <span id="305">305</span> |
| <span id="306">306</span> |
| <span id="307">307</span> |
| <span id="308">308</span> |
| <span id="309">309</span> |
| <span id="310">310</span> |
| <span id="311">311</span> |
| <span id="312">312</span> |
| <span id="313">313</span> |
| <span id="314">314</span> |
| <span id="315">315</span> |
| <span id="316">316</span> |
| <span id="317">317</span> |
| <span id="318">318</span> |
| <span id="319">319</span> |
| <span id="320">320</span> |
| <span id="321">321</span> |
| <span id="322">322</span> |
| <span id="323">323</span> |
| <span id="324">324</span> |
| <span id="325">325</span> |
| <span id="326">326</span> |
| <span id="327">327</span> |
| <span id="328">328</span> |
| <span id="329">329</span> |
| <span id="330">330</span> |
| <span id="331">331</span> |
| <span id="332">332</span> |
| <span id="333">333</span> |
| <span id="334">334</span> |
| <span id="335">335</span> |
| <span id="336">336</span> |
| <span id="337">337</span> |
| <span id="338">338</span> |
| <span id="339">339</span> |
| <span id="340">340</span> |
| <span id="341">341</span> |
| <span id="342">342</span> |
| <span id="343">343</span> |
| </pre><pre class="rust"><code><span class="comment">/* origin: FreeBSD /usr/src/lib/msun/src/e_jn.c */ |
| /* |
| * ==================================================== |
| * Copyright (C) 1993 by Sun Microsystems, Inc. All rights reserved. |
| * |
| * Developed at SunSoft, a Sun Microsystems, Inc. business. |
| * Permission to use, copy, modify, and distribute this |
| * software is freely granted, provided that this notice |
| * is preserved. |
| * ==================================================== |
| */ |
| /* |
| * jn(n, x), yn(n, x) |
| * floating point Bessel's function of the 1st and 2nd kind |
| * of order n |
| * |
| * Special cases: |
| * y0(0)=y1(0)=yn(n,0) = -inf with division by zero signal; |
| * y0(-ve)=y1(-ve)=yn(n,-ve) are NaN with invalid signal. |
| * Note 2. About jn(n,x), yn(n,x) |
| * For n=0, j0(x) is called, |
| * for n=1, j1(x) is called, |
| * for n<=x, forward recursion is used starting |
| * from values of j0(x) and j1(x). |
| * for n>x, a continued fraction approximation to |
| * j(n,x)/j(n-1,x) is evaluated and then backward |
| * recursion is used starting from a supposed value |
| * for j(n,x). The resulting value of j(0,x) is |
| * compared with the actual value to correct the |
| * supposed value of j(n,x). |
| * |
| * yn(n,x) is similar in all respects, except |
| * that forward recursion is used for all |
| * values of n>1. |
| */ |
| |
| </span><span class="kw">use super</span>::{cos, fabs, get_high_word, get_low_word, j0, j1, log, sin, sqrt, y0, y1}; |
| |
| <span class="kw">const </span>INVSQRTPI: f64 = <span class="number">5.64189583547756279280e-01</span>; <span class="comment">/* 0x3FE20DD7, 0x50429B6D */ |
| |
| </span><span class="kw">pub fn </span>jn(n: i32, <span class="kw-2">mut </span>x: f64) -> f64 { |
| <span class="kw">let </span><span class="kw-2">mut </span>ix: u32; |
| <span class="kw">let </span>lx: u32; |
| <span class="kw">let </span>nm1: i32; |
| <span class="kw">let </span><span class="kw-2">mut </span>i: i32; |
| <span class="kw">let </span><span class="kw-2">mut </span>sign: bool; |
| <span class="kw">let </span><span class="kw-2">mut </span>a: f64; |
| <span class="kw">let </span><span class="kw-2">mut </span>b: f64; |
| <span class="kw">let </span><span class="kw-2">mut </span>temp: f64; |
| |
| ix = get_high_word(x); |
| lx = get_low_word(x); |
| sign = (ix >> <span class="number">31</span>) != <span class="number">0</span>; |
| ix &= <span class="number">0x7fffffff</span>; |
| |
| <span class="comment">// -lx == !lx + 1 |
| </span><span class="kw">if </span>(ix | (lx | ((!lx).wrapping_add(<span class="number">1</span>))) >> <span class="number">31</span>) > <span class="number">0x7ff00000 </span>{ |
| <span class="comment">/* nan */ |
| </span><span class="kw">return </span>x; |
| } |
| |
| <span class="comment">/* J(-n,x) = (-1)^n * J(n, x), J(n, -x) = (-1)^n * J(n, x) |
| * Thus, J(-n,x) = J(n,-x) |
| */ |
| /* nm1 = |n|-1 is used instead of |n| to handle n==INT_MIN */ |
| </span><span class="kw">if </span>n == <span class="number">0 </span>{ |
| <span class="kw">return </span>j0(x); |
| } |
| <span class="kw">if </span>n < <span class="number">0 </span>{ |
| nm1 = -(n + <span class="number">1</span>); |
| x = -x; |
| sign = !sign; |
| } <span class="kw">else </span>{ |
| nm1 = n - <span class="number">1</span>; |
| } |
| <span class="kw">if </span>nm1 == <span class="number">0 </span>{ |
| <span class="kw">return </span>j1(x); |
| } |
| |
| sign &= (n & <span class="number">1</span>) != <span class="number">0</span>; <span class="comment">/* even n: 0, odd n: signbit(x) */ |
| </span>x = fabs(x); |
| <span class="kw">if </span>(ix | lx) == <span class="number">0 </span>|| ix == <span class="number">0x7ff00000 </span>{ |
| <span class="comment">/* if x is 0 or inf */ |
| </span>b = <span class="number">0.0</span>; |
| } <span class="kw">else if </span>(nm1 <span class="kw">as </span>f64) < x { |
| <span class="comment">/* Safe to use J(n+1,x)=2n/x *J(n,x)-J(n-1,x) */ |
| </span><span class="kw">if </span>ix >= <span class="number">0x52d00000 </span>{ |
| <span class="comment">/* x > 2**302 */ |
| /* (x >> n**2) |
| * Jn(x) = cos(x-(2n+1)*pi/4)*sqrt(2/x*pi) |
| * Yn(x) = sin(x-(2n+1)*pi/4)*sqrt(2/x*pi) |
| * Let s=sin(x), c=cos(x), |
| * xn=x-(2n+1)*pi/4, sqt2 = sqrt(2),then |
| * |
| * n sin(xn)*sqt2 cos(xn)*sqt2 |
| * ---------------------------------- |
| * 0 s-c c+s |
| * 1 -s-c -c+s |
| * 2 -s+c -c-s |
| * 3 s+c c-s |
| */ |
| </span>temp = <span class="kw">match </span>nm1 & <span class="number">3 </span>{ |
| <span class="number">0 </span>=> -cos(x) + sin(x), |
| <span class="number">1 </span>=> -cos(x) - sin(x), |
| <span class="number">2 </span>=> cos(x) - sin(x), |
| <span class="number">3 </span>| <span class="kw">_ </span>=> cos(x) + sin(x), |
| }; |
| b = INVSQRTPI * temp / sqrt(x); |
| } <span class="kw">else </span>{ |
| a = j0(x); |
| b = j1(x); |
| i = <span class="number">0</span>; |
| <span class="kw">while </span>i < nm1 { |
| i += <span class="number">1</span>; |
| temp = b; |
| b = b * (<span class="number">2.0 </span>* (i <span class="kw">as </span>f64) / x) - a; <span class="comment">/* avoid underflow */ |
| </span>a = temp; |
| } |
| } |
| } <span class="kw">else </span>{ |
| <span class="kw">if </span>ix < <span class="number">0x3e100000 </span>{ |
| <span class="comment">/* x < 2**-29 */ |
| /* x is tiny, return the first Taylor expansion of J(n,x) |
| * J(n,x) = 1/n!*(x/2)^n - ... |
| */ |
| </span><span class="kw">if </span>nm1 > <span class="number">32 </span>{ |
| <span class="comment">/* underflow */ |
| </span>b = <span class="number">0.0</span>; |
| } <span class="kw">else </span>{ |
| temp = x * <span class="number">0.5</span>; |
| b = temp; |
| a = <span class="number">1.0</span>; |
| i = <span class="number">2</span>; |
| <span class="kw">while </span>i <= nm1 + <span class="number">1 </span>{ |
| a <span class="kw-2">*</span>= i <span class="kw">as </span>f64; <span class="comment">/* a = n! */ |
| </span>b <span class="kw-2">*</span>= temp; <span class="comment">/* b = (x/2)^n */ |
| </span>i += <span class="number">1</span>; |
| } |
| b = b / a; |
| } |
| } <span class="kw">else </span>{ |
| <span class="comment">/* use backward recurrence */ |
| /* x x^2 x^2 |
| * J(n,x)/J(n-1,x) = ---- ------ ------ ..... |
| * 2n - 2(n+1) - 2(n+2) |
| * |
| * 1 1 1 |
| * (for large x) = ---- ------ ------ ..... |
| * 2n 2(n+1) 2(n+2) |
| * -- - ------ - ------ - |
| * x x x |
| * |
| * Let w = 2n/x and h=2/x, then the above quotient |
| * is equal to the continued fraction: |
| * 1 |
| * = ----------------------- |
| * 1 |
| * w - ----------------- |
| * 1 |
| * w+h - --------- |
| * w+2h - ... |
| * |
| * To determine how many terms needed, let |
| * Q(0) = w, Q(1) = w(w+h) - 1, |
| * Q(k) = (w+k*h)*Q(k-1) - Q(k-2), |
| * When Q(k) > 1e4 good for single |
| * When Q(k) > 1e9 good for double |
| * When Q(k) > 1e17 good for quadruple |
| */ |
| /* determine k */ |
| </span><span class="kw">let </span><span class="kw-2">mut </span>t: f64; |
| <span class="kw">let </span><span class="kw-2">mut </span>q0: f64; |
| <span class="kw">let </span><span class="kw-2">mut </span>q1: f64; |
| <span class="kw">let </span><span class="kw-2">mut </span>w: f64; |
| <span class="kw">let </span>h: f64; |
| <span class="kw">let </span><span class="kw-2">mut </span>z: f64; |
| <span class="kw">let </span><span class="kw-2">mut </span>tmp: f64; |
| <span class="kw">let </span>nf: f64; |
| |
| <span class="kw">let </span><span class="kw-2">mut </span>k: i32; |
| |
| nf = (nm1 <span class="kw">as </span>f64) + <span class="number">1.0</span>; |
| w = <span class="number">2.0 </span>* nf / x; |
| h = <span class="number">2.0 </span>/ x; |
| z = w + h; |
| q0 = w; |
| q1 = w * z - <span class="number">1.0</span>; |
| k = <span class="number">1</span>; |
| <span class="kw">while </span>q1 < <span class="number">1.0e9 </span>{ |
| k += <span class="number">1</span>; |
| z += h; |
| tmp = z * q1 - q0; |
| q0 = q1; |
| q1 = tmp; |
| } |
| t = <span class="number">0.0</span>; |
| i = k; |
| <span class="kw">while </span>i >= <span class="number">0 </span>{ |
| t = <span class="number">1.0 </span>/ (<span class="number">2.0 </span>* ((i <span class="kw">as </span>f64) + nf) / x - t); |
| i -= <span class="number">1</span>; |
| } |
| a = t; |
| b = <span class="number">1.0</span>; |
| <span class="comment">/* estimate log((2/x)^n*n!) = n*log(2/x)+n*ln(n) |
| * Hence, if n*(log(2n/x)) > ... |
| * single 8.8722839355e+01 |
| * double 7.09782712893383973096e+02 |
| * long double 1.1356523406294143949491931077970765006170e+04 |
| * then recurrent value may overflow and the result is |
| * likely underflow to zero |
| */ |
| </span>tmp = nf * log(fabs(w)); |
| <span class="kw">if </span>tmp < <span class="number">7.09782712893383973096e+02 </span>{ |
| i = nm1; |
| <span class="kw">while </span>i > <span class="number">0 </span>{ |
| temp = b; |
| b = b * (<span class="number">2.0 </span>* (i <span class="kw">as </span>f64)) / x - a; |
| a = temp; |
| i -= <span class="number">1</span>; |
| } |
| } <span class="kw">else </span>{ |
| i = nm1; |
| <span class="kw">while </span>i > <span class="number">0 </span>{ |
| temp = b; |
| b = b * (<span class="number">2.0 </span>* (i <span class="kw">as </span>f64)) / x - a; |
| a = temp; |
| <span class="comment">/* scale b to avoid spurious overflow */ |
| </span><span class="kw">let </span>x1p500 = f64::from_bits(<span class="number">0x5f30000000000000</span>); <span class="comment">// 0x1p500 == 2^500 |
| </span><span class="kw">if </span>b > x1p500 { |
| a /= b; |
| t /= b; |
| b = <span class="number">1.0</span>; |
| } |
| i -= <span class="number">1</span>; |
| } |
| } |
| z = j0(x); |
| w = j1(x); |
| <span class="kw">if </span>fabs(z) >= fabs(w) { |
| b = t * z / b; |
| } <span class="kw">else </span>{ |
| b = t * w / a; |
| } |
| } |
| } |
| |
| <span class="kw">if </span>sign { |
| -b |
| } <span class="kw">else </span>{ |
| b |
| } |
| } |
| |
| <span class="kw">pub fn </span>yn(n: i32, x: f64) -> f64 { |
| <span class="kw">let </span><span class="kw-2">mut </span>ix: u32; |
| <span class="kw">let </span>lx: u32; |
| <span class="kw">let </span><span class="kw-2">mut </span>ib: u32; |
| <span class="kw">let </span>nm1: i32; |
| <span class="kw">let </span><span class="kw-2">mut </span>sign: bool; |
| <span class="kw">let </span><span class="kw-2">mut </span>i: i32; |
| <span class="kw">let </span><span class="kw-2">mut </span>a: f64; |
| <span class="kw">let </span><span class="kw-2">mut </span>b: f64; |
| <span class="kw">let </span><span class="kw-2">mut </span>temp: f64; |
| |
| ix = get_high_word(x); |
| lx = get_low_word(x); |
| sign = (ix >> <span class="number">31</span>) != <span class="number">0</span>; |
| ix &= <span class="number">0x7fffffff</span>; |
| |
| <span class="comment">// -lx == !lx + 1 |
| </span><span class="kw">if </span>(ix | (lx | ((!lx).wrapping_add(<span class="number">1</span>))) >> <span class="number">31</span>) > <span class="number">0x7ff00000 </span>{ |
| <span class="comment">/* nan */ |
| </span><span class="kw">return </span>x; |
| } |
| <span class="kw">if </span>sign && (ix | lx) != <span class="number">0 </span>{ |
| <span class="comment">/* x < 0 */ |
| </span><span class="kw">return </span><span class="number">0.0 </span>/ <span class="number">0.0</span>; |
| } |
| <span class="kw">if </span>ix == <span class="number">0x7ff00000 </span>{ |
| <span class="kw">return </span><span class="number">0.0</span>; |
| } |
| |
| <span class="kw">if </span>n == <span class="number">0 </span>{ |
| <span class="kw">return </span>y0(x); |
| } |
| <span class="kw">if </span>n < <span class="number">0 </span>{ |
| nm1 = -(n + <span class="number">1</span>); |
| sign = (n & <span class="number">1</span>) != <span class="number">0</span>; |
| } <span class="kw">else </span>{ |
| nm1 = n - <span class="number">1</span>; |
| sign = <span class="bool-val">false</span>; |
| } |
| <span class="kw">if </span>nm1 == <span class="number">0 </span>{ |
| <span class="kw">if </span>sign { |
| <span class="kw">return </span>-y1(x); |
| } <span class="kw">else </span>{ |
| <span class="kw">return </span>y1(x); |
| } |
| } |
| |
| <span class="kw">if </span>ix >= <span class="number">0x52d00000 </span>{ |
| <span class="comment">/* x > 2**302 */ |
| /* (x >> n**2) |
| * Jn(x) = cos(x-(2n+1)*pi/4)*sqrt(2/x*pi) |
| * Yn(x) = sin(x-(2n+1)*pi/4)*sqrt(2/x*pi) |
| * Let s=sin(x), c=cos(x), |
| * xn=x-(2n+1)*pi/4, sqt2 = sqrt(2),then |
| * |
| * n sin(xn)*sqt2 cos(xn)*sqt2 |
| * ---------------------------------- |
| * 0 s-c c+s |
| * 1 -s-c -c+s |
| * 2 -s+c -c-s |
| * 3 s+c c-s |
| */ |
| </span>temp = <span class="kw">match </span>nm1 & <span class="number">3 </span>{ |
| <span class="number">0 </span>=> -sin(x) - cos(x), |
| <span class="number">1 </span>=> -sin(x) + cos(x), |
| <span class="number">2 </span>=> sin(x) + cos(x), |
| <span class="number">3 </span>| <span class="kw">_ </span>=> sin(x) - cos(x), |
| }; |
| b = INVSQRTPI * temp / sqrt(x); |
| } <span class="kw">else </span>{ |
| a = y0(x); |
| b = y1(x); |
| <span class="comment">/* quit if b is -inf */ |
| </span>ib = get_high_word(b); |
| i = <span class="number">0</span>; |
| <span class="kw">while </span>i < nm1 && ib != <span class="number">0xfff00000 </span>{ |
| i += <span class="number">1</span>; |
| temp = b; |
| b = (<span class="number">2.0 </span>* (i <span class="kw">as </span>f64) / x) * b - a; |
| ib = get_high_word(b); |
| a = temp; |
| } |
| } |
| |
| <span class="kw">if </span>sign { |
| -b |
| } <span class="kw">else </span>{ |
| b |
| } |
| } |
| </code></pre></div> |
| </section></div></main><div id="rustdoc-vars" data-root-path="../../../" data-current-crate="libm" data-themes="ayu,dark,light" data-resource-suffix="" data-rustdoc-version="1.66.0-nightly (5c8bff74b 2022-10-21)" ></div></body></html> |