—
—
—
—
—
—

              
#
# GENERATED WITH PDL::PP from lib/PDL/Compression.pd! Don't modify!
#
package PDL::Compression;
our @EXPORT_OK = qw(rice_compress rice_expand );
our %EXPORT_TAGS = (Func=>\@EXPORT_OK);
use PDL::Core;
use PDL::Exporter;
use DynaLoader;
    
   our @ISA = ( 'PDL::Exporter','DynaLoader' );
   push @PDL::Core::PP, __PACKAGE__;
   bootstrap PDL::Compression ;
#line 9 "lib/PDL/Compression.pd"
HideShow 23 lines of Pod
=head1 NAME
PDL::Compression - compression utilities
=head1 DESCRIPTION
These routines generally accept some data as a PDL and compress it
into a smaller PDL.  Algorithms typically work on a single dimension
and broadcast over other dimensions, producing a broadcasted table of
compressed values if more than one dimension is fed in.
The Rice algorithm, in particular, is designed to be identical to the
RICE_1 algorithm used in internal FITS-file compression (see PDL::IO::FITS).
=head1 SYNOPSIS
 use PDL::Compression
 ($y,$xsize) = $x->rice_compress();
 $c = $y->rice_expand($xsize);
=cut
use strict;
use warnings;
#line 54 "lib/PDL/Compression.pm"
HideShow 4 lines of Pod
=head1 FUNCTIONS
=cut
#line 78 "lib/PDL/Compression.pd"
HideShow 4 lines of Pod
=head1 METHODS
=cut
#line 70 "lib/PDL/Compression.pm"
HideShow 65 lines of Pod
=head2 rice_compress
=for sig
 Signature: (in(n); [o]out(m=CALC(ceil($SIZE(n) * 1.01))); indx[o]len(); int blocksize)
 Types: (byte short ushort long)
=for usage
 ($out, $len) = rice_compress($in, $blocksize);
 rice_compress($in, $out, $len, $blocksize);    # all arguments given
 ($out, $len) = $in->rice_compress($blocksize); # method call
 $in->rice_compress($out, $len, $blocksize);
=for ref
Squishes an input PDL along the 0 dimension by Rice compression.  In
scalar context, you get back only the compressed PDL; in list context,
you also get back ancillary information that is required to uncompress
the data with rice_uncompress.  
Multidimensional data are broadcasted over - each row is compressed
separately, and the returned PDL is squished to the maximum compressed
size of any row.  If any of the streams could not be compressed (the
algorithm produced longer output), the corresponding length is set to -1
and the row is treated as if it had length 0.
Rice compression only works on integer data types -- if you have
floating point data you must first quantize them.
The underlying algorithm is identical to the Rice compressor used in
CFITSIO (and is used by PDL::IO::FITS to load and save compressed FITS
images).
The optional blocksize indicates how many samples are to be compressed
as a unit; it defaults to 32.
How it works:
Rice compression is a subset of Golomb compression, and works on data sets
where variation between adjacent samples is typically small compared to the
dynamic range of each sample.  In this implementation (originally written
by Richard White and contributed to CFITSIO in 1999), the data are divided
into blocks of samples (by default 32 samples per block).  Each block 
has a running difference applied, and the difference is bit-folded to make
it positive definite.  High order bits of the difference stream are discarded,
and replaced with a unary representation; low order bits are preserved.  Unary
representation is very efficient for small numbers, but large jumps could
give rise to ludicrously large bins in a plain Golomb code; such large jumps
("high entropy" samples) are simply recorded directly in the output stream.
Working on astronomical or solar image data, typical compression ratios of 
2-3 are achieved.
=pod
Broadcasts over its inputs.
=for bad
C<rice_compress> ignores the bad-value flag of the input ndarrays.
It will set the bad-value flag of all output ndarrays if the flag is set for any of the input ndarrays.
=cut
sub PDL::rice_compress {
    my $in = shift;
    my $blocksize = shift || 32;
    ## Reject floating-point inputs
    if( $in->type != byte &&
        $in->type != short &&
        $in->type != ushort &&
        $in->type != long
        ) {
        die("rice_compress: input needs to have type byte, short, ushort, or long, not ".($in->type)."\n");
    }
    PDL::_rice_compress_int( $in, my $out=PDL->null, my $len=PDL->null, $blocksize );
    my $l = $len->max->sclr;
    $out = $out->slice("0:".($l-1))->sever;
    return wantarray ? ($out, $in->dim(0), $blocksize, $len) : $out;
}
*rice_compress = \&PDL::rice_compress;
HideShow 31 lines of Pod
=head2 rice_expand
=for sig
 Signature: (in(n); indx len(); [o]out(m); IV dim0 => m; int blocksize)
 Types: (byte short ushort long)
=for usage
 $out = rice_expand($in, $len, $dim0);             # using default value of blocksize=32
 $out = rice_expand($in, $len, $dim0, $blocksize); # overriding default
 rice_expand($in, $len, $out, $dim0, $blocksize);  # all arguments given
 $out = $in->rice_expand($len, $dim0);             # method call
 $out = $in->rice_expand($len, $dim0, $blocksize);
 $in->rice_expand($len, $out, $dim0, $blocksize);
=for ref
Unsquishes a PDL that has been squished by rice_compress.
=pod
Broadcasts over its inputs.
=for bad
C<rice_expand> ignores the bad-value flag of the input ndarrays.
It will set the bad-value flag of all output ndarrays if the flag is set for any of the input ndarrays.
=cut
*rice_expand = \&PDL::rice_expand;
#line 39 "lib/PDL/Compression.pd"
HideShow 35 lines of Pod
=head1 AUTHORS
Copyright (C) 2010 Craig DeForest.
All rights reserved. There is no warranty. You are allowed
to redistribute this software / documentation under certain
conditions. For details, see the file COPYING in the PDL
distribution. If this file is separated from the PDL distribution,
the copyright notice should be included in the file.
The Rice compression library is derived from the similar library in
the CFITSIO 3.24 release, and is licensed under yet more more lenient
terms than PDL itself; that notice is present in the file "ricecomp.c".
=head1 BUGS
=over 3
=item * Currently headers are ignored.  
=item * Currently there is only one compression algorithm.
=back
=head1 TODO
=over 3
=item * Add object encapsulation
=item * Add test suite
=back
=cut
#line 245 "lib/PDL/Compression.pm"
# Exit with OK status
1;