next() Function Complexity¶

The next() function retrieves the next item from an iterator by calling its __next__() method.

Complexity Reference¶

Operation	Time	Space	Notes
`next(iterator)`	O(1)*	O(1)	Get next item from iterator
`next(iterator, default)`	O(1)*	O(1)	Get next or return default

*O(1) for list/tuple/range iterators; filter/map iterators may skip items (O(k) where k items filtered)

Basic Usage¶

Getting Next Item¶

# Create iterator - O(1)
it = iter([1, 2, 3])  # O(1)

# Get next items - O(1) each
item1 = next(it)  # 1 - O(1)
item2 = next(it)  # 2 - O(1)
item3 = next(it)  # 3 - O(1)

# next() raises StopIteration when exhausted
try:
    item4 = next(it)  # Raises StopIteration
except StopIteration:
    print("Iterator exhausted")

Using Default Value¶

# Use default to avoid exception - O(1)
it = iter([1, 2, 3])

next(it)  # 1
next(it)  # 2
next(it)  # 3
item = next(it, "END")  # "END" - returns default, no exception

# Useful for safe iteration
value = next(iterator, None)  # Returns None if exhausted

Manual Iterator Control¶

Step Through Sequences¶

# Manually iterate - O(1) per step
it = iter("hello")

first = next(it)   # 'h' - O(1)
second = next(it)  # 'e' - O(1)
third = next(it)   # 'l' - O(1)

# Continue with rest
for char in it:  # O(1) each
    print(char)  # 'l', 'o'

Mixing Manual and For Loop¶

# Get first item manually
it = iter([10, 20, 30, 40])
first = next(it)  # 10 - O(1)

# Process rest in for loop
for item in it:  # O(1) each iteration
    print(item)  # 20, 30, 40

Generator Functions¶

Generators and next()¶

# Generator function
def count_up(max):
    i = 0
    while i < max:
        yield i
        i += 1

# Create generator - O(1)
gen = count_up(3)  # O(1)

# Use next() to step through - O(1) per step
val1 = next(gen)  # 0 - O(1)
val2 = next(gen)  # 1 - O(1)
val3 = next(gen)  # 2 - O(1)

try:
    val4 = next(gen)  # Raises StopIteration
except StopIteration:
    print("Done")

Performance Considerations¶

next() vs Indexing¶

# For lists, direct indexing is simpler
lst = [1, 2, 3, 4, 5]

# Using next() - O(1) per call
it = iter(lst)
next(it)  # O(1)
next(it)  # O(1)

# Direct indexing - O(1)
lst[0]  # O(1)
lst[1]  # O(1)

# Prefer indexing for lists; next() for iterators

Generator Memory¶

# Generator with next() - O(1) memory
def infinite_counter():
    i = 0
    while True:
        yield i
        i += 1

gen = infinite_counter()
val1 = next(gen)  # O(1) memory
val2 = next(gen)  # O(1) memory
val3 = next(gen)  # O(1) memory

# vs. list - O(n) memory
lst = list(range(1000000))  # O(n) memory!

Version Notes¶

Python 2.x: next() function available; iterator.next() method also works
Python 3.x: next() function standard; iterator.next() removed
All versions: Iterator protocol with __next__() method

iter() - Create iterator from iterable
for loop - Iterate using next() internally
zip() - Combine multiple iterators
enumerate() - Iterator with index

Best Practices¶

✅ Do:

Use for loops for normal iteration
Use next() with default to avoid exceptions
Use next() for special iterator control
Use generator functions with next() for lazy evaluation

❌ Avoid:

Calling next() without handling StopIteration
Using next() when for loop is clearer
Assuming next() is faster than for loops (it's not)
Calling next() on non-iterators (raises TypeError)