@stdlib/math-iter-sequences-continued-fraction 0.0.5 → 0.2.0

package/LICENSE

@@ -175,307 +175,3 @@
       of your accepting any such warranty or additional liability.
 
    END OF TERMS AND CONDITIONS
-
-
-
-Boost Software License - Version 1.0 - August 17th, 2003
-
-Permission is hereby granted, free of charge, to any person or organization
-obtaining a copy of the software and accompanying documentation covered by this
-license (the "Software") to use, reproduce, display, distribute, execute, and
-transmit the Software, and to prepare derivative works of the Software, and to
-permit third-parties to whom the Software is furnished to do so, all subject to
-the following:
-
-The copyright notices in the Software and this entire statement, including the
-above license grant, this restriction and the following disclaimer, must be
-included in all copies of the Software, in whole or in part, and all derivative
-works of the Software, unless such copies or derivative works are solely in the
-form of machine-executable object code generated by a source language processor.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
-FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE
-COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE FOR ANY DAMAGES
-OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF
-OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
-
-
-
-
-DEPENDENCIES
-
-The library links against the following external libraries, which have their own
-licenses:
-
-* OpenBLAS <https://raw.githubusercontent.com/xianyi/OpenBLAS/
-def146efed8d5908ea04e22668feeab7099599a0/LICENSE>
-
-Copyright (c) 2011-2014, The OpenBLAS Project
-All rights reserved.
-
-Redistribution and use in source and binary forms, with or without
-modification, are permitted provided that the following conditions are
-met:
-
-   1. Redistributions of source code must retain the above copyright
-      notice, this list of conditions and the following disclaimer.
-
-   2. Redistributions in binary form must reproduce the above copyright
-      notice, this list of conditions and the following disclaimer in
-      the documentation and/or other materials provided with the
-      distribution.
-
-   3. Neither the name of the OpenBLAS project nor the names of
-      its contributors may be used to endorse or promote products
-      derived from this software without specific prior written
-      permission.
-
-THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
-ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
-LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
-CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
-GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
-HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
-LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
-THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-
-* Electron <https://raw.githubusercontent.com/electron/electron/
-c4cfb3e7110266b9d7ad80e1ae097c4db564501c/LICENSE>
-
-Copyright (c) 2013-2017 GitHub Inc.
-
-Permission is hereby granted, free of charge, to any person obtaining
-a copy of this software and associated documentation files (the
-"Software"), to deal in the Software without restriction, including
-without limitation the rights to use, copy, modify, merge, publish,
-distribute, sublicense, and/or sell copies of the Software, and to
-permit persons to whom the Software is furnished to do so, subject to
-the following conditions:
-
-The above copyright notice and this permission notice shall be
-included in all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
-EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
-MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
-NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
-LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
-OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
-WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
-
-
-* Boost <http://www.boost.org/LICENSE_1_0.txt>
-
-Boost Software License - Version 1.0 - August 17th, 2003
-
-Permission is hereby granted, free of charge, to any person or organization
-obtaining a copy of the software and accompanying documentation covered by
-this license (the "Software") to use, reproduce, display, distribute,
-execute, and transmit the Software, and to prepare derivative works of the
-Software, and to permit third-parties to whom the Software is furnished to
-do so, all subject to the following:
-
-The copyright notices in the Software and this entire statement, including
-the above license grant, this restriction and the following disclaimer,
-must be included in all copies of the Software, in whole or in part, and
-all derivative works of the Software, unless such copies or derivative
-works are solely in the form of machine-executable object code generated by
-a source language processor.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT
-SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE
-FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,
-ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
-DEALINGS IN THE SOFTWARE.
-
-
-* Cephes <http://www.netlib.org/cephes/readme>
-
-Copyright (c) 1984-2000 Stephen L. Moshier
-
-Some software in this archive may be from the book _Methods and Programs for
-Mathematical Functions_ (Prentice-Hall or Simon & Schuster International, 1989)
-or from the Cephes Mathematical Library, a commercial product. In either event,
-it is copyrighted by the author. What you see here may be used freely but it
-comes with no support or guarantee.
-
-Stephen L. Moshier
-moshier@na-net.ornl.gov
-
-
-
-ATTRIBUTION
-
-The library contains implementations from the following external libraries,
-which have their own licenses:
-
-* FreeBSD <https://svnweb.freebsd.org/>
-
-Copyright (C) 1993-2004 by Sun Microsystems, Inc. All rights reserved.
-
-Developed at SunPro, a Sun Microsystems, Inc. business.
-Permission to use, copy, modify, and distribute this
-software is freely granted, provided that this notice
-is preserved.
-
-
-* FDLIBM <http://www.netlib.org/fdlibm/>
-
-Copyright (C) 2004 by Sun Microsystems, Inc. All rights reserved.
-
-Developed at SunPro, a Sun Microsystems, Inc. business.
-Permission to use, copy, modify, and distribute this
-software is freely granted, provided that this notice
-is preserved.
-
-
-* Go <https://raw.githubusercontent.com/golang/go/master/LICENSE>
-
-Copyright (c) 2009 The Go Authors. All rights reserved.
-
-Redistribution and use in source and binary forms, with or without
-modification, are permitted provided that the following conditions are
-met:
-
-   * Redistributions of source code must retain the above copyright
-notice, this list of conditions and the following disclaimer.
-   * Redistributions in binary form must reproduce the above
-copyright notice, this list of conditions and the following disclaimer
-in the documentation and/or other materials provided with the
-distribution.
-   * Neither the name of Google Inc. nor the names of its
-contributors may be used to endorse or promote products derived from
-this software without specific prior written permission.
-
-THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-
-* SLATEC Common Mathematical Library <http://www.netlib.no/netlib/slatec/>
-
-Public domain.
-
-
-* ESLint <https://raw.githubusercontent.com/eslint/eslint/master/LICENSE>
-
-Copyright JS Foundation and other contributors, https://js.foundation
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in
-all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-THE SOFTWARE.
-
-
-* StatsFuns.jl <https://raw.githubusercontent.com/JuliaStats/StatsFuns.jl/
-e66dd973650c375bc1739c820e5b96bb5bd000a8/LICENSE.md>
-
-Copyright (c) 2015: Dahua Lin.
-
-Permission is hereby granted, free of charge, to any person obtaining
-a copy of this software and associated documentation files (the
-"Software"), to deal in the Software without restriction, including
-without limitation the rights to use, copy, modify, merge, publish,
-distribute, sublicense, and/or sell copies of the Software, and to
-permit persons to whom the Software is furnished to do so, subject to
-the following conditions:
-
-The above copyright notice and this permission notice shall be
-included in all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
-EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
-MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
-IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
-CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
-TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
-SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
-
-
-* SpecialFunctions.jl <https://raw.githubusercontent.com/JuliaMath/
-SpecialFunctions.jl/02a173fbe24a61c4b392aec17a9764ac5727feb1/LICENSE>
-
-The MIT License (MIT)
-
-Copyright (c) 2017 Jeff Bezanson, Stefan Karpinski, Viral B. Shah, and others:
-
-https://github.com/JuliaMath/SpecialFunctions.jl/graphs/contributors
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.
-
-
-* MT19937 <http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/MT2002/CODES/
-mt19937ar.c>
-
-Copyright (C) 1997 - 2002, Makoto Matsumoto and Takuji Nishimura,
-All rights reserved.
-
-Redistribution and use in source and binary forms, with or without
-modification, are permitted provided that the following conditions
-are met:
-
- 1. Redistributions of source code must retain the above copyright
-    notice, this list of conditions and the following disclaimer.
-
- 2. Redistributions in binary form must reproduce the above copyright
-    notice, this list of conditions and the following disclaimer in the
-    documentation and/or other materials provided with the distribution.
-
- 3. The names of its contributors may not be used to endorse or promote
-    products derived from this software without specific prior written
-    permission.
-
-THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT
-OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

