From 344d94030dd0079edf5ca024c6119fd2c4e76658 Mon Sep 17 00:00:00 2001
From: CoprDistGit <infra@openeuler.org>
Date: Mon, 10 Apr 2023 12:48:40 +0000
Subject: automatic import of python-fastdtw

---
 .gitignore          |  1 +
 python-fastdtw.spec | 76 +++++++++++++++++++++++++++++++++++++++++++++++++++++
 sources             |  1 +
 3 files changed, 78 insertions(+)
 create mode 100644 python-fastdtw.spec
 create mode 100644 sources

diff --git a/.gitignore b/.gitignore
index e69de29..8e8248f 100644
--- a/.gitignore
+++ b/.gitignore
@@ -0,0 +1 @@
+/fastdtw-0.3.4.tar.gz
diff --git a/python-fastdtw.spec b/python-fastdtw.spec
new file mode 100644
index 0000000..ef00fd8
--- /dev/null
+++ b/python-fastdtw.spec
@@ -0,0 +1,76 @@
+%global _empty_manifest_terminate_build 0
+Name:		python-fastdtw
+Version:	0.3.4
+Release:	1
+Summary:	Dynamic Time Warping (DTW) algorithm with an O(N) time and memory complexity.
+License:	MIT
+URL:		https://github.com/slaypni/fastdtw
+Source0:	https://mirrors.nju.edu.cn/pypi/web/packages/99/43/30f2d8db076f216b15c10db663b46e22d1750b1ebacd7af6e62b83d6ab98/fastdtw-0.3.4.tar.gz
+BuildArch:	noarch
+
+Requires:	python3-numpy
+
+%description
+Python implementation of `FastDTW
+<http://cs.fit.edu/~pkc/papers/tdm04.pdf>`_ [1]_, which is an approximate Dynamic Time Warping (DTW) algorithm that provides optimal or near-optimal alignments with an O(N) time and memory complexity.
+
+%package -n python3-fastdtw
+Summary:	Dynamic Time Warping (DTW) algorithm with an O(N) time and memory complexity.
+Provides:	python-fastdtw
+BuildRequires:	python3-devel
+BuildRequires:	python3-setuptools
+BuildRequires:	python3-pip
+%description -n python3-fastdtw
+Python implementation of `FastDTW
+<http://cs.fit.edu/~pkc/papers/tdm04.pdf>`_ [1]_, which is an approximate Dynamic Time Warping (DTW) algorithm that provides optimal or near-optimal alignments with an O(N) time and memory complexity.
+
+%package help
+Summary:	Development documents and examples for fastdtw
+Provides:	python3-fastdtw-doc
+%description help
+Python implementation of `FastDTW
+<http://cs.fit.edu/~pkc/papers/tdm04.pdf>`_ [1]_, which is an approximate Dynamic Time Warping (DTW) algorithm that provides optimal or near-optimal alignments with an O(N) time and memory complexity.
+
+%prep
+%autosetup -n fastdtw-0.3.4
+
+%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-fastdtw -f filelist.lst
+%dir %{python3_sitelib}/*
+
+%files help -f doclist.lst
+%{_docdir}/*
+
+%changelog
+* Mon Apr 10 2023 Python_Bot <Python_Bot@openeuler.org> - 0.3.4-1
+- Package Spec generated
diff --git a/sources b/sources
new file mode 100644
index 0000000..0327c20
--- /dev/null
+++ b/sources
@@ -0,0 +1 @@
+03804669ea21e5a91ca06d39dc1908ec  fastdtw-0.3.4.tar.gz
-- 
cgit v1.2.3