interval-search provides predicate-based binary and doubling search implementations
Project description
interval-search
interval-search provides predicate-based binary and doubling search implementations
Free software: MIT license
Documentation: https://interval-search.readthedocs.io.
import interval_search as inch
# inch.binary_search
list_ = [1, 10, 20, 500, 5000]
binary_search(lambda x: list_[x] >= 20, 0, len(list_) - 1)
# -> 2
# inch.doubling_search
inch.doubling_search(lambda x: x >= 5) # -> 5
# with a lower bound to start searching at,
inch.doubling_search(lambda x: x >= 5, 10) # -> 10
Credits
This package was created with Cookiecutter and the audreyr/cookiecutter-pypackage project template.
History
0.0.0 (2022-02-22)
First release on PyPI.
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
interval-search-0.1.1.tar.gz
(9.2 kB
view hashes)
Built Distribution
Close
Hashes for interval_search-0.1.1-py2.py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 5fcc1cbd845c01a04947b11d3aaf2e80038de73762ef10d40afdb504158bd47c |
|
MD5 | 725047db80ea417aca7c3423715a0291 |
|
BLAKE2b-256 | c7089b23e5747f046eca11322541acfc40d8d8aef58a6d55e30a106b89fcc8d8 |