Sort.i

   1 %module "Math::GSL::Sort"
   2 /* Danger Will Robinson! */
   3
   4 %include "typemaps.i"
   5 %include "gsl_typemaps.i"
   6
   7 %typemap(argout) (double * data, const size_t stride, const size_t n) {
   8     int i=0;
   9     AV* tempav = newAV();
  10
  11     while( i < $3 ) {
  12         av_push(tempav, newSVnv((double) $1[i]));
  13         i++;
  14     }
  15
  16     $result = sv_2mortal( newRV_noinc( (SV*) tempav) );
  17     //Perl_sv_dump($result);
  18     argvi++;
  19 }
  20 %typemap(argout) (double * dest, const size_t k, const gsl_vector * v) {
  21     int i=0;
  22     AV* tempav = newAV();
  23
  24     while( i < $2 ) {
  25         av_push(tempav, newSVnv((double) $1[i]));
  26         i++;
  27     }
  28
  29     $result = sv_2mortal( newRV_noinc( (SV*) tempav) );
  30     argvi++;
  31 }
  32
  33 %typemap(argout) (double * dest, const size_t k, const double * src, const size_t stride, const size_t n) {
  34     int i=0;
  35     AV* tempav = newAV();
  36     while( i < $2 ) {
  37         av_push(tempav, newSVnv((double) $1[i]));
  38         i++;
  39     }
  40
  41     $result = sv_2mortal( newRV_noinc( (SV*) tempav) );
  42     argvi++;
  43 }
  44 %typemap(argout) (size_t * p, const size_t k, const gsl_vector * v)
  45 {
  46     int i=0;
  47     AV* tempav = newAV();
  48     while( i < $2 ) {
  49         av_push(tempav, newSVnv((double) $1[i]));
  50         i++;
  51     }
  52
  53     $result = sv_2mortal( newRV_noinc( (SV*) tempav) );
  54     argvi++;
  55 }
  56
  57 %typemap(argout) (size_t * p, const double * data, const size_t stride, const size_t n)
  58 {
  59     int i=0;
  60     AV* tempav = newAV();
  61     while( i < $4 ) {
  62         av_push(tempav, newSVnv((size_t) $1[i]));
  63         i++;
  64     }
  65
  66     $result = sv_2mortal( newRV_noinc( (SV*) tempav) );
  67     argvi++;
  68 }
  69
  70 %typemap(argout) (size_t * p, const size_t k, const double * src, const size_t stride, const size_t n)
  71 {
  72     int i=0;
  73     AV* tempav = newAV();
  74     while( i < $2 ) {
  75         av_push(tempav, newSVnv((size_t) $1[i]));
  76         i++;
  77     }
  78
  79     $result = sv_2mortal( newRV_noinc( (SV*) tempav) );
  80     argvi++;
  81 }
  82
  83 %apply double * { double *data, double *dest };
  84
  85 %{
  86     #include "gsl/gsl_nan.h"
  87     #include "gsl/gsl_sort.h"
  88     #include "gsl/gsl_sort_double.h"
  89     #include "gsl/gsl_sort_int.h"
  90     #include "gsl/gsl_sort_vector.h"
  91     #include "gsl/gsl_sort_vector_double.h"
  92     #include "gsl/gsl_sort_vector_int.h"
  93     #include "gsl/gsl_permutation.h"
  94 %}
  95 %include "gsl/gsl_nan.h"
  96 %include "gsl/gsl_sort.h"
  97 %include "gsl/gsl_sort_double.h"
  98 %include "gsl/gsl_sort_int.h"
  99 %include "gsl/gsl_sort_vector.h"
 100 %include "gsl/gsl_sort_vector_double.h"
 101 %include "gsl/gsl_sort_vector_int.h"
 102 %include "gsl/gsl_permutation.h"
 103
 104
 105 %perlcode %{
 106 @EXPORT_plain = qw/
 107                 gsl_sort gsl_sort_index
 108                 gsl_sort_smallest gsl_sort_smallest_index
 109                 gsl_sort_largest gsl_sort_largest_index
 110                 /;
 111 @EXPORT_vector= qw/
 112                 gsl_sort_vector gsl_sort_vector_index
 113                 gsl_sort_vector_smallest gsl_sort_vector_smallest_index
 114                 gsl_sort_vector_largest gsl_sort_vector_largest_index
 115                 /;
 116 @EXPORT_OK    = ( @EXPORT_plain, @EXPORT_vector );
 117 %EXPORT_TAGS  = (
 118                  all    => [ @EXPORT_OK     ],
 119                  plain  => [ @EXPORT_plain  ],
 120                  vector => [ @EXPORT_vector ],
 121                 );
 122 __END__
 123
 124 =head1 NAME
 125
 126 Math::GSL::Sort - Functions for sorting data
 127
 128 =head1 SYNOPSIS
 129
 130     use Math::GSL::Sort qw/:all/;
 131     my $x      = [ 2**15, 1.67, 20e5,
 132                     -17, 6900, 1/3 , 42e-10 ];
 133     my $sorted = gsl_sort($x, 1, $#$x+1 );
 134     my $array = [2,3];
 135     my ($status, $smallest) = gsl_sort_smallest($array, 2, $x, 1, $#$x+1);
 136
 137
 138 =head1 DESCRIPTION
 139
 140 Here is a list of all the functions included in this module :
 141
 142 =over
 143
 144 =item * gsl_sort_vector($v) - This function sorts the elements of the vector $v into ascending numerical order.
 145
 146 =item * gsl_sort_vector_index($p, $v) - This function indirectly sorts the elements of the vector $v into ascending order, storing the resulting permutation in $p. The elements of $p give the index of the vector element which would have been stored in that position if the vector had been sorted in place. The first element of $p gives the index of the least element in $v, and the last element of $p gives the index of the greatest element in $v. The vector $v is not changed.
 147
 148 =item * gsl_sort_vector_smallest($array, $k, $vector) - This function outputs 0 if the operation succeeded, 1 otherwise and then the $k smallest elements of the vector $v. $k must be less than or equal to the length of the vector $v.
 149
 150 =item * gsl_sort_vector_smallest_index($p, $k, $v) - This function outputs 0 if the operation succeeded, 1 otherwise and then the indices of the $k smallest elements of the vector $v. $p must be a prealocated array reference. This should be removed in further versions. $k must be less than or equal to the length of the vector $v.
 151
 152 =item * gsl_sort_vector_largest($array, $k, $vector) - This function outputs 0 if the operation succeeded, 1 otherwise and then the $k largest elements of the vector $v. $k must be less than or equal to the length of the vector $v.
 153
 154 =item * gsl_sort_vector_largest_index($p, $k, $v) - This function outputs 0 if the operation succeeded, 1 otherwise and then the indices of the $k largest elements of the vector $v. $p must be a prealocated array reference. This should be removed in further versions. $k must be less than or equal to the length of the vector $v.
 155
 156 =item * gsl_sort($data, $stride, $n) - This function returns an array reference to the sorted $n elements of the array $data with stride $stride into ascending numerical order.
 157
 158 =item * gsl_sort_index($p, $data, $stride, $n) - This function indirectly sorts the $n elements of the array $data with stride $stride into ascending order, outputting the permutation in the foram of an array. $p must be a prealocated array reference. This should be removed in further versions. The array $data is not changed.
 159
 160 =item * gsl_sort_smallest($array, $k, $data, $stride, $n) - This function outputs 0 if the operation succeeded, 1 otherwise and then the $k smallest elements of the array $data, of size $n and stride $stride, in ascending numerical. The size $k of the subset must be less than or equal to $n. The data $src is not modified by this operation. $array must be a prealocated array reference. This should be removed in further versions.
 161
 162 =item * gsl_sort_smallest_index($p, $k, $src, $stride, $n) - This function outputs 0 if the operation succeeded, 1 otherwise and then the indices of the $k smallest elements of the array $src, of size $n and stride $stride. The indices are chosen so that the corresponding data is in ascending numerical order. $k must be less than or equal to $n. The data $src is not modified by this operation. $p must be a prealocated array reference. This should be removed in further versions.
 163
 164 =item * gsl_sort_largest($array, $k, $data, $stride, $n) - This function outputs 0 if the operation succeeded, 1 otherwise and then the $k largest elements of the array $data, of size $n and stride $stride, in ascending numerical. The size $k of the subset must be less than or equal to $n. The data $src is not modified by this operation. $array must be a prealocated array reference. This should be removed in further versions.
 165
 166 =item * gsl_sort_largest_index($p, $k, $src, $stride, $n) - This function outputs 0 if the operation succeeded, 1 otherwise and then the indices of the $k largest elements of the array $src, of size $n and stride $stride. The indices are chosen so that the corresponding data is in ascending numerical order. $k must be less than or equal to $n. The data $src is not modified by this operation. $p must be a prealocated array reference. This should be removed in further versions.
 167
 168 =back
 169
 170  You have to add the functions you want to use inside the qw /put_funtion_here /.
 171  You can also write use Math::GSL::Sort qw/:all/ to use all avaible functions of the module.
 172  Other tags are also avaible, here is a complete list of all tags for this module :
 173
 174 =over
 175
 176 =item all
 177
 178 =item plain
 179
 180 =item vector
 181
 182 =back
 183
 184 For more informations on the functions, we refer you to the GSL offcial documentation:
 185 L<http://www.gnu.org/software/gsl/manual/html_node/>
 186
 187 Tip : search on google: site:http://www.gnu.org/software/gsl/manual/html_node/ name_of_the_function_you_want
 188
 189 =head1 PERFORMANCE
 190
 191 In the source code of Math::GSL, the file "examples/benchmark/sort" compares
 192 the performance of gsl_sort() to Perl's builtin sort() function. It's first
 193 argument is the number of iterations and the second is the size of the array
 194 of numbers to sort. For example, to see a benchmark of 1000 iterations for
 195 arrays of size 50000 you would type
 196
 197     ./examples/benchmark/sort 1000 50000
 198
 199 Initial benchmarks indicate just slightly above a 2x performance increase
 200 over sort() for arrays of between 5000 and 50000 elements. This may mostly
 201 be due to the fact that gsl_sort() takes and returns a reference while sort()
 202 takes and returns a plain list.
 203
 204 =head1 AUTHORS
 205
 206 Jonathan Leto <jonathan@leto.net> and Thierry Moisan <thierry.moisan@gmail.com>
 207
 208 =head1 COPYRIGHT AND LICENSE
 209
 210 Copyright (C) 2008 Jonathan Leto and Thierry Moisan
 211
 212 This program is free software; you can redistribute it and/or modify it
 213 under the same terms as Perl itself.
 214
 215 =cut
 216
 217 %}