package/NOTICE

@@ -1 +1 @@
-Copyright (c) 2016-2022 The Stdlib Authors.
+Copyright (c) 2016-2024 The Stdlib Authors.

package/README.md

@@ -18,6 +18,17 @@ limitations under the License.
 
 -->
 
+
+<details>
+  <summary>
+    About stdlib...
+  </summary>
+  <p>We believe in a future in which the web is a preferred environment for numerical computation. To help realize this future, we've built stdlib. stdlib is a standard library, with an emphasis on numerical and scientific computation, written in JavaScript (and C) for execution in browsers and in Node.js.</p>
+  <p>The library is fully decomposable, being architected in such a way that you can swap out and mix and match APIs and functionality to cater to your exact preferences and use cases.</p>
+  <p>When you use stdlib, you can be absolutely certain that you are using the most thorough, rigorous, well-written, studied, documented, tested, measured, and high-quality code out there.</p>
+  <p>To join us in bringing numerical computing to the web, get started by checking us out on <a href="https://github.com/stdlib-js/stdlib">GitHub</a>, and please consider <a href="https://opencollective.com/stdlib">financially supporting stdlib</a>. We greatly appreciate your continued support!</p>
+</details>
+
 # iterContinuedFractionSeq
 
 [![NPM version][npm-image]][npm-url] [![Build Status][test-image]][test-url] [![Coverage Status][coverage-image]][coverage-url] <!-- [![dependencies][dependencies-image]][dependencies-url] -->
@@ -35,7 +46,7 @@ A **generalized continued fraction** has the form
 <div class="equation" align="center" data-raw-text="x = b_0 + \frac{a_1}{b_1+\frac{a_2}{b_2+\frac{a_3}{b_3+\frac{a_4}{b_4+\ldots}}}}" data-equation="eq:continued_fraction">
     <img src="https://cdn.jsdelivr.net/gh/stdlib-js/stdlib@b05b08e74e5706e091431f99b26166caea11fed9/lib/node_modules/@stdlib/math/iter/sequences/continued-fraction/docs/img/equation_continued_fraction.svg" alt="Continued fraction">
     <br>
-</div>
+</div> -->
 
 <!-- </equation> -->
 
@@ -43,10 +54,10 @@ If `a_i = 1` for all `i`, the above expression reduces to a **simple continued f
 
 <!-- <equation class="equation" label="eq:simple_continued_fraction" align="center" raw="x = b_0 + \frac{1}{b_1+\frac{1}{b_2+\frac{1}{b_3+\frac{1}{b_4+\ldots}}}}" alt="Simple continued fraction"> -->
 
-<div class="equation" align="center" data-raw-text="x = b_0 + \frac{1}{b_1+\frac{1}{b_2+\frac{1}{b_3+\frac{1}{b_4+\ldots}}}}" data-equation="eq:simple_continued_fraction">
+<!-- <div class="equation" align="center" data-raw-text="x = b_0 + \frac{1}{b_1+\frac{1}{b_2+\frac{1}{b_3+\frac{1}{b_4+\ldots}}}}" data-equation="eq:simple_continued_fraction">
     <img src="https://cdn.jsdelivr.net/gh/stdlib-js/stdlib@b05b08e74e5706e091431f99b26166caea11fed9/lib/node_modules/@stdlib/math/iter/sequences/continued-fraction/docs/img/equation_simple_continued_fraction.svg" alt="Simple continued fraction">
     <br>
-</div>
+</div> -->
 
 <!-- </equation> -->
 
@@ -54,7 +65,7 @@ where the values `b_i` are called the **coefficients** or **terms** of the conti
 
 <!-- <equation class="equation" label="eq:simple_continued_fraction_convergents" align="center" raw="b_0, b_0 + \frac{1}{b_1},b_0 + \frac{1}{b_1 + \frac{1}{b2}},b_0 + \frac{1}{b_1 + \frac{1}{b2+\frac{1}{b3}}},\ldots" alt="Simple continued fraction convergents"> -->
 
-<div class="equation" align="center" data-raw-text="b_0, b_0 + \frac{1}{b_1},b_0 + \frac{1}{b_1 + \frac{1}{b2}},b_0 + \frac{1}{b_1 + \frac{1}{b2+\frac{1}{b3}}},\ldots" data-equation="eq:simple_continued_fraction_convergents">
+<!-- <div class="equation" align="center" data-raw-text="b_0, b_0 + \frac{1}{b_1},b_0 + \frac{1}{b_1 + \frac{1}{b2}},b_0 + \frac{1}{b_1 + \frac{1}{b2+\frac{1}{b3}}},\ldots" data-equation="eq:simple_continued_fraction_convergents">
     <img src="https://cdn.jsdelivr.net/gh/stdlib-js/stdlib@6be2d95d94757e01f8e07117664fdf14b5f82777/lib/node_modules/@stdlib/math/iter/sequences/continued-fraction/docs/img/equation_simple_continued_fraction_convergents.svg" alt="Simple continued fraction convergents">
     <br>
 </div>
@@ -305,6 +316,12 @@ console.log( 'computed: %d', evaluate( terms ) );
 
 <section class="related">
 
+* * *
+
+## See Also
+
+-   <span class="package-name">[`@stdlib/math-iter/utils/continued-fraction`][@stdlib/math/iter/utils/continued-fraction]</span><span class="delimiter">: </span><span class="description">evaluate the terms of a continued fraction.</span>
+
 </section>
 
 <!-- /.related -->
@@ -335,7 +352,7 @@ See [LICENSE][stdlib-license].
 
 ## Copyright
 
-Copyright &copy; 2016-2022. The Stdlib [Authors][stdlib-authors].
+Copyright &copy; 2016-2024. The Stdlib [Authors][stdlib-authors].
 
 </section>
 
@@ -348,8 +365,8 @@ Copyright &copy; 2016-2022. The Stdlib [Authors][stdlib-authors].
 [npm-image]: http://img.shields.io/npm/v/@stdlib/math-iter-sequences-continued-fraction.svg
 [npm-url]: https://npmjs.org/package/@stdlib/math-iter-sequences-continued-fraction
 
-[test-image]: https://github.com/stdlib-js/math-iter-sequences-continued-fraction/actions/workflows/test.yml/badge.svg?branch=v0.0.5
-[test-url]: https://github.com/stdlib-js/math-iter-sequences-continued-fraction/actions/workflows/test.yml?query=branch:v0.0.5
+[test-image]: https://github.com/stdlib-js/math-iter-sequences-continued-fraction/actions/workflows/test.yml/badge.svg?branch=v0.2.0
+[test-url]: https://github.com/stdlib-js/math-iter-sequences-continued-fraction/actions/workflows/test.yml?query=branch:v0.2.0
 
 [coverage-image]: https://img.shields.io/codecov/c/github/stdlib-js/math-iter-sequences-continued-fraction/main.svg
 [coverage-url]: https://codecov.io/github/stdlib-js/math-iter-sequences-continued-fraction?branch=main
@@ -361,23 +378,33 @@ Copyright &copy; 2016-2022. The Stdlib [Authors][stdlib-authors].
 
 -->
 
