%global __brp_check_rpaths %{nil} %global __requires_exclude ^libmpi %global packname seqtrie %global packver 0.2.8 %global rlibdir /usr/local/lib/R/library Name: R-CRAN-%{packname} Version: 0.2.8 Release: 1%{?dist}%{?buildtag} Summary: Radix Tree and Trie-Based String Distances License: GPL-3 URL: https://cran.r-project.org/package=%{packname} Source0: %{url}&version=%{packver}#/%{packname}_%{packver}.tar.gz BuildRequires: R-devel >= 3.5.0 Requires: R-core >= 3.5.0 BuildRequires: R-CRAN-RcppParallel >= 5.1.3 BuildRequires: R-CRAN-Rcpp >= 0.12.18.3 BuildRequires: R-CRAN-R6 BuildRequires: R-CRAN-rlang BuildRequires: R-CRAN-dplyr BuildRequires: R-CRAN-stringi BuildRequires: R-CRAN-BH Requires: R-CRAN-RcppParallel >= 5.1.3 Requires: R-CRAN-Rcpp >= 0.12.18.3 Requires: R-CRAN-R6 Requires: R-CRAN-rlang Requires: R-CRAN-dplyr Requires: R-CRAN-stringi %description A collection of Radix Tree and Trie algorithms for finding similar sequences and calculating sequence distances (Levenshtein and other distance metrics). This work was inspired by a trie implementation in Python: "Fast and Easy Levenshtein distance using a Trie." Hanov (2011) . %prep %setup -q -c -n %{packname} # fix end of executable files find -type f -executable -exec grep -Iq . {} \; -exec sed -i -e '$a\' {} \; # prevent binary stripping [ -d %{packname}/src ] && find %{packname}/src -type f -exec \ sed -i 's@/usr/bin/strip@/usr/bin/true@g' {} \; || true [ -d %{packname}/src ] && find %{packname}/src/Make* -type f -exec \ sed -i 's@-g0@@g' {} \; || true # don't allow local prefix in executable scripts find -type f -executable -exec sed -Ei 's@#!( )*/usr/local/bin@#!/usr/bin@g' {} \; %build %install mkdir -p %{buildroot}%{rlibdir} %{_bindir}/R CMD INSTALL -l %{buildroot}%{rlibdir} %{packname} test -d %{packname}/src && (cd %{packname}/src; rm -f *.o *.so) rm -f %{buildroot}%{rlibdir}/R.css # remove buildroot from installed files find %{buildroot}%{rlibdir} -type f -exec sed -i "s@%{buildroot}@@g" {} \; %files %{rlibdir}/%{packname}