b9df14aef8
Cyclomatic complexity is a software metric (measurement), used to indicate the complexity of a program. It is a quantitative measure of the number of linearly independent paths through a program's source code. It was developed by Thomas J. McCabe, Sr. in 1976.
20 lines
548 B
Makefile
20 lines
548 B
Makefile
# $NetBSD: Makefile,v 1.1 2020/02/10 14:18:23 mef Exp $
|
|
|
|
R_PKGNAME= cyclocomp
|
|
R_PKGVER= 1.1.0
|
|
CATEGORIES= devel
|
|
|
|
MAINTAINER= pkgsrc-users@NetBSD.org
|
|
COMMENT= Cyclomatic Complexity of R Code
|
|
LICENSE= mit # + file LICENSE
|
|
|
|
DEPENDS+= R-callr>=3.4.1:../../devel/R-callr
|
|
DEPENDS+= R-crayon>=1.3.4:../../devel/R-crayon
|
|
DEPENDS+= R-desc>=1.2.0:../../devel/R-desc
|
|
DEPENDS+= R-remotes>=2.1.0:../../devel/R-remotes
|
|
DEPENDS+= R-withr>=2.1.2:../../devel/R-withr
|
|
|
|
USE_LANGUAGES= # none
|
|
|
|
.include "../../math/R/Makefile.extension"
|
|
.include "../../mk/bsd.pkg.mk"
|