+[chat-image]: https://img.shields.io/gitter/room/stdlib-js/stdlib.svg
+[chat-url]: https://app.gitter.im/#/room/#stdlib-js_stdlib:gitter.im
+
+[stdlib]: https://github.com/stdlib-js/stdlib
+
+[stdlib-authors]: https://github.com/stdlib-js/stdlib/graphs/contributors
+
 [umd]: https://github.com/umdjs/umd
 [es-module]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Modules
 
 [deno-url]: https://github.com/stdlib-js/math-iter-sequences-continued-fraction/tree/deno
+[deno-readme]: https://github.com/stdlib-js/math-iter-sequences-continued-fraction/blob/deno/README.md
 [umd-url]: https://github.com/stdlib-js/math-iter-sequences-continued-fraction/tree/umd
+[umd-readme]: https://github.com/stdlib-js/math-iter-sequences-continued-fraction/blob/umd/README.md
 [esm-url]: https://github.com/stdlib-js/math-iter-sequences-continued-fraction/tree/esm
+[esm-readme]: https://github.com/stdlib-js/math-iter-sequences-continued-fraction/blob/esm/README.md
+[branches-url]: https://github.com/stdlib-js/math-iter-sequences-continued-fraction/blob/main/branches.md
 
-[chat-image]: https://img.shields.io/gitter/room/stdlib-js/stdlib.svg
-[chat-url]: https://gitter.im/stdlib-js/stdlib/
+[stdlib-license]: https://raw.githubusercontent.com/stdlib-js/math-iter-sequences-continued-fraction/main/LICENSE
 
-[stdlib]: https://github.com/stdlib-js/stdlib
+[@stdlib/constants/float64/eps]: https://www.npmjs.com/package/@stdlib/constants-float64-eps
 
-[stdlib-authors]: https://github.com/stdlib-js/stdlib/graphs/contributors
+<!-- <related-links> -->
 
-[stdlib-license]: https://raw.githubusercontent.com/stdlib-js/math-iter-sequences-continued-fraction/main/LICENSE
+[@stdlib/math/iter/utils/continued-fraction]: https://www.npmjs.com/package/@stdlib/math-iter-utils-continued-fraction
 
-[@stdlib/constants/float64/eps]: https://www.npmjs.com/package/@stdlib/constants-float64-eps
+<!-- </related-links> -->
 
 </section>
 

package/SECURITY.md

