diff options
| -rw-r--r-- | .gitignore | 1 | ||||
| -rw-r--r-- | python-blist.spec | 135 | ||||
| -rw-r--r-- | sources | 1 |
3 files changed, 137 insertions, 0 deletions
@@ -0,0 +1 @@ +/blist-1.3.6.tar.gz diff --git a/python-blist.spec b/python-blist.spec new file mode 100644 index 0000000..9d539a0 --- /dev/null +++ b/python-blist.spec @@ -0,0 +1,135 @@ +%global _empty_manifest_terminate_build 0 +Name: python-blist +Version: 1.3.6 +Release: 1 +Summary: a list-like type with better asymptotic performance and similar performance on small lists +License: BSD +URL: http://stutzbachenterprises.com/blist/ +Source0: https://mirrors.nju.edu.cn/pypi/web/packages/6b/a8/dca5224abe81ccf8db81f8a2ca3d63e7a5fa7a86adc198d4e268c67ce884/blist-1.3.6.tar.gz +BuildArch: noarch + + +%description +The ``blist`` is a drop-in replacement for the Python list that provides +better performance when modifying large lists. The blist package also +provides ``sortedlist``, ``sortedset``, ``weaksortedlist``, +``weaksortedset``, ``sorteddict``, and ``btuple`` types. +Full documentation is at the link below: +http://stutzbachenterprises.com/blist-doc/ +Python's built-in list is a dynamically-sized array; to insert or +remove an item from the beginning or middle of the list, it has to +move most of the list in memory, i.e., O(n) operations. The blist +uses a flexible, hybrid array/tree structure and only needs to move a +small portion of items in memory, specifically using O(log n) +operations. +For small lists, the blist and the built-in list have virtually +identical performance. +To use the blist, you simply change code like this: +>>> items = [5, 6, 2] +>>> more_items = function_that_returns_a_list() +to: +>>> from blist import blist +>>> items = blist([5, 6, 2]) +>>> more_items = blist(function_that_returns_a_list()) +Here are some of the use cases where the blist asymptotically + +%package -n python3-blist +Summary: a list-like type with better asymptotic performance and similar performance on small lists +Provides: python-blist +BuildRequires: python3-devel +BuildRequires: python3-setuptools +BuildRequires: python3-pip +%description -n python3-blist +The ``blist`` is a drop-in replacement for the Python list that provides +better performance when modifying large lists. The blist package also +provides ``sortedlist``, ``sortedset``, ``weaksortedlist``, +``weaksortedset``, ``sorteddict``, and ``btuple`` types. +Full documentation is at the link below: +http://stutzbachenterprises.com/blist-doc/ +Python's built-in list is a dynamically-sized array; to insert or +remove an item from the beginning or middle of the list, it has to +move most of the list in memory, i.e., O(n) operations. The blist +uses a flexible, hybrid array/tree structure and only needs to move a +small portion of items in memory, specifically using O(log n) +operations. +For small lists, the blist and the built-in list have virtually +identical performance. +To use the blist, you simply change code like this: +>>> items = [5, 6, 2] +>>> more_items = function_that_returns_a_list() +to: +>>> from blist import blist +>>> items = blist([5, 6, 2]) +>>> more_items = blist(function_that_returns_a_list()) +Here are some of the use cases where the blist asymptotically + +%package help +Summary: Development documents and examples for blist +Provides: python3-blist-doc +%description help +The ``blist`` is a drop-in replacement for the Python list that provides +better performance when modifying large lists. The blist package also +provides ``sortedlist``, ``sortedset``, ``weaksortedlist``, +``weaksortedset``, ``sorteddict``, and ``btuple`` types. +Full documentation is at the link below: +http://stutzbachenterprises.com/blist-doc/ +Python's built-in list is a dynamically-sized array; to insert or +remove an item from the beginning or middle of the list, it has to +move most of the list in memory, i.e., O(n) operations. The blist +uses a flexible, hybrid array/tree structure and only needs to move a +small portion of items in memory, specifically using O(log n) +operations. +For small lists, the blist and the built-in list have virtually +identical performance. +To use the blist, you simply change code like this: +>>> items = [5, 6, 2] +>>> more_items = function_that_returns_a_list() +to: +>>> from blist import blist +>>> items = blist([5, 6, 2]) +>>> more_items = blist(function_that_returns_a_list()) +Here are some of the use cases where the blist asymptotically + +%prep +%autosetup -n blist-1.3.6 + +%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-blist -f filelist.lst +%dir %{python3_sitelib}/* + +%files help -f doclist.lst +%{_docdir}/* + +%changelog +* Tue Apr 11 2023 Python_Bot <Python_Bot@openeuler.org> - 1.3.6-1 +- Package Spec generated @@ -0,0 +1 @@ +a538f1a24b9191e3c40252e9397408a9 blist-1.3.6.tar.gz |