Skip to content

Instantly share code, notes, and snippets.

@akrizs

akrizs/generators.py

Last active March 27, 2022 20:31
Show Gist options

  • Select an option

    Learn more about clone URLs
  • Save akrizs/54bb6b5a8725b6d850016e3721ad77d1 to your computer and use it in GitHub Desktop.

Select an option

Learn more about clone URLs
Save akrizs/54bb6b5a8725b6d850016e3721ad77d1 to your computer and use it in GitHub Desktop.
Download ZIP

Revisions

  1. akrizs revised this gist Mar 27, 2022. 1 changed file with 3 additions and 0 deletions.
    3 changes: 3 additions & 0 deletions generators.py
    View file
    Original file line number Diff line number Diff line change
    @@ -154,6 +154,9 @@ def fibonaccis(nums: int):


    if __name__ == "__main__":
    # Select how many numbers should be in the list generated.
    # default count is set to 100, otherwise the generator just runs forever
    # and generates endless counts of numbers.
    count = 15

    sq = [x for x in squarables(count=count)]
  2. akrizs created this gist Mar 27, 2022.
    171 changes: 171 additions & 0 deletions generators.py
    View file
    Original file line number Diff line number Diff line change
    @@ -0,0 +1,171 @@
    from math import sqrt

    def is_prime(num: int):
    for n in range(2,int(num**0.5)+1):
    if num%n==0:
    return False
    return True

    def is_composite(num: int):
    return not is_prime(num)

    def is_odd(num: int):
    if (num % 2) == 0:
    return False
    else:
    return True

    def is_even(num: int):
    return not is_odd(num)

    def sqr_root(num: int):
    return num ** (1/2)

    def squarables(num: int = 1, count: int or None = 100, under: bool = False):
    n = num
    tick = 1
    while True:
    if n > 0:
    if sqrt(n).is_integer():
    yield n
    if under:
    n -= 1
    else:
    n += 1

    if count:
    if tick < count:
    tick += 1
    else:
    break
    else:
    if under:
    n -= 1
    else:
    n += 1
    else:
    break

    def odds(num: int = 1, count: int or None = 100, under: bool = False):
    n = num
    tick = 1
    while True:
    if n > 0:
    if is_odd(n):
    yield n
    if under:
    n -= 1
    else:
    n += 1

    if count:
    if tick < count:
    tick += 1
    else:
    break
    else:
    if under:
    n -= 1
    else:
    n += 1
    else:
    break

    def evens(num: int = 1, count: int or None = 100, under: bool = False):
    n = num
    tick = 1
    while True:
    if n > 0:
    if is_even(n):
    yield n
    if under:
    n -= 1
    else:
    n += 1

    if count:
    if tick < count:
    tick += 1
    else:
    break
    else:
    if under:
    n -= 1
    else:
    n += 1
    else:
    break

    def primes(num: int = 2, count: int or None = 100, under: bool = False):
    n = num
    tick = 1
    while True:
    if n > 0:
    if is_prime(n):
    yield n
    if under:
    n -= 1
    else:
    n += 1

    if count:
    if tick < count:
    tick += 1
    else:
    break
    else:
    if under:
    n -= 1
    else:
    n += 1
    else:
    break

    def composites(num: int = 2, count: int or None = 100, under: bool = False):
    n = num
    tick = 1
    while True:
    if n > 0:
    if is_composite(n):
    yield n
    if under:
    n -= 1
    else:
    n += 1

    if count:
    if tick < count:
    tick += 1
    else:
    break
    else:
    if under:
    n -= 1
    else:
    n += 1
    else:
    break

    def fibonaccis(nums: int):
    x, y = 0, 1
    for _ in range(nums):
    x, y = y, x+y
    yield x


    if __name__ == "__main__":
    count = 15

    sq = [x for x in squarables(count=count)]
    od = [x for x in odds(count=count)]
    ev = [x for x in evens(count=count)]
    pr = [x for x in primes(count=count)]
    co = [x for x in composites(count=count)]
    fi = [x for x in fibonaccis(count)]

    print(sq)
    print(od)
    print(ev)
    print(pr)
    print(co)
    print(fi)