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 init
git config --local user.name Vasilis Sioros
git config --local user.email billsioros97@gmail.com
git add .
git commit -m "feat: initial commit"
git remote add origin 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
: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.0.tar.gz
(7.8 kB
view hashes)
Built Distribution
Close
Hashes for querpyable-2.0.0-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 85d912ebe706bc6eb7fdde195748ca13b5a0a1e13de666c0befa9313fbe7b3ea |
|
MD5 | f9eac5f406268849fb22f92b9d2727f7 |
|
BLAKE2b-256 | 657daee580c31c8bad7281aa87d32540605bbcdd0dcb0a6c5c68f5f187c457a3 |