ó î&]\c@`s§ddlmZmZmZddlmZyddlZWnek rOnXy6eƒ'Z e j e dƒddl m Z WdQXWnek r™nXd„ZdS(i(tdivisiontprint_functiontabsolute_import(tsuppress_warningsNs"inspect.getargspec.. is deprecated(txc`sųtˆƒ}t‡fd†ttˆƒƒDƒƒ}t|jtd|ƒjƒ}|dg}x/t|ƒD]!}|j|d|jƒƒqmWtj dƒg}x<td|ƒD]+}|j||j t|dƒ|ƒqīWt d„|ƒ}|S(s”Given a series f(x) = a[1]*x + a[2]*x**2 + ... + a[n-1]*x**(n - 1), use the Lagrange inversion formula to compute a series g(x) = b[1]*x + b[2]*x**2 + ... + b[n-1]*x**(n - 1) so that f(g(x)) = g(f(x)) = x mod x**n. We must have a[0] = 0, so necessarily b[0] = 0 too. The algorithm is naive and could be improved, but speed isn't an issue here and it's easy to read. c3`s!|]}ˆ|t|VqdS(N(R(t.0ti(ta(s>lib/python2.7/site-packages/scipy/special/_precompute/utils.pys %siiĸĸĸĸicS`s tj|ƒS(N(tmptmpf(R((s>lib/python2.7/site-packages/scipy/special/_precompute/utils.pyt-s( tlentsumtrangeRtseriestremoveOtappendtexpandRR tcoefftmap(Rtntfththpowertktb((Rs>lib/python2.7/site-packages/scipy/special/_precompute/utils.pytlagrange_inversions ( )(t __future__RRRtscipy._lib._numpy_compatRtmpmathRt ImportErrortsuptfiltertDeprecationWarningt sympy.abcRR(((s>lib/python2.7/site-packages/scipy/special/_precompute/utils.pyts