File R-CTD.spec of Package R-CTD

# Automatically generated by CRAN2OBS
# 
# Spec file for package CTD 
# This file is auto-generated using information in the package source, 
# esp. Description and Summary. Improvements in that area should be 
# discussed with upstream. 
# 
# Copyright (c) 2024 SUSE LINUX GmbH, Nuernberg, Germany. 
# 
# All modifications and additions to the file contributed by third parties 
# remain the property of their copyright owners, unless otherwise agreed 
# upon. The license for this file, and modifications and additions to the 
# file, is the same license as for the pristine package itself (unless the 
# license for the pristine package is not an Open Source License, in which 
# case the license is the MIT License). An "Open Source License" is a 
# license that conforms to the Open Source Definition (Version 1.9) 
# published by the Open Source Initiative. 
#  
# Please submit bugfixes or comments via http://bugs.opensuse.org/ 
# 
 
%global packname  CTD 
%global rlibdir   %{_libdir}/R/library 
 
Name:           R-%{packname} 
Version:        1.3 
Release:        0 
Summary:        A Method for 'Connecting The Dots' in Weighted Graphs 
Group:          Development/Libraries/Other 
License:        MIT + file LICENSE 
URL:            http://cran.r-project.org/web/packages/%{packname} 
Source:         CTD_1.3.tar.gz 
Requires:       R-base 
Requires:	R-igraph
Requires:	R-cli
Requires:	R-lifecycle
Requires:	R-magrittr
Requires:	R-pkgconfig
Requires:	R-rlang
Requires:	R-vctrs
Requires:	R-cpp11
Requires:	R-glue
 
# %%if 0%%{?sle_version} > 120400 || 0%%{?is_opensuse} 
# # Three others commonly needed 
# BuildRequires:  tex(ae.sty) 
# BuildRequires:  tex(fancyvrb.sty) 
# BuildRequires:  tex(inconsolata.sty) 
# BuildRequires:  tex(natbib.sty) 
# %else 
# BuildRequires:  texlive 
# %endif 
# BuildRequires:  texinfo 
BuildRequires:  fdupes 
BuildRequires:  R-base 
BuildRequires: 	R-igraph
BuildRequires: 	R-cli
BuildRequires: 	R-lifecycle
BuildRequires: 	R-magrittr
BuildRequires: 	R-pkgconfig
BuildRequires: 	R-rlang
BuildRequires: 	R-vctrs
BuildRequires: 	R-cpp11-devel
BuildRequires: 	R-glue
 
Suggests:	R-knitr
Suggests:	R-rmarkdown
Suggests:	R-huge
Suggests:	R-ggplot2
Suggests:	R-gplots
Suggests:	R-RColorBrewer
Suggests:	R-testthat
%description 
A method for pattern discovery in weighted graphs as outlined in 
Thistlethwaite et al. (2021) <doi:10.1371/journal.pcbi.1008550>. Two 
use cases are achieved: 1) Given a weighted graph and a subset of its 
nodes, do the nodes show significant connectedness? 2) Given a weighted 
graph and two subsets of its nodes, are the subsets close neighbors or 
distant? 
 
%prep 
%setup -q -c -n %{packname} 
# the next line is needed, because we build without --clean in between two packages 
rm -rf ~/.R  
 
 
%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 
%fdupes -s %{buildroot}%{rlibdir} 
 
#%%check 
#%%{_bindir}/R CMD check %%{packname} 
 
%files 
%dir %{rlibdir}/%{packname} 
%{rlibdir}/%{packname}/CITATION
%doc %{rlibdir}/%{packname}/DESCRIPTION
%{rlibdir}/%{packname}/INDEX
%license %{rlibdir}/%{packname}/LICENSE
%{rlibdir}/%{packname}/Meta
%{rlibdir}/%{packname}/NAMESPACE
%doc %{rlibdir}/%{packname}/NEWS
%{rlibdir}/%{packname}/R
%{rlibdir}/%{packname}/data
%{rlibdir}/%{packname}/doc
%doc %{rlibdir}/%{packname}/help
%doc %{rlibdir}/%{packname}/html
 
%changelog