Generators

CHANGELOG.md

@@ -62,6 +62,7 @@ Types of change:
 ### Changed
 - [Html - Link Relative Paths - Change part of PQ as it wasn't worder properly](https://github.com/enkidevs/curriculum/pull/2985)
 - [Python - Format Text Paragraphs With Textwrap - Make the fill method more clear](https://github.com/enkidevs/curriculum/pull/2981)
+- [Python - Generators - Move single-line commands to a single line, update indentation in codeblocks from 4 to 2 spaces](https://github.com/enkidevs/curriculum/pull/3026)
 - [Python - Iterators - Move single-line commands to a single line, update indentation in codeblocks from 4 to 2 spaces](https://github.com/enkidevs/curriculum/pull/3027)
 
 ## January 4th 2022

python/functional-programming/generators/generator-of-generators.md

@@ -27,7 +27,7 @@ Last insight, we've seen how **recursion** and **generators** can work together.
 
 Consider the following example:
 
-```plain-text
+```python
 def fibonacci():
     #Generating fibonacci sequence
     a, b = 0, 1
@@ -51,7 +51,7 @@ This is why we define the second **generator** called `firstn` which accepts two
 
 Finally, we print a list containing the first 10 *elements* of the *Fibonacci sequence*:
 
-```plain-text
+```python
 # Output:
 # [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
 ```
@@ -99,8 +99,7 @@ def n_power(g,n):
     for i in range(n):
       yield next(g)
 
-print(list(n_power(
-  power_of_two(), 4)))
+print(list(n_power(power_of_two(), 4)))
 ```
 
 ???

python/functional-programming/generators/recursive-generator.md

@@ -30,9 +30,9 @@ Consider the following example:
 
 ```python
 def infinity(start):
-    yield start
-    for x in infinity(start + 1)
-      yield x
+  yield start
+  for x in infinity(start + 1)
+    yield x
 ```
 
 We defined a **generator** that counts up to infinity. During the first evaluation, the starting value will be **returned**. Then we loop on the new **generators** created in the `for`'s body.
@@ -43,8 +43,8 @@ Let's check out the example above implemented using `yield from`:
 
 ```python
 def infinity(start):
-    yield start
-    yield from infinity(start + 1)
+  yield start
+  yield from infinity(start + 1)
 
 gen = infinity(20)
 print(next(gen)) # 20
@@ -64,9 +64,9 @@ Can you spot which of the following generators are recursive?
 
 ```python
 def list_gen(l):
-    if l:
-        yield l[0]
-        yield from list_gen(l[1:])
+  if l:
+    yield l[0]
+    yield from list_gen(l[1:])
 
 def cubic_generator(n):
 	for i in range(n):

python/functional-programming/generators/yield-and-next.md

@@ -42,10 +42,10 @@ Consider the following generator:
 
 ```py
 def range_gen(n):
-    i = 0
-    while i < n:
-        yield i
-        i += 1
+  i = 0
+  while i < n:
+    yield i
+    i += 1
 ```
 
 This **function** generates all natural numbers up to `n`. Let's use the `next()` method now:
@@ -73,9 +73,9 @@ What is the output of the following snippet?
 
 ```py
 def countdown(num):
-    while num > 0:
-        yield num
-        num -= 1
+  while num > 0:
+    yield num
+    num -= 1
 
 >>> gen = countdown(5)
 >>> print(next(gen))