Data science often involves working with datasets that are too large to fit comfortably into memory. Loading an entire dataset at once can be inefficient or even impossible. Python provides powerful constructs called iterators and generators to handle these situations gracefully, allowing data to be processed sequentially without needing to store everything upfront. This approach is fundamental to writing scalable and memory-efficient code for data analysis and machine learning pipelines.
At its core, an iterator is an object that represents a stream of data. It allows you to traverse through a sequence of items one by one. The mechanism behind iteration in Python is governed by the iterator protocol, which requires an object to implement two specific methods:
__iter__(): This method returns the iterator object itself. It's called when you start iterating over an object (e.g., at the beginning of a for loop).__next__(): This method returns the next item in the sequence. When there are no more items, it raises a StopIteration exception.Many built-in Python objects, like lists, tuples, dictionaries, and strings, are iterable. This means they have an __iter__() method that returns an iterator. You can get an iterator from an iterable using the built-in iter() function, and retrieve the next item using the next() function.
Let's see this in action with a simple list:
my_list = [10, 20, 30]
# Get an iterator object from the list
my_iterator = iter(my_list)
# Check the type
print(type(my_iterator))
# Output: <class 'list_iterator'>
# Retrieve items one by one using next()
print(next(my_iterator)) # Output: 10
print(next(my_iterator)) # Output: 20
print(next(my_iterator)) # Output: 30
# Trying to get another item raises StopIteration
try:
print(next(my_iterator))
except StopIteration:
print("No more items!")
# Output: No more items!
You rarely need to call iter() and next() directly like this. Python's for loop handles this process automatically behind the scenes. When you write:
for item in my_list:
print(item)
Python first calls iter(my_list) to get an iterator. Then, in each iteration, it calls next() on the iterator to get the next item and assigns it to item. The loop stops automatically when next() raises StopIteration. This makes iteration clean and intuitive.
While you can create custom iterators by defining a class with __iter__ and __next__ methods, Python offers a much more convenient way: generators.
A generator is a special kind of function that returns an iterator. Instead of using return to send back a value and exit, a generator function uses the yield keyword. When a generator function encounters yield, it pauses its execution at that point, sends the yielded value back to the caller, and saves its local state. The next time the iterator's next() method is called, the function resumes execution right after the yield statement, continuing until it hits another yield, completes, or encounters a return statement (which implicitly raises StopIteration).
Consider this simple generator function:
def count_up_to(n):
"""Generates numbers from 1 up to n."""
i = 1
while i <= n:
yield i # Pauses here, returns i, and waits
i += 1 # Resumes here on the next call to next()
print("Generator finished.") # This line runs after the last yield
# Create a generator object (calling the function doesn't run it yet)
counter_gen = count_up_to(3)
print(type(counter_gen))
# Output: <class 'generator'>
# Iterate using next()
print(next(counter_gen)) # Output: 1
print(next(counter_gen)) # Output: 2
print(next(counter_gen)) # Output: 3
# Next call raises StopIteration
try:
next(counter_gen)
except StopIteration:
print("Caught StopIteration as expected.")
# Output: Generator finished.
# Output: Caught StopIteration as expected.
# You can also use a for loop directly
print("\nUsing a for loop:")
for number in count_up_to(4):
print(number)
# Output:
# Using a for loop:
# 1
# 2
# 3
# 4
# Generator finished.
Notice how the "Generator finished." message appears only after the loop (or manual next() calls) has exhausted all yielded values.
Generators are particularly valuable in data science and machine learning for several reasons:
Memory Efficiency: This is the most significant advantage. Generators produce items one at a time and only when requested (lazy evaluation). They don't store the entire sequence in memory. Imagine processing a log file that's several gigabytes in size. Reading it line by line with a generator is feasible, whereas loading the whole file into a list would likely crash your program.
# Example: Processing a potentially large file line by line
def read_large_file(filepath):
"""Generator to read a file line by line."""
try:
with open(filepath, 'r') as f:
for line in f:
yield line.strip() # Process/yield one line at a time
except FileNotFoundError:
print(f"Error: File not found at {filepath}")
# Usage:
# for log_entry in read_large_file('huge_log_file.txt'):
# if 'ERROR' in log_entry:
# print(f"Found error: {log_entry}")
# This processes the file without loading it all into memory.
Lazy Evaluation: Computations are performed only when the value is needed. If you create a generator for a potentially infinite sequence or a very long one, you only pay the computational cost for the items you actually consume.
Composability: Generators can be chained together to create efficient data processing pipelines. The output of one generator can be the input to the next, with data flowing through the pipeline one item at a time.
def get_lines(filepath):
"""Yields lines from a file."""
with open(filepath, 'r') as f:
for line in f:
yield line
def extract_values(lines, column_index):
"""Yields values from a specific column (assuming CSV)."""
for line in lines:
parts = line.strip().split(',')
if len(parts) > column_index:
yield parts[column_index]
def convert_to_float(values):
"""Yields float conversions, skipping errors."""
for value in values:
try:
yield float(value)
except ValueError:
continue # Skip non-float values
# Example pipeline (assuming 'data.csv' exists)
# file_path = 'data.csv'
# lines_gen = get_lines(file_path)
# values_gen = extract_values(lines_gen, 2) # Get 3rd column
# floats_gen = convert_to_float(values_gen)
# Now you can process the floats one by one
# total = 0
# count = 0
# for val in floats_gen:
# total += val
# count += 1
# if count > 0:
# print(f"Average of column 2: {total / count}")
As mentioned briefly in the previous section on comprehensions, Python provides a concise syntax for creating simple generators on the fly: generator expressions. They look very much like list comprehensions but use parentheses () instead of square brackets [].
# List comprehension (creates the full list in memory)
squares_list = [x * x for x in range(10)]
print(squares_list)
# Output: [0, 1, 4, 9, 16, 25, 36, 49, 64, 81]
print(type(squares_list))
# Output: <class 'list'>
# Generator expression (creates a generator object)
squares_gen = (x * x for x in range(10))
print(squares_gen)
# Output: <generator object <genexpr> at 0x...> (address varies)
print(type(squares_gen))
# Output: <class 'generator'>
# You need to iterate to get the values
print(list(squares_gen)) # Convert to list to see values
# Output: [0, 1, 4, 9, 16, 25, 36, 49, 64, 81]
# Note: Once iterated, the generator is exhausted
print(list(squares_gen))
# Output: []
Generator expressions are excellent when you need an iterator for immediate use (like in a for loop or passing to a function like sum()), and the logic is simple enough to fit into a single expression. They offer the same memory benefits as generator functions.
# Summing squares without creating an intermediate list
total_sum_of_squares = sum(x * x for x in range(1000000))
print(f"Sum calculated efficiently: {total_sum_of_squares}")
By understanding and utilizing iterators and generators, you can write Python code that handles data streams and large sequences efficiently, a critical skill when preparing and processing data for machine learning models. They promote cleaner code by separating the logic of producing data from the logic of consuming it.
Was this section helpful?
yield keyword and its behavior in generator functions.© 2026 ApX Machine LearningEngineered with