@@ -0,0 +1,5 @@
+# Security
+
+> Policy for reporting security vulnerabilities.
+
+See the security policy [in the main project repository](https://github.com/stdlib-js/stdlib/security).

package/dist/index.d.ts

@@ -0,0 +1,3 @@
+/// <reference path="../docs/types/index.d.ts" />
+import iterContinuedFractionSeq from '../docs/types/index';
+export = iterContinuedFractionSeq;

package/dist/index.js

@@ -0,0 +1,7 @@
+"use strict";var P=function(r,e){return function(){return e||r((e={exports:{}}).exports,e),e.exports}};var I=P(function(rr,j){
+var Y=require('@stdlib/assert-is-plain-object/dist'),T=require('@stdlib/assert-has-own-property/dist'),_=require('@stdlib/assert-is-nonnegative-integer/dist').isPrimitive,k=require('@stdlib/assert-is-finite/dist').isPrimitive,p=require('@stdlib/error-tools-fmtprodmsg/dist'),N=["terms","convergents","*"];function z(r,e){return Y(e)?T(e,"iter")&&(r.iter=e.iter,!_(e.iter))?new TypeError(p('0Zv2t',"iter",e.iter)):T(e,"tol")&&(r.tol=e.tol,!k(e.tol)||e.tol<=0)?new TypeError(p('0Zv4R',"tol",e.tol)):T(e,"returns")&&(r.returns=e.returns,N.indexOf(e.returns)===-1)?new TypeError(p('0Zv4S',"returns",N.join('", "'),e.returns)):null:new TypeError(p('0Zv2V',e));}j.exports=z
+});var U=P(function(er,R){
+var y=require('@stdlib/utils-define-nonenumerable-read-only-property/dist'),A=require('@stdlib/assert-is-finite/dist').isPrimitive,S=require('@stdlib/symbol-iterator/dist'),B=require('@stdlib/error-tools-fmtprodmsg/dist'),F=require('@stdlib/math-base-special-floor/dist'),H=require('@stdlib/math-base-special-abs/dist'),J=require('@stdlib/constants-float64-eps/dist'),K=require('@stdlib/utils-fifo/dist'),M=I(),C=1e-50,Q={terms:W,convergents:X,"*":Z};function W(r,e,u){return u&&r>0?-r:r}function X(r,e,u){return u&&r>0?-e:e}function Z(r,e,u){return u&&r>0?[-r,-e]:[r,e]}function L(r,e){var u,h,E,l,v,a,b,d,i,f,m,s,n,g,q,w;if(!A(r))throw new TypeError(B('0Zv4Q',r));if(l={iter:1e308,tol:J,returns:"terms"},arguments.length>1&&(b=M(l,e),b))throw b;if(u=Q[l.returns],a=0,E=r,r<0?(d=!0,r=-r):d=!1,w=0,v={},y(v,"next",V),y(v,"return",D),S&&y(v,S,G),n=new K,i=F(r),n.push([i,i]),i===r||i===0&&(r=1/r,i=F(r),n.push([i,1/i]),i===r))return a=1,v;return q=r-i,g=1/q,f=i,m=f,s=0,n.push(O()),n.push(O()),v;function O(){var t=f;return i=F(g),q=g-i,g=1/q,s+=i,s===0&&(s=C),m=i+1/m,m===0&&(m=C),s=1/s,h=m*s,f*=h,H(h-1)<=l.tol&&(a=1,t===f)?[-1,f]:[i,f]}function V(){var t,o,c;return w+=1,a>0?a===1&&n.length>0?(t=n.pop(),o=t[0],c=t[1],o===-1?{done:!0}:(t=n.first(),n.length===2&&t[0]===1&&(o+=1,c=t[1],n.clear()),{value:u(o,c,d),done:!1})):(a=2,{done:!0}):w===l.iter?(t=n.pop(),o=t[0],c=t[1],t=n.first(),t[0]===1&&(o+=1,c=t[1]),n.clear(),a=2,{value:u(o,c,d),done:!1}):(t=n.push(O()).pop(),{value:u(t[0],t[1],d),done:!1})}function D(t){return a=2,arguments.length?{value:t,done:!0}:{done:!0}}function G(){return L(E,l)}}R.exports=L
+});var $=U();module.exports=$;
+/** @license Apache-2.0 */
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../lib/validate.js", "../lib/main.js", "../lib/index.js"],
+  "sourcesContent": ["/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isPlainObject = require( '@stdlib/assert-is-plain-object' );\nvar hasOwnProp = require( '@stdlib/assert-has-own-property' );\nvar isNonNegativeInteger = require( '@stdlib/assert-is-nonnegative-integer' ).isPrimitive;\nvar isFinite = require( '@stdlib/assert-is-finite' ).isPrimitive; // eslint-disable-line stdlib/no-redeclare\nvar format = require( '@stdlib/string-format' );\n\n\n// VARIABLES //\n\nvar returns = [\n\t'terms',\n\t'convergents',\n\t'*'\n];\n\n\n// MAIN //\n\n/**\n* Validates function options.\n*\n* @private\n* @param {Object} opts - destination object\n* @param {Options} options - function options\n* @param {NonNegativeInteger} [options.iter] - maximum number of iterations\n* @param {PositiveNumber} [options.tol] - tolerance at which to terminate further evaluation of the continued fraction\n* @param {string} [options.returns] - specifies the type of result to return (must be one of `'terms'`, `'convergents'`, or `'*'`)\n* @returns {(Error|null)} null or an error object\n*\n* @example\n* var opts = {};\n* var options = {\n*     'iter': 50\n* };\n* var err = validate( opts, options );\n* if ( err ) {\n*     throw err;\n* }\n*/\nfunction validate( opts, options ) {\n\tif ( !isPlainObject( options ) ) {\n\t\treturn new TypeError( format( 'invalid argument. Options argument must be an object. Value: `%s`.', options ) );\n\t}\n\tif ( hasOwnProp( options, 'iter' ) ) {\n\t\topts.iter = options.iter;\n\t\tif ( !isNonNegativeInteger( options.iter ) ) {\n\t\t\treturn new TypeError( format( 'invalid option. `%s` option must be a nonnegative integer. Option: `%s`.', 'iter', options.iter ) );\n\t\t}\n\t}\n\tif ( hasOwnProp( options, 'tol' ) ) {\n\t\topts.tol = options.tol;\n\t\tif ( !isFinite( options.tol ) || options.tol <= 0.0 ) {\n\t\t\treturn new TypeError( format( 'invalid option. `%s` option must be a positive finite number. Option: `%s`.', 'tol', options.tol ) );\n\t\t}\n\t}\n\tif ( hasOwnProp( options, 'returns' ) ) {\n\t\topts.returns = options.returns;\n\t\tif ( returns.indexOf( options.returns ) === -1 ) {\n\t\t\treturn new TypeError( format( 'invalid option. `%s` option must be one of the following: \"%s\". Option: `%s`.', 'returns', returns.join( '\", \"' ), options.returns ) );\n\t\t}\n\t}\n\treturn null;\n}\n\n\n// EXPORTS //\n\nmodule.exports = validate;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils-define-nonenumerable-read-only-property' );\nvar isFinite = require( '@stdlib/assert-is-finite' ).isPrimitive; // eslint-disable-line stdlib/no-redeclare\nvar iteratorSymbol = require( '@stdlib/symbol-iterator' );\nvar format = require( '@stdlib/string-format' );\nvar floor = require( '@stdlib/math-base-special-floor' );\nvar abs = require( '@stdlib/math-base-special-abs' );\nvar EPS = require( '@stdlib/constants-float64-eps' );\nvar FIFO = require( '@stdlib/utils-fifo' );\nvar validate = require( './validate.js' );\n\n\n// VARIABLES //\n\nvar TINY = 1.0e-50;\nvar RESULT_FUNCTION = {\n\t'terms': terms,\n\t'convergents': convergents,\n\t'*': both\n};\n\n\n// FUNCTIONS //\n\n/**\n* Returns a continued fraction term result.\n*\n* @private\n* @param {number} term - continued fraction term\n* @param {number} convergent - continued fraction convergent\n* @param {boolean} negative - boolean indicating whether the input value is negative\n* @returns {number} term\n*/\nfunction terms( term, convergent, negative ) {\n\treturn ( negative && term > 0 ) ? -term : term;\n}\n\n/**\n* Returns a continued fraction convergent result.\n*\n* @private\n* @param {number} term - continued fraction term\n* @param {number} convergent - continued fraction convergent\n* @param {boolean} negative - boolean indicating whether the input value is negative\n* @returns {number} convergent\n*/\nfunction convergents( term, convergent, negative ) {\n\treturn ( negative && term > 0 ) ? -convergent : convergent;\n}\n\n/**\n* Returns a result as two-element array consisting of a continued fraction term and its associated convergent.\n*\n* @private\n* @param {number} term - continued fraction term\n* @param {number} convergent - continued fraction convergent\n* @param {boolean} negative - boolean indicating whether the input value is negative\n* @returns {Array<number>} result\n*/\nfunction both( term, convergent, negative ) {\n\treturn ( negative && term > 0 ) ? [ -term, -convergent ] : [ term, convergent ]; // eslint-disable-line max-len\n}\n\n\n// MAIN //\n\n/**\n* Returns an iterator which generates a list of all continued fraction terms which can be obtained given the precision of `x`.\n*\n* ## Notes\n*\n* -   If an environment supports `Symbol.iterator`, the returned iterator is iterable.\n*\n* @param {number} x - input value\n* @param {Options} [options] - function options\n* @param {NonNegativeInteger} [options.iter=1e308] - maximum number of iterations\n* @param {PositiveNumber} [options.tol] - tolerance at which to terminate further evaluation of the continued fraction\n* @param {string} [options.returns='terms'] - specifies the type of result to return (must be one of `'terms'`, `'convergents'`, or `'*'`)\n* @throws {TypeError} first argument must be a finite number\n* @throws {TypeError} options argument must be an object\n* @throws {TypeError} must provide valid options\n* @returns {Iterator} iterator\n*\n* @example\n* var iter = iterContinuedFractionSeq( 3.245 );\n*\n* var v = iter.next().value;\n* // returns 3\n*\n* v = iter.next().value;\n* // returns 4\n*\n* v = iter.next().value;\n* // returns 12\n*\n* v = iter.next().value;\n* // returns 4\n*\n* var bool = iter.next().done;\n* // returns true\n*/\nfunction iterContinuedFractionSeq( x, options ) {\n\tvar result;\n\tvar delta;\n\tvar orig;\n\tvar opts;\n\tvar iter;\n\tvar FLG;\n\tvar err;\n\tvar neg;\n\tvar bi;\n\tvar fi;\n\tvar Ci;\n\tvar Di;\n\tvar q;\n\tvar v;\n\tvar r;\n\tvar i;\n\n\tif ( !isFinite( x ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a finite number. Value: `%s`.', x ) );\n\t}\n\topts = {\n\t\t'iter': 1e308,\n\t\t'tol': EPS,\n\t\t'returns': 'terms'\n\t};\n\tif ( arguments.length > 1 ) {\n\t\terr = validate( opts, options );\n\t\tif ( err ) {\n\t\t\tthrow err;\n\t\t}\n\t}\n\tresult = RESULT_FUNCTION[ opts.returns ];\n\tFLG = 0;\n\torig = x;\n\n\t// If `x < 0`, we choose to negate the terms (i.e., [b0; b1, b2, ..., bn] => [-b0; -b1, -b2, ..., -bn]), thus allowing the evaluation of those terms to return the input value. This differs from an alternative approach of having only a negative `b0` and the rest `{b1, ..., bn}` be positive. When doing the latter, floating-point rounding error can prevent recovering the original value...\n\tif ( x < 0 ) {\n\t\tneg = true;\n\t\tx = -x;\n\t} else {\n\t\tneg = false;\n\t}\n\ti = 0;\n\n\t// Create an iterator protocol-compliant object:\n\titer = {};\n\tsetReadOnly( iter, 'next', next );\n\tsetReadOnly( iter, 'return', end );\n\n\t// If an environment supports `Symbol.iterator`, make the iterator iterable:\n\tif ( iteratorSymbol ) {\n\t\tsetReadOnly( iter, iteratorSymbol, factory );\n\t}\n\t// Continued fractions may not be unique (e.g., [b0; b1, ..., bn, 1] = [b0; b1, ..., bn+1]). Accordingly, in order to ensure we return a canonical representation (i.e., the shorter representation), returned values must lag by two terms, as we'll need to peek ahead to determine if we need to canonicalize before returning the last term. In which case, let's create a FIFO queue for storing terms and their associated convergents...\n\tq = new FIFO();\n\n\t// Extract the integer part of the provided value:\n\tbi = floor( x );\n\tq.push( [ bi, bi ] ); // b0 is both the first term and the first convergent\n\tif ( bi === x ) {\n\t\t// We've been provided an integer value, so no continued fractions to compute...\n\t\tFLG = 1;\n\t\treturn iter;\n\t}\n\t// For `0 < x < 1`, leverage the fact that continued fraction representations of a positive rational number and its reciprocal are identical, except for shifting one place to the right (i.e., [b0; b1, b1, ..., bn] and [0; b0, b1, b2, ..., bn] are reciprocals)...\n\tif ( bi === 0 ) {\n\t\tx = 1.0 / x;\n\t\tbi = floor( x );\n\t\tq.push( [ bi, 1.0/bi ] );\n\t\tif ( bi === x ) {\n\t\t\t// No more continued fractions to compute...\n\t\t\tFLG = 1;\n\t\t\treturn iter;\n\t\t}\n\t}\n\t// Compute the next term of the continued fraction...\n\tr = x - bi;\n\tv = 1.0 / r;\n\n\t// Initialize parameters of the modified Lentz's algorithm...\n\tfi = bi;\n\tCi = fi;\n\tDi = 0.0;\n\n\t// Compute the next two terms:\n\tq.push( nextTerm() );\n\tq.push( nextTerm() );\n\n\treturn iter;\n\n\t/**\n\t* Computes the next term of the continued fraction.\n\t*\n\t* @private\n\t* @returns {number} next term\n\t*/\n\tfunction nextTerm() {\n\t\tvar fj = fi;\n\n\t\t// Compute the next term of the continued fraction...\n\t\tbi = floor( v );\n\t\tr = v - bi;\n\t\tv = 1.0 / r;\n\n\t\t// Use the modified Lentz's algorithm to find the next convergent...\n\t\tDi += bi;             // b_j + a_j*D_{j-1}, where a_j = 1.0 for all j\n\t\tif ( Di === 0.0 ) {\n\t\t\tDi = TINY;\n\t\t}\n\t\tCi = bi + ( 1.0/Ci ); // b_j + a_j/C_{j-1}, where a_j = 1.0 for all j\n\t\tif ( Ci === 0.0 ) {\n\t\t\tCi = TINY;\n\t\t}\n\t\tDi = 1.0 / Di;\n\t\tdelta = Ci * Di;\n\t\tfi *= delta;\n\n\t\t// Check whether we can terminate computation...\n\t\tif ( abs( delta - 1.0 ) <= opts.tol ) {\n\t\t\tFLG = 1;\n\t\t\tif ( fj === fi ) {\n\t\t\t\t// Return a sentinel value to indicate that the last term did not improve the approximation:\n\t\t\t\treturn [ -1, fi ];\n\t\t\t}\n\t\t}\n\t\treturn [ bi, fi ];\n\t}\n\n\t/**\n\t* Returns an iterator protocol-compliant object containing the next iterated value.\n\t*\n\t* @private\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction next() {\n\t\tvar item;\n\t\tvar term;\n\t\tvar f;\n\n\t\ti += 1;\n\t\tif ( FLG > 0 ) {\n\t\t\tif ( FLG === 1 && q.length > 0 ) {\n\t\t\t\titem = q.pop();\n\t\t\t\tterm = item[ 0 ];\n\t\t\t\tf = item[ 1 ];\n\t\t\t\tif ( term === -1 ) {\n\t\t\t\t\treturn {\n\t\t\t\t\t\t'done': true\n\t\t\t\t\t};\n\t\t\t\t}\n\t\t\t\t// Check whether we need to adjust the current term to ensure canonical representation...\n\t\t\t\titem = q.first();\n\t\t\t\tif ( q.length === 2 && item[ 0 ] === 1 ) {\n\t\t\t\t\tterm += 1;\n\t\t\t\t\tf = item[ 1 ];\n\t\t\t\t\tq.clear();\n\t\t\t\t}\n\t\t\t\treturn {\n\t\t\t\t\t'value': result( term, f, neg ),\n\t\t\t\t\t'done': false\n\t\t\t\t};\n\t\t\t}\n\t\t\tFLG = 2;\n\t\t\treturn {\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\tif ( i === opts.iter ) {\n\t\t\titem = q.pop();\n\t\t\tterm = item[ 0 ];\n\t\t\tf = item[ 1 ];\n\n\t\t\t// Check whether we need to adjust the final term to ensure canonical representation...\n\t\t\titem = q.first();\n\t\t\tif ( item[ 0 ] === 1 ) {\n\t\t\t\tterm += 1;\n\t\t\t\tf = item[ 1 ];\n\t\t\t}\n\t\t\tq.clear();\n\t\t\tFLG = 2;\n\t\t\treturn {\n\t\t\t\t'value': result( term, f, neg ),\n\t\t\t\t'done': false\n\t\t\t};\n\t\t}\n\t\titem = q.push( nextTerm() ).pop();\n\t\treturn {\n\t\t\t'value': result( item[ 0 ], item[ 1 ], neg ),\n\t\t\t'done': false\n\t\t};\n\t}\n\n\t/**\n\t* Finishes an iterator.\n\t*\n\t* @private\n\t* @param {*} [value] - value to return\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction end( value ) {\n\t\tFLG = 2;\n\t\tif ( arguments.length ) {\n\t\t\treturn {\n\t\t\t\t'value': value,\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'done': true\n\t\t};\n\t}\n\n\t/**\n\t* Returns a new iterator.\n\t*\n\t* @private\n\t* @returns {Iterator} iterator\n\t*/\n\tfunction factory() {\n\t\treturn iterContinuedFractionSeq( orig, opts );\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = iterContinuedFractionSeq;\n", "/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n*    http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create an iterator which generates a list of all continued fraction terms which can be obtained given the precision of `x`.\n*\n* @module @stdlib/math-iter-sequences-continued-fraction\n*\n* @example\n* var iterContinuedFractionSeq = require( '@stdlib/math-iter-sequences-continued-fraction' );\n*\n* var iter = iterContinuedFractionSeq( 3.245 );\n*\n* var v = iter.next().value;\n* // returns 3\n*\n* v = iter.next().value;\n* // returns 4\n*\n* v = iter.next().value;\n* // returns 12\n*\n* v = iter.next().value;\n* // returns 4\n*\n* var bool = iter.next().done;\n* // returns true\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n"],
+  "mappings": "uGAAA,IAAAA,EAAAC,EAAA,SAAAC,GAAAC,EAAA,cAsBA,IAAIC,EAAgB,QAAS,gCAAiC,EAC1DC,EAAa,QAAS,iCAAkC,EACxDC,EAAuB,QAAS,uCAAwC,EAAE,YAC1EC,EAAW,QAAS,0BAA2B,EAAE,YACjDC,EAAS,QAAS,uBAAwB,EAK1CC,EAAU,CACb,QACA,cACA,GACD,EA0BA,SAASC,EAAUC,EAAMC,EAAU,CAClC,OAAMR,EAAeQ,CAAQ,EAGxBP,EAAYO,EAAS,MAAO,IAChCD,EAAK,KAAOC,EAAQ,KACf,CAACN,EAAsBM,EAAQ,IAAK,GACjC,IAAI,UAAWJ,EAAQ,2EAA4E,OAAQI,EAAQ,IAAK,CAAE,EAG9HP,EAAYO,EAAS,KAAM,IAC/BD,EAAK,IAAMC,EAAQ,IACd,CAACL,EAAUK,EAAQ,GAAI,GAAKA,EAAQ,KAAO,GACxC,IAAI,UAAWJ,EAAQ,8EAA+E,MAAOI,EAAQ,GAAI,CAAE,EAG/HP,EAAYO,EAAS,SAAU,IACnCD,EAAK,QAAUC,EAAQ,QAClBH,EAAQ,QAASG,EAAQ,OAAQ,IAAM,IACpC,IAAI,UAAWJ,EAAQ,gFAAiF,UAAWC,EAAQ,KAAM,MAAO,EAAGG,EAAQ,OAAQ,CAAE,EAG/J,KApBC,IAAI,UAAWJ,EAAQ,qEAAsEI,CAAQ,CAAE,CAqBhH,CAKAT,EAAO,QAAUO,ICzFjB,IAAAG,EAAAC,EAAA,SAAAC,GAAAC,EAAA,cAsBA,IAAIC,EAAc,QAAS,uDAAwD,EAC/EC,EAAW,QAAS,0BAA2B,EAAE,YACjDC,EAAiB,QAAS,yBAA0B,EACpDC,EAAS,QAAS,uBAAwB,EAC1CC,EAAQ,QAAS,iCAAkC,EACnDC,EAAM,QAAS,+BAAgC,EAC/CC,EAAM,QAAS,+BAAgC,EAC/CC,EAAO,QAAS,oBAAqB,EACrCC,EAAW,IAKXC,EAAO,MACPC,EAAkB,CACrB,MAASC,EACT,YAAeC,EACf,IAAKC,CACN,EAcA,SAASF,EAAOG,EAAMC,EAAYC,EAAW,CAC5C,OAASA,GAAYF,EAAO,EAAM,CAACA,EAAOA,CAC3C,CAWA,SAASF,EAAaE,EAAMC,EAAYC,EAAW,CAClD,OAASA,GAAYF,EAAO,EAAM,CAACC,EAAaA,CACjD,CAWA,SAASF,EAAMC,EAAMC,EAAYC,EAAW,CAC3C,OAASA,GAAYF,EAAO,EAAM,CAAE,CAACA,EAAM,CAACC,CAAW,EAAI,CAAED,EAAMC,CAAW,CAC/E,CAwCA,SAASE,EAA0BC,EAAGC,EAAU,CAC/C,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAEJ,GAAK,CAAClC,EAAUiB,CAAE,EACjB,MAAM,IAAI,UAAWf,EAAQ,yEAA0Ee,CAAE,CAAE,EAO5G,GALAK,EAAO,CACN,KAAQ,MACR,IAAOjB,EACP,QAAW,OACZ,EACK,UAAU,OAAS,IACvBoB,EAAMlB,EAAUe,EAAMJ,CAAQ,EACzBO,GACJ,MAAMA,EAqCR,GAlCAN,EAASV,EAAiBa,EAAK,OAAQ,EACvCE,EAAM,EACNH,EAAOJ,EAGFA,EAAI,GACRS,EAAM,GACNT,EAAI,CAACA,GAELS,EAAM,GAEPQ,EAAI,EAGJX,EAAO,CAAC,EACRxB,EAAawB,EAAM,OAAQY,CAAK,EAChCpC,EAAawB,EAAM,SAAUa,CAAI,EAG5BnC,GACJF,EAAawB,EAAMtB,EAAgBoC,CAAQ,EAG5CN,EAAI,IAAIzB,EAGRqB,EAAKxB,EAAOc,CAAE,EACdc,EAAE,KAAM,CAAEJ,EAAIA,CAAG,CAAE,EACdA,IAAOV,GAMPU,IAAO,IACXV,EAAI,EAAMA,EACVU,EAAKxB,EAAOc,CAAE,EACdc,EAAE,KAAM,CAAEJ,EAAI,EAAIA,CAAG,CAAE,EAClBA,IAAOV,GAEX,OAAAO,EAAM,EACCD,EAIT,OAAAU,EAAIhB,EAAIU,EACRK,EAAI,EAAMC,EAGVL,EAAKD,EACLE,EAAKD,EACLE,EAAK,EAGLC,EAAE,KAAMO,EAAS,CAAE,EACnBP,EAAE,KAAMO,EAAS,CAAE,EAEZf,EAQP,SAASe,GAAW,CACnB,IAAIC,EAAKX,EAqBT,OAlBAD,EAAKxB,EAAO6B,CAAE,EACdC,EAAID,EAAIL,EACRK,EAAI,EAAMC,EAGVH,GAAMH,EACDG,IAAO,IACXA,EAAKtB,GAENqB,EAAKF,EAAO,EAAIE,EACXA,IAAO,IACXA,EAAKrB,GAENsB,EAAK,EAAMA,EACXV,EAAQS,EAAKC,EACbF,GAAMR,EAGDhB,EAAKgB,EAAQ,CAAI,GAAKE,EAAK,MAC/BE,EAAM,EACDe,IAAOX,GAEJ,CAAE,GAAIA,CAAG,EAGX,CAAED,EAAIC,CAAG,CACjB,CAQA,SAASO,GAAO,CACf,IAAIK,EACA3B,EACA4B,EAGJ,OADAP,GAAK,EACAV,EAAM,EACLA,IAAQ,GAAKO,EAAE,OAAS,GAC5BS,EAAOT,EAAE,IAAI,EACblB,EAAO2B,EAAM,CAAE,EACfC,EAAID,EAAM,CAAE,EACP3B,IAAS,GACN,CACN,KAAQ,EACT,GAGD2B,EAAOT,EAAE,MAAM,EACVA,EAAE,SAAW,GAAKS,EAAM,CAAE,IAAM,IACpC3B,GAAQ,EACR4B,EAAID,EAAM,CAAE,EACZT,EAAE,MAAM,GAEF,CACN,MAASZ,EAAQN,EAAM4B,EAAGf,CAAI,EAC9B,KAAQ,EACT,KAEDF,EAAM,EACC,CACN,KAAQ,EACT,GAEIU,IAAMZ,EAAK,MACfkB,EAAOT,EAAE,IAAI,EACblB,EAAO2B,EAAM,CAAE,EACfC,EAAID,EAAM,CAAE,EAGZA,EAAOT,EAAE,MAAM,EACVS,EAAM,CAAE,IAAM,IAClB3B,GAAQ,EACR4B,EAAID,EAAM,CAAE,GAEbT,EAAE,MAAM,EACRP,EAAM,EACC,CACN,MAASL,EAAQN,EAAM4B,EAAGf,CAAI,EAC9B,KAAQ,EACT,IAEDc,EAAOT,EAAE,KAAMO,EAAS,CAAE,EAAE,IAAI,EACzB,CACN,MAASnB,EAAQqB,EAAM,CAAE,EAAGA,EAAM,CAAE,EAAGd,CAAI,EAC3C,KAAQ,EACT,EACD,CASA,SAASU,EAAKM,EAAQ,CAErB,OADAlB,EAAM,EACD,UAAU,OACP,CACN,MAASkB,EACT,KAAQ,EACT,EAEM,CACN,KAAQ,EACT,CACD,CAQA,SAASL,GAAU,CAClB,OAAOrB,EAA0BK,EAAMC,CAAK,CAC7C,CACD,CAKAxB,EAAO,QAAUkB,IC7SjB,IAAI2B,EAAO,IAKX,OAAO,QAAUA",
+  "names": ["require_validate", "__commonJSMin", "exports", "module", "isPlainObject", "hasOwnProp", "isNonNegativeInteger", "isFinite", "format", "returns", "validate", "opts", "options", "require_main", "__commonJSMin", "exports", "module", "setReadOnly", "isFinite", "iteratorSymbol", "format", "floor", "abs", "EPS", "FIFO", "validate", "TINY", "RESULT_FUNCTION", "terms", "convergents", "both", "term", "convergent", "negative", "iterContinuedFractionSeq", "x", "options", "result", "delta", "orig", "opts", "iter", "FLG", "err", "neg", "bi", "fi", "Ci", "Di", "q", "v", "r", "i", "next", "end", "factory", "nextTerm", "fj", "item", "f", "value", "main"]
+}

