Module lange.gp
Expand source code
# Copyright (c) 2021. Davi Pereira dos Santos
# This file is part of the lange project.
# Please respect the license - more about this in the section (*) below.
#
# lange is free software: you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation, either version 3 of the License, or
# (at your option) any later version.
#
# lange is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with lange. If not, see <http://www.gnu.org/licenses/>.
#
# (*) Removing authorship by any means, e.g. by distribution of derived
# works or verbatim, obfuscated, compiled or rewritten versions of any
# part of this work is a crime and is unethical regarding the effort and
# time spent here.
# Relevant employers or funding agencies will be notified accordingly.
from lange.abs.progression import Progression
class GP(Progression):
"""Geometric Progression. A flexible inductive sequence of numbers based on Haskell interval notation.
maxdigits: maximum amount of digits verified during precision detection
(includes numbers to the left and to the right of the decimal separator, if any)
Usage:
>>> print(GP(5))
[5]
>>> print(GP(5, 1))
[5 1]
>>> gp = GP(0.3, 0.6, ..., 6)
>>> gp
[0.3 0.6 .*. 6.0]
>>> list(gp)
[0.3, 0.6, 1.2, 2.4, 4.8]
>>> gp[1]
0.6
>>> list(GP(0.2, 4.1, 0.9))
[0.2, 4.1, 0.9]
>>> gp = GP(0.3, 0.6, ...)
>>> gp
[0.3 0.6 .*. inf]
>>> GP(0.3, 0.6, ...)[:8]
[0.3 0.6 .*. 38.4]
>>> list(GP(0.3, 0.6, ...)[:8])
[0.3, 0.6, 1.2, 2.4, 4.8, 9.6, 19.2, 38.4]
>>> GP()
[]
>>> list(GP())
[]
Usage (square brackets syntax):
>>> from lange import gp
>>> gp[0.3, 0.6, ..., 2]
[0.3 0.6 1.2]
>>> gp[1, 2]
[1 2]
>>> list(gp[1, 2])
[1, 2]
>>> gp[1]
[1]
>>> list(gp[1])
[1]
>>> gp[3, 1, 6, 7, 0]
[3 1 6 7 0]
>>> list(gp[3, 1, 6, 7, 0])
[3, 1, 6, 7, 0]
>>> gp[4, 5, 2, 9, 4, 7, 3, 3][2:6]
[2 9 4 7]
>>> gp[4, 5, 2, 9, 4, 7, 3, 3][5]
[7]
>>> list(gp[3, 2, 6666, 7, 8, 6, 5555, 7, 3, 9][2:9:4])
[6666, 5555]
>>> print(gp[0.1, 0.2, ...][2:8])
[0.4 0.8 .*. 12.8]
>>> gp[0.1, 0.2, ...][2:8:2]
[0.4 1.6 6.4]
>>> list(gp[2,3,...,14])
[2.0, 3.0, 4.5, 6.75, 10.125]
>>> gp[1,2,...]
[1 2 .*. ∞]
>>> gp[1,1.00000000001,...][1_000_000_000_000]
22026.465793705393
"""
def __init__(self, *args, maxdigits=28):
super().__init__(
"*",
1,
lambda a, b: a * b,
lambda a, b: a / b,
lambda a, b: a**b,
lambda a, b, c: abs(b / a).log10() / abs(c).log10(),
args,
maxdigits,
)
def __reduce__(self): # pragma: no cover
return GP, self.args + (self.maxdigits,)Classes
class GP (*args, maxdigits=28)-
Geometric Progression. A flexible inductive sequence of numbers based on Haskell interval notation.
maxdigits: maximum amount of digits verified during precision detection (includes numbers to the left and to the right of the decimal separator, if any)
Usage
>>> print(GP(5)) [5] >>> print(GP(5, 1)) [5 1] >>> gp = GP(0.3, 0.6, ..., 6) >>> gp [0.3 0.6 .*. 6.0] >>> list(gp) [0.3, 0.6, 1.2, 2.4, 4.8] >>> gp[1] 0.6 >>> list(GP(0.2, 4.1, 0.9)) [0.2, 4.1, 0.9] >>> gp = GP(0.3, 0.6, ...) >>> gp [0.3 0.6 .*. inf] >>> GP(0.3, 0.6, ...)[:8] [0.3 0.6 .*. 38.4] >>> list(GP(0.3, 0.6, ...)[:8]) [0.3, 0.6, 1.2, 2.4, 4.8, 9.6, 19.2, 38.4] >>> GP() [] >>> list(GP()) []Usage (square brackets syntax): >>> from lange import gp >>> gp[0.3, 0.6, …, 2] [0.3 0.6 1.2] >>> gp[1, 2] [1 2] >>> list(gp[1, 2]) [1, 2] >>> gp[1] [1] >>> list(gp[1]) [1] >>> gp[3, 1, 6, 7, 0] [3 1 6 7 0] >>> list(gp[3, 1, 6, 7, 0]) [3, 1, 6, 7, 0] >>> gp[4, 5, 2, 9, 4, 7, 3, 3][2:6] [2 9 4 7] >>> gp[4, 5, 2, 9, 4, 7, 3, 3][5] [7] >>> list(gp[3, 2, 6666, 7, 8, 6, 5555, 7, 3, 9][2:9:4]) [6666, 5555] >>> print(gp[0.1, 0.2, …][2:8]) [0.4 0.8 .. 12.8] >>> gp[0.1, 0.2, …][2:8:2] [0.4 1.6 6.4] >>> list(gp[2,3,…,14]) [2.0, 3.0, 4.5, 6.75, 10.125] >>> gp[1,2,…] [1 2 .. ∞] >>> gp[1,1.00000000001,…][1_000_000_000_000] 22026.465793705393
Expand source code
class GP(Progression): """Geometric Progression. A flexible inductive sequence of numbers based on Haskell interval notation. maxdigits: maximum amount of digits verified during precision detection (includes numbers to the left and to the right of the decimal separator, if any) Usage: >>> print(GP(5)) [5] >>> print(GP(5, 1)) [5 1] >>> gp = GP(0.3, 0.6, ..., 6) >>> gp [0.3 0.6 .*. 6.0] >>> list(gp) [0.3, 0.6, 1.2, 2.4, 4.8] >>> gp[1] 0.6 >>> list(GP(0.2, 4.1, 0.9)) [0.2, 4.1, 0.9] >>> gp = GP(0.3, 0.6, ...) >>> gp [0.3 0.6 .*. inf] >>> GP(0.3, 0.6, ...)[:8] [0.3 0.6 .*. 38.4] >>> list(GP(0.3, 0.6, ...)[:8]) [0.3, 0.6, 1.2, 2.4, 4.8, 9.6, 19.2, 38.4] >>> GP() [] >>> list(GP()) [] Usage (square brackets syntax): >>> from lange import gp >>> gp[0.3, 0.6, ..., 2] [0.3 0.6 1.2] >>> gp[1, 2] [1 2] >>> list(gp[1, 2]) [1, 2] >>> gp[1] [1] >>> list(gp[1]) [1] >>> gp[3, 1, 6, 7, 0] [3 1 6 7 0] >>> list(gp[3, 1, 6, 7, 0]) [3, 1, 6, 7, 0] >>> gp[4, 5, 2, 9, 4, 7, 3, 3][2:6] [2 9 4 7] >>> gp[4, 5, 2, 9, 4, 7, 3, 3][5] [7] >>> list(gp[3, 2, 6666, 7, 8, 6, 5555, 7, 3, 9][2:9:4]) [6666, 5555] >>> print(gp[0.1, 0.2, ...][2:8]) [0.4 0.8 .*. 12.8] >>> gp[0.1, 0.2, ...][2:8:2] [0.4 1.6 6.4] >>> list(gp[2,3,...,14]) [2.0, 3.0, 4.5, 6.75, 10.125] >>> gp[1,2,...] [1 2 .*. ∞] >>> gp[1,1.00000000001,...][1_000_000_000_000] 22026.465793705393 """ def __init__(self, *args, maxdigits=28): super().__init__( "*", 1, lambda a, b: a * b, lambda a, b: a / b, lambda a, b: a**b, lambda a, b, c: abs(b / a).log10() / abs(c).log10(), args, maxdigits, ) def __reduce__(self): # pragma: no cover return GP, self.args + (self.maxdigits,)Ancestors
Inherited members