fz0x1/Stegano
1
0
Fork 0
mirror of https://github.com/cedricbonhomme/Stegano.git synced 2025-05-12 17:18:30 +02:00
Code Issues Projects Releases Packages Wiki Activity Actions

Encapsulated the ackermann_naive generator, updated revision dates

Browse source
This commit is contained in:
AdrienCos 2019-06-04 11:40:50 -04:00
parent 8f8cd483fd
commit 3f350c3569
No known key found for this signature in database
GPG key ID: 97AD9AEBCA16D08D
2 changed files with 16 additions and 5 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
bin/stegano-lsb-set
View file

@ -22,7 +22,7 @@
__author__ = "Cedric Bonhomme" __author__ = "Cedric Bonhomme"
__version__ = "$Revision: 0.7 $" __version__ = "$Revision: 0.7 $"
__date__ = "$Date: 2016/03/18 $" __date__ = "$Date: 2016/03/18 $"
__revision__ = "$Date: 2017/05/16 $" __revision__ = "$Date: 2019/06/04 $"
__license__ = "GPLv3" __license__ = "GPLv3"
import inspect import inspect

19
stegano/lsbset/generators.py
View file

@ -22,7 +22,7 @@
__author__ = "Cedric Bonhomme" __author__ = "Cedric Bonhomme"
__version__ = "$Revision: 0.3 $" __version__ = "$Revision: 0.3 $"
__date__ = "$Date: 2011/12/28 $" __date__ = "$Date: 2011/12/28 $"
__revision__ = "$Date: 2017/03/10 $" __revision__ = "$Date: 2019/06/04 $"
__license__ = "GPLv3" __license__ = "GPLv3"
import itertools import itertools
@ -107,15 +107,24 @@ def carmichael() -> Iterator[int]:
yield m yield m
def ackermann_naive(m: int, n: int) -> int: def ackermann_slow(m: int, n: int) -> int:
"""Ackermann number. """Ackermann number.
""" """
if m == 0: if m == 0:
return n + 1 return n + 1
elif n == 0: elif n == 0:
return ackermann_naive(m - 1, 1) return ackermann_slow(m - 1, 1)
else: else:
return ackermann_naive(m - 1, ackermann_naive(m, n - 1)) return ackermann_slow(m - 1, ackermann_slow(m, n - 1))
def ackermann_naive(m: int) -> Iterator[int]:
"""Naive Ackermann encapsulated in a generator
"""
n = 0
while True:
yield ackermann_slow(m, n)
n += 1
def ackermann_fast(m: int, n: int) -> int: def ackermann_fast(m: int, n: int) -> int:
@ -136,6 +145,7 @@ def ackermann_fast(m: int, n: int) -> int:
else: else:
return n + 1 return n + 1
def ackermann(m: int) -> Iterator[int]: def ackermann(m: int) -> Iterator[int]:
"""Ackermann encapsulated in a generator. """Ackermann encapsulated in a generator.
""" """
@ -144,6 +154,7 @@ def ackermann(m: int) -> Iterator[int]:
yield ackermann_fast(m, n) yield ackermann_fast(m, n)
n += 1 n += 1
def fibonacci() -> Iterator[int]: def fibonacci() -> Iterator[int]:
"""Generate the sequence of Fibonacci. """Generate the sequence of Fibonacci.
https://oeis.org/A000045 https://oeis.org/A000045