Generators and Iterators are tools in Python used to handle data efficiently, especially large datasets.<\/p>\n\n\n\n
They allow you to process data one item at a time instead of loading everything into memory.<\/p>\n\n\n\n
This improves:<\/p>\n\n\n\n
Memory efficiency
Performance
Scalability<\/p>\n\n\n\n
An Iterator is an object that allows you to traverse (loop through) a collection one element at a time.<\/p>\n\n\n\n
An object is an iterator if it has:<\/p>\n\n\n\n
iter<\/strong>() Example:<\/p>\n\n\n\n Output:<\/p>\n\n\n\n 1 When elements finish, it raises StopIteration.<\/p>\n\n\n\n Iterator follows this process:<\/p>\n\n\n\n You can also create custom iterators.<\/p>\n\n\n\n Example:<\/p>\n\n\n\n A Generator is a simpler way to create iterators using the yield keyword.<\/p>\n\n\n\n Instead of writing iter<\/strong>() and next<\/strong>(), you use yield.<\/p>\n\n\n\n Example:<\/p>\n\n\n\n Generators automatically handle StopIteration.<\/p>\n\n\n\n return:<\/p>\n\n\n\n Ends function completely<\/p>\n\n\n\n yield:<\/p>\n\n\n\n Pauses function and remembers state This makes generators memory-efficient.<\/p>\n\n\n\n Similar to list comprehensions but use parentheses.<\/p>\n\n\n\n List comprehension (stores all values):<\/p>\n\n\n\n Generator expression (memory efficient):<\/p>\n\n\n\n Generator expressions do not store full list in memory.<\/p>\n\n\n\n They:<\/p>\n\n\n\n Use less memory Used in:<\/p>\n\n\n\n Reading large files Iterator:<\/p>\n\n\n\n More code Generator:<\/p>\n\n\n\n Short and simple Generators are easier and cleaner.<\/p>\n\n\n\n Reading large file line by line:<\/p>\n\n\n\n File objects are iterators. Large datasets Iterators allow sequential access to data. They are powerful tools for handling large data efficiently in Python.<\/p>\n\n\n
next<\/strong>()<\/p>\n\n\n\nnumbers = [1, 2, 3]
iterator = iter(numbers)print(next(iterator))
print(next(iterator))
print(next(iterator))<\/pre>\n\n\n\n
2
3<\/p>\n\n\n\nHow Iterators Work<\/h1>\n\n\n\n
\n
class Counter:
def __init__(self, limit):
self.limit = limit
self.current = 0 def __iter__(self):
return self def __next__(self):
if self.current < self.limit:
self.current += 1
return self.current
else:
raise StopIteration<\/pre>\n\n\n\nWhat is a Generator?<\/h1>\n\n\n\n
def count_up_to(limit):
for i in range(1, limit + 1):
yield igen = count_up_to(5)for num in gen:
print(num)<\/pre>\n\n\n\nYield vs Return<\/h1>\n\n\n\n
Resumes from where it left off<\/p>\n\n\n\nGenerator Expressions<\/h1>\n\n\n\n
numbers = [x*x for x in range(1000000)]<\/pre>\n\n\n\n
numbers = (x*x for x in range(1000000))<\/pre>\n\n\n\n
Why Generators Are Important<\/h1>\n\n\n\n
Handle large datasets efficiently
Improve performance
Support lazy evaluation<\/p>\n\n\n\n
Streaming data
Data pipelines
Big data processing<\/p>\n\n\n\nIterator vs Generator<\/h1>\n\n\n\n
Manual implementation
Requires iter<\/strong> and next<\/strong><\/p>\n\n\n\n
Uses yield
Automatically creates iterator<\/p>\n\n\n\nReal-World Example<\/h1>\n\n\n\n
with open(\"large_file.txt\") as file:
for line in file:
process(line)<\/pre>\n\n\n\n
They read one line at a time, not entire file.<\/p>\n\n\n\nWhen to Use Generators<\/h1>\n\n\n\n
Streaming data
Infinite sequences
Memory-sensitive applications<\/p>\n\n\n\nKey Takeaway<\/h1>\n\n\n\n
Generators are a simple and memory-efficient way to create iterators using yield.<\/p>\n\n\n\n