Added Iterators and Generators - Exercise

Author: MitkoVtori

OOP/8.Iterators and Generators/Iterators and Generators - Exercise/01. Take Skip.py

@@ -0,0 +1,20 @@
+class take_skip:
+
+    def __init__(self, step, count):
+        self.step = step
+        self.current_number = self.step
+        self.count = count
+        self.operations_count = 0
+
+    def __iter__(self):
+        return self
+
+    def __next__(self):
+        self.operations_count += 1
+        if self.operations_count <= self.count:
+            number = self.current_number
+            self.current_number += self.step
+            return number - self.step
+        else:
+            raise StopIteration()
+

OOP/8.Iterators and Generators/Iterators and Generators - Exercise/02. Dictionary Iterator.py

@@ -0,0 +1,16 @@
+class dictionary_iter:
+
+    def __init__(self, dictionary):
+        self.dictionary = dictionary
+        self.element = -1
+
+    def __iter__(self):
+        return self
+
+    def __next__(self):
+        self.element += 1
+        if self.element < len(self.dictionary):
+            return tuple(self.dictionary.items())[self.element]
+        else:
+            raise StopIteration()
+

OOP/8.Iterators and Generators/Iterators and Generators - Exercise/03. Countdown Iterator.py

@@ -0,0 +1,16 @@
+class countdown_iterator:
+
+    def __init__(self, count):
+        self.count = count
+        self.current_number = count
+
+    def __iter__(self):
+        return self
+
+    def __next__(self):
+        if self.current_number >= 0:
+            self.current_number -= 1
+            return self.current_number + 1
+        else:
+            raise StopIteration()
+

OOP/8.Iterators and Generators/Iterators and Generators - Exercise/04. Sequence Repeat.py

@@ -0,0 +1,22 @@
+class sequence_repeat:
+
+    def __init__(self, sequence, number):
+        self.sequence = sequence
+        self.number = number
+        self.index = 0
+        self.current_row = 0
+
+    def __iter__(self):
+        return self
+
+    def __next__(self):
+        self.current_row += 1
+        if self.index < len(self.sequence) and self.current_row <= self.number:
+            self.index += 1
+            return self.sequence[self.index-1]
+        elif self.current_row <= self.number:
+            self.index = 1
+            return self.sequence[self.index-1]
+        else:
+            raise StopIteration()
+

OOP/8.Iterators and Generators/Iterators and Generators - Exercise/05. Take Halves.py

@@ -0,0 +1,18 @@
+def solution():
+
+    def integers():
+        num = 1
+        while True:
+            yield num
+            num += 1
+
+    def halves():
+
+        for i in integers():
+            yield i/2
+
+    def take(n, seq):
+        return [next(seq) for _ in range(n)]
+
+    return (take, halves, integers)
+

OOP/8.Iterators and Generators/Iterators and Generators - Exercise/06. Fibonacci Generator.py

@@ -0,0 +1,8 @@
+def fibonacci():
+    prev_num = 0
+    curr_num = 1
+
+    while True:
+        yield prev_num
+        prev_num, curr_num = curr_num, prev_num + curr_num
+

OOP/8.Iterators and Generators/Iterators and Generators - Exercise/07. Reader.py

@@ -0,0 +1,5 @@
+def read_next(*args):
+    for el in args:
+        for sub_el in el:
+            yield sub_el
+

OOP/8.Iterators and Generators/Iterators and Generators - Exercise/08. Prime Numbers.py

@@ -0,0 +1,11 @@
+def get_primes(integers):
+    for i in integers:
+        if i > 1:
+            prime = True
+            for n in range(2, i):
+                if i % n == 0:
+                    prime = False
+                    break
+            if prime:
+                yield i
+

OOP/8.Iterators and Generators/Iterators and Generators - Exercise/09. Possible permutations.py

@@ -0,0 +1,7 @@
+from itertools import permutations
+
+
+def possible_permutations(sequence: list):
+    for el in list(permutations(sequence)):
+        yield list(el)
+