ffsort

Sorting: sort an ff vector -- optionally in-place

manip

arith

univar

 data

 IO 

The ff package provides data structures that are stored on
disk but behave (almost) as if they were in RAM by transparently
mapping only a section (pagesize) in main memory - the effective
virtual memory consumption per ff object. ff supports R's standard
atomic data types 'double', 'logical', 'raw' and 'integer' and
non-standard atomic types boolean (1 bit), quad (2 bit unsigned),
nibble (4 bit unsigned), byte (1 byte signed with NAs), ubyte (1 byte
unsigned), short (2 byte signed with NAs), ushort (2 byte unsigned),
single (4 byte float with NAs). For example 'quad' allows efficient
storage of genomic data as an 'A','T','G','C' factor. The unsigned
types support 'circular' arithmetic. There is also support for
close-to-atomic types 'factor', 'ordered', 'POSIXct', 'Date' and
custom close-to-atomic types.
ff not only has native C-support for vectors, matrices and arrays
with flexible dimorder (major column-order, major row-order and
generalizations for arrays). There is also a ffdf class not unlike
data.frames and import/export filters for csv files.
ff objects store raw data in binary flat files in native encoding,
and complement this with metadata stored in R as physical and virtual
attributes. ff objects have well-defined hybrid copying semantics,
which gives rise to certain performance improvements through
virtualization. ff objects can be stored and reopened across R
sessions. ff files can be shared by multiple ff R objects
(using different data en/de-coding schemes) in the same process
or from multiple R processes to exploit parallelism. A wide choice of
finalizer options allows to work with 'permanent' files as well as
creating/removing 'temporary' ff files completely transparent to the
user. On certain OS/Filesystem combinations, creating the ff files
works without notable delay thanks to using sparse file allocation.
Several access optimization techniques such as Hybrid Index
Preprocessing and Virtualization are implemented to achieve good
performance even with large datasets, for example virtual matrix
transpose without touching a single byte on disk. Further, to reduce
disk I/O, 'logicals' and non-standard data types get stored native and
compact on binary flat files i.e. logicals take up exactly 2 bits to
represent TRUE, FALSE and NA.
Beyond basic access functions, the ff package also provides
compatibility functions that facilitate writing code for ff and ram
objects and support for batch processing on ff objects (e.g. as.ram,
as.ff, ffapply). ff interfaces closely with functionality from package
'bit': chunked looping, fast bit operations and coercions between
different objects that can store subscript information ('bit',
'bitwhich', ff 'boolean', ri range index, hi hybrid index). This allows
to work interactively with selections of large datasets and quickly
modify selection criteria.
Further high-performance enhancements can be made available upon request.

Jens Oehlschl�gel

Memory-Efficient Storage of Large Data on Disk and Fast Access
Functions

Daniel Adler

Christian Gläser

Oleg Nenadic

Jens Oehlschlägel

Martijn Schuemie

Walter Zucchini

ffsort function

<dl> <dt>x</dt>
<dd>an ff vector</dd> <dt>aux</dt>
<dd>NULL or an ff vector of the same type for temporary storage</dd> <dt>has.na</dt>
<dd>boolean scalar telling ffsort whether the vector might contain <code>NA</code>s.
Note that you risk a crash if there are unexpected <code>NA</code>s with <code>has.na=FALSE</code></dd> <dt>na.last</dt>
<dd>boolean scalar telling ffsort whether to sort <code>NA</code>s last or first.
Note that 'boolean' means that there is no third option <code>NA</code> as in <code><a href="/link/sort?package=ff&version=4.5.0" data-mini-rdoc="ff::sort">sort</a></code></dd> <dt>decreasing</dt>
<dd>boolean scalar telling ffsort whether to sort increasing or decreasing</dd> <dt>inplace</dt>
<dd>boolean scalar telling ffsort whether to sort the original ff vector (<code>TRUE</code>)
or to create a sorted copy (<code>FALSE</code>, the default)</dd> <dt>decorate</dt>
<dd>boolean scalar telling ffsort whether to decorate the returned ff vector with <code><a href="/link/is.sorted?package=ff&version=4.5.0" data-mini-rdoc="ff::is.sorted">is.sorted</a></code>
and <code><a href="/link/na.count?package=ff&version=4.5.0" data-mini-rdoc="ff::na.count">na.count</a></code> attributes.</dd> <dt>BATCHBYTES</dt>
<dd>maximum number of RAM bytes ffsort should try not to exceed</dd> <dt>VERBOSE</dt>
<dd>cat some info about the sorting</dd></dl>

Arguments

Author

Sorting of ff vectors — ffsort

<dl>

 <dt>x</dt>
<dd>an ff vector</dd>

 <dt>aux</dt>
<dd>NULL or an ff vector of the same type for temporary storage</dd>

 <dt>has.na</dt>
<dd>boolean scalar telling ffsort whether the vector might contain <code>NA</code>s.
Note that you risk a crash if there are unexpected <code>NA</code>s with <code>has.na=FALSE</code></dd>

 <dt>na.last</dt>
<dd>boolean scalar telling ffsort whether to sort <code>NA</code>s last or first.
Note that 'boolean' means that there is no third option <code>NA</code> as in <code><a href='https://rdrr.io/r/base/sort.html'>sort</a></code></dd>

 <dt>decreasing</dt>
<dd>boolean scalar telling ffsort whether to sort increasing or decreasing</dd>

 <dt>inplace</dt>
<dd>boolean scalar telling ffsort whether to sort the original ff vector (<code>TRUE</code>)
or to create a sorted copy (<code>FALSE</code>, the default)</dd>

 <dt>decorate</dt>
<dd>boolean scalar telling ffsort whether to decorate the returned ff vector with <code><a href='https://rdrr.io/pkg/bit/man/Metadata.html'>is.sorted</a></code>
and <code><a href='https://rdrr.io/pkg/bit/man/Metadata.html'>na.count</a></code> attributes.</dd>

 <dt>BATCHBYTES</dt>
<dd>maximum number of RAM bytes ffsort should try not to exceed</dd>

 <dt>VERBOSE</dt>
<dd>cat some info about the sorting</dd>

</dl>

Sorting of ff vectors

ffsort: Sorting of ff vectors

Description

Usage

Value

Arguments

Author

Details

See Also

Examples