A Python implementation of LINQ
Project description
Querpyable
A Python implementation of LINQ
:bulb: Example
# Calculating the first 10000 primes
Queryable \
.range(2, 1_000_000) \
.where(lambda n: all(n % i != 0 for i in range(2, int(n ** 0.5) + 1))) \
.take(10000)
:cd: Installation
pip install querpyable
In order to locally set up the project please follow the instructions below:
# Set up the GitHub repository
git clone https://github.com/billsioros/querpyable
# Create a virtual environment using poetry and install the required dependencies
poetry shell
poetry install
# Install pre-commit hooks
pre-commit install --install-hooks
pre-commit autoupdate
:book: Documentation
The project's documentation can be found here.
:heart: Support the project
Feel free to Buy me a coffee! ☕.
:sparkles: Contributing
If you would like to contribute to the project, please go through the Contributing Guidelines first.
:label: Credits
This project was generated with billsioros/cookiecutter-pypackage
cookiecutter template.
Project details
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
querpyable-2.0.3.tar.gz
(9.2 kB
view hashes)
Built Distribution
Close
Hashes for querpyable-2.0.3-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 4d095b61514ad4e842cde88151735f3a112aaa43712b63f0ee1b62273e86e1a6 |
|
MD5 | 4e01edbf24c05ef55924116d38913792 |
|
BLAKE2b-256 | 129976975e8339ecfbda259717e40697fc869f209aa301f803e2b989e6ab23f7 |