package/docs/types/index.d.ts

@@ -16,7 +16,7 @@
 * limitations under the License.
 */
 
-// TypeScript Version: 2.0
+// TypeScript Version: 4.1
 
 /// <reference types="@stdlib/types"/>
 
@@ -79,7 +79,7 @@ interface Options {
 * var bool = iter.next().done;
 * // returns true
 */
-declare function iterContinuedFractionSeq( x: number, options?: Options ): Iterator; // tslint:disable-line:max-line-length
+declare function iterContinuedFractionSeq( x: number, options?: Options ): Iterator;
 
 
 // EXPORTS //

package/lib/index.js

@@ -46,9 +46,9 @@
 
 // MODULES //
 
-var iterator = require( './main.js' );
+var main = require( './main.js' );
 
 
 // EXPORTS //
 
-module.exports = iterator;
+module.exports = main;

package/lib/main.js

@@ -23,6 +23,7 @@
 var setReadOnly = require( '@stdlib/utils-define-nonenumerable-read-only-property' );
 var isFinite = require( '@stdlib/assert-is-finite' ).isPrimitive; // eslint-disable-line stdlib/no-redeclare
 var iteratorSymbol = require( '@stdlib/symbol-iterator' );
+var format = require( '@stdlib/string-format' );
 var floor = require( '@stdlib/math-base-special-floor' );
 var abs = require( '@stdlib/math-base-special-abs' );
 var EPS = require( '@stdlib/constants-float64-eps' );
@@ -138,7 +139,7 @@ function iterContinuedFractionSeq( x, options ) {
 	var i;
 
 	if ( !isFinite( x ) ) {
-		throw new TypeError( 'invalid argument. First argument must be a finite number. Value: `' + x + '`.' );
+		throw new TypeError( format( 'invalid argument. First argument must be a finite number. Value: `%s`.', x ) );
 	}
 	opts = {
 		'iter': 1e308,

package/lib/validate.js

@@ -24,6 +24,7 @@ var isPlainObject = require( '@stdlib/assert-is-plain-object' );
 var hasOwnProp = require( '@stdlib/assert-has-own-property' );
 var isNonNegativeInteger = require( '@stdlib/assert-is-nonnegative-integer' ).isPrimitive;
 var isFinite = require( '@stdlib/assert-is-finite' ).isPrimitive; // eslint-disable-line stdlib/no-redeclare
+var format = require( '@stdlib/string-format' );
 
 
 // VARIABLES //
@@ -60,24 +61,24 @@ var returns = [
 */
 function validate( opts, options ) {
 	if ( !isPlainObject( options ) ) {
-		return new TypeError( 'invalid argument. Options argument must be an object. Value: `' + options + '`.' );
+		return new TypeError( format( 'invalid argument. Options argument must be an object. Value: `%s`.', options ) );
 	}
 	if ( hasOwnProp( options, 'iter' ) ) {
 		opts.iter = options.iter;
 		if ( !isNonNegativeInteger( options.iter ) ) {
-			return new TypeError( 'invalid option. `iter` option must be a nonnegative integer. Option: `' + options.iter + '`.' );
+			return new TypeError( format( 'invalid option. `%s` option must be a nonnegative integer. Option: `%s`.', 'iter', options.iter ) );
 		}
 	}
 	if ( hasOwnProp( options, 'tol' ) ) {
 		opts.tol = options.tol;
 		if ( !isFinite( options.tol ) || options.tol <= 0.0 ) {
-			return new TypeError( 'invalid option. `tol` option must be a positive finite number. Option: `' + options.tol + '`.' );
+			return new TypeError( format( 'invalid option. `%s` option must be a positive finite number. Option: `%s`.', 'tol', options.tol ) );
 		}
 	}
 	if ( hasOwnProp( options, 'returns' ) ) {
 		opts.returns = options.returns;
 		if ( returns.indexOf( options.returns ) === -1 ) {
-			return new TypeError( 'invalid option. `returns` option must be one of the following: '+returns.join( ', ' )+'. Option: `' + options.returns + '`.' );
+			return new TypeError( format( 'invalid option. `%s` option must be one of the following: "%s". Option: `%s`.', 'returns', returns.join( '", "' ), options.returns ) );
 		}
 	}
 	return null;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@stdlib/math-iter-sequences-continued-fraction",
-  "version": "0.0.5",
+  "version": "0.2.0",
   "description": "Create an iterator which generates a list of all continued fraction terms which can be obtained given the precision of a provided number.",
   "license": "Apache-2.0",
   "author": {
@@ -37,28 +37,31 @@
     "url": "https://github.com/stdlib-js/stdlib/issues"
   },
   "dependencies": {
-    "@stdlib/assert-has-own-property": "^0.0.x",
-    "@stdlib/assert-is-finite": "^0.0.x",
-    "@stdlib/assert-is-nonnegative-integer": "^0.0.x",
-    "@stdlib/assert-is-plain-object": "^0.0.x",
-    "@stdlib/constants-float64-eps": "^0.0.x",
-    "@stdlib/math-base-special-abs": "^0.0.x",
-    "@stdlib/math-base-special-floor": "^0.0.x",
-    "@stdlib/symbol-iterator": "^0.0.x",
-    "@stdlib/types": "^0.0.x",
-    "@stdlib/utils-define-nonenumerable-read-only-property": "^0.0.x",
-    "@stdlib/utils-fifo": "^0.0.x"
+    "@stdlib/assert-has-own-property": "^0.1.1",
+    "@stdlib/assert-is-finite": "^0.2.0",
+    "@stdlib/assert-is-nonnegative-integer": "^0.2.0",
+    "@stdlib/assert-is-plain-object": "^0.2.0",
+    "@stdlib/constants-float64-eps": "^0.2.0",
+    "@stdlib/math-base-special-abs": "^0.2.0",
+    "@stdlib/math-base-special-floor": "^0.2.0",
+    "@stdlib/string-format": "^0.2.0",
+    "@stdlib/symbol-iterator": "^0.2.0",
+    "@stdlib/types": "^0.3.1",
+    "@stdlib/utils-define-nonenumerable-read-only-property": "^0.2.0",
+    "@stdlib/utils-fifo": "^0.2.0",
+    "@stdlib/error-tools-fmtprodmsg": "^0.1.1"
   },
   "devDependencies": {
-    "@stdlib/assert-is-array": "^0.0.x",
-    "@stdlib/assert-is-iterator-like": "^0.0.x",
-    "@stdlib/bench": "^0.0.x",
-    "@stdlib/constants-float64-pi": "^0.0.x",
-    "@stdlib/math-base-assert-is-nan": "^0.0.x",
+    "@stdlib/assert-is-array": "^0.1.1",
+    "@stdlib/assert-is-iterator-like": "^0.2.0",
+    "@stdlib/constants-float64-pi": "^0.1.1",
+    "@stdlib/math-base-assert-is-nan": "^0.1.1",
     "proxyquire": "^2.0.0",
     "tape": "git+https://github.com/kgryte/tape.git#fix/globby",
     "istanbul": "^0.4.1",
-    "tap-spec": "5.x.x"
+    "tap-min": "git+https://github.com/Planeshifter/tap-min.git",
+    "@stdlib/bench-harness": "^0.2.0",
+    "@stdlib/bench": "^0.3.1"
   },
   "engines": {
     "node": ">=0.10.0",
@@ -89,7 +92,7 @@
     "iter"
   ],
   "funding": {
-    "type": "patreon",
-    "url": "https://www.patreon.com/athan"
+    "type": "opencollective",
+    "url": "https://opencollective.com/stdlib"
   }
 }

package/docs/repl.txt

@@ -1,77 +0,0 @@
-
-{{alias}}( x[, options] )
-    Returns an iterator which generates a list of all continued fraction terms
-    which can be obtained given the precision of `x`.
-
-    If an environment supports Symbol.iterator, the returned iterator is
-    iterable.
-
-    Parameters
-    ----------
-    x: number
-        Input value.
-
-    options: Object (optional)
-        Function options.
-
-    options.iter: integer (optional)
-        Maximum number of iterations. Default: 1e308.
-
-    options.tol: number (optional)
-        Tolerance at which to terminate further evaluation of the continued
-        fraction. Default: floating-point epsilon.
-
-    options.returns: string (optional)
-        Specifies the type of result to return. Must be one of
-
-        - terms: return continued fraction terms
-        - convergents: return continued fraction convergents
-        - *: return both continued fraction terms and their associated
-          convergents as a two-element array.
-
-        Default: 'terms'.
-
-    Returns
-    -------
-    iterator: Object
-        Iterator.
-
-    iterator.next(): Function
-        Returns an iterator protocol-compliant object containing the next
-        iterated value (if one exists) and a boolean flag indicating whether the
-        iterator is finished.
-
-    iterator.return( [value] ): Function
-        Finishes an iterator and returns a provided value.
-
-    Examples
-    --------
-    // Return continued fraction terms...
-    > var it = {{alias}}( 3.245 );
-    > var v = it.next().value
-    3
-    > v = it.next().value
-    4
-    > v = it.next().value
-    12
-    > v = it.next().value
-    4
-    > var bool = it.next().done
-    true
-
-    // Return continued fraction convergents...
-    > it = {{alias}}( 3.245, { 'returns': 'convergents' } );
-    > v = it.next().value
-    3.0
-    > v = it.next().value
-    3.25
-    > v = it.next().value
-    ~3.2449
-    > v = it.next().value
-    3.245
-    > bool = it.next().done
-    true
-
-    See Also
-    --------
-

package/docs/types/test.ts

@@ -1,98 +0,0 @@
-/*
-* @license Apache-2.0
-*
-* Copyright (c) 2022 The Stdlib Authors.
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* 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 "AS IS" 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.
-*/
-
-import iterContinuedFractionSeq = require( './index' );
-
-
-// TESTS //
-
-// The function returns an iterator...
-{
-	iterContinuedFractionSeq( 3.14 ); // $ExpectType Iterator
-	iterContinuedFractionSeq( 3.14, {} ); // $ExpectType Iterator
-	iterContinuedFractionSeq( 3.14, { 'iter': 10 } ); // $ExpectType Iterator
-	iterContinuedFractionSeq( 3.14, { 'tol': 1.0e-10 } ); // $ExpectType Iterator
-}
-
-// The compiler throws an error if the function is provided a first argument which is not a number...
-{
-	iterContinuedFractionSeq( '5' ); // $ExpectError
-	iterContinuedFractionSeq( true ); // $ExpectError
-	iterContinuedFractionSeq( false ); // $ExpectError
-	iterContinuedFractionSeq( null ); // $ExpectError
-	iterContinuedFractionSeq( [] ); // $ExpectError
-	iterContinuedFractionSeq( {} ); // $ExpectError
-	iterContinuedFractionSeq( ( x: number ): number => x ); // $ExpectError
-
-	iterContinuedFractionSeq( '5', {} ); // $ExpectError
-	iterContinuedFractionSeq( true, {} ); // $ExpectError
-	iterContinuedFractionSeq( false, {} ); // $ExpectError
-	iterContinuedFractionSeq( null, {} ); // $ExpectError
-	iterContinuedFractionSeq( [], {} ); // $ExpectError
-	iterContinuedFractionSeq( {}, {} ); // $ExpectError
-	iterContinuedFractionSeq( ( x: number ): number => x, {} ); // $ExpectError
-}
-
-// The compiler throws an error if the function is provided a second argument which is not an options object...
-{
-	iterContinuedFractionSeq( 3.14, '5' ); // $ExpectError
-	iterContinuedFractionSeq( 3.14, 5 ); // $ExpectError
-	iterContinuedFractionSeq( 3.14, true ); // $ExpectError
-	iterContinuedFractionSeq( 3.14, false ); // $ExpectError
-	iterContinuedFractionSeq( 3.14, null ); // $ExpectError
-}
-
-// The compiler throws an error if the function is provided an `iter` option which is not a number...
-{
-	iterContinuedFractionSeq( 3.14, { 'iter': '5' } ); // $ExpectError
-	iterContinuedFractionSeq( 3.14, { 'iter': true } ); // $ExpectError
-	iterContinuedFractionSeq( 3.14, { 'iter': false } ); // $ExpectError
-	iterContinuedFractionSeq( 3.14, { 'iter': null } ); // $ExpectError
-	iterContinuedFractionSeq( 3.14, { 'iter': [] } ); // $ExpectError
-	iterContinuedFractionSeq( 3.14, { 'iter': {} } ); // $ExpectError
-	iterContinuedFractionSeq( 3.14, { 'iter': ( x: number ): number => x } ); // $ExpectError
-}
-
-// The compiler throws an error if the function is provided a `tol` option which is not a number...
-{
-	iterContinuedFractionSeq( 3.14, { 'tol': '5' } ); // $ExpectError
-	iterContinuedFractionSeq( 3.14, { 'tol': true } ); // $ExpectError
-	iterContinuedFractionSeq( 3.14, { 'tol': false } ); // $ExpectError
-	iterContinuedFractionSeq( 3.14, { 'tol': null } ); // $ExpectError
-	iterContinuedFractionSeq( 3.14, { 'tol': [] } ); // $ExpectError
-	iterContinuedFractionSeq( 3.14, { 'tol': {} } ); // $ExpectError
-	iterContinuedFractionSeq( 3.14, { 'tol': ( x: number ): number => x } ); // $ExpectError
-}
-
-// The compiler throws an error if the function is provided a `returns` option which is not a supported value...
-{
-	iterContinuedFractionSeq( 3.14, { 'returns': '5' } ); // $ExpectError
-	iterContinuedFractionSeq( 3.14, { 'returns': 5 } ); // $ExpectError
-	iterContinuedFractionSeq( 3.14, { 'returns': true } ); // $ExpectError
-	iterContinuedFractionSeq( 3.14, { 'returns': false } ); // $ExpectError
-	iterContinuedFractionSeq( 3.14, { 'returns': null } ); // $ExpectError
-	iterContinuedFractionSeq( 3.14, { 'returns': [] } ); // $ExpectError
-	iterContinuedFractionSeq( 3.14, { 'returns': {} } ); // $ExpectError
-	iterContinuedFractionSeq( 3.14, { 'returns': ( x: number ): number => x } ); // $ExpectError
-}
-
-// The compiler throws an error if the function is provided an unsupported number of arguments...
-{
-	iterContinuedFractionSeq(); // $ExpectError
-	iterContinuedFractionSeq( 3.14, {}, {} ); // $ExpectError
-}