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

Remove dead man walking set generator.

Browse source
This commit is contained in:
Cédric Bonhomme 2017-03-09 10:02:52 +01:00
parent 7c9530aa9d
commit b31d830c76
No known key found for this signature in database
GPG key ID: A1CB94DE57B7A70D
2 changed files with 2 additions and 13 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

7
docs/software.rst
View file

@ -90,9 +90,6 @@ Sets are used in order to select the pixels where the message will be hidden.
# List all available generators # List all available generators
$ lsb-set list-generators $ lsb-set list-generators
Dead_Man_Walking
Dead Man Walking.
OEIS_A000217 OEIS_A000217
http://oeis.org/A000217 http://oeis.org/A000217
Triangular numbers: a(n) = C(n+1,2) = n(n+1)/2 = 0+1+2+...+n. Triangular numbers: a(n) = C(n+1,2) = n(n+1)/2 = 0+1+2+...+n.
@ -107,8 +104,8 @@ Sets are used in order to select the pixels where the message will be hidden.
eratosthenes eratosthenes
Generate the prime numbers with the sieve of Eratosthenes. Generate the prime numbers with the sieve of Eratosthenes.
eratosthenes_composite composite
Generate the composite numbers with the sieve of Eratosthenes. Generate the composite numbers using the sieve of Eratosthenes.
fermat fermat
Generate the n-th Fermat Number. Generate the n-th Fermat Number.

8
stegano/lsbset/generators.py
View file

@ -37,14 +37,6 @@ def identity() -> Iterator[int]:
yield n yield n
n += 1 n += 1
def Dead_Man_Walking() -> Iterator[int]:
"""Dead Man Walking.
"""
n = 0
while True:
yield n + 7
n += 2
def triangular_numbers() -> Iterator[int]: def triangular_numbers() -> Iterator[int]:
"""http://oeis.org/A000217 """http://oeis.org/A000217
Triangular numbers: a(n) = C(n+1,2) = n(n+1)/2 = 0+1+2+...+n. Triangular numbers: a(n) = C(n+1,2) = n(n+1)/2 = 0+1+2+...+n.