diff options
Diffstat (limited to 'python-binary-search.spec')
| -rw-r--r-- | python-binary-search.spec | 207 |
1 files changed, 207 insertions, 0 deletions
diff --git a/python-binary-search.spec b/python-binary-search.spec new file mode 100644 index 0000000..d3cbbf6 --- /dev/null +++ b/python-binary-search.spec @@ -0,0 +1,207 @@ +%global _empty_manifest_terminate_build 0 +Name: python-binary-search +Version: 0.3.0 +Release: 1 +Summary: Binary search on python sorted sequences +License: MIT License +URL: https://github.com/LemonPi/python_binary_search +Source0: https://mirrors.nju.edu.cn/pypi/web/packages/6a/e8/120de6ce10e8912d4623a5750089a5c17d44f9b3dd60fb89ab5b2e0775a0/binary_search-0.3.0.tar.gz +BuildArch: noarch + + +%description +## Binary Search in Python + +Binary search on already sorted sequences (list, tuple) to get the first element `>=` or `>` +a value (similar to C++'s `std::lower_bound` and `std::upper_bound`). + +Requires python >=3.5 for the `typing` module and >= 3.4 for the `enum` module, but you can easily +extract the `search` function from `binary_search/__init__.py` if you need it for a lower version. + +## Install +1. `pip install binary-search` + +## Usage +See `tests.py` for more sample usage. +```python +import binary_search as bs + +sorted_sequence = (2, 5, 7, 9) +a = bs.search(sorted_sequence, 5) +print(a) # 1 - the index of the first element >= 5 + +b = bs.search(sorted_sequence, 6) +print(b) # 2 - the index of the first element >= 6 (element 2 with value 7) +``` + +You can also use a custom key in the same way as `sorted` +```python +import binary_search as bs +import random + +# sequence of 10 random pairs of integers +sequence = [(random.randint(), random.randint()) for _ in range(10)] +# sort and search just using the first integer +key = lambda pair: pair[0] + +sorted_sequence = sorted(sequence, key=key) +bs.search(sorted_sequence, [5, None], key=key) +``` + +## Development and testing +1. Fork the repository +2. Clone your fork +3. Install it in editable mode `pip install -e .` +4. Make any changes and add new tests to `tests.py` +5. Run pytest `python -m pytest` +6. Commit and push to your fork +7. Make pull request (merge your fork back to main repo) + +%package -n python3-binary-search +Summary: Binary search on python sorted sequences +Provides: python-binary-search +BuildRequires: python3-devel +BuildRequires: python3-setuptools +BuildRequires: python3-pip +%description -n python3-binary-search +## Binary Search in Python + +Binary search on already sorted sequences (list, tuple) to get the first element `>=` or `>` +a value (similar to C++'s `std::lower_bound` and `std::upper_bound`). + +Requires python >=3.5 for the `typing` module and >= 3.4 for the `enum` module, but you can easily +extract the `search` function from `binary_search/__init__.py` if you need it for a lower version. + +## Install +1. `pip install binary-search` + +## Usage +See `tests.py` for more sample usage. +```python +import binary_search as bs + +sorted_sequence = (2, 5, 7, 9) +a = bs.search(sorted_sequence, 5) +print(a) # 1 - the index of the first element >= 5 + +b = bs.search(sorted_sequence, 6) +print(b) # 2 - the index of the first element >= 6 (element 2 with value 7) +``` + +You can also use a custom key in the same way as `sorted` +```python +import binary_search as bs +import random + +# sequence of 10 random pairs of integers +sequence = [(random.randint(), random.randint()) for _ in range(10)] +# sort and search just using the first integer +key = lambda pair: pair[0] + +sorted_sequence = sorted(sequence, key=key) +bs.search(sorted_sequence, [5, None], key=key) +``` + +## Development and testing +1. Fork the repository +2. Clone your fork +3. Install it in editable mode `pip install -e .` +4. Make any changes and add new tests to `tests.py` +5. Run pytest `python -m pytest` +6. Commit and push to your fork +7. Make pull request (merge your fork back to main repo) + +%package help +Summary: Development documents and examples for binary-search +Provides: python3-binary-search-doc +%description help +## Binary Search in Python + +Binary search on already sorted sequences (list, tuple) to get the first element `>=` or `>` +a value (similar to C++'s `std::lower_bound` and `std::upper_bound`). + +Requires python >=3.5 for the `typing` module and >= 3.4 for the `enum` module, but you can easily +extract the `search` function from `binary_search/__init__.py` if you need it for a lower version. + +## Install +1. `pip install binary-search` + +## Usage +See `tests.py` for more sample usage. +```python +import binary_search as bs + +sorted_sequence = (2, 5, 7, 9) +a = bs.search(sorted_sequence, 5) +print(a) # 1 - the index of the first element >= 5 + +b = bs.search(sorted_sequence, 6) +print(b) # 2 - the index of the first element >= 6 (element 2 with value 7) +``` + +You can also use a custom key in the same way as `sorted` +```python +import binary_search as bs +import random + +# sequence of 10 random pairs of integers +sequence = [(random.randint(), random.randint()) for _ in range(10)] +# sort and search just using the first integer +key = lambda pair: pair[0] + +sorted_sequence = sorted(sequence, key=key) +bs.search(sorted_sequence, [5, None], key=key) +``` + +## Development and testing +1. Fork the repository +2. Clone your fork +3. Install it in editable mode `pip install -e .` +4. Make any changes and add new tests to `tests.py` +5. Run pytest `python -m pytest` +6. Commit and push to your fork +7. Make pull request (merge your fork back to main repo) + +%prep +%autosetup -n binary-search-0.3.0 + +%build +%py3_build + +%install +%py3_install +install -d -m755 %{buildroot}/%{_pkgdocdir} +if [ -d doc ]; then cp -arf doc %{buildroot}/%{_pkgdocdir}; fi +if [ -d docs ]; then cp -arf docs %{buildroot}/%{_pkgdocdir}; fi +if [ -d example ]; then cp -arf example %{buildroot}/%{_pkgdocdir}; fi +if [ -d examples ]; then cp -arf examples %{buildroot}/%{_pkgdocdir}; fi +pushd %{buildroot} +if [ -d usr/lib ]; then + find usr/lib -type f -printf "/%h/%f\n" >> filelist.lst +fi +if [ -d usr/lib64 ]; then + find usr/lib64 -type f -printf "/%h/%f\n" >> filelist.lst +fi +if [ -d usr/bin ]; then + find usr/bin -type f -printf "/%h/%f\n" >> filelist.lst +fi +if [ -d usr/sbin ]; then + find usr/sbin -type f -printf "/%h/%f\n" >> filelist.lst +fi +touch doclist.lst +if [ -d usr/share/man ]; then + find usr/share/man -type f -printf "/%h/%f.gz\n" >> doclist.lst +fi +popd +mv %{buildroot}/filelist.lst . +mv %{buildroot}/doclist.lst . + +%files -n python3-binary-search -f filelist.lst +%dir %{python3_sitelib}/* + +%files help -f doclist.lst +%{_docdir}/* + +%changelog +* Wed May 10 2023 Python_Bot <Python_Bot@openeuler.org> - 0.3.0-1 +- Package Spec generated |