<!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 `/Users/erlendbasso/.cargo/registry/src/github.com-1ecc6299db9ec823/libm-0.2.6/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="../../../static.files/SourceSerif4-Regular-1f7d512b176f0f72.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/FiraSans-Regular-018c141bf0843ffd.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/FiraSans-Medium-8f9a781e4970d388.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceCodePro-Regular-562dcc5011b6de7d.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceSerif4-Bold-124a1ca42af929b6.ttf.woff2"><link rel="preload" as="font" type="font/woff2" crossorigin href="../../../static.files/SourceCodePro-Semibold-d899c5a5c4aeb14a.ttf.woff2"><link rel="stylesheet" href="../../../static.files/normalize-76eba96aa4d2e634.css"><link rel="stylesheet" href="../../../static.files/rustdoc-6827029ac823cab7.css" id="mainThemeStyle"><link rel="stylesheet" id="themeStyle" href="../../../static.files/light-ebce58d0a40c3431.css"><link rel="stylesheet" disabled href="../../../static.files/dark-f23faae4a2daf9a6.css"><link rel="stylesheet" disabled href="../../../static.files/ayu-8af5e100b21cd173.css"><script id="default-settings" ></script><script src="../../../static.files/storage-d43fa987303ecbbb.js"></script><script defer src="../../../static.files/source-script-5cf2e01a42cc9858.js"></script><script defer src="../../../source-files.js"></script><script defer src="../../../static.files/main-c55e1eb52e1886b4.js"></script><noscript><link rel="stylesheet" href="../../../static.files/noscript-13285aec31fa243e.css"></noscript><link rel="alternate icon" type="image/png" href="../../../static.files/favicon-16x16-8b506e7a72182f1c.png"><link rel="alternate icon" type="image/png" href="../../../static.files/favicon-32x32-422f7d1d52889060.png"><link rel="icon" type="image/svg+xml" href="../../../static.files/favicon-2c020d218678b618.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"></nav><main><div class="width-limiter"><nav class="sub"><a class="sub-logo-container" href="../../../libm/index.html"><img class="rust-logo" src="../../../static.files/rust-logo-151179464ae7ed46.svg" alt="logo"></a><form class="search-form"><span></span><input class="search-input" name="search" aria-label="Run search in the documentation" 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="../../../static.files/wheel-5ec35bf9ca753509.svg"></a></div></form></nav><section id="main-content" class="content"><div class="example-wrap"><pre class="src-line-numbers"><a href="#1" id="1">1</a>
<a href="#2" id="2">2</a>
<a href="#3" id="3">3</a>
<a href="#4" id="4">4</a>
<a href="#5" id="5">5</a>
<a href="#6" id="6">6</a>
<a href="#7" id="7">7</a>
<a href="#8" id="8">8</a>
<a href="#9" id="9">9</a>
<a href="#10" id="10">10</a>
<a href="#11" id="11">11</a>
<a href="#12" id="12">12</a>
<a href="#13" id="13">13</a>
<a href="#14" id="14">14</a>
<a href="#15" id="15">15</a>
<a href="#16" id="16">16</a>
<a href="#17" id="17">17</a>
<a href="#18" id="18">18</a>
<a href="#19" id="19">19</a>
<a href="#20" id="20">20</a>
<a href="#21" id="21">21</a>
<a href="#22" id="22">22</a>
<a href="#23" id="23">23</a>
<a href="#24" id="24">24</a>
<a href="#25" id="25">25</a>
<a href="#26" id="26">26</a>
<a href="#27" id="27">27</a>
<a href="#28" id="28">28</a>
<a href="#29" id="29">29</a>
<a href="#30" id="30">30</a>
<a href="#31" id="31">31</a>
<a href="#32" id="32">32</a>
<a href="#33" id="33">33</a>
<a href="#34" id="34">34</a>
<a href="#35" id="35">35</a>
<a href="#36" id="36">36</a>
<a href="#37" id="37">37</a>
<a href="#38" id="38">38</a>
<a href="#39" id="39">39</a>
<a href="#40" id="40">40</a>
<a href="#41" id="41">41</a>
<a href="#42" id="42">42</a>
<a href="#43" id="43">43</a>
<a href="#44" id="44">44</a>
<a href="#45" id="45">45</a>
<a href="#46" id="46">46</a>
<a href="#47" id="47">47</a>
<a href="#48" id="48">48</a>
<a href="#49" id="49">49</a>
<a href="#50" id="50">50</a>
<a href="#51" id="51">51</a>
<a href="#52" id="52">52</a>
<a href="#53" id="53">53</a>
<a href="#54" id="54">54</a>
<a href="#55" id="55">55</a>
<a href="#56" id="56">56</a>
<a href="#57" id="57">57</a>
<a href="#58" id="58">58</a>
<a href="#59" id="59">59</a>
<a href="#60" id="60">60</a>
<a href="#61" id="61">61</a>
<a href="#62" id="62">62</a>
<a href="#63" id="63">63</a>
<a href="#64" id="64">64</a>
<a href="#65" id="65">65</a>
<a href="#66" id="66">66</a>
<a href="#67" id="67">67</a>
<a href="#68" id="68">68</a>
<a href="#69" id="69">69</a>
<a href="#70" id="70">70</a>
<a href="#71" id="71">71</a>
<a href="#72" id="72">72</a>
<a href="#73" id="73">73</a>
<a href="#74" id="74">74</a>
<a href="#75" id="75">75</a>
<a href="#76" id="76">76</a>
<a href="#77" id="77">77</a>
<a href="#78" id="78">78</a>
<a href="#79" id="79">79</a>
<a href="#80" id="80">80</a>
<a href="#81" id="81">81</a>
<a href="#82" id="82">82</a>
<a href="#83" id="83">83</a>
<a href="#84" id="84">84</a>
<a href="#85" id="85">85</a>
<a href="#86" id="86">86</a>
<a href="#87" id="87">87</a>
<a href="#88" id="88">88</a>
<a href="#89" id="89">89</a>
<a href="#90" id="90">90</a>
<a href="#91" id="91">91</a>
<a href="#92" id="92">92</a>
<a href="#93" id="93">93</a>
<a href="#94" id="94">94</a>
<a href="#95" id="95">95</a>
<a href="#96" id="96">96</a>
<a href="#97" id="97">97</a>
<a href="#98" id="98">98</a>
<a href="#99" id="99">99</a>
<a href="#100" id="100">100</a>
<a href="#101" id="101">101</a>
<a href="#102" id="102">102</a>
<a href="#103" id="103">103</a>
<a href="#104" id="104">104</a>
<a href="#105" id="105">105</a>
<a href="#106" id="106">106</a>
<a href="#107" id="107">107</a>
<a href="#108" id="108">108</a>
<a href="#109" id="109">109</a>
<a href="#110" id="110">110</a>
<a href="#111" id="111">111</a>
<a href="#112" id="112">112</a>
<a href="#113" id="113">113</a>
<a href="#114" id="114">114</a>
<a href="#115" id="115">115</a>
<a href="#116" id="116">116</a>
<a href="#117" id="117">117</a>
<a href="#118" id="118">118</a>
<a href="#119" id="119">119</a>
<a href="#120" id="120">120</a>
<a href="#121" id="121">121</a>
<a href="#122" id="122">122</a>
<a href="#123" id="123">123</a>
<a href="#124" id="124">124</a>
<a href="#125" id="125">125</a>
<a href="#126" id="126">126</a>
<a href="#127" id="127">127</a>
<a href="#128" id="128">128</a>
<a href="#129" id="129">129</a>
<a href="#130" id="130">130</a>
<a href="#131" id="131">131</a>
<a href="#132" id="132">132</a>
<a href="#133" id="133">133</a>
<a href="#134" id="134">134</a>
<a href="#135" id="135">135</a>
<a href="#136" id="136">136</a>
<a href="#137" id="137">137</a>
<a href="#138" id="138">138</a>
<a href="#139" id="139">139</a>
<a href="#140" id="140">140</a>
<a href="#141" id="141">141</a>
<a href="#142" id="142">142</a>
<a href="#143" id="143">143</a>
<a href="#144" id="144">144</a>
<a href="#145" id="145">145</a>
<a href="#146" id="146">146</a>
<a href="#147" id="147">147</a>
<a href="#148" id="148">148</a>
<a href="#149" id="149">149</a>
<a href="#150" id="150">150</a>
<a href="#151" id="151">151</a>
<a href="#152" id="152">152</a>
<a href="#153" id="153">153</a>
<a href="#154" id="154">154</a>
<a href="#155" id="155">155</a>
<a href="#156" id="156">156</a>
<a href="#157" id="157">157</a>
<a href="#158" id="158">158</a>
<a href="#159" id="159">159</a>
<a href="#160" id="160">160</a>
<a href="#161" id="161">161</a>
<a href="#162" id="162">162</a>
<a href="#163" id="163">163</a>
<a href="#164" id="164">164</a>
<a href="#165" id="165">165</a>
<a href="#166" id="166">166</a>
<a href="#167" id="167">167</a>
<a href="#168" id="168">168</a>
<a href="#169" id="169">169</a>
<a href="#170" id="170">170</a>
<a href="#171" id="171">171</a>
<a href="#172" id="172">172</a>
<a href="#173" id="173">173</a>
<a href="#174" id="174">174</a>
<a href="#175" id="175">175</a>
<a href="#176" id="176">176</a>
<a href="#177" id="177">177</a>
<a href="#178" id="178">178</a>
<a href="#179" id="179">179</a>
<a href="#180" id="180">180</a>
<a href="#181" id="181">181</a>
<a href="#182" id="182">182</a>
<a href="#183" id="183">183</a>
<a href="#184" id="184">184</a>
<a href="#185" id="185">185</a>
<a href="#186" id="186">186</a>
<a href="#187" id="187">187</a>
<a href="#188" id="188">188</a>
<a href="#189" id="189">189</a>
<a href="#190" id="190">190</a>
<a href="#191" id="191">191</a>
<a href="#192" id="192">192</a>
<a href="#193" id="193">193</a>
<a href="#194" id="194">194</a>
<a href="#195" id="195">195</a>
<a href="#196" id="196">196</a>
<a href="#197" id="197">197</a>
<a href="#198" id="198">198</a>
<a href="#199" id="199">199</a>
<a href="#200" id="200">200</a>
<a href="#201" id="201">201</a>
<a href="#202" id="202">202</a>
<a href="#203" id="203">203</a>
<a href="#204" id="204">204</a>
<a href="#205" id="205">205</a>
<a href="#206" id="206">206</a>
<a href="#207" id="207">207</a>
<a href="#208" id="208">208</a>
<a href="#209" id="209">209</a>
<a href="#210" id="210">210</a>
<a href="#211" id="211">211</a>
<a href="#212" id="212">212</a>
<a href="#213" id="213">213</a>
<a href="#214" id="214">214</a>
<a href="#215" id="215">215</a>
<a href="#216" id="216">216</a>
<a href="#217" id="217">217</a>
<a href="#218" id="218">218</a>
<a href="#219" id="219">219</a>
<a href="#220" id="220">220</a>
<a href="#221" id="221">221</a>
<a href="#222" id="222">222</a>
<a href="#223" id="223">223</a>
<a href="#224" id="224">224</a>
<a href="#225" id="225">225</a>
<a href="#226" id="226">226</a>
<a href="#227" id="227">227</a>
<a href="#228" id="228">228</a>
<a href="#229" id="229">229</a>
<a href="#230" id="230">230</a>
<a href="#231" id="231">231</a>
<a href="#232" id="232">232</a>
<a href="#233" id="233">233</a>
<a href="#234" id="234">234</a>
<a href="#235" id="235">235</a>
<a href="#236" id="236">236</a>
<a href="#237" id="237">237</a>
<a href="#238" id="238">238</a>
<a href="#239" id="239">239</a>
<a href="#240" id="240">240</a>
<a href="#241" id="241">241</a>
<a href="#242" id="242">242</a>
<a href="#243" id="243">243</a>
<a href="#244" id="244">244</a>
<a href="#245" id="245">245</a>
<a href="#246" id="246">246</a>
<a href="#247" id="247">247</a>
<a href="#248" id="248">248</a>
<a href="#249" id="249">249</a>
<a href="#250" id="250">250</a>
<a href="#251" id="251">251</a>
<a href="#252" id="252">252</a>
<a href="#253" id="253">253</a>
<a href="#254" id="254">254</a>
<a href="#255" id="255">255</a>
<a href="#256" id="256">256</a>
<a href="#257" id="257">257</a>
<a href="#258" id="258">258</a>
<a href="#259" id="259">259</a>
<a href="#260" id="260">260</a>
<a href="#261" id="261">261</a>
<a href="#262" id="262">262</a>
<a href="#263" id="263">263</a>
<a href="#264" id="264">264</a>
<a href="#265" id="265">265</a>
<a href="#266" id="266">266</a>
<a href="#267" id="267">267</a>
<a href="#268" id="268">268</a>
<a href="#269" id="269">269</a>
<a href="#270" id="270">270</a>
<a href="#271" id="271">271</a>
<a href="#272" id="272">272</a>
<a href="#273" id="273">273</a>
<a href="#274" id="274">274</a>
<a href="#275" id="275">275</a>
<a href="#276" id="276">276</a>
<a href="#277" id="277">277</a>
<a href="#278" id="278">278</a>
<a href="#279" id="279">279</a>
<a href="#280" id="280">280</a>
<a href="#281" id="281">281</a>
<a href="#282" id="282">282</a>
<a href="#283" id="283">283</a>
<a href="#284" id="284">284</a>
<a href="#285" id="285">285</a>
<a href="#286" id="286">286</a>
<a href="#287" id="287">287</a>
<a href="#288" id="288">288</a>
<a href="#289" id="289">289</a>
<a href="#290" id="290">290</a>
<a href="#291" id="291">291</a>
<a href="#292" id="292">292</a>
<a href="#293" id="293">293</a>
<a href="#294" id="294">294</a>
<a href="#295" id="295">295</a>
<a href="#296" id="296">296</a>
<a href="#297" id="297">297</a>
<a href="#298" id="298">298</a>
<a href="#299" id="299">299</a>
<a href="#300" id="300">300</a>
<a href="#301" id="301">301</a>
<a href="#302" id="302">302</a>
<a href="#303" id="303">303</a>
<a href="#304" id="304">304</a>
<a href="#305" id="305">305</a>
<a href="#306" id="306">306</a>
<a href="#307" id="307">307</a>
<a href="#308" id="308">308</a>
<a href="#309" id="309">309</a>
<a href="#310" id="310">310</a>
<a href="#311" id="311">311</a>
<a href="#312" id="312">312</a>
<a href="#313" id="313">313</a>
<a href="#314" id="314">314</a>
<a href="#315" id="315">315</a>
<a href="#316" id="316">316</a>
<a href="#317" id="317">317</a>
<a href="#318" id="318">318</a>
<a href="#319" id="319">319</a>
<a href="#320" id="320">320</a>
<a href="#321" id="321">321</a>
<a href="#322" id="322">322</a>
<a href="#323" id="323">323</a>
<a href="#324" id="324">324</a>
<a href="#325" id="325">325</a>
<a href="#326" id="326">326</a>
<a href="#327" id="327">327</a>
<a href="#328" id="328">328</a>
<a href="#329" id="329">329</a>
<a href="#330" id="330">330</a>
<a href="#331" id="331">331</a>
<a href="#332" id="332">332</a>
<a href="#333" id="333">333</a>
<a href="#334" id="334">334</a>
<a href="#335" id="335">335</a>
<a href="#336" id="336">336</a>
<a href="#337" id="337">337</a>
<a href="#338" id="338">338</a>
<a href="#339" id="339">339</a>
<a href="#340" id="340">340</a>
<a href="#341" id="341">341</a>
<a href="#342" id="342">342</a>
<a href="#343" id="343">343</a>
</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-static-root-path="../../../static.files/" data-current-crate="libm" data-themes="" data-resource-suffix="" data-rustdoc-version="1.67.1 (d5a82bbd2 2023-02-07)" data-search-js="search-444266647c4dba98.js" data-settings-js="settings-bebeae96e00e4617.js" data-settings-css="settings-af96d9e2fc13e081.css" ></div></body></html>