mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-04-22 13:47:37 +00:00
Code Issues Packages Projects Releases Wiki Activity

Fixed code typo

Browse Source
This commit is contained in:
matheusfvesco 2023-10-03 16:44:42 -03:00
parent 5a220a2b38
commit 7a9cacda6d
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
data_structures/arrays/pairwise_iteration.py
View File

@ -69,7 +69,7 @@ def pairwise_iteration_comprehension(
"""
Generate pairs of elements from an iterable with a given step size.
This function uses list comprehensions to get the itens that are step
This function uses list comprehensions to get the items that are step
distance from each other and later the `iter()` conversion to create
two independent list iterators (`a` and `b`) from the input iterable.
The `next` function is used to offset the `b` iterator by one index,
@ -113,15 +113,15 @@ def pairwise_iteration_comprehension(
>>> list(pairwise_iteration_comprehension(['a'], step=1))
[]
"""
# creates a list, using list comprehensions, that only stores itens
# creates a list, using list comprehensions, that only stores items
# that are n steps apart from each other.
itens = [item for i, item in enumerate(iterable) if i % step == 0]
items = [item for i, item in enumerate(iterable) if i % step == 0]
# creates two independent list iterators (a and b) from the list
# we created earlier, using the iter() function. This means we can
# use next() on each one without affecting the other, no matter the
# iterable type
a, b = (iter(itens), iter(itens))
a, b = (iter(items), iter(items))
# Offsets the second iterator (b) by one step to create a staggered
# alignment.