Qwery List
Welcome to Qwery List (or qwlist for short) - the Python library that puts the "fun" back in functional programming
by bringing Rust-style iterators to Python!
Qwery List introduces a new way to work with lists and iterators, leveraging lazy evaluation to improve efficiency
while keeping your code clean and readable.
Why choose Qwery List?
In Python, we're accustomed to using list comprehensions and generators for lazy evaluation.
Let's explore why Qwery List might just become your new best friend.
Consider a simple scenario: converting a list of strings to integers, filtering even numbers, and summing them up.
Traditionally, you might write:
nums = ['1', '2', '3', '4', '5', '6', '7']
s = sum([int(n) for n in nums if int(n) % 2 == 0])
Notice the repeated use of int()
. Sure, casting to int is quick, but what if you were running a time-consuming
function? You might turn to map
and filter
:
mapped_data = map(long_taking_operation, data)
filtered_data = filter(lambda x: x % 2 == 0, mapped_data)
s = sum(filtered_data)
This approach is better but introduces readability challenges, especially when chaining operations:
s = sum(filter(lambda x: x % 2 == 0, map(long_taking_operation, data)))
Readable? Barely. Maintainable? Questionable. Enter Qwery List!
nums = QList(['1', '2', '3', '4', '5', '6', '7'])
s = nums.map(long_taking_operation).filter(lambda x: x % 2 == 0).sum()
Not only does this look cleaner, but it also flows naturally from left to right.
From simple to sophisticated
The previous example was straightforward, and you might stick to Python's built-in tools for such cases.
But when dealing with more advanced scenarios, Qwery List truly shines. Let’s see it in action:
teams_df = pd.DataFrame()
allowed_teams = ['Team A', 'Rascals', 'True Pythonists']
batches = (
Lazy(teams_df.iterrows())
.map(lambda pair: pair[1])
.map(lambda row: (row['team_name'], row['team_id']))
.filter(lambda pair: pair[0] in allowed_teams)
.batch(20)
)
Here, we used Lazy
instead of QList
. Why? While QList
is an extension of Python's standard list
,
Lazy
introduces true lazy evaluation. Operations are only computed when needed, and even the creation of the
iterator is deferred.
Consider this infinite prime number generator:
def naturals(start: int):
current = start
while True:
yield current
current += 1
primes = Lazy(naturals(2)).filter(
lambda n: Lazy(naturals(2))
.take_while(lambda p: p * p <= n)
.all(lambda x: n % x != 0)
)
Yes, that’s an infinite iterator. And no, it won’t crash your program (unless you ask it for infinite
output - then all bets are off). It elegantly showcases how Qwery List handles infinite iterators with grace.
Overview of some of the unique methods
Qwery List not only allows you to use some of the standard Python built-in functions in a fluent way but also
offers a range of unique methods that elevate your programming game. Here's a quick overview:
Boolean Quantifiers
Both QList
and Lazy
have any
and all
methods, making it easy to evaluate boolean conditions across elements.
Lazy([True, True, False]).all()
Lazy([True, True, False]).any()
Lazy([2, 4, 6]).all(lambda x: x % 2 == 0)
Math Operations: max
and min
Find the maximum or minimum value of an iterable with or without a custom key function:
Lazy([1, 2, 3, 4]).max()
Lazy([1, 2, 3, 4]).min()
Lazy([1, 2, 3, 4]).max(key=lambda x: abs(3 - x))
Chaining iterators
Qwery List allows you to seamlessly chain finite and infinite iterators.
primes = Lazy(naturals(2)).filter(
lambda n: Lazy(naturals(2))
.take_while(lambda p: p * p <= n)
.all(lambda x: n % x != 0)
)
chained = Lazy([0, 0, 0]).chain(primes)
Sorting capabilities
Qwery List offers a new sorted
and merge
methods which come in handy for dealing with ordered data.
sorted_list = QList([2, 5, 3, 1, 4]).sorted()
merged_list = QList([1, 2, 5, 7, 8]).merge([3, 4, 6, 9], lambda left, right: left < right).collect()
Grouping capabilities
Query List offers a bunch of grouping capabilities such as window
, batch
, batch_by
, group_by
.
QList([1, 2, 3, 4, 5]).window(2).collect()
QList([1, 2, 3, 4, 5]).batch(2).collect()
QList(['a1', 'b1', 'b2', 'a2', 'a3', 'b3']).batch_by(lambda s: s[0]).collect()
QList(['a1', 'b1', 'b2', 'a2', 'a3', 'b3']).group_by(lambda s: s[0]).collect()
Pure functional style
Qwery List offers methods such as fold
, flat_fold
and uncons
that are well known from functional languages.
head, tail = Lazy([1, 2, 3, 4]).uncons()
from typing import List, Dict, TypeVar
K = TypeVar('K')
V = TypeVar('V')
def update_dict(data: Dict[K, List[V]], key: K, value: V) -> Dict[K, List[V]]:
if key in data:
data[key].append(value)
else:
data[key] = [value]
return data
values = QList([('name', 'Alex'), ('country', 'Poland'), ('name', 'David')])
data = values.fold(lambda acc, x: update_dict(acc, *x), {})
QList([2, 3]).flat_fold(lambda acc, x: [acc + x, acc * x], 1).collect()
Installation
This package is available on PyPI
pip install qwlist
Versioning
Starting with version 2.0.0, qwlist
uses the new generic syntax introduced in Python 3.12.
This change introduces a breaking change for compatibility with older Python versions.
For Python versions earlier than 3.12, please use qwlist
version 1.5.0 or older.
python version | compatible qwlist version |
---|
>= 3.12 | >= 2.0.0 |
3.9 - 3.11 | <= 1.5.0 |
Side note
This syntax resembles Rust syntax:
Rust | Python |
---|
let xs = vec![1, 2, 3, 4];
let double_xs: Vec<i32> = xs
.iter()
.map(|&x| x * 2)
.collect();
println!("{double_xs:?}");
|
xs = QList([1, 2, 3, 4])
double_xs = (
xs
.map(lambda x: x * 2)
.collect()
)
print(double_xs)
|