a ùcý ã@sJdZddlZddlZddd„Zdd„Zdd „Zd d „Zd d „Zdd„Z dS)zMiscellaneous utilities.éNécCs*t |¡}t ||¡}t |¡jddkS)aÑ Check if an array is linear. :param x: Array to be checked for linearity. :param decimals: decimal places upto which the derivative of the array should be rounded off (default=5) :type x: numpy.ndarray :type decimals: int :return: If the array is linear :rtype: boolean :Example: >>> import numpy as np >>> x = np.linspace(0, 2 * np.pi, 100) >>> is_linear(x) True >>> is_linear(np.sin(x)) False ré)ÚnpZdiffZaroundÚuniqueÚshape)ÚxZdecimalsZ derivative©rúW/nfs/NAS7/SABIOD/METHODE/ermites/ermites_venv/lib/python3.9/site-packages/tftb/utils.pyÚ is_linear s  r cCs„|jdkr|j\}}n|jdd}}tj||ftd}t|ƒD]<}t |¡tjj|dd…|fdd||t  |¡|<qB|S)zInverse Zak transform.érr)ZdtypeN)Zaxis) ÚndimrrÚzerosÚcomplexÚrangeÚsqrtZfftZifftZarange)rÚnÚmÚsigZimrrr Úizak!s   :rcCst t |¡¡S)a{ Compute the integer exponent of the next higher power of 2. :param n: Number whose next higest power of 2 needs to be computed. :type n: int, np.ndarray :rtype: int, np.ndarray :Example: >>> from __future__ import print_function >>> import numpy as np >>> x = np.arange(1, 9) >>> print(nextpow2(x)) [ 0. 1. 2. 2. 3. 3. 3. 3.] )ÚmathÚceilÚlog2)rrrr Únextpow2-srcCsbt |¡}|ddkr&t|ƒ}||fSt |¡}t|ddƒD]}||}||dkr<qZq<||fS)aç Compute two factors of N such that they are as close as possible to sqrt(N). :param N: Number to be divided. :type N: int :return: A tuple of two integers such that their product is `N` and they are the closest possible to :math:`\sqrt(N)` # NOQA: W605 :rtype: tuple(int) :Example: >>> from __future__ import print_function >>> print(divider(256)) (16, 16) >>> print(divider(10)) (2, 5) >>> print(divider(101)) (1, 101) rréÿÿÿÿ)rrÚintrr)ÚNÚsÚiÚfactorrrr Údivider>s    rcCst|ttjfƒr@t |¡}|t |d¡dkd7<| t¡S|ddkrT|dSt |¡ddkrpt  |¡St |¡ddkrŒt |¡S|S)a\ Get the nearest odd number for each value of N. :param N: int / sequence of ints :return: int / sequence of ints :Example: >>> from __future__ import print_function >>> print(nearest_odd(range(1, 11))) [ 1. 3. 3. 5. 5. 7. 7. 9. 9. 11.] >>> nearest_odd(0) 1 >>> nearest_odd(3) 3.0 r rr) Ú isinstanceÚlistrZndarrayÚfloorÚ remainderZastyperrr)rÚyrrr Ú nearest_odd\s     r%cCsTtt |¡ƒr(t ||¡}|||dk<n(t t |¡|¡dt t |¡|¡}|S)zþ Compute the congruence of each element of x modulo N. :type x: array-like :type N: int :return: array-like :Example: >>> from __future__ import print_function >>> print(modulo(range(1, 11), 2)) [1 2 1 2 1 2 1 2 1 2] ryð?)ÚanyrZisrealÚmodÚrealÚimag)rrr$rrr Úmoduloxs  (r*)r) Ú__doc__rÚnumpyrr rrrr%r*rrrr Ús