# -*- coding: utf-8; mode: tcl; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- vim:fenc=utf-8:ft=tcl:et:sw=4:ts=4:sts=4

PortSystem          1.0
PortGroup           R 1.0

R.setup             cran hsong1 PUlasso 3.2.5
revision            1
categories-append   math
maintainers         {@barracuda156 gmail.com:vital.had} openmaintainer
license             GPL-2
description         High-dimensional variable selection with presence-only data
long_description    Efficient algorithm for solving PU (Positive and Unlabeled) problem \
                    in low or high dimensional setting with lasso or group lasso penalty. \
                    The algorithm uses Maximization-Minorization and (block) coordinate descent. \
                    Sparse calculation and parallel computing are supported for the computational speed-up.
homepage            https://github.com/hsong1/PUlasso
checksums           rmd160  cd321f4f102b34dd28ff03b9cb6816575a8a04ef \
                    sha256  257cf5b8c69dcc225fc7fe1142beac18841f45ae73684b1539f4f6a8493fced3 \
                    size    313383

depends_lib-append  port:R-doParallel \
                    port:R-foreach \
                    port:R-ggplot2 \
                    port:R-Rcpp \
                    port:R-RcppEigen

depends_test-append port:R-knitr \
                    port:R-rmarkdown \
                    port:R-testthat

test.run            yes