1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108
|
%module "Math::GSL::Sort"
/* Danger Will Robinson! */
%include "typemaps.i"
%include "gsl_typemaps.i"
%include "renames.i"
%typemap(argout) (double * data, const size_t stride, const size_t n) {
int i=0;
AV* tempav = newAV();
while( i < $3 ) {
av_push(tempav, newSVnv((double) $1[i]));
i++;
}
$result = sv_2mortal( newRV_noinc( (SV*) tempav) );
//Perl_sv_dump($result);
argvi++;
}
%typemap(argout) (double * dest, const size_t k, const gsl_vector * v) {
int i=0;
AV* tempav = newAV();
while( i < $2 ) {
av_push(tempav, newSVnv((double) $1[i]));
i++;
}
$result = sv_2mortal( newRV_noinc( (SV*) tempav) );
argvi++;
}
%typemap(argout) (double * dest, const size_t k, const double * src, const size_t stride, const size_t n) {
int i=0;
AV* tempav = newAV();
while( i < $2 ) {
av_push(tempav, newSVnv((double) $1[i]));
i++;
}
$result = sv_2mortal( newRV_noinc( (SV*) tempav) );
argvi++;
}
%typemap(argout) (size_t * p, const size_t k, const gsl_vector * v)
{
int i=0;
AV* tempav = newAV();
while( i < $2 ) {
av_push(tempav, newSVnv((size_t) $1[i]));
i++;
}
$result = sv_2mortal( newRV_noinc( (SV*) tempav) );
argvi++;
}
%typemap(argout) (size_t * p, const double * data, const size_t stride, const size_t n)
{
int i=0;
AV* tempav = newAV();
while( i < $4 ) {
av_push(tempav, newSViv((size_t) $1[i]));
i++;
}
$result = sv_2mortal( newRV_noinc( (SV*) tempav) );
argvi++;
}
%typemap(argout) (size_t * p, const size_t k, const double * src, const size_t stride, const size_t n)
{
int i=0;
AV* tempav = newAV();
while( i < $2 ) {
av_push(tempav, newSViv((size_t) $1[i]));
i++;
}
$result = sv_2mortal( newRV_noinc( (SV*) tempav) );
argvi++;
}
%apply double * { double *data, double *dest };
%{
#include "gsl/gsl_inline.h"
#include "gsl/gsl_nan.h"
#include "gsl/gsl_sort.h"
#include "gsl/gsl_sort_double.h"
#include "gsl/gsl_sort_int.h"
#include "gsl/gsl_sort_vector.h"
#include "gsl/gsl_sort_vector_double.h"
#include "gsl/gsl_sort_vector_int.h"
#include "gsl/gsl_permutation.h"
%}
%include "gsl/gsl_inline.h"
%include "gsl/gsl_nan.h"
%include "gsl/gsl_sort.h"
%include "gsl/gsl_sort_double.h"
%include "gsl/gsl_sort_int.h"
%include "gsl/gsl_sort_vector.h"
%include "gsl/gsl_sort_vector_double.h"
%include "gsl/gsl_sort_vector_int.h"
%include "gsl/gsl_permutation.h"
%include "../pod/Sort.pod"
|