%global _empty_manifest_terminate_build 0
Name:		python-PyTrie
Version:	0.4.0
Release:	1
Summary:	A pure Python implementation of the trie data structure.
License:	BSD License
URL:		https://github.com/gsakkis/pytrie/
Source0:	https://mirrors.nju.edu.cn/pypi/web/packages/d3/19/15ec77ab9c85f7c36eb590d6ab7dd529f8c8516c0e2219f1a77a99d7ee77/PyTrie-0.4.0.tar.gz
BuildArch:	noarch


%description
# pytrie

`pytrie` is a a pure Python 3 implementation of the trie data structure.

A _trie_ is an ordered tree data structure that is used to store a mapping
where the keys are sequences, usually strings over an alphabet. In addition to
implementing the mapping interface, tries allow finding the items for a given
prefix, and vice versa, finding the items whose keys are prefixes of a given key.

To install run:

    pip install pytrie

Documentation is available at [Read the Docs](https://pytrie.readthedocs.io/).

## Changelog

### 0.4.0

* Drop Python 2 support

### 0.3.1

* Fixed iteritems/itervalues for SortedDicts in Python 2.7.

### 0.3

* Fixed bug for tries with zero-length keys.
* Added `__bool__` (`__nonzero__`) and `__cmp__` methods to `Trie`.
* Added `sortedcontainers` dependency.
* Linting.
* Converted from Mercurial to Git.

### 0.2

* Initial Python 3 support (thanks Dmitrijs Milajevs)

### 0.1

* Initial release

%package -n python3-PyTrie
Summary:	A pure Python implementation of the trie data structure.
Provides:	python-PyTrie
BuildRequires:	python3-devel
BuildRequires:	python3-setuptools
BuildRequires:	python3-pip
%description -n python3-PyTrie
# pytrie

`pytrie` is a a pure Python 3 implementation of the trie data structure.

A _trie_ is an ordered tree data structure that is used to store a mapping
where the keys are sequences, usually strings over an alphabet. In addition to
implementing the mapping interface, tries allow finding the items for a given
prefix, and vice versa, finding the items whose keys are prefixes of a given key.

To install run:

    pip install pytrie

Documentation is available at [Read the Docs](https://pytrie.readthedocs.io/).

## Changelog

### 0.4.0

* Drop Python 2 support

### 0.3.1

* Fixed iteritems/itervalues for SortedDicts in Python 2.7.

### 0.3

* Fixed bug for tries with zero-length keys.
* Added `__bool__` (`__nonzero__`) and `__cmp__` methods to `Trie`.
* Added `sortedcontainers` dependency.
* Linting.
* Converted from Mercurial to Git.

### 0.2

* Initial Python 3 support (thanks Dmitrijs Milajevs)

### 0.1

* Initial release

%package help
Summary:	Development documents and examples for PyTrie
Provides:	python3-PyTrie-doc
%description help
# pytrie

`pytrie` is a a pure Python 3 implementation of the trie data structure.

A _trie_ is an ordered tree data structure that is used to store a mapping
where the keys are sequences, usually strings over an alphabet. In addition to
implementing the mapping interface, tries allow finding the items for a given
prefix, and vice versa, finding the items whose keys are prefixes of a given key.

To install run:

    pip install pytrie

Documentation is available at [Read the Docs](https://pytrie.readthedocs.io/).

## Changelog

### 0.4.0

* Drop Python 2 support

### 0.3.1

* Fixed iteritems/itervalues for SortedDicts in Python 2.7.

### 0.3

* Fixed bug for tries with zero-length keys.
* Added `__bool__` (`__nonzero__`) and `__cmp__` methods to `Trie`.
* Added `sortedcontainers` dependency.
* Linting.
* Converted from Mercurial to Git.

### 0.2

* Initial Python 3 support (thanks Dmitrijs Milajevs)

### 0.1

* Initial release

%prep
%autosetup -n PyTrie-0.4.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-PyTrie -f filelist.lst
%dir %{python3_sitelib}/*

%files help -f doclist.lst
%{_docdir}/*

%changelog
* Tue Apr 11 2023 Python_Bot <Python_Bot@openeuler.org> - 0.4.0-1
- Package Spec generated