{"added":null,"apiVersion":1,"behindSince":null,"buildDepends":[],"categories":["devel"],"comment":"Cyclomatic Complexity of R Code","compare":null,"dependentCount":null,"description":"Cyclomatic complexity is a software metric (measurement), used to indicate the\ncomplexity of a program. It is a quantitative measure of the number of linearly\nindependent paths through a program's source code. It was developed by Thomas\nJ. McCabe, Sr. in 1976.","flavors":[],"html":"https://daemonports.org/midnightbsd/devel/R-cran-cyclocomp/","kind":"port","lastUpdate":null,"license":["mit"],"maintainer":"ports@MidnightBSD.org","name":"cyclocomp","newest":false,"newestVersion":"1.1.2","noVulnData":true,"origin":"devel/R-cran-cyclocomp","otherSystems":[{"maintainer":"uzsolt@FreeBSD.org","newest":true,"origin":"devel/R-cran-cyclocomp","path":"/devel/R-cran-cyclocomp/","system":"FreeBSD","version":"1.1.2"},{"maintainer":"uzsolt@FreeBSD.org","origin":"devel/R-cran-cyclocomp","path":"/dragonfly/devel/R-cran-cyclocomp/","system":"DragonFly","version":"1.1.1"},{"maintainer":"uzsolt@FreeBSD.org","newest":true,"noVulnData":true,"origin":"devel/R-cran-cyclocomp","path":"","system":"HardenedBSD","version":"1.1.2"},{"maintainer":"uzsolt@FreeBSD.org","newest":true,"noVulnData":true,"origin":"devel/R-cran-cyclocomp","path":"","system":"GhostBSD","version":"1.1.2"}],"packages":null,"pkgName":"cyclocomp-1.1.1","related":null,"repository":"mports","requiredBy":["devel/R-cran-lintr"],"requiredByCount":1,"runDepends":["devel/R-cran-callr","devel/R-cran-crayon","devel/R-cran-desc","devel/R-cran-remotes","devel/R-cran-withr"],"status":null,"system":"midnightbsd","systemLabel":"MidnightBSD","version":"1.1.1","versions":null,"vulnerabilities":null,"www":"https://github.com/gaborcsardi/cyclocomp"}