%global debug_package %{nil} # header only lib Name: qsort Version: 0.2 Release: 1%{?dist} Summary: Quicksort implemented as a C macro License: MIT URL: https://github.com/svpv/qsort Source0: %{url}/archive/v%{version}/%{name}-%{version}.tar.gz # README.md cites MIT license but does not include it Source1: LICENSE BuildRequires: gcc-c++ Patch: enable_offline_test.patch %global _description %{expand: This is a traditional Quicksort implementation which for the most part follows Robert Sedgewick's 1978 paper. It is implemented as a C macro, which means that comparisons can be inlined. A distinctive feature of this implementation is that it works entirely on array indices, while actual access to the array elements is abstracted out with the `less` and `swap` primitives provided by the caller.} %description %{_description} %package devel Summary: %{summary} Provides: %{name}-static = %{version}-%{release} BuildArch: noarch %description devel %{_description} %prep %autosetup cp -a %{SOURCE1} LICENSE %check # tests/bench only work on x86_64 # patches are possible to work around this but beyond my programming experience leve to maintain %if "%{_arch}" == "x86_64" %{__make} bench %endif %build %install install -D -p qsort.h -t %{buildroot}%{_includedir}/ %files devel %license LICENSE %doc README.md %{_includedir}/%{name}.h %changelog * Sun Aug 21 2022 Jonathan Wright - 0.2-1 - Initial package build