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.2.tar.gz
(10.0 kB
view hashes)
Built Distribution
Close
Hashes for interval_search-0.1.2-py2.py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 9632f31016c4b64669352099a99b244e7423c544cc353318ea96ffb6212667c2 |
|
MD5 | cd985ac02d3aaf90c8dabf185f0bb699 |
|
BLAKE2b-256 | b0acc6232c25eedbfe3fa4ef79022ddcbccd7de931b0fd1767cac99dee715c61 |