From owner-svn-ports-all@freebsd.org Sun Aug 9 07:33:36 2015 Return-Path: Delivered-To: svn-ports-all@mailman.ysv.freebsd.org Received: from mx1.freebsd.org (mx1.freebsd.org [IPv6:2001:1900:2254:206a::19:1]) by mailman.ysv.freebsd.org (Postfix) with ESMTP id 1608C99D927; Sun, 9 Aug 2015 07:33:36 +0000 (UTC) (envelope-from tota@FreeBSD.org) Received: from repo.freebsd.org (repo.freebsd.org [IPv6:2001:1900:2254:2068::e6a:0]) (using TLSv1.2 with cipher ECDHE-RSA-AES256-GCM-SHA384 (256/256 bits)) (Client did not present a certificate) by mx1.freebsd.org (Postfix) with ESMTPS id E747F1FB2; Sun, 9 Aug 2015 07:33:35 +0000 (UTC) (envelope-from tota@FreeBSD.org) Received: from repo.freebsd.org ([127.0.1.70]) by repo.freebsd.org (8.15.2/8.15.2) with ESMTP id t797XZtT027923; Sun, 9 Aug 2015 07:33:35 GMT (envelope-from tota@FreeBSD.org) Received: (from tota@localhost) by repo.freebsd.org (8.15.2/8.15.2/Submit) id t797XYEA027919; Sun, 9 Aug 2015 07:33:34 GMT (envelope-from tota@FreeBSD.org) Message-Id: <201508090733.t797XYEA027919@repo.freebsd.org> X-Authentication-Warning: repo.freebsd.org: tota set sender to tota@FreeBSD.org using -f From: TAKATSU Tomonari Date: Sun, 9 Aug 2015 07:33:34 +0000 (UTC) To: ports-committers@freebsd.org, svn-ports-all@freebsd.org, svn-ports-head@freebsd.org Subject: svn commit: r393764 - in head/devel: . R-cran-bit X-SVN-Group: ports-head MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit X-BeenThere: svn-ports-all@freebsd.org X-Mailman-Version: 2.1.20 Precedence: list List-Id: SVN commit messages for the ports tree List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Sun, 09 Aug 2015 07:33:36 -0000 Author: tota Date: Sun Aug 9 07:33:33 2015 New Revision: 393764 URL: https://svnweb.freebsd.org/changeset/ports/393764 Log: - Add new port: devel/R-cran-bit bitmapped vectors of booleans (no NAs), coercion from and to logicals, integers and integer subscripts; fast boolean operators and fast summary statistics. With 'bit' vectors you can store true binary booleans {FALSE,TRUE} at the expense of 1 bit only, on a 32 bit architecture this means factor 32 less RAM and ~ factor 32 more speed on boolean operations. Due to overhead of R calls, actual speed gain depends on the size of the vector: expect gains for vectors of size > 10000 elements. Even for one-time boolean operations it can pay-off to convert to bit, the pay-off is obvious, when such components are used more than once. Reading from and writing to bit is approximately as fast as accessing standard logicals - mostly due to R's time for memory allocation. The package allows to work with pre-allocated memory for return values by calling .Call() directly: when evaluating the speed of C-access with pre-allocated vector memory, coping from bit to logical requires only 70% of the time for copying from logical to logical; and copying from logical to bit comes at a performance penalty of 150%. the package now contains further classes for representing logical selections: 'bitwhich' for very skewed selections and 'ri' for selecting ranges of values for chunked processing. All three index classes can be used for subsetting 'ff' objects (ff-2.1-0 and higher). WWW: https://cran.r-project.org/web/packages/bit/ Added: head/devel/R-cran-bit/ head/devel/R-cran-bit/Makefile (contents, props changed) head/devel/R-cran-bit/distinfo (contents, props changed) head/devel/R-cran-bit/pkg-descr (contents, props changed) Modified: head/devel/Makefile Modified: head/devel/Makefile ============================================================================== --- head/devel/Makefile Sun Aug 9 06:57:11 2015 (r393763) +++ head/devel/Makefile Sun Aug 9 07:33:33 2015 (r393764) @@ -12,6 +12,7 @@ SUBDIR += R-cran-Hmisc SUBDIR += R-cran-RUnit SUBDIR += R-cran-Rcpp + SUBDIR += R-cran-bit SUBDIR += R-cran-bitops SUBDIR += R-cran-caTools SUBDIR += R-cran-caret Added: head/devel/R-cran-bit/Makefile ============================================================================== --- /dev/null 00:00:00 1970 (empty, because file is newly added) +++ head/devel/R-cran-bit/Makefile Sun Aug 9 07:33:33 2015 (r393764) @@ -0,0 +1,16 @@ +# Created by: TAKATSU Tomonari +# $FreeBSD$ + +PORTNAME= bit +DISTVERSION= 1.1-12 +CATEGORIES= devel +DISTNAME= ${PORTNAME}_${DISTVERSION} + +MAINTAINER= tota@FreeBSD.org +COMMENT= Class for vectors of 1-bit booleans + +LICENSE= GPLv2 + +USES= cran:auto-plist + +.include Added: head/devel/R-cran-bit/distinfo ============================================================================== --- /dev/null 00:00:00 1970 (empty, because file is newly added) +++ head/devel/R-cran-bit/distinfo Sun Aug 9 07:33:33 2015 (r393764) @@ -0,0 +1,2 @@ +SHA256 (bit_1.1-12.tar.gz) = ce281c87fb7602bf1a599e72f3e25f9ff7a13e390c124a4506087f69ad79d128 +SIZE (bit_1.1-12.tar.gz) = 53737 Added: head/devel/R-cran-bit/pkg-descr ============================================================================== --- /dev/null 00:00:00 1970 (empty, because file is newly added) +++ head/devel/R-cran-bit/pkg-descr Sun Aug 9 07:33:33 2015 (r393764) @@ -0,0 +1,23 @@ +bitmapped vectors of booleans (no NAs), coercion from and to logicals, +integers and integer subscripts; fast boolean operators and fast +summary statistics. With 'bit' vectors you can store true binary +booleans {FALSE,TRUE} at the expense of 1 bit only, on a 32 bit +architecture this means factor 32 less RAM and ~ factor 32 more +speed on boolean operations. Due to overhead of R calls, actual +speed gain depends on the size of the vector: expect gains for +vectors of size > 10000 elements. Even for one-time boolean operations +it can pay-off to convert to bit, the pay-off is obvious, when such +components are used more than once. Reading from and writing to bit +is approximately as fast as accessing standard logicals - mostly +due to R's time for memory allocation. The package allows to work +with pre-allocated memory for return values by calling .Call() +directly: when evaluating the speed of C-access with pre-allocated +vector memory, coping from bit to logical requires only 70% of the +time for copying from logical to logical; and copying from logical +to bit comes at a performance penalty of 150%. the package now +contains further classes for representing logical selections: +'bitwhich' for very skewed selections and 'ri' for selecting ranges +of values for chunked processing. All three index classes can be +used for subsetting 'ff' objects (ff-2.1-0 and higher). + +WWW: https://cran.r-project.org/web/packages/bit/