/* ----------------------------------------------------------------------------
* This file was automatically generated by SWIG (http://www.swig.org).
* Version 2.0.12
*
* This file is not intended to be easily readable and contains a number of
* coding conventions designed to improve portability and efficiency. Do not make
* changes to this file unless you know what you are doing--modify the SWIG
* interface file instead.
* ----------------------------------------------------------------------------- */
#define SWIGPERL
#define SWIG_CASTRANK_MODE
/* -----------------------------------------------------------------------------
* This section contains generic SWIG labels for method/variable
* declarations/attributes, and other compiler dependent labels.
* ----------------------------------------------------------------------------- */
/* template workaround for compilers that cannot correctly implement the C++ standard */
#ifndef SWIGTEMPLATEDISAMBIGUATOR
# if defined(__SUNPRO_CC) && (__SUNPRO_CC <= 0x560)
# define SWIGTEMPLATEDISAMBIGUATOR template
# elif defined(__HP_aCC)
/* Needed even with `aCC -AA' when `aCC -V' reports HP ANSI C++ B3910B A.03.55 */
/* If we find a maximum version that requires this, the test would be __HP_aCC <= 35500 for A.03.55 */
# define SWIGTEMPLATEDISAMBIGUATOR template
# else
# define SWIGTEMPLATEDISAMBIGUATOR
# endif
#endif
/* inline attribute */
#ifndef SWIGINLINE
# if defined(__cplusplus) || (defined(__GNUC__) && !defined(__STRICT_ANSI__))
# define SWIGINLINE inline
# else
# define SWIGINLINE
# endif
#endif
/* attribute recognised by some compilers to avoid 'unused' warnings */
#ifndef SWIGUNUSED
# if defined(__GNUC__)
# if !(defined(__cplusplus)) || (__GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ >= 4))
# define SWIGUNUSED __attribute__ ((__unused__))
# else
# define SWIGUNUSED
# endif
# elif defined(__ICC)
# define SWIGUNUSED __attribute__ ((__unused__))
# else
# define SWIGUNUSED
# endif
#endif
#ifndef SWIG_MSC_UNSUPPRESS_4505
# if defined(_MSC_VER)
# pragma warning(disable : 4505) /* unreferenced local function has been removed */
# endif
#endif
#ifndef SWIGUNUSEDPARM
# ifdef __cplusplus
# define SWIGUNUSEDPARM(p)
# else
# define SWIGUNUSEDPARM(p) p SWIGUNUSED
# endif
#endif
/* internal SWIG method */
#ifndef SWIGINTERN
# define SWIGINTERN static SWIGUNUSED
#endif
/* internal inline SWIG method */
#ifndef SWIGINTERNINLINE
# define SWIGINTERNINLINE SWIGINTERN SWIGINLINE
#endif
/* exporting methods */
#if (__GNUC__ >= 4) || (__GNUC__ == 3 && __GNUC_MINOR__ >= 4)
# ifndef GCC_HASCLASSVISIBILITY
# define GCC_HASCLASSVISIBILITY
# endif
#endif
#ifndef SWIGEXPORT
# if defined(_WIN32) || defined(__WIN32__) || defined(__CYGWIN__)
# if defined(STATIC_LINKED)
# define SWIGEXPORT
# else
# define SWIGEXPORT __declspec(dllexport)
# endif
# else
# if defined(__GNUC__) && defined(GCC_HASCLASSVISIBILITY)
# define SWIGEXPORT __attribute__ ((visibility("default")))
# else
# define SWIGEXPORT
# endif
# endif
#endif
/* calling conventions for Windows */
#ifndef SWIGSTDCALL
# if defined(_WIN32) || defined(__WIN32__) || defined(__CYGWIN__)
# define SWIGSTDCALL __stdcall
# else
# define SWIGSTDCALL
# endif
#endif
/* Deal with Microsoft's attempt at deprecating C standard runtime functions */
#if !defined(SWIG_NO_CRT_SECURE_NO_DEPRECATE) && defined(_MSC_VER) && !defined(_CRT_SECURE_NO_DEPRECATE)
# define _CRT_SECURE_NO_DEPRECATE
#endif
/* Deal with Microsoft's attempt at deprecating methods in the standard C++ library */
#if !defined(SWIG_NO_SCL_SECURE_NO_DEPRECATE) && defined(_MSC_VER) && !defined(_SCL_SECURE_NO_DEPRECATE)
# define _SCL_SECURE_NO_DEPRECATE
#endif
/* -----------------------------------------------------------------------------
* swigrun.swg
*
* This file contains generic C API SWIG runtime support for pointer
* type checking.
* ----------------------------------------------------------------------------- */
/* This should only be incremented when either the layout of swig_type_info changes,
or for whatever reason, the runtime changes incompatibly */
#define SWIG_RUNTIME_VERSION "4"
/* define SWIG_TYPE_TABLE_NAME as "SWIG_TYPE_TABLE" */
#ifdef SWIG_TYPE_TABLE
# define SWIG_QUOTE_STRING(x) #x
# define SWIG_EXPAND_AND_QUOTE_STRING(x) SWIG_QUOTE_STRING(x)
# define SWIG_TYPE_TABLE_NAME SWIG_EXPAND_AND_QUOTE_STRING(SWIG_TYPE_TABLE)
#else
# define SWIG_TYPE_TABLE_NAME
#endif
/*
You can use the SWIGRUNTIME and SWIGRUNTIMEINLINE macros for
creating a static or dynamic library from the SWIG runtime code.
In 99.9% of the cases, SWIG just needs to declare them as 'static'.
But only do this if strictly necessary, ie, if you have problems
with your compiler or suchlike.
*/
#ifndef SWIGRUNTIME
# define SWIGRUNTIME SWIGINTERN
#endif
#ifndef SWIGRUNTIMEINLINE
# define SWIGRUNTIMEINLINE SWIGRUNTIME SWIGINLINE
#endif
/* Generic buffer size */
#ifndef SWIG_BUFFER_SIZE
# define SWIG_BUFFER_SIZE 1024
#endif
/* Flags for pointer conversions */
#define SWIG_POINTER_DISOWN 0x1
#define SWIG_CAST_NEW_MEMORY 0x2
/* Flags for new pointer objects */
#define SWIG_POINTER_OWN 0x1
/*
Flags/methods for returning states.
The SWIG conversion methods, as ConvertPtr, return an integer
that tells if the conversion was successful or not. And if not,
an error code can be returned (see swigerrors.swg for the codes).
Use the following macros/flags to set or process the returning
states.
In old versions of SWIG, code such as the following was usually written:
if (SWIG_ConvertPtr(obj,vptr,ty.flags) != -1) {
// success code
} else {
//fail code
}
Now you can be more explicit:
int res = SWIG_ConvertPtr(obj,vptr,ty.flags);
if (SWIG_IsOK(res)) {
// success code
} else {
// fail code
}
which is the same really, but now you can also do
Type *ptr;
int res = SWIG_ConvertPtr(obj,(void **)(&ptr),ty.flags);
if (SWIG_IsOK(res)) {
// success code
if (SWIG_IsNewObj(res) {
...
delete *ptr;
} else {
...
}
} else {
// fail code
}
I.e., now SWIG_ConvertPtr can return new objects and you can
identify the case and take care of the deallocation. Of course that
also requires SWIG_ConvertPtr to return new result values, such as
int SWIG_ConvertPtr(obj, ptr,...) {
if (<obj is ok>) {
if (<need new object>) {
*ptr = <ptr to new allocated object>;
return SWIG_NEWOBJ;
} else {
*ptr = <ptr to old object>;
return SWIG_OLDOBJ;
}
} else {
return SWIG_BADOBJ;
}
}
Of course, returning the plain '0(success)/-1(fail)' still works, but you can be
more explicit by returning SWIG_BADOBJ, SWIG_ERROR or any of the
SWIG errors code.
Finally, if the SWIG_CASTRANK_MODE is enabled, the result code
allows to return the 'cast rank', for example, if you have this
int food(double)
int fooi(int);
and you call
food(1) // cast rank '1' (1 -> 1.0)
fooi(1) // cast rank '0'
just use the SWIG_AddCast()/SWIG_CheckState()
*/
#define SWIG_OK (0)
#define SWIG_ERROR (-1)
#define SWIG_IsOK(r) (r >= 0)
#define SWIG_ArgError(r) ((r != SWIG_ERROR) ? r : SWIG_TypeError)
/* The CastRankLimit says how many bits are used for the cast rank */
#define SWIG_CASTRANKLIMIT (1 << 8)
/* The NewMask denotes the object was created (using new/malloc) */
#define SWIG_NEWOBJMASK (SWIG_CASTRANKLIMIT << 1)
/* The TmpMask is for in/out typemaps that use temporal objects */
#define SWIG_TMPOBJMASK (SWIG_NEWOBJMASK << 1)
/* Simple returning values */
#define SWIG_BADOBJ (SWIG_ERROR)
#define SWIG_OLDOBJ (SWIG_OK)
#define SWIG_NEWOBJ (SWIG_OK | SWIG_NEWOBJMASK)
#define SWIG_TMPOBJ (SWIG_OK | SWIG_TMPOBJMASK)
/* Check, add and del mask methods */
#define SWIG_AddNewMask(r) (SWIG_IsOK(r) ? (r | SWIG_NEWOBJMASK) : r)
#define SWIG_DelNewMask(r) (SWIG_IsOK(r) ? (r & ~SWIG_NEWOBJMASK) : r)
#define SWIG_IsNewObj(r) (SWIG_IsOK(r) && (r & SWIG_NEWOBJMASK))
#define SWIG_AddTmpMask(r) (SWIG_IsOK(r) ? (r | SWIG_TMPOBJMASK) : r)
#define SWIG_DelTmpMask(r) (SWIG_IsOK(r) ? (r & ~SWIG_TMPOBJMASK) : r)
#define SWIG_IsTmpObj(r) (SWIG_IsOK(r) && (r & SWIG_TMPOBJMASK))
/* Cast-Rank Mode */
#if defined(SWIG_CASTRANK_MODE)
# ifndef SWIG_TypeRank
# define SWIG_TypeRank unsigned long
# endif
# ifndef SWIG_MAXCASTRANK /* Default cast allowed */
# define SWIG_MAXCASTRANK (2)
# endif
# define SWIG_CASTRANKMASK ((SWIG_CASTRANKLIMIT) -1)
# define SWIG_CastRank(r) (r & SWIG_CASTRANKMASK)
SWIGINTERNINLINE int SWIG_AddCast(int r) {
return SWIG_IsOK(r) ? ((SWIG_CastRank(r) < SWIG_MAXCASTRANK) ? (r + 1) : SWIG_ERROR) : r;
}
SWIGINTERNINLINE int SWIG_CheckState(int r) {
return SWIG_IsOK(r) ? SWIG_CastRank(r) + 1 : 0;
}
#else /* no cast-rank mode */
# define SWIG_AddCast(r) (r)
# define SWIG_CheckState(r) (SWIG_IsOK(r) ? 1 : 0)
#endif
#include <string.h>
#ifdef __cplusplus
extern "C" {
#endif
typedef void *(*swig_converter_func)(void *, int *);
typedef struct swig_type_info *(*swig_dycast_func)(void **);
/* Structure to store information on one type */
typedef struct swig_type_info {
const char *name; /* mangled name of this type */
const char *str; /* human readable name of this type */
swig_dycast_func dcast; /* dynamic cast function down a hierarchy */
struct swig_cast_info *cast; /* linked list of types that can cast into this type */
void *clientdata; /* language specific type data */
int owndata; /* flag if the structure owns the clientdata */
} swig_type_info;
/* Structure to store a type and conversion function used for casting */
typedef struct swig_cast_info {
swig_type_info *type; /* pointer to type that is equivalent to this type */
swig_converter_func converter; /* function to cast the void pointers */
struct swig_cast_info *next; /* pointer to next cast in linked list */
struct swig_cast_info *prev; /* pointer to the previous cast */
} swig_cast_info;
/* Structure used to store module information
* Each module generates one structure like this, and the runtime collects
* all of these structures and stores them in a circularly linked list.*/
typedef struct swig_module_info {
swig_type_info **types; /* Array of pointers to swig_type_info structures that are in this module */
size_t size; /* Number of types in this module */
struct swig_module_info *next; /* Pointer to next element in circularly linked list */
swig_type_info **type_initial; /* Array of initially generated type structures */
swig_cast_info **cast_initial; /* Array of initially generated casting structures */
void *clientdata; /* Language specific module data */
} swig_module_info;
/*
Compare two type names skipping the space characters, therefore
"char*" == "char *" and "Class<int>" == "Class<int >", etc.
Return 0 when the two name types are equivalent, as in
strncmp, but skipping ' '.
*/
SWIGRUNTIME int
SWIG_TypeNameComp(const char *f1, const char *l1,
const char *f2, const char *l2) {
for (;(f1 != l1) && (f2 != l2); ++f1, ++f2) {
while ((*f1 == ' ') && (f1 != l1)) ++f1;
while ((*f2 == ' ') && (f2 != l2)) ++f2;
if (*f1 != *f2) return (*f1 > *f2) ? 1 : -1;
}
return (int)((l1 - f1) - (l2 - f2));
}
/*
Check type equivalence in a name list like <name1>|<name2>|...
Return 0 if equal, -1 if nb < tb, 1 if nb > tb
*/
SWIGRUNTIME int
SWIG_TypeCmp(const char *nb, const char *tb) {
int equiv = 1;
const char* te = tb + strlen(tb);
const char* ne = nb;
while (equiv != 0 && *ne) {
for (nb = ne; *ne; ++ne) {
if (*ne == '|') break;
}
equiv = SWIG_TypeNameComp(nb, ne, tb, te);
if (*ne) ++ne;
}
return equiv;
}
/*
Check type equivalence in a name list like <name1>|<name2>|...
Return 0 if not equal, 1 if equal
*/
SWIGRUNTIME int
SWIG_TypeEquiv(const char *nb, const char *tb) {
return SWIG_TypeCmp(nb, tb) == 0 ? 1 : 0;
}
/*
Check the typename
*/
SWIGRUNTIME swig_cast_info *
SWIG_TypeCheck(const char *c, swig_type_info *ty) {
if (ty) {
swig_cast_info *iter = ty->cast;
while (iter) {
if (strcmp(iter->type->name, c) == 0) {
if (iter == ty->cast)
return iter;
/* Move iter to the top of the linked list */
iter->prev->next = iter->next;
if (iter->next)
iter->next->prev = iter->prev;
iter->next = ty->cast;
iter->prev = 0;
if (ty->cast) ty->cast->prev = iter;
ty->cast = iter;
return iter;
}
iter = iter->next;
}
}
return 0;
}
/*
Identical to SWIG_TypeCheck, except strcmp is replaced with a pointer comparison
*/
SWIGRUNTIME swig_cast_info *
SWIG_TypeCheckStruct(swig_type_info *from, swig_type_info *ty) {
if (ty) {
swig_cast_info *iter = ty->cast;
while (iter) {
if (iter->type == from) {
if (iter == ty->cast)
return iter;
/* Move iter to the top of the linked list */
iter->prev->next = iter->next;
if (iter->next)
iter->next->prev = iter->prev;
iter->next = ty->cast;
iter->prev = 0;
if (ty->cast) ty->cast->prev = iter;
ty->cast = iter;
return iter;
}
iter = iter->next;
}
}
return 0;
}
/*
Cast a pointer up an inheritance hierarchy
*/
SWIGRUNTIMEINLINE void *
SWIG_TypeCast(swig_cast_info *ty, void *ptr, int *newmemory) {
return ((!ty) || (!ty->converter)) ? ptr : (*ty->converter)(ptr, newmemory);
}
/*
Dynamic pointer casting. Down an inheritance hierarchy
*/
SWIGRUNTIME swig_type_info *
SWIG_TypeDynamicCast(swig_type_info *ty, void **ptr) {
swig_type_info *lastty = ty;
if (!ty || !ty->dcast) return ty;
while (ty && (ty->dcast)) {
ty = (*ty->dcast)(ptr);
if (ty) lastty = ty;
}
return lastty;
}
/*
Return the name associated with this type
*/
SWIGRUNTIMEINLINE const char *
SWIG_TypeName(const swig_type_info *ty) {
return ty->name;
}
/*
Return the pretty name associated with this type,
that is an unmangled type name in a form presentable to the user.
*/
SWIGRUNTIME const char *
SWIG_TypePrettyName(const swig_type_info *type) {
/* The "str" field contains the equivalent pretty names of the
type, separated by vertical-bar characters. We choose
to print the last name, as it is often (?) the most
specific. */
if (!type) return NULL;
if (type->str != NULL) {
const char *last_name = type->str;
const char *s;
for (s = type->str; *s; s++)
if (*s == '|') last_name = s+1;
return last_name;
}
else
return type->name;
}
/*
Set the clientdata field for a type
*/
SWIGRUNTIME void
SWIG_TypeClientData(swig_type_info *ti, void *clientdata) {
swig_cast_info *cast = ti->cast;
/* if (ti->clientdata == clientdata) return; */
ti->clientdata = clientdata;
while (cast) {
if (!cast->converter) {
swig_type_info *tc = cast->type;
if (!tc->clientdata) {
SWIG_TypeClientData(tc, clientdata);
}
}
cast = cast->next;
}
}
SWIGRUNTIME void
SWIG_TypeNewClientData(swig_type_info *ti, void *clientdata) {
SWIG_TypeClientData(ti, clientdata);
ti->owndata = 1;
}
/*
Search for a swig_type_info structure only by mangled name
Search is a O(log #types)
We start searching at module start, and finish searching when start == end.
Note: if start == end at the beginning of the function, we go all the way around
the circular list.
*/
SWIGRUNTIME swig_type_info *
SWIG_MangledTypeQueryModule(swig_module_info *start,
swig_module_info *end,
const char *name) {
swig_module_info *iter = start;
do {
if (iter->size) {
register size_t l = 0;
register size_t r = iter->size - 1;
do {
/* since l+r >= 0, we can (>> 1) instead (/ 2) */
register size_t i = (l + r) >> 1;
const char *iname = iter->types[i]->name;
if (iname) {
register int compare = strcmp(name, iname);
if (compare == 0) {
return iter->types[i];
} else if (compare < 0) {
if (i) {
r = i - 1;
} else {
break;
}
} else if (compare > 0) {
l = i + 1;
}
} else {
break; /* should never happen */
}
} while (l <= r);
}
iter = iter->next;
} while (iter != end);
return 0;
}
/*
Search for a swig_type_info structure for either a mangled name or a human readable name.
It first searches the mangled names of the types, which is a O(log #types)
If a type is not found it then searches the human readable names, which is O(#types).
We start searching at module start, and finish searching when start == end.
Note: if start == end at the beginning of the function, we go all the way around
the circular list.
*/
SWIGRUNTIME swig_type_info *
SWIG_TypeQueryModule(swig_module_info *start,
swig_module_info *end,
const char *name) {
/* STEP 1: Search the name field using binary search */
swig_type_info *ret = SWIG_MangledTypeQueryModule(start, end, name);
if (ret) {
return ret;
} else {
/* STEP 2: If the type hasn't been found, do a complete search
of the str field (the human readable name) */
swig_module_info *iter = start;
do {
register size_t i = 0;
for (; i < iter->size; ++i) {
if (iter->types[i]->str && (SWIG_TypeEquiv(iter->types[i]->str, name)))
return iter->types[i];
}
iter = iter->next;
} while (iter != end);
}
/* neither found a match */
return 0;
}
/*
Pack binary data into a string
*/
SWIGRUNTIME char *
SWIG_PackData(char *c, void *ptr, size_t sz) {
static const char hex[17] = "0123456789abcdef";
register const unsigned char *u = (unsigned char *) ptr;
register const unsigned char *eu = u + sz;
for (; u != eu; ++u) {
register unsigned char uu = *u;
*(c++) = hex[(uu & 0xf0) >> 4];
*(c++) = hex[uu & 0xf];
}
return c;
}
/*
Unpack binary data from a string
*/
SWIGRUNTIME const char *
SWIG_UnpackData(const char *c, void *ptr, size_t sz) {
register unsigned char *u = (unsigned char *) ptr;
register const unsigned char *eu = u + sz;
for (; u != eu; ++u) {
register char d = *(c++);
register unsigned char uu;
if ((d >= '0') && (d <= '9'))
uu = ((d - '0') << 4);
else if ((d >= 'a') && (d <= 'f'))
uu = ((d - ('a'-10)) << 4);
else
return (char *) 0;
d = *(c++);
if ((d >= '0') && (d <= '9'))
uu |= (d - '0');
else if ((d >= 'a') && (d <= 'f'))
uu |= (d - ('a'-10));
else
return (char *) 0;
*u = uu;
}
return c;
}
/*
Pack 'void *' into a string buffer.
*/
SWIGRUNTIME char *
SWIG_PackVoidPtr(char *buff, void *ptr, const char *name, size_t bsz) {
char *r = buff;
if ((2*sizeof(void *) + 2) > bsz) return 0;
*(r++) = '_';
r = SWIG_PackData(r,&ptr,sizeof(void *));
if (strlen(name) + 1 > (bsz - (r - buff))) return 0;
strcpy(r,name);
return buff;
}
SWIGRUNTIME const char *
SWIG_UnpackVoidPtr(const char *c, void **ptr, const char *name) {
if (*c != '_') {
if (strcmp(c,"NULL") == 0) {
*ptr = (void *) 0;
return name;
} else {
return 0;
}
}
return SWIG_UnpackData(++c,ptr,sizeof(void *));
}
SWIGRUNTIME char *
SWIG_PackDataName(char *buff, void *ptr, size_t sz, const char *name, size_t bsz) {
char *r = buff;
size_t lname = (name ? strlen(name) : 0);
if ((2*sz + 2 + lname) > bsz) return 0;
*(r++) = '_';
r = SWIG_PackData(r,ptr,sz);
if (lname) {
strncpy(r,name,lname+1);
} else {
*r = 0;
}
return buff;
}
SWIGRUNTIME const char *
SWIG_UnpackDataName(const char *c, void *ptr, size_t sz, const char *name) {
if (*c != '_') {
if (strcmp(c,"NULL") == 0) {
memset(ptr,0,sz);
return name;
} else {
return 0;
}
}
return SWIG_UnpackData(++c,ptr,sz);
}
#ifdef __cplusplus
}
#endif
/* Errors in SWIG */
#define SWIG_UnknownError -1
#define SWIG_IOError -2
#define SWIG_RuntimeError -3
#define SWIG_IndexError -4
#define SWIG_TypeError -5
#define SWIG_DivisionByZero -6
#define SWIG_OverflowError -7
#define SWIG_SyntaxError -8
#define SWIG_ValueError -9
#define SWIG_SystemError -10
#define SWIG_AttributeError -11
#define SWIG_MemoryError -12
#define SWIG_NullReferenceError -13
#ifdef __cplusplus
/* Needed on some windows machines---since MS plays funny games with the header files under C++ */
#include <math.h>
#include <stdlib.h>
extern "C" {
#endif
#include "EXTERN.h"
#include "perl.h"
#include "XSUB.h"
/* Add in functionality missing in older versions of Perl. Much of this is based on Devel-PPPort on cpan. */
/* Add PERL_REVISION, PERL_VERSION, PERL_SUBVERSION if missing */
#ifndef PERL_REVISION
# if !defined(__PATCHLEVEL_H_INCLUDED__) && !(defined(PATCHLEVEL) && defined(SUBVERSION))
# define PERL_PATCHLEVEL_H_IMPLICIT
# include <patchlevel.h>
# endif
# if !(defined(PERL_VERSION) || (defined(SUBVERSION) && defined(PATCHLEVEL)))
# include <could_not_find_Perl_patchlevel.h>
# endif
# ifndef PERL_REVISION
# define PERL_REVISION (5)
# define PERL_VERSION PATCHLEVEL
# define PERL_SUBVERSION SUBVERSION
# endif
#endif
#if defined(WIN32) && defined(PERL_OBJECT) && !defined(PerlIO_exportFILE)
#define PerlIO_exportFILE(fh,fl) (FILE*)(fh)
#endif
#ifndef SvIOK_UV
# define SvIOK_UV(sv) (SvIOK(sv) && (SvUVX(sv) == SvIVX(sv)))
#endif
#ifndef SvUOK
# define SvUOK(sv) SvIOK_UV(sv)
#endif
#if ((PERL_VERSION < 4) || ((PERL_VERSION == 4) && (PERL_SUBVERSION <= 5)))
# define PL_sv_undef sv_undef
# define PL_na na
# define PL_errgv errgv
# define PL_sv_no sv_no
# define PL_sv_yes sv_yes
# define PL_markstack_ptr markstack_ptr
#endif
#ifndef IVSIZE
# ifdef LONGSIZE
# define IVSIZE LONGSIZE
# else
# define IVSIZE 4 /* A bold guess, but the best we can make. */
# endif
#endif
#ifndef INT2PTR
# if (IVSIZE == PTRSIZE) && (UVSIZE == PTRSIZE)
# define PTRV UV
# define INT2PTR(any,d) (any)(d)
# else
# if PTRSIZE == LONGSIZE
# define PTRV unsigned long
# else
# define PTRV unsigned
# endif
# define INT2PTR(any,d) (any)(PTRV)(d)
# endif
# define NUM2PTR(any,d) (any)(PTRV)(d)
# define PTR2IV(p) INT2PTR(IV,p)
# define PTR2UV(p) INT2PTR(UV,p)
# define PTR2NV(p) NUM2PTR(NV,p)
# if PTRSIZE == LONGSIZE
# define PTR2ul(p) (unsigned long)(p)
# else
# define PTR2ul(p) INT2PTR(unsigned long,p)
# endif
#endif /* !INT2PTR */
#ifndef SvPV_nolen
# define SvPV_nolen(x) SvPV(x,PL_na)
#endif
#ifndef get_sv
# define get_sv perl_get_sv
#endif
#ifndef ERRSV
# define ERRSV get_sv("@",FALSE)
#endif
#ifndef pTHX_
#define pTHX_
#endif
#include <string.h>
#ifdef __cplusplus
}
#endif
/* -----------------------------------------------------------------------------
* error manipulation
* ----------------------------------------------------------------------------- */
SWIGINTERN const char*
SWIG_Perl_ErrorType(int code) {
switch(code) {
case SWIG_MemoryError:
return "MemoryError";
case SWIG_IOError:
return "IOError";
case SWIG_RuntimeError:
return "RuntimeError";
case SWIG_IndexError:
return "IndexError";
case SWIG_TypeError:
return "TypeError";
case SWIG_DivisionByZero:
return "ZeroDivisionError";
case SWIG_OverflowError:
return "OverflowError";
case SWIG_SyntaxError:
return "SyntaxError";
case SWIG_ValueError:
return "ValueError";
case SWIG_SystemError:
return "SystemError";
case SWIG_AttributeError:
return "AttributeError";
default:
return "RuntimeError";
}
}
/* -----------------------------------------------------------------------------
* perlrun.swg
*
* This file contains the runtime support for Perl modules
* and includes code for managing global variables and pointer
* type checking.
* ----------------------------------------------------------------------------- */
#ifdef PERL_OBJECT
#define SWIG_PERL_OBJECT_DECL CPerlObj *SWIGUNUSEDPARM(pPerl),
#define SWIG_PERL_OBJECT_CALL pPerl,
#else
#define SWIG_PERL_OBJECT_DECL
#define SWIG_PERL_OBJECT_CALL
#endif
/* Common SWIG API */
/* for raw pointers */
#define SWIG_ConvertPtr(obj, pp, type, flags) SWIG_Perl_ConvertPtr(SWIG_PERL_OBJECT_CALL obj, pp, type, flags)
#define SWIG_ConvertPtrAndOwn(obj, pp, type, flags,own) SWIG_Perl_ConvertPtrAndOwn(SWIG_PERL_OBJECT_CALL obj, pp, type, flags, own)
#define SWIG_NewPointerObj(p, type, flags) SWIG_Perl_NewPointerObj(SWIG_PERL_OBJECT_CALL p, type, flags)
/* for raw packed data */
#define SWIG_ConvertPacked(obj, p, s, type) SWIG_Perl_ConvertPacked(SWIG_PERL_OBJECT_CALL obj, p, s, type)
#define SWIG_NewPackedObj(p, s, type) SWIG_Perl_NewPackedObj(SWIG_PERL_OBJECT_CALL p, s, type)
/* for class or struct pointers */
#define SWIG_ConvertInstance(obj, pptr, type, flags) SWIG_ConvertPtr(obj, pptr, type, flags)
#define SWIG_NewInstanceObj(ptr, type, flags) SWIG_NewPointerObj(ptr, type, flags)
/* for C or C++ function pointers */
#define SWIG_ConvertFunctionPtr(obj, pptr, type) SWIG_ConvertPtr(obj, pptr, type, 0)
#define SWIG_NewFunctionPtrObj(ptr, type) SWIG_NewPointerObj(ptr, type, 0)
/* for C++ member pointers, ie, member methods */
#define SWIG_ConvertMember(obj, ptr, sz, ty) SWIG_ConvertPacked(obj, ptr, sz, ty)
#define SWIG_NewMemberObj(ptr, sz, type) SWIG_NewPackedObj(ptr, sz, type)
/* Runtime API */
#define SWIG_GetModule(clientdata) SWIG_Perl_GetModule(clientdata)
#define SWIG_SetModule(clientdata, pointer) SWIG_Perl_SetModule(pointer)
/* Error manipulation */
#define SWIG_ErrorType(code) SWIG_Perl_ErrorType(code)
#define SWIG_Error(code, msg) sv_setpvf(get_sv("@", GV_ADD), "%s %s", SWIG_ErrorType(code), msg)
#define SWIG_fail goto fail
/* Perl-specific SWIG API */
#define SWIG_MakePtr(sv, ptr, type, flags) SWIG_Perl_MakePtr(SWIG_PERL_OBJECT_CALL sv, ptr, type, flags)
#define SWIG_MakePackedObj(sv, p, s, type) SWIG_Perl_MakePackedObj(SWIG_PERL_OBJECT_CALL sv, p, s, type)
#define SWIG_SetError(str) SWIG_Error(SWIG_RuntimeError, str)
#define SWIG_PERL_DECL_ARGS_1(arg1) (SWIG_PERL_OBJECT_DECL arg1)
#define SWIG_PERL_CALL_ARGS_1(arg1) (SWIG_PERL_OBJECT_CALL arg1)
#define SWIG_PERL_DECL_ARGS_2(arg1, arg2) (SWIG_PERL_OBJECT_DECL arg1, arg2)
#define SWIG_PERL_CALL_ARGS_2(arg1, arg2) (SWIG_PERL_OBJECT_CALL arg1, arg2)
/* -----------------------------------------------------------------------------
* pointers/data manipulation
* ----------------------------------------------------------------------------- */
/* For backward compatibility only */
#define SWIG_POINTER_EXCEPTION 0
#ifdef __cplusplus
extern "C" {
#endif
#define SWIG_OWNER SWIG_POINTER_OWN
#define SWIG_SHADOW SWIG_OWNER << 1
#define SWIG_MAYBE_PERL_OBJECT SWIG_PERL_OBJECT_DECL
/* SWIG Perl macros */
/* Macro to declare an XS function */
#ifndef XSPROTO
# define XSPROTO(name) void name(pTHX_ CV* cv)
#endif
/* Macro to call an XS function */
#ifdef PERL_OBJECT
# define SWIG_CALLXS(_name) _name(cv,pPerl)
#else
# ifndef MULTIPLICITY
# define SWIG_CALLXS(_name) _name(cv)
# else
# define SWIG_CALLXS(_name) _name(PERL_GET_THX, cv)
# endif
#endif
#ifdef PERL_OBJECT
#define MAGIC_PPERL CPerlObj *pPerl = (CPerlObj *) this;
#ifdef __cplusplus
extern "C" {
#endif
typedef int (CPerlObj::*SwigMagicFunc)(SV *, MAGIC *);
#ifdef __cplusplus
}
#endif
#define SWIG_MAGIC(a,b) (SV *a, MAGIC *b)
#define SWIGCLASS_STATIC
#else /* PERL_OBJECT */
#define MAGIC_PPERL
#define SWIGCLASS_STATIC static SWIGUNUSED
#ifndef MULTIPLICITY
#define SWIG_MAGIC(a,b) (SV *a, MAGIC *b)
#ifdef __cplusplus
extern "C" {
#endif
typedef int (*SwigMagicFunc)(SV *, MAGIC *);
#ifdef __cplusplus
}
#endif
#else /* MULTIPLICITY */
#define SWIG_MAGIC(a,b) (struct interpreter *interp, SV *a, MAGIC *b)
#ifdef __cplusplus
extern "C" {
#endif
typedef int (*SwigMagicFunc)(struct interpreter *, SV *, MAGIC *);
#ifdef __cplusplus
}
#endif
#endif /* MULTIPLICITY */
#endif /* PERL_OBJECT */
# ifdef PERL_OBJECT
# define SWIG_croak_null() SWIG_Perl_croak_null(pPerl)
static void SWIG_Perl_croak_null(CPerlObj *pPerl)
# else
static void SWIG_croak_null()
# endif
{
SV *err = get_sv("@", GV_ADD);
# if (PERL_VERSION < 6)
croak("%_", err);
# else
if (sv_isobject(err))
croak(0);
else
croak("%s", SvPV_nolen(err));
# endif
}
/*
Define how strict is the cast between strings and integers/doubles
when overloading between these types occurs.
The default is making it as strict as possible by using SWIG_AddCast
when needed.
You can use -DSWIG_PERL_NO_STRICT_STR2NUM at compilation time to
disable the SWIG_AddCast, making the casting between string and
numbers less strict.
In the end, we try to solve the overloading between strings and
numerical types in the more natural way, but if you can avoid it,
well, avoid it using %rename, for example.
*/
#ifndef SWIG_PERL_NO_STRICT_STR2NUM
# ifndef SWIG_PERL_STRICT_STR2NUM
# define SWIG_PERL_STRICT_STR2NUM
# endif
#endif
#ifdef SWIG_PERL_STRICT_STR2NUM
/* string takes precedence */
#define SWIG_Str2NumCast(x) SWIG_AddCast(x)
#else
/* number takes precedence */
#define SWIG_Str2NumCast(x) x
#endif
#include <stdlib.h>
SWIGRUNTIME const char *
SWIG_Perl_TypeProxyName(const swig_type_info *type) {
if (!type) return NULL;
if (type->clientdata != NULL) {
return (const char*) type->clientdata;
}
else {
return type->name;
}
}
/* Identical to SWIG_TypeCheck, except for strcmp comparison */
SWIGRUNTIME swig_cast_info *
SWIG_TypeProxyCheck(const char *c, swig_type_info *ty) {
if (ty) {
swig_cast_info *iter = ty->cast;
while (iter) {
if (strcmp(SWIG_Perl_TypeProxyName(iter->type), c) == 0) {
if (iter == ty->cast)
return iter;
/* Move iter to the top of the linked list */
iter->prev->next = iter->next;
if (iter->next)
iter->next->prev = iter->prev;
iter->next = ty->cast;
iter->prev = 0;
if (ty->cast) ty->cast->prev = iter;
ty->cast = iter;
return iter;
}
iter = iter->next;
}
}
return 0;
}
/* Function for getting a pointer value */
SWIGRUNTIME int
SWIG_Perl_ConvertPtrAndOwn(SWIG_MAYBE_PERL_OBJECT SV *sv, void **ptr, swig_type_info *_t, int flags, int *own) {
swig_cast_info *tc;
void *voidptr = (void *)0;
SV *tsv = 0;
if (own)
*own = 0;
/* If magical, apply more magic */
if (SvGMAGICAL(sv))
mg_get(sv);
/* Check to see if this is an object */
if (sv_isobject(sv)) {
IV tmp = 0;
tsv = (SV*) SvRV(sv);
if ((SvTYPE(tsv) == SVt_PVHV)) {
MAGIC *mg;
if (SvMAGICAL(tsv)) {
mg = mg_find(tsv,'P');
if (mg) {
sv = mg->mg_obj;
if (sv_isobject(sv)) {
tsv = (SV*)SvRV(sv);
tmp = SvIV(tsv);
}
}
} else {
return SWIG_ERROR;
}
} else {
tmp = SvIV(tsv);
}
voidptr = INT2PTR(void *,tmp);
} else if (! SvOK(sv)) { /* Check for undef */
*(ptr) = (void *) 0;
return SWIG_OK;
} else if (SvTYPE(sv) == SVt_RV) { /* Check for NULL pointer */
if (!SvROK(sv)) {
/* In Perl 5.12 and later, SVt_RV == SVt_IV, so sv could be a valid integer value. */
if (SvIOK(sv)) {
return SWIG_ERROR;
} else {
/* NULL pointer (reference to undef). */
*(ptr) = (void *) 0;
return SWIG_OK;
}
} else {
return SWIG_ERROR;
}
} else { /* Don't know what it is */
return SWIG_ERROR;
}
if (_t) {
/* Now see if the types match */
char *_c = HvNAME(SvSTASH(SvRV(sv)));
tc = SWIG_TypeProxyCheck(_c,_t);
if (!tc) {
return SWIG_ERROR;
}
{
int newmemory = 0;
*ptr = SWIG_TypeCast(tc,voidptr,&newmemory);
if (newmemory == SWIG_CAST_NEW_MEMORY) {
assert(own); /* badly formed typemap which will lead to a memory leak - it must set and use own to delete *ptr */
if (own)
*own = *own | SWIG_CAST_NEW_MEMORY;
}
}
} else {
*ptr = voidptr;
}
/*
* DISOWN implementation: we need a perl guru to check this one.
*/
if (tsv && (flags & SWIG_POINTER_DISOWN)) {
/*
* almost copy paste code from below SWIG_POINTER_OWN setting
*/
SV *obj = sv;
HV *stash = SvSTASH(SvRV(obj));
GV *gv = *(GV**)hv_fetch(stash, "OWNER", 5, TRUE);
if (isGV(gv)) {
HV *hv = GvHVn(gv);
/*
* To set ownership (see below), a newSViv(1) entry is added.
* Hence, to remove ownership, we delete the entry.
*/
if (hv_exists_ent(hv, obj, 0)) {
hv_delete_ent(hv, obj, 0, 0);
}
}
}
return SWIG_OK;
}
SWIGRUNTIME int
SWIG_Perl_ConvertPtr(SWIG_MAYBE_PERL_OBJECT SV *sv, void **ptr, swig_type_info *_t, int flags) {
return SWIG_Perl_ConvertPtrAndOwn(sv, ptr, _t, flags, 0);
}
SWIGRUNTIME void
SWIG_Perl_MakePtr(SWIG_MAYBE_PERL_OBJECT SV *sv, void *ptr, swig_type_info *t, int flags) {
if (ptr && (flags & (SWIG_SHADOW | SWIG_POINTER_OWN))) {
SV *self;
SV *obj=newSV(0);
HV *hash=newHV();
HV *stash;
sv_setref_pv(obj, SWIG_Perl_TypeProxyName(t), ptr);
stash=SvSTASH(SvRV(obj));
if (flags & SWIG_POINTER_OWN) {
HV *hv;
GV *gv = *(GV**)hv_fetch(stash, "OWNER", 5, TRUE);
if (!isGV(gv))
gv_init(gv, stash, "OWNER", 5, FALSE);
hv=GvHVn(gv);
hv_store_ent(hv, obj, newSViv(1), 0);
}
sv_magic((SV *)hash, (SV *)obj, 'P', Nullch, 0);
SvREFCNT_dec(obj);
self=newRV_noinc((SV *)hash);
sv_setsv(sv, self);
SvREFCNT_dec((SV *)self);
sv_bless(sv, stash);
}
else {
sv_setref_pv(sv, SWIG_Perl_TypeProxyName(t), ptr);
}
}
SWIGRUNTIMEINLINE SV *
SWIG_Perl_NewPointerObj(SWIG_MAYBE_PERL_OBJECT void *ptr, swig_type_info *t, int flags) {
SV *result = sv_newmortal();
SWIG_MakePtr(result, ptr, t, flags);
return result;
}
SWIGRUNTIME void
SWIG_Perl_MakePackedObj(SWIG_MAYBE_PERL_OBJECT SV *sv, void *ptr, int sz, swig_type_info *type) {
char result[1024];
char *r = result;
if ((2*sz + 1 + strlen(SWIG_Perl_TypeProxyName(type))) > 1000) return;
*(r++) = '_';
r = SWIG_PackData(r,ptr,sz);
strcpy(r,SWIG_Perl_TypeProxyName(type));
sv_setpv(sv, result);
}
SWIGRUNTIME SV *
SWIG_Perl_NewPackedObj(SWIG_MAYBE_PERL_OBJECT void *ptr, int sz, swig_type_info *type) {
SV *result = sv_newmortal();
SWIG_Perl_MakePackedObj(result, ptr, sz, type);
return result;
}
/* Convert a packed value value */
SWIGRUNTIME int
SWIG_Perl_ConvertPacked(SWIG_MAYBE_PERL_OBJECT SV *obj, void *ptr, int sz, swig_type_info *ty) {
swig_cast_info *tc;
const char *c = 0;
if ((!obj) || (!SvOK(obj))) return SWIG_ERROR;
c = SvPV_nolen(obj);
/* Pointer values must start with leading underscore */
if (*c != '_') return SWIG_ERROR;
c++;
c = SWIG_UnpackData(c,ptr,sz);
if (ty) {
tc = SWIG_TypeCheck(c,ty);
if (!tc) return SWIG_ERROR;
}
return SWIG_OK;
}
/* Macros for low-level exception handling */
#define SWIG_croak(x) { SWIG_Error(SWIG_RuntimeError, x); SWIG_fail; }
typedef XSPROTO(SwigPerlWrapper);
typedef SwigPerlWrapper *SwigPerlWrapperPtr;
/* Structure for command table */
typedef struct {
const char *name;
SwigPerlWrapperPtr wrapper;
} swig_command_info;
/* Information for constant table */
#define SWIG_INT 1
#define SWIG_FLOAT 2
#define SWIG_STRING 3
#define SWIG_POINTER 4
#define SWIG_BINARY 5
/* Constant information structure */
typedef struct swig_constant_info {
int type;
const char *name;
long lvalue;
double dvalue;
void *pvalue;
swig_type_info **ptype;
} swig_constant_info;
/* Structure for variable table */
typedef struct {
const char *name;
SwigMagicFunc set;
SwigMagicFunc get;
swig_type_info **type;
} swig_variable_info;
/* Magic variable code */
#ifndef PERL_OBJECT
# ifdef __cplusplus
# define swig_create_magic(s,a,b,c) _swig_create_magic(s,const_cast<char*>(a),b,c)
# else
# define swig_create_magic(s,a,b,c) _swig_create_magic(s,(char*)(a),b,c)
# endif
# ifndef MULTIPLICITY
SWIGRUNTIME void _swig_create_magic(SV *sv, char *name, int (*set)(SV *, MAGIC *), int (*get)(SV *,MAGIC *))
# else
SWIGRUNTIME void _swig_create_magic(SV *sv, char *name, int (*set)(struct interpreter*, SV *, MAGIC *), int (*get)(struct interpreter*, SV *,MAGIC *))
# endif
#else
# define swig_create_magic(s,a,b,c) _swig_create_magic(pPerl,s,a,b,c)
SWIGRUNTIME void _swig_create_magic(CPerlObj *pPerl, SV *sv, const char *name, int (CPerlObj::*set)(SV *, MAGIC *), int (CPerlObj::*get)(SV *, MAGIC *))
#endif
{
MAGIC *mg;
sv_magic(sv,sv,'U',name,strlen(name));
mg = mg_find(sv,'U');
mg->mg_virtual = (MGVTBL *) malloc(sizeof(MGVTBL));
mg->mg_virtual->svt_get = (SwigMagicFunc) get;
mg->mg_virtual->svt_set = (SwigMagicFunc) set;
mg->mg_virtual->svt_len = 0;
mg->mg_virtual->svt_clear = 0;
mg->mg_virtual->svt_free = 0;
}
SWIGRUNTIME swig_module_info *
SWIG_Perl_GetModule(void *SWIGUNUSEDPARM(clientdata)) {
static void *type_pointer = (void *)0;
SV *pointer;
/* first check if pointer already created */
if (!type_pointer) {
pointer = get_sv("swig_runtime_data::type_pointer" SWIG_RUNTIME_VERSION SWIG_TYPE_TABLE_NAME, FALSE | GV_ADDMULTI);
if (pointer && SvOK(pointer)) {
type_pointer = INT2PTR(swig_type_info **, SvIV(pointer));
}
}
return (swig_module_info *) type_pointer;
}
SWIGRUNTIME void
SWIG_Perl_SetModule(swig_module_info *module) {
SV *pointer;
/* create a new pointer */
pointer = get_sv("swig_runtime_data::type_pointer" SWIG_RUNTIME_VERSION SWIG_TYPE_TABLE_NAME, TRUE | GV_ADDMULTI);
sv_setiv(pointer, PTR2IV(module));
}
#ifdef __cplusplus
}
#endif
/* Workaround perl5 global namespace pollution. Note that undefining library
* functions like fopen will not solve the problem on all platforms as fopen
* might be a macro on Windows but not necessarily on other operating systems. */
#ifdef do_open
#undef do_open
#endif
#ifdef do_close
#undef do_close
#endif
#ifdef do_exec
#undef do_exec
#endif
#ifdef scalar
#undef scalar
#endif
#ifdef list
#undef list
#endif
#ifdef apply
#undef apply
#endif
#ifdef convert
#undef convert
#endif
#ifdef Error
#undef Error
#endif
#ifdef form
#undef form
#endif
#ifdef vform
#undef vform
#endif
#ifdef LABEL
#undef LABEL
#endif
#ifdef METHOD
#undef METHOD
#endif
#ifdef Move
#undef Move
#endif
#ifdef yylex
#undef yylex
#endif
#ifdef yyparse
#undef yyparse
#endif
#ifdef yyerror
#undef yyerror
#endif
#ifdef invert
#undef invert
#endif
#ifdef ref
#undef ref
#endif
#ifdef read
#undef read
#endif
#ifdef write
#undef write
#endif
#ifdef eof
#undef eof
#endif
#ifdef close
#undef close
#endif
#ifdef rewind
#undef rewind
#endif
#ifdef free
#undef free
#endif
#ifdef malloc
#undef malloc
#endif
#ifdef calloc
#undef calloc
#endif
#ifdef Stat
#undef Stat
#endif
#ifdef check
#undef check
#endif
#ifdef seekdir
#undef seekdir
#endif
#ifdef open
#undef open
#endif
#ifdef readdir
#undef readdir
#endif
#ifdef bind
#undef bind
#endif
#ifdef access
#undef access
#endif
#ifdef stat
#undef stat
#endif
#ifdef bool
/* Leave if macro is from C99 stdbool.h */
#ifndef __bool_true_false_are_defined
#undef bool
#endif
#endif
#define SWIG_exception_fail(code, msg) do { SWIG_Error(code, msg); SWIG_fail; } while(0)
#define SWIG_contract_assert(expr, msg) if (!(expr)) { SWIG_Error(SWIG_RuntimeError, msg); SWIG_fail; } else
/* -------- TYPES TABLE (BEGIN) -------- */
#define SWIGTYPE_p_FILE swig_types[0]
#define SWIGTYPE_p_char swig_types[1]
#define SWIGTYPE_p_double swig_types[2]
#define SWIGTYPE_p_f_p_q_const__char_p_q_const__char_int_int__void swig_types[3]
#define SWIGTYPE_p_f_p_q_const__char_p_q_const__char_int_p_q_const__char__void swig_types[4]
#define SWIGTYPE_p_gsl_permutation_struct swig_types[5]
#define SWIGTYPE_p_gsl_vector swig_types[6]
#define SWIGTYPE_p_gsl_vector_int swig_types[7]
#define SWIGTYPE_p_int swig_types[8]
#define SWIGTYPE_p_size_t swig_types[9]
static swig_type_info *swig_types[11];
static swig_module_info swig_module = {swig_types, 10, 0, 0, 0, 0};
#define SWIG_TypeQuery(name) SWIG_TypeQueryModule(&swig_module, &swig_module, name)
#define SWIG_MangledTypeQuery(name) SWIG_MangledTypeQueryModule(&swig_module, &swig_module, name)
/* -------- TYPES TABLE (END) -------- */
#define SWIG_init boot_Math__GSL__Sort
#define SWIG_name "Math::GSL::Sortc::boot_Math__GSL__Sort"
#define SWIG_prefix "Math::GSL::Sortc::"
#define SWIGVERSION 0x020012
#define SWIG_VERSION SWIGVERSION
#define SWIG_as_voidptr(a) (void *)((const void *)(a))
#define SWIG_as_voidptrptr(a) ((void)SWIG_as_voidptr(*a),(void**)(a))
#ifdef __cplusplus
extern "C"
#endif
#ifndef PERL_OBJECT
#ifndef MULTIPLICITY
SWIGEXPORT void SWIG_init (CV* cv);
#else
SWIGEXPORT void SWIG_init (pTHXo_ CV* cv);
#endif
#else
SWIGEXPORT void SWIG_init (CV *cv, CPerlObj *);
#endif
SWIGINTERNINLINE SV *
SWIG_From_long SWIG_PERL_DECL_ARGS_1(long value)
{
SV *sv;
if (value >= IV_MIN && value <= IV_MAX)
sv = newSViv(value);
else
sv = newSVpvf("%ld", value);
return sv_2mortal(sv);
}
SWIGINTERNINLINE SV *
SWIG_From_int SWIG_PERL_DECL_ARGS_1(int value)
{
return SWIG_From_long SWIG_PERL_CALL_ARGS_1(value);
}
SWIGINTERNINLINE SV *
SWIG_From_double SWIG_PERL_DECL_ARGS_1(double value)
{
return sv_2mortal(newSVnv(value));
}
SWIGINTERN swig_type_info*
SWIG_pchar_descriptor(void)
{
static int init = 0;
static swig_type_info* info = 0;
if (!init) {
info = SWIG_TypeQuery("_p_char");
init = 1;
}
return info;
}
SWIGINTERN int
SWIG_AsCharPtrAndSize(SV *obj, char** cptr, size_t* psize, int *alloc)
{
if (SvMAGICAL(obj)) {
SV *tmp = sv_newmortal();
SvSetSV(tmp, obj);
obj = tmp;
}
if (SvPOK(obj)) {
STRLEN len = 0;
char *cstr = SvPV(obj, len);
size_t size = len + 1;
if (cptr) {
if (alloc) {
if (*alloc == SWIG_NEWOBJ) {
*cptr = (char *)memcpy((char *)malloc((size)*sizeof(char)), cstr, sizeof(char)*(size));
} else {
*cptr = cstr;
*alloc = SWIG_OLDOBJ;
}
}
}
if (psize) *psize = size;
return SWIG_OK;
} else {
swig_type_info* pchar_descriptor = SWIG_pchar_descriptor();
if (pchar_descriptor) {
char* vptr = 0;
if (SWIG_ConvertPtr(obj, (void**)&vptr, pchar_descriptor, 0) == SWIG_OK) {
if (cptr) *cptr = vptr;
if (psize) *psize = vptr ? (strlen(vptr) + 1) : 0;
if (alloc) *alloc = SWIG_OLDOBJ;
return SWIG_OK;
}
}
}
return SWIG_TypeError;
}
#include <limits.h>
#if !defined(SWIG_NO_LLONG_MAX)
# if !defined(LLONG_MAX) && defined(__GNUC__) && defined (__LONG_LONG_MAX__)
# define LLONG_MAX __LONG_LONG_MAX__
# define LLONG_MIN (-LLONG_MAX - 1LL)
# define ULLONG_MAX (LLONG_MAX * 2ULL + 1ULL)
# endif
#endif
SWIGINTERN int
SWIG_AsVal_double SWIG_PERL_DECL_ARGS_2(SV *obj, double *val)
{
if (SvNIOK(obj)) {
if (val) *val = SvNV(obj);
return SWIG_OK;
} else if (SvIOK(obj)) {
if (val) *val = (double) SvIV(obj);
return SWIG_AddCast(SWIG_OK);
} else {
const char *nptr = SvPV_nolen(obj);
if (nptr) {
char *endptr;
double v;
errno = 0;
v = strtod(nptr, &endptr);
if (errno == ERANGE) {
errno = 0;
return SWIG_OverflowError;
} else {
if (*endptr == '\0') {
if (val) *val = v;
return SWIG_Str2NumCast(SWIG_OK);
}
}
}
}
return SWIG_TypeError;
}
#include <float.h>
#include <math.h>
SWIGINTERNINLINE int
SWIG_CanCastAsInteger(double *d, double min, double max) {
double x = *d;
if ((min <= x && x <= max)) {
double fx = floor(x);
double cx = ceil(x);
double rd = ((x - fx) < 0.5) ? fx : cx; /* simple rint */
if ((errno == EDOM) || (errno == ERANGE)) {
errno = 0;
} else {
double summ, reps, diff;
if (rd < x) {
diff = x - rd;
} else if (rd > x) {
diff = rd - x;
} else {
return 1;
}
summ = rd + x;
reps = diff/summ;
if (reps < 8*DBL_EPSILON) {
*d = rd;
return 1;
}
}
}
return 0;
}
SWIGINTERN int
SWIG_AsVal_long SWIG_PERL_DECL_ARGS_2(SV *obj, long* val)
{
if (SvUOK(obj)) {
UV v = SvUV(obj);
if (v <= LONG_MAX) {
if (val) *val = v;
return SWIG_OK;
}
return SWIG_OverflowError;
} else if (SvIOK(obj)) {
IV v = SvIV(obj);
if (v >= LONG_MIN && v <= LONG_MAX) {
if(val) *val = v;
return SWIG_OK;
}
return SWIG_OverflowError;
} else {
int dispatch = 0;
const char *nptr = SvPV_nolen(obj);
if (nptr) {
char *endptr;
long v;
errno = 0;
v = strtol(nptr, &endptr,0);
if (errno == ERANGE) {
errno = 0;
return SWIG_OverflowError;
} else {
if (*endptr == '\0') {
if (val) *val = v;
return SWIG_Str2NumCast(SWIG_OK);
}
}
}
if (!dispatch) {
double d;
int res = SWIG_AddCast(SWIG_AsVal_double SWIG_PERL_CALL_ARGS_2(obj,&d));
if (SWIG_IsOK(res) && SWIG_CanCastAsInteger(&d, LONG_MIN, LONG_MAX)) {
if (val) *val = (long)(d);
return res;
}
}
}
return SWIG_TypeError;
}
SWIGINTERN int
SWIG_AsVal_int SWIG_PERL_DECL_ARGS_2(SV * obj, int *val)
{
long v;
int res = SWIG_AsVal_long SWIG_PERL_CALL_ARGS_2(obj, &v);
if (SWIG_IsOK(res)) {
if ((v < INT_MIN || v > INT_MAX)) {
return SWIG_OverflowError;
} else {
if (val) *val = (int)(v);
}
}
return res;
}
SWIGINTERNINLINE SV *
SWIG_FromCharPtrAndSize(const char* carray, size_t size)
{
SV *obj = sv_newmortal();
if (carray) {
sv_setpvn(obj, carray, size);
} else {
sv_setsv(obj, &PL_sv_undef);
}
return obj;
}
SWIGINTERNINLINE SV *
SWIG_FromCharPtr(const char *cptr)
{
return SWIG_FromCharPtrAndSize(cptr, (cptr ? strlen(cptr) : 0));
}
#include "gsl/gsl_nan.h"
#include "gsl/gsl_errno.h"
#include "gsl/gsl_math.h"
#include "gsl/gsl_monte.h"
struct perl_array {
I32 len;
AV *array;
};
enum awType { awDouble, awFloat, awInt, awUnsigned };
typedef struct {
I32 size;
enum awType type;
void * data;
} array_wrapper;
array_wrapper * array_wrapper_alloc(int numelem, enum awType type){
array_wrapper * rv = malloc(sizeof(array_wrapper));
if (rv == NULL)
croak("array_wrapper_alloc: can't malloc wrapper\n");
switch (type){
case awDouble:
rv->data = malloc(sizeof(double) * numelem);
break;
case awFloat:
rv->data = malloc(sizeof(float) * numelem);
break;
case awInt:
rv->data = malloc(sizeof(int) * numelem);
break;
case awUnsigned:
rv->data = malloc(sizeof(unsigned int) * numelem);
break;
default:
croak("array_wrapper_alloc: type should be awDouble, awFloat, awInt, or awUnsigned");
}
if (rv->data == NULL)
croak("array_wrapper_alloc: can't malloc data");
rv->size = numelem;
rv->type = type;
return rv;
}
void array_wrapper_free(array_wrapper * daw){
free(daw->data);
free(daw);
}
/* structure to hold required information while the gsl function call
for each callback
*/
struct gsl_function_perl {
gsl_function C_gsl_function;
SV * function;
SV * params;
};
struct gsl_monte_function_perl {
gsl_monte_function C_gsl_monte_function;
SV * f;
SV * dim;
SV * params;
};
void gsl_function_perl_free(struct gsl_function_perl * perl_f){
if (perl_f != NULL) {
SvREFCNT_dec(perl_f->function);
SvREFCNT_dec(perl_f->params);
Safefree(perl_f);
}
}
/* These functions (C callbacks) calls the perl callbacks.
Info for perl callback can be found using the 'void*params' parameter
*/
double call_gsl_function(double x , void *params){
struct gsl_function_perl *F=(struct gsl_function_perl*)params;
unsigned int count;
double y;
dSP;
//fprintf(stderr, "LOOKUP CALLBACK\n");
ENTER;
SAVETMPS;
PUSHMARK(SP);
XPUSHs(sv_2mortal(newSVnv((double)x)));
XPUSHs(F->params);
PUTBACK; /* make local stack pointer global */
count = call_sv(F->function, G_SCALAR);
SPAGAIN;
if (count != 1)
croak("Expected to call subroutine in scalar context!");
y = POPn;
PUTBACK; /* make local stack pointer global */
FREETMPS;
LEAVE;
return y;
}
double call_gsl_monte_function(double *x_array , size_t dim, void *params){
struct gsl_monte_function_perl *F=(struct gsl_monte_function_perl*)params;
unsigned int count;
unsigned int i;
AV* perl_array;
double y;
dSP;
//fprintf(stderr, "LOOKUP CALLBACK\n");
ENTER;
SAVETMPS;
PUSHMARK(SP);
perl_array=newAV();
sv_2mortal((SV*)perl_array);
XPUSHs(sv_2mortal(newRV((SV *)perl_array)));
for(i=0; i<dim; i++) {
/* no mortal : it is referenced by the array */
av_push(perl_array, newSVnv(x_array[i]));
}
XPUSHs(sv_2mortal(newSViv(dim)));
XPUSHs(F->params);
PUTBACK; /* make local stack pointer global */
count = call_sv(F->f, G_SCALAR);
SPAGAIN;
if (count != 1)
croak("Expected to call subroutine in scalar context!");
y = POPn;
PUTBACK; /* make local stack pointer global */
FREETMPS;
LEAVE;
return y;
}
#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"
SWIGINTERN int
SWIG_AsVal_unsigned_SS_long SWIG_PERL_DECL_ARGS_2(SV *obj, unsigned long *val)
{
if (SvUOK(obj)) {
UV v = SvUV(obj);
if (v <= ULONG_MAX) {
if (val) *val = v;
return SWIG_OK;
}
return SWIG_OverflowError;
} else if (SvIOK(obj)) {
IV v = SvIV(obj);
if (v >= 0 && v <= ULONG_MAX) {
if (val) *val = v;
return SWIG_OK;
}
return SWIG_OverflowError;
} else {
int dispatch = 0;
const char *nptr = SvPV_nolen(obj);
if (nptr) {
char *endptr;
unsigned long v;
errno = 0;
v = strtoul(nptr, &endptr,0);
if (errno == ERANGE) {
errno = 0;
return SWIG_OverflowError;
} else {
if (*endptr == '\0') {
if (val) *val = v;
return SWIG_Str2NumCast(SWIG_OK);
}
}
}
if (!dispatch) {
double d;
int res = SWIG_AddCast(SWIG_AsVal_double SWIG_PERL_CALL_ARGS_2(obj,&d));
if (SWIG_IsOK(res) && SWIG_CanCastAsInteger(&d, 0, ULONG_MAX)) {
if (val) *val = (unsigned long)(d);
return res;
}
}
}
return SWIG_TypeError;
}
SWIGINTERNINLINE int
SWIG_AsVal_size_t SWIG_PERL_DECL_ARGS_2(SV * obj, size_t *val)
{
unsigned long v;
int res = SWIG_AsVal_unsigned_SS_long SWIG_PERL_CALL_ARGS_2(obj, val ? &v : 0);
if (SWIG_IsOK(res) && val) *val = (size_t)(v);
return res;
}
SWIGINTERNINLINE SV *
SWIG_From_unsigned_SS_long SWIG_PERL_DECL_ARGS_1(unsigned long value)
{
SV *sv;
if (value <= UV_MAX)
sv = newSVuv(value);
else
sv = newSVpvf("%lu", value);
return sv_2mortal(sv);
}
SWIGINTERNINLINE SV *
SWIG_From_size_t SWIG_PERL_DECL_ARGS_1(size_t value)
{
return SWIG_From_unsigned_SS_long SWIG_PERL_CALL_ARGS_1((unsigned long)(value));
}
#ifdef __cplusplus
extern "C" {
#endif
#ifdef PERL_OBJECT
#define MAGIC_CLASS _wrap_Math__GSL__Sort_var::
class _wrap_Math__GSL__Sort_var : public CPerlObj {
public:
#else
#define MAGIC_CLASS
#endif
SWIGCLASS_STATIC int swig_magic_readonly(pTHX_ SV *SWIGUNUSEDPARM(sv), MAGIC *SWIGUNUSEDPARM(mg)) {
MAGIC_PPERL
croak("Value is read-only.");
return 0;
}
#ifdef PERL_OBJECT
};
#endif
#ifdef __cplusplus
}
#endif
#ifdef __cplusplus
extern "C" {
#endif
XS(_wrap_gsl_error) {
{
char *arg1 = (char *) 0 ;
char *arg2 = (char *) 0 ;
int arg3 ;
int arg4 ;
int res1 ;
char *buf1 = 0 ;
int alloc1 = 0 ;
int res2 ;
char *buf2 = 0 ;
int alloc2 = 0 ;
int val3 ;
int ecode3 = 0 ;
int val4 ;
int ecode4 = 0 ;
int argvi = 0;
dXSARGS;
if ((items < 4) || (items > 4)) {
SWIG_croak("Usage: gsl_error(reason,file,line,gsl_errno);");
}
res1 = SWIG_AsCharPtrAndSize(ST(0), &buf1, NULL, &alloc1);
if (!SWIG_IsOK(res1)) {
SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "gsl_error" "', argument " "1"" of type '" "char const *""'");
}
arg1 = (char *)(buf1);
res2 = SWIG_AsCharPtrAndSize(ST(1), &buf2, NULL, &alloc2);
if (!SWIG_IsOK(res2)) {
SWIG_exception_fail(SWIG_ArgError(res2), "in method '" "gsl_error" "', argument " "2"" of type '" "char const *""'");
}
arg2 = (char *)(buf2);
ecode3 = SWIG_AsVal_int SWIG_PERL_CALL_ARGS_2(ST(2), &val3);
if (!SWIG_IsOK(ecode3)) {
SWIG_exception_fail(SWIG_ArgError(ecode3), "in method '" "gsl_error" "', argument " "3"" of type '" "int""'");
}
arg3 = (int)(val3);
ecode4 = SWIG_AsVal_int SWIG_PERL_CALL_ARGS_2(ST(3), &val4);
if (!SWIG_IsOK(ecode4)) {
SWIG_exception_fail(SWIG_ArgError(ecode4), "in method '" "gsl_error" "', argument " "4"" of type '" "int""'");
}
arg4 = (int)(val4);
gsl_error((char const *)arg1,(char const *)arg2,arg3,arg4);
ST(argvi) = sv_newmortal();
if (alloc1 == SWIG_NEWOBJ) free((char*)buf1);
if (alloc2 == SWIG_NEWOBJ) free((char*)buf2);
XSRETURN(argvi);
fail:
if (alloc1 == SWIG_NEWOBJ) free((char*)buf1);
if (alloc2 == SWIG_NEWOBJ) free((char*)buf2);
SWIG_croak_null();
}
}
XS(_wrap_gsl_stream_printf) {
{
char *arg1 = (char *) 0 ;
char *arg2 = (char *) 0 ;
int arg3 ;
char *arg4 = (char *) 0 ;
int res1 ;
char *buf1 = 0 ;
int alloc1 = 0 ;
int res2 ;
char *buf2 = 0 ;
int alloc2 = 0 ;
int val3 ;
int ecode3 = 0 ;
int res4 ;
char *buf4 = 0 ;
int alloc4 = 0 ;
int argvi = 0;
dXSARGS;
if ((items < 4) || (items > 4)) {
SWIG_croak("Usage: gsl_stream_printf(label,file,line,reason);");
}
res1 = SWIG_AsCharPtrAndSize(ST(0), &buf1, NULL, &alloc1);
if (!SWIG_IsOK(res1)) {
SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "gsl_stream_printf" "', argument " "1"" of type '" "char const *""'");
}
arg1 = (char *)(buf1);
res2 = SWIG_AsCharPtrAndSize(ST(1), &buf2, NULL, &alloc2);
if (!SWIG_IsOK(res2)) {
SWIG_exception_fail(SWIG_ArgError(res2), "in method '" "gsl_stream_printf" "', argument " "2"" of type '" "char const *""'");
}
arg2 = (char *)(buf2);
ecode3 = SWIG_AsVal_int SWIG_PERL_CALL_ARGS_2(ST(2), &val3);
if (!SWIG_IsOK(ecode3)) {
SWIG_exception_fail(SWIG_ArgError(ecode3), "in method '" "gsl_stream_printf" "', argument " "3"" of type '" "int""'");
}
arg3 = (int)(val3);
res4 = SWIG_AsCharPtrAndSize(ST(3), &buf4, NULL, &alloc4);
if (!SWIG_IsOK(res4)) {
SWIG_exception_fail(SWIG_ArgError(res4), "in method '" "gsl_stream_printf" "', argument " "4"" of type '" "char const *""'");
}
arg4 = (char *)(buf4);
gsl_stream_printf((char const *)arg1,(char const *)arg2,arg3,(char const *)arg4);
ST(argvi) = sv_newmortal();
if (alloc1 == SWIG_NEWOBJ) free((char*)buf1);
if (alloc2 == SWIG_NEWOBJ) free((char*)buf2);
if (alloc4 == SWIG_NEWOBJ) free((char*)buf4);
XSRETURN(argvi);
fail:
if (alloc1 == SWIG_NEWOBJ) free((char*)buf1);
if (alloc2 == SWIG_NEWOBJ) free((char*)buf2);
if (alloc4 == SWIG_NEWOBJ) free((char*)buf4);
SWIG_croak_null();
}
}
XS(_wrap_gsl_strerror) {
{
int arg1 ;
int val1 ;
int ecode1 = 0 ;
int argvi = 0;
char *result = 0 ;
dXSARGS;
if ((items < 1) || (items > 1)) {
SWIG_croak("Usage: gsl_strerror(gsl_errno);");
}
ecode1 = SWIG_AsVal_int SWIG_PERL_CALL_ARGS_2(ST(0), &val1);
if (!SWIG_IsOK(ecode1)) {
SWIG_exception_fail(SWIG_ArgError(ecode1), "in method '" "gsl_strerror" "', argument " "1"" of type '" "int""'");
}
arg1 = (int)(val1);
result = (char *)gsl_strerror(arg1);
ST(argvi) = SWIG_FromCharPtr((const char *)result); argvi++ ;
XSRETURN(argvi);
fail:
SWIG_croak_null();
}
}
XS(_wrap_gsl_set_error_handler) {
{
gsl_error_handler_t *arg1 = (gsl_error_handler_t *) 0 ;
int argvi = 0;
gsl_error_handler_t *result = 0 ;
dXSARGS;
if ((items < 1) || (items > 1)) {
SWIG_croak("Usage: gsl_set_error_handler(new_handler);");
}
{
int res = SWIG_ConvertFunctionPtr(ST(0), (void**)(&arg1), SWIGTYPE_p_f_p_q_const__char_p_q_const__char_int_int__void);
if (!SWIG_IsOK(res)) {
SWIG_exception_fail(SWIG_ArgError(res), "in method '" "gsl_set_error_handler" "', argument " "1"" of type '" "gsl_error_handler_t *""'");
}
}
result = (gsl_error_handler_t *)gsl_set_error_handler(arg1);
ST(argvi) = SWIG_NewFunctionPtrObj((void *)(result), SWIGTYPE_p_f_p_q_const__char_p_q_const__char_int_int__void); argvi++ ;
XSRETURN(argvi);
fail:
SWIG_croak_null();
}
}
XS(_wrap_gsl_set_error_handler_off) {
{
int argvi = 0;
gsl_error_handler_t *result = 0 ;
dXSARGS;
if ((items < 0) || (items > 0)) {
SWIG_croak("Usage: gsl_set_error_handler_off();");
}
result = (gsl_error_handler_t *)gsl_set_error_handler_off();
ST(argvi) = SWIG_NewFunctionPtrObj((void *)(result), SWIGTYPE_p_f_p_q_const__char_p_q_const__char_int_int__void); argvi++ ;
XSRETURN(argvi);
fail:
SWIG_croak_null();
}
}
XS(_wrap_gsl_set_stream_handler) {
{
gsl_stream_handler_t *arg1 = (gsl_stream_handler_t *) 0 ;
int argvi = 0;
gsl_stream_handler_t *result = 0 ;
dXSARGS;
if ((items < 1) || (items > 1)) {
SWIG_croak("Usage: gsl_set_stream_handler(new_handler);");
}
{
int res = SWIG_ConvertFunctionPtr(ST(0), (void**)(&arg1), SWIGTYPE_p_f_p_q_const__char_p_q_const__char_int_p_q_const__char__void);
if (!SWIG_IsOK(res)) {
SWIG_exception_fail(SWIG_ArgError(res), "in method '" "gsl_set_stream_handler" "', argument " "1"" of type '" "gsl_stream_handler_t *""'");
}
}
result = (gsl_stream_handler_t *)gsl_set_stream_handler(arg1);
ST(argvi) = SWIG_NewFunctionPtrObj((void *)(result), SWIGTYPE_p_f_p_q_const__char_p_q_const__char_int_p_q_const__char__void); argvi++ ;
XSRETURN(argvi);
fail:
SWIG_croak_null();
}
}
XS(_wrap_gsl_set_stream) {
{
FILE *arg1 = (FILE *) 0 ;
void *argp1 = 0 ;
int res1 = 0 ;
int argvi = 0;
FILE *result = 0 ;
dXSARGS;
if ((items < 1) || (items > 1)) {
SWIG_croak("Usage: gsl_set_stream(new_stream);");
}
res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_FILE, 0 | 0 );
if (!SWIG_IsOK(res1)) {
SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "gsl_set_stream" "', argument " "1"" of type '" "FILE *""'");
}
arg1 = (FILE *)(argp1);
result = (FILE *)gsl_set_stream(arg1);
ST(argvi) = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_FILE, 0 | 0); argvi++ ;
XSRETURN(argvi);
fail:
SWIG_croak_null();
}
}
XS(_wrap_gsl_sort) {
{
double *arg1 = (double *) 0 ;
size_t arg2 ;
size_t arg3 ;
size_t val2 ;
int ecode2 = 0 ;
size_t val3 ;
int ecode3 = 0 ;
int argvi = 0;
SV * _saved[1] ;
dXSARGS;
if ((items < 3) || (items > 3)) {
SWIG_croak("Usage: gsl_sort(data,stride,n);");
}
{
AV *tempav;
I32 len;
int i;
SV **tv;
if (!SvROK(ST(0)))
croak("Math::GSL : $data is not a reference!");
if (SvTYPE(SvRV(ST(0))) != SVt_PVAV)
croak("Math::GSL : $data is not an array ref!");
tempav = (AV*)SvRV(ST(0));
len = av_len(tempav);
arg1 = (double *) malloc((len+2)*sizeof(double));
for (i = 0; i <= len; i++) {
tv = av_fetch(tempav, i, 0);
arg1[i] = (double) SvNV(*tv);
}
}
ecode2 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(1), &val2);
if (!SWIG_IsOK(ecode2)) {
SWIG_exception_fail(SWIG_ArgError(ecode2), "in method '" "gsl_sort" "', argument " "2"" of type '" "size_t""'");
}
arg2 = (size_t)(val2);
ecode3 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(2), &val3);
if (!SWIG_IsOK(ecode3)) {
SWIG_exception_fail(SWIG_ArgError(ecode3), "in method '" "gsl_sort" "', argument " "3"" of type '" "size_t""'");
}
arg3 = (size_t)(val3);
_saved[0] = ST(0);
gsl_sort(arg1,arg2,arg3);
ST(argvi) = sv_newmortal();
{
int i=0;
AV* tempav = newAV();
while( i < arg3 ) {
av_push(tempav, newSVnv((double) arg1[i]));
i++;
}
ST(argvi) = sv_2mortal( newRV_noinc( (SV*) tempav) );
//Perl_sv_dump(ST(argvi));
argvi++;
}
{
if (arg1) free(arg1);
}
XSRETURN(argvi);
fail:
{
if (arg1) free(arg1);
}
SWIG_croak_null();
}
}
XS(_wrap_gsl_sort2) {
{
double *arg1 = (double *) 0 ;
size_t arg2 ;
double *arg3 = (double *) 0 ;
size_t arg4 ;
size_t arg5 ;
void *argp1 = 0 ;
int res1 = 0 ;
size_t val2 ;
int ecode2 = 0 ;
void *argp3 = 0 ;
int res3 = 0 ;
size_t val4 ;
int ecode4 = 0 ;
size_t val5 ;
int ecode5 = 0 ;
int argvi = 0;
dXSARGS;
if ((items < 5) || (items > 5)) {
SWIG_croak("Usage: gsl_sort2(data1,stride1,data2,stride2,n);");
}
res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_double, 0 | 0 );
if (!SWIG_IsOK(res1)) {
SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "gsl_sort2" "', argument " "1"" of type '" "double *""'");
}
arg1 = (double *)(argp1);
ecode2 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(1), &val2);
if (!SWIG_IsOK(ecode2)) {
SWIG_exception_fail(SWIG_ArgError(ecode2), "in method '" "gsl_sort2" "', argument " "2"" of type '" "size_t""'");
}
arg2 = (size_t)(val2);
res3 = SWIG_ConvertPtr(ST(2), &argp3,SWIGTYPE_p_double, 0 | 0 );
if (!SWIG_IsOK(res3)) {
SWIG_exception_fail(SWIG_ArgError(res3), "in method '" "gsl_sort2" "', argument " "3"" of type '" "double *""'");
}
arg3 = (double *)(argp3);
ecode4 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(3), &val4);
if (!SWIG_IsOK(ecode4)) {
SWIG_exception_fail(SWIG_ArgError(ecode4), "in method '" "gsl_sort2" "', argument " "4"" of type '" "size_t""'");
}
arg4 = (size_t)(val4);
ecode5 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(4), &val5);
if (!SWIG_IsOK(ecode5)) {
SWIG_exception_fail(SWIG_ArgError(ecode5), "in method '" "gsl_sort2" "', argument " "5"" of type '" "size_t""'");
}
arg5 = (size_t)(val5);
gsl_sort2(arg1,arg2,arg3,arg4,arg5);
ST(argvi) = sv_newmortal();
XSRETURN(argvi);
fail:
SWIG_croak_null();
}
}
XS(_wrap_gsl_sort_index) {
{
size_t *arg1 = (size_t *) 0 ;
double *arg2 = (double *) 0 ;
size_t arg3 ;
size_t arg4 ;
size_t val3 ;
int ecode3 = 0 ;
size_t val4 ;
int ecode4 = 0 ;
int argvi = 0;
SV * _saved[1] ;
dXSARGS;
if ((items < 4) || (items > 4)) {
SWIG_croak("Usage: gsl_sort_index(p,data,stride,n);");
}
{
AV *tempav;
I32 len;
int i;
SV **tv;
if (!SvROK(ST(0)))
croak("Math::GSL : $p is not a reference!");
if (SvTYPE(SvRV(ST(0))) != SVt_PVAV)
croak("Math::GSL : $p is not an array ref!");
tempav = (AV*)SvRV(ST(0));
len = av_len(tempav);
/* Why does this need to be len+2 ? */
arg1 = (size_t *) malloc((len+2)*sizeof(size_t));
for (i = 0; i <= len; i++) {
tv = av_fetch(tempav, i, 0);
arg1[i] = (size_t) SvIV(*tv);
}
}
{
AV *tempav;
I32 len;
int i;
SV **tv;
if (!SvROK(ST(1)))
croak("Math::GSL : $data is not a reference!");
if (SvTYPE(SvRV(ST(1))) != SVt_PVAV)
croak("Math::GSL : $data is not an array ref!");
tempav = (AV*)SvRV(ST(1));
len = av_len(tempav);
arg2 = (double *) malloc((len+2)*sizeof(double));
for (i = 0; i <= len; i++) {
tv = av_fetch(tempav, i, 0);
arg2[i] = (double) SvNV(*tv);
}
}
ecode3 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(2), &val3);
if (!SWIG_IsOK(ecode3)) {
SWIG_exception_fail(SWIG_ArgError(ecode3), "in method '" "gsl_sort_index" "', argument " "3"" of type '" "size_t""'");
}
arg3 = (size_t)(val3);
ecode4 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(3), &val4);
if (!SWIG_IsOK(ecode4)) {
SWIG_exception_fail(SWIG_ArgError(ecode4), "in method '" "gsl_sort_index" "', argument " "4"" of type '" "size_t""'");
}
arg4 = (size_t)(val4);
_saved[0] = ST(0);
gsl_sort_index(arg1,(double const *)arg2,arg3,arg4);
ST(argvi) = sv_newmortal();
{
int i=0;
AV* tempav = newAV();
while( i < arg4 ) {
av_push(tempav, newSViv((size_t) arg1[i]));
i++;
}
ST(argvi) = sv_2mortal( newRV_noinc( (SV*) tempav) );
argvi++;
}
{
// if (arg1) free(arg1);
}
{
if (arg2) free(arg2);
}
XSRETURN(argvi);
fail:
{
// if (arg1) free(arg1);
}
{
if (arg2) free(arg2);
}
SWIG_croak_null();
}
}
XS(_wrap_gsl_sort_smallest) {
{
double *arg1 = (double *) 0 ;
size_t arg2 ;
double *arg3 = (double *) 0 ;
size_t arg4 ;
size_t arg5 ;
size_t val2 ;
int ecode2 = 0 ;
size_t val4 ;
int ecode4 = 0 ;
size_t val5 ;
int ecode5 = 0 ;
int argvi = 0;
SV * _saved[1] ;
int result;
dXSARGS;
if ((items < 5) || (items > 5)) {
SWIG_croak("Usage: gsl_sort_smallest(dest,k,src,stride,n);");
}
{
AV *tempav;
I32 len;
int i;
SV **tv;
if (!SvROK(ST(0)))
croak("Math::GSL : $dest is not a reference!");
if (SvTYPE(SvRV(ST(0))) != SVt_PVAV)
croak("Math::GSL : $dest is not an array ref!");
tempav = (AV*)SvRV(ST(0));
len = av_len(tempav);
arg1 = (double *) malloc((len+2)*sizeof(double));
for (i = 0; i <= len; i++) {
tv = av_fetch(tempav, i, 0);
arg1[i] = (double) SvNV(*tv);
}
}
ecode2 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(1), &val2);
if (!SWIG_IsOK(ecode2)) {
SWIG_exception_fail(SWIG_ArgError(ecode2), "in method '" "gsl_sort_smallest" "', argument " "2"" of type '" "size_t""'");
}
arg2 = (size_t)(val2);
{
AV *tempav;
I32 len;
int i;
SV **tv;
if (!SvROK(ST(2)))
croak("Math::GSL : $src is not a reference!");
if (SvTYPE(SvRV(ST(2))) != SVt_PVAV)
croak("Math::GSL : $src is not an array ref!");
tempav = (AV*)SvRV(ST(2));
len = av_len(tempav);
arg3 = (double *) malloc((len+2)*sizeof(double));
for (i = 0; i <= len; i++) {
tv = av_fetch(tempav, i, 0);
arg3[i] = (double) SvNV(*tv);
}
}
ecode4 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(3), &val4);
if (!SWIG_IsOK(ecode4)) {
SWIG_exception_fail(SWIG_ArgError(ecode4), "in method '" "gsl_sort_smallest" "', argument " "4"" of type '" "size_t""'");
}
arg4 = (size_t)(val4);
ecode5 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(4), &val5);
if (!SWIG_IsOK(ecode5)) {
SWIG_exception_fail(SWIG_ArgError(ecode5), "in method '" "gsl_sort_smallest" "', argument " "5"" of type '" "size_t""'");
}
arg5 = (size_t)(val5);
_saved[0] = ST(0);
result = (int)gsl_sort_smallest(arg1,arg2,(double const *)arg3,arg4,arg5);
ST(argvi) = SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(result)); argvi++ ;
{
int i=0;
AV* tempav = newAV();
while( i < arg2 ) {
av_push(tempav, newSVnv((double) arg1[i]));
i++;
}
ST(argvi) = sv_2mortal( newRV_noinc( (SV*) tempav) );
argvi++;
}
{
if (arg1) free(arg1);
}
{
if (arg3) free(arg3);
}
XSRETURN(argvi);
fail:
{
if (arg1) free(arg1);
}
{
if (arg3) free(arg3);
}
SWIG_croak_null();
}
}
XS(_wrap_gsl_sort_smallest_index) {
{
size_t *arg1 = (size_t *) 0 ;
size_t arg2 ;
double *arg3 = (double *) 0 ;
size_t arg4 ;
size_t arg5 ;
size_t val2 ;
int ecode2 = 0 ;
size_t val4 ;
int ecode4 = 0 ;
size_t val5 ;
int ecode5 = 0 ;
int argvi = 0;
SV * _saved[1] ;
int result;
dXSARGS;
if ((items < 5) || (items > 5)) {
SWIG_croak("Usage: gsl_sort_smallest_index(p,k,src,stride,n);");
}
{
AV *tempav;
I32 len;
int i;
SV **tv;
if (!SvROK(ST(0)))
croak("Math::GSL : $p is not a reference!");
if (SvTYPE(SvRV(ST(0))) != SVt_PVAV)
croak("Math::GSL : $p is not an array ref!");
tempav = (AV*)SvRV(ST(0));
len = av_len(tempav);
/* Why does this need to be len+2 ? */
arg1 = (size_t *) malloc((len+2)*sizeof(size_t));
for (i = 0; i <= len; i++) {
tv = av_fetch(tempav, i, 0);
arg1[i] = (size_t) SvIV(*tv);
}
}
ecode2 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(1), &val2);
if (!SWIG_IsOK(ecode2)) {
SWIG_exception_fail(SWIG_ArgError(ecode2), "in method '" "gsl_sort_smallest_index" "', argument " "2"" of type '" "size_t""'");
}
arg2 = (size_t)(val2);
{
AV *tempav;
I32 len;
int i;
SV **tv;
if (!SvROK(ST(2)))
croak("Math::GSL : $src is not a reference!");
if (SvTYPE(SvRV(ST(2))) != SVt_PVAV)
croak("Math::GSL : $src is not an array ref!");
tempav = (AV*)SvRV(ST(2));
len = av_len(tempav);
arg3 = (double *) malloc((len+2)*sizeof(double));
for (i = 0; i <= len; i++) {
tv = av_fetch(tempav, i, 0);
arg3[i] = (double) SvNV(*tv);
}
}
ecode4 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(3), &val4);
if (!SWIG_IsOK(ecode4)) {
SWIG_exception_fail(SWIG_ArgError(ecode4), "in method '" "gsl_sort_smallest_index" "', argument " "4"" of type '" "size_t""'");
}
arg4 = (size_t)(val4);
ecode5 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(4), &val5);
if (!SWIG_IsOK(ecode5)) {
SWIG_exception_fail(SWIG_ArgError(ecode5), "in method '" "gsl_sort_smallest_index" "', argument " "5"" of type '" "size_t""'");
}
arg5 = (size_t)(val5);
_saved[0] = ST(0);
result = (int)gsl_sort_smallest_index(arg1,arg2,(double const *)arg3,arg4,arg5);
ST(argvi) = SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(result)); argvi++ ;
{
int i=0;
AV* tempav = newAV();
while( i < arg2 ) {
av_push(tempav, newSViv((size_t) arg1[i]));
i++;
}
ST(argvi) = sv_2mortal( newRV_noinc( (SV*) tempav) );
argvi++;
}
{
// if (arg1) free(arg1);
}
{
if (arg3) free(arg3);
}
XSRETURN(argvi);
fail:
{
// if (arg1) free(arg1);
}
{
if (arg3) free(arg3);
}
SWIG_croak_null();
}
}
XS(_wrap_gsl_sort_largest) {
{
double *arg1 = (double *) 0 ;
size_t arg2 ;
double *arg3 = (double *) 0 ;
size_t arg4 ;
size_t arg5 ;
size_t val2 ;
int ecode2 = 0 ;
size_t val4 ;
int ecode4 = 0 ;
size_t val5 ;
int ecode5 = 0 ;
int argvi = 0;
SV * _saved[1] ;
int result;
dXSARGS;
if ((items < 5) || (items > 5)) {
SWIG_croak("Usage: gsl_sort_largest(dest,k,src,stride,n);");
}
{
AV *tempav;
I32 len;
int i;
SV **tv;
if (!SvROK(ST(0)))
croak("Math::GSL : $dest is not a reference!");
if (SvTYPE(SvRV(ST(0))) != SVt_PVAV)
croak("Math::GSL : $dest is not an array ref!");
tempav = (AV*)SvRV(ST(0));
len = av_len(tempav);
arg1 = (double *) malloc((len+2)*sizeof(double));
for (i = 0; i <= len; i++) {
tv = av_fetch(tempav, i, 0);
arg1[i] = (double) SvNV(*tv);
}
}
ecode2 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(1), &val2);
if (!SWIG_IsOK(ecode2)) {
SWIG_exception_fail(SWIG_ArgError(ecode2), "in method '" "gsl_sort_largest" "', argument " "2"" of type '" "size_t""'");
}
arg2 = (size_t)(val2);
{
AV *tempav;
I32 len;
int i;
SV **tv;
if (!SvROK(ST(2)))
croak("Math::GSL : $src is not a reference!");
if (SvTYPE(SvRV(ST(2))) != SVt_PVAV)
croak("Math::GSL : $src is not an array ref!");
tempav = (AV*)SvRV(ST(2));
len = av_len(tempav);
arg3 = (double *) malloc((len+2)*sizeof(double));
for (i = 0; i <= len; i++) {
tv = av_fetch(tempav, i, 0);
arg3[i] = (double) SvNV(*tv);
}
}
ecode4 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(3), &val4);
if (!SWIG_IsOK(ecode4)) {
SWIG_exception_fail(SWIG_ArgError(ecode4), "in method '" "gsl_sort_largest" "', argument " "4"" of type '" "size_t""'");
}
arg4 = (size_t)(val4);
ecode5 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(4), &val5);
if (!SWIG_IsOK(ecode5)) {
SWIG_exception_fail(SWIG_ArgError(ecode5), "in method '" "gsl_sort_largest" "', argument " "5"" of type '" "size_t""'");
}
arg5 = (size_t)(val5);
_saved[0] = ST(0);
result = (int)gsl_sort_largest(arg1,arg2,(double const *)arg3,arg4,arg5);
ST(argvi) = SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(result)); argvi++ ;
{
int i=0;
AV* tempav = newAV();
while( i < arg2 ) {
av_push(tempav, newSVnv((double) arg1[i]));
i++;
}
ST(argvi) = sv_2mortal( newRV_noinc( (SV*) tempav) );
argvi++;
}
{
if (arg1) free(arg1);
}
{
if (arg3) free(arg3);
}
XSRETURN(argvi);
fail:
{
if (arg1) free(arg1);
}
{
if (arg3) free(arg3);
}
SWIG_croak_null();
}
}
XS(_wrap_gsl_sort_largest_index) {
{
size_t *arg1 = (size_t *) 0 ;
size_t arg2 ;
double *arg3 = (double *) 0 ;
size_t arg4 ;
size_t arg5 ;
size_t val2 ;
int ecode2 = 0 ;
size_t val4 ;
int ecode4 = 0 ;
size_t val5 ;
int ecode5 = 0 ;
int argvi = 0;
SV * _saved[1] ;
int result;
dXSARGS;
if ((items < 5) || (items > 5)) {
SWIG_croak("Usage: gsl_sort_largest_index(p,k,src,stride,n);");
}
{
AV *tempav;
I32 len;
int i;
SV **tv;
if (!SvROK(ST(0)))
croak("Math::GSL : $p is not a reference!");
if (SvTYPE(SvRV(ST(0))) != SVt_PVAV)
croak("Math::GSL : $p is not an array ref!");
tempav = (AV*)SvRV(ST(0));
len = av_len(tempav);
/* Why does this need to be len+2 ? */
arg1 = (size_t *) malloc((len+2)*sizeof(size_t));
for (i = 0; i <= len; i++) {
tv = av_fetch(tempav, i, 0);
arg1[i] = (size_t) SvIV(*tv);
}
}
ecode2 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(1), &val2);
if (!SWIG_IsOK(ecode2)) {
SWIG_exception_fail(SWIG_ArgError(ecode2), "in method '" "gsl_sort_largest_index" "', argument " "2"" of type '" "size_t""'");
}
arg2 = (size_t)(val2);
{
AV *tempav;
I32 len;
int i;
SV **tv;
if (!SvROK(ST(2)))
croak("Math::GSL : $src is not a reference!");
if (SvTYPE(SvRV(ST(2))) != SVt_PVAV)
croak("Math::GSL : $src is not an array ref!");
tempav = (AV*)SvRV(ST(2));
len = av_len(tempav);
arg3 = (double *) malloc((len+2)*sizeof(double));
for (i = 0; i <= len; i++) {
tv = av_fetch(tempav, i, 0);
arg3[i] = (double) SvNV(*tv);
}
}
ecode4 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(3), &val4);
if (!SWIG_IsOK(ecode4)) {
SWIG_exception_fail(SWIG_ArgError(ecode4), "in method '" "gsl_sort_largest_index" "', argument " "4"" of type '" "size_t""'");
}
arg4 = (size_t)(val4);
ecode5 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(4), &val5);
if (!SWIG_IsOK(ecode5)) {
SWIG_exception_fail(SWIG_ArgError(ecode5), "in method '" "gsl_sort_largest_index" "', argument " "5"" of type '" "size_t""'");
}
arg5 = (size_t)(val5);
_saved[0] = ST(0);
result = (int)gsl_sort_largest_index(arg1,arg2,(double const *)arg3,arg4,arg5);
ST(argvi) = SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(result)); argvi++ ;
{
int i=0;
AV* tempav = newAV();
while( i < arg2 ) {
av_push(tempav, newSViv((size_t) arg1[i]));
i++;
}
ST(argvi) = sv_2mortal( newRV_noinc( (SV*) tempav) );
argvi++;
}
{
// if (arg1) free(arg1);
}
{
if (arg3) free(arg3);
}
XSRETURN(argvi);
fail:
{
// if (arg1) free(arg1);
}
{
if (arg3) free(arg3);
}
SWIG_croak_null();
}
}
XS(_wrap_gsl_sort_int) {
{
int *arg1 = (int *) 0 ;
size_t arg2 ;
size_t arg3 ;
void *argp1 = 0 ;
int res1 = 0 ;
size_t val2 ;
int ecode2 = 0 ;
size_t val3 ;
int ecode3 = 0 ;
int argvi = 0;
dXSARGS;
if ((items < 3) || (items > 3)) {
SWIG_croak("Usage: gsl_sort_int(data,stride,n);");
}
res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_int, 0 | 0 );
if (!SWIG_IsOK(res1)) {
SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "gsl_sort_int" "', argument " "1"" of type '" "int *""'");
}
arg1 = (int *)(argp1);
ecode2 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(1), &val2);
if (!SWIG_IsOK(ecode2)) {
SWIG_exception_fail(SWIG_ArgError(ecode2), "in method '" "gsl_sort_int" "', argument " "2"" of type '" "size_t""'");
}
arg2 = (size_t)(val2);
ecode3 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(2), &val3);
if (!SWIG_IsOK(ecode3)) {
SWIG_exception_fail(SWIG_ArgError(ecode3), "in method '" "gsl_sort_int" "', argument " "3"" of type '" "size_t""'");
}
arg3 = (size_t)(val3);
gsl_sort_int(arg1,arg2,arg3);
ST(argvi) = sv_newmortal();
XSRETURN(argvi);
fail:
SWIG_croak_null();
}
}
XS(_wrap_gsl_sort2_int) {
{
int *arg1 = (int *) 0 ;
size_t arg2 ;
int *arg3 = (int *) 0 ;
size_t arg4 ;
size_t arg5 ;
void *argp1 = 0 ;
int res1 = 0 ;
size_t val2 ;
int ecode2 = 0 ;
void *argp3 = 0 ;
int res3 = 0 ;
size_t val4 ;
int ecode4 = 0 ;
size_t val5 ;
int ecode5 = 0 ;
int argvi = 0;
dXSARGS;
if ((items < 5) || (items > 5)) {
SWIG_croak("Usage: gsl_sort2_int(data1,stride1,data2,stride2,n);");
}
res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_int, 0 | 0 );
if (!SWIG_IsOK(res1)) {
SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "gsl_sort2_int" "', argument " "1"" of type '" "int *""'");
}
arg1 = (int *)(argp1);
ecode2 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(1), &val2);
if (!SWIG_IsOK(ecode2)) {
SWIG_exception_fail(SWIG_ArgError(ecode2), "in method '" "gsl_sort2_int" "', argument " "2"" of type '" "size_t""'");
}
arg2 = (size_t)(val2);
res3 = SWIG_ConvertPtr(ST(2), &argp3,SWIGTYPE_p_int, 0 | 0 );
if (!SWIG_IsOK(res3)) {
SWIG_exception_fail(SWIG_ArgError(res3), "in method '" "gsl_sort2_int" "', argument " "3"" of type '" "int *""'");
}
arg3 = (int *)(argp3);
ecode4 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(3), &val4);
if (!SWIG_IsOK(ecode4)) {
SWIG_exception_fail(SWIG_ArgError(ecode4), "in method '" "gsl_sort2_int" "', argument " "4"" of type '" "size_t""'");
}
arg4 = (size_t)(val4);
ecode5 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(4), &val5);
if (!SWIG_IsOK(ecode5)) {
SWIG_exception_fail(SWIG_ArgError(ecode5), "in method '" "gsl_sort2_int" "', argument " "5"" of type '" "size_t""'");
}
arg5 = (size_t)(val5);
gsl_sort2_int(arg1,arg2,arg3,arg4,arg5);
ST(argvi) = sv_newmortal();
XSRETURN(argvi);
fail:
SWIG_croak_null();
}
}
XS(_wrap_gsl_sort_int_index) {
{
size_t *arg1 = (size_t *) 0 ;
int *arg2 = (int *) 0 ;
size_t arg3 ;
size_t arg4 ;
void *argp2 = 0 ;
int res2 = 0 ;
size_t val3 ;
int ecode3 = 0 ;
size_t val4 ;
int ecode4 = 0 ;
int argvi = 0;
dXSARGS;
if ((items < 4) || (items > 4)) {
SWIG_croak("Usage: gsl_sort_int_index(p,data,stride,n);");
}
{
AV *tempav;
I32 len;
int i;
SV **tv;
if (!SvROK(ST(0)))
croak("Math::GSL : $p is not a reference!");
if (SvTYPE(SvRV(ST(0))) != SVt_PVAV)
croak("Math::GSL : $p is not an array ref!");
tempav = (AV*)SvRV(ST(0));
len = av_len(tempav);
/* Why does this need to be len+2 ? */
arg1 = (size_t *) malloc((len+2)*sizeof(size_t));
for (i = 0; i <= len; i++) {
tv = av_fetch(tempav, i, 0);
arg1[i] = (size_t) SvIV(*tv);
}
}
res2 = SWIG_ConvertPtr(ST(1), &argp2,SWIGTYPE_p_int, 0 | 0 );
if (!SWIG_IsOK(res2)) {
SWIG_exception_fail(SWIG_ArgError(res2), "in method '" "gsl_sort_int_index" "', argument " "2"" of type '" "int const *""'");
}
arg2 = (int *)(argp2);
ecode3 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(2), &val3);
if (!SWIG_IsOK(ecode3)) {
SWIG_exception_fail(SWIG_ArgError(ecode3), "in method '" "gsl_sort_int_index" "', argument " "3"" of type '" "size_t""'");
}
arg3 = (size_t)(val3);
ecode4 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(3), &val4);
if (!SWIG_IsOK(ecode4)) {
SWIG_exception_fail(SWIG_ArgError(ecode4), "in method '" "gsl_sort_int_index" "', argument " "4"" of type '" "size_t""'");
}
arg4 = (size_t)(val4);
gsl_sort_int_index(arg1,(int const *)arg2,arg3,arg4);
ST(argvi) = sv_newmortal();
{
// if (arg1) free(arg1);
}
XSRETURN(argvi);
fail:
{
// if (arg1) free(arg1);
}
SWIG_croak_null();
}
}
XS(_wrap_gsl_sort_int_smallest) {
{
int *arg1 = (int *) 0 ;
size_t arg2 ;
int *arg3 = (int *) 0 ;
size_t arg4 ;
size_t arg5 ;
void *argp1 = 0 ;
int res1 = 0 ;
size_t val2 ;
int ecode2 = 0 ;
void *argp3 = 0 ;
int res3 = 0 ;
size_t val4 ;
int ecode4 = 0 ;
size_t val5 ;
int ecode5 = 0 ;
int argvi = 0;
int result;
dXSARGS;
if ((items < 5) || (items > 5)) {
SWIG_croak("Usage: gsl_sort_int_smallest(dest,k,src,stride,n);");
}
res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_int, 0 | 0 );
if (!SWIG_IsOK(res1)) {
SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "gsl_sort_int_smallest" "', argument " "1"" of type '" "int *""'");
}
arg1 = (int *)(argp1);
ecode2 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(1), &val2);
if (!SWIG_IsOK(ecode2)) {
SWIG_exception_fail(SWIG_ArgError(ecode2), "in method '" "gsl_sort_int_smallest" "', argument " "2"" of type '" "size_t""'");
}
arg2 = (size_t)(val2);
res3 = SWIG_ConvertPtr(ST(2), &argp3,SWIGTYPE_p_int, 0 | 0 );
if (!SWIG_IsOK(res3)) {
SWIG_exception_fail(SWIG_ArgError(res3), "in method '" "gsl_sort_int_smallest" "', argument " "3"" of type '" "int const *""'");
}
arg3 = (int *)(argp3);
ecode4 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(3), &val4);
if (!SWIG_IsOK(ecode4)) {
SWIG_exception_fail(SWIG_ArgError(ecode4), "in method '" "gsl_sort_int_smallest" "', argument " "4"" of type '" "size_t""'");
}
arg4 = (size_t)(val4);
ecode5 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(4), &val5);
if (!SWIG_IsOK(ecode5)) {
SWIG_exception_fail(SWIG_ArgError(ecode5), "in method '" "gsl_sort_int_smallest" "', argument " "5"" of type '" "size_t""'");
}
arg5 = (size_t)(val5);
result = (int)gsl_sort_int_smallest(arg1,arg2,(int const *)arg3,arg4,arg5);
ST(argvi) = SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(result)); argvi++ ;
XSRETURN(argvi);
fail:
SWIG_croak_null();
}
}
XS(_wrap_gsl_sort_int_smallest_index) {
{
size_t *arg1 = (size_t *) 0 ;
size_t arg2 ;
int *arg3 = (int *) 0 ;
size_t arg4 ;
size_t arg5 ;
size_t val2 ;
int ecode2 = 0 ;
void *argp3 = 0 ;
int res3 = 0 ;
size_t val4 ;
int ecode4 = 0 ;
size_t val5 ;
int ecode5 = 0 ;
int argvi = 0;
int result;
dXSARGS;
if ((items < 5) || (items > 5)) {
SWIG_croak("Usage: gsl_sort_int_smallest_index(p,k,src,stride,n);");
}
{
AV *tempav;
I32 len;
int i;
SV **tv;
if (!SvROK(ST(0)))
croak("Math::GSL : $p is not a reference!");
if (SvTYPE(SvRV(ST(0))) != SVt_PVAV)
croak("Math::GSL : $p is not an array ref!");
tempav = (AV*)SvRV(ST(0));
len = av_len(tempav);
/* Why does this need to be len+2 ? */
arg1 = (size_t *) malloc((len+2)*sizeof(size_t));
for (i = 0; i <= len; i++) {
tv = av_fetch(tempav, i, 0);
arg1[i] = (size_t) SvIV(*tv);
}
}
ecode2 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(1), &val2);
if (!SWIG_IsOK(ecode2)) {
SWIG_exception_fail(SWIG_ArgError(ecode2), "in method '" "gsl_sort_int_smallest_index" "', argument " "2"" of type '" "size_t""'");
}
arg2 = (size_t)(val2);
res3 = SWIG_ConvertPtr(ST(2), &argp3,SWIGTYPE_p_int, 0 | 0 );
if (!SWIG_IsOK(res3)) {
SWIG_exception_fail(SWIG_ArgError(res3), "in method '" "gsl_sort_int_smallest_index" "', argument " "3"" of type '" "int const *""'");
}
arg3 = (int *)(argp3);
ecode4 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(3), &val4);
if (!SWIG_IsOK(ecode4)) {
SWIG_exception_fail(SWIG_ArgError(ecode4), "in method '" "gsl_sort_int_smallest_index" "', argument " "4"" of type '" "size_t""'");
}
arg4 = (size_t)(val4);
ecode5 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(4), &val5);
if (!SWIG_IsOK(ecode5)) {
SWIG_exception_fail(SWIG_ArgError(ecode5), "in method '" "gsl_sort_int_smallest_index" "', argument " "5"" of type '" "size_t""'");
}
arg5 = (size_t)(val5);
result = (int)gsl_sort_int_smallest_index(arg1,arg2,(int const *)arg3,arg4,arg5);
ST(argvi) = SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(result)); argvi++ ;
{
// if (arg1) free(arg1);
}
XSRETURN(argvi);
fail:
{
// if (arg1) free(arg1);
}
SWIG_croak_null();
}
}
XS(_wrap_gsl_sort_int_largest) {
{
int *arg1 = (int *) 0 ;
size_t arg2 ;
int *arg3 = (int *) 0 ;
size_t arg4 ;
size_t arg5 ;
void *argp1 = 0 ;
int res1 = 0 ;
size_t val2 ;
int ecode2 = 0 ;
void *argp3 = 0 ;
int res3 = 0 ;
size_t val4 ;
int ecode4 = 0 ;
size_t val5 ;
int ecode5 = 0 ;
int argvi = 0;
int result;
dXSARGS;
if ((items < 5) || (items > 5)) {
SWIG_croak("Usage: gsl_sort_int_largest(dest,k,src,stride,n);");
}
res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_int, 0 | 0 );
if (!SWIG_IsOK(res1)) {
SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "gsl_sort_int_largest" "', argument " "1"" of type '" "int *""'");
}
arg1 = (int *)(argp1);
ecode2 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(1), &val2);
if (!SWIG_IsOK(ecode2)) {
SWIG_exception_fail(SWIG_ArgError(ecode2), "in method '" "gsl_sort_int_largest" "', argument " "2"" of type '" "size_t""'");
}
arg2 = (size_t)(val2);
res3 = SWIG_ConvertPtr(ST(2), &argp3,SWIGTYPE_p_int, 0 | 0 );
if (!SWIG_IsOK(res3)) {
SWIG_exception_fail(SWIG_ArgError(res3), "in method '" "gsl_sort_int_largest" "', argument " "3"" of type '" "int const *""'");
}
arg3 = (int *)(argp3);
ecode4 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(3), &val4);
if (!SWIG_IsOK(ecode4)) {
SWIG_exception_fail(SWIG_ArgError(ecode4), "in method '" "gsl_sort_int_largest" "', argument " "4"" of type '" "size_t""'");
}
arg4 = (size_t)(val4);
ecode5 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(4), &val5);
if (!SWIG_IsOK(ecode5)) {
SWIG_exception_fail(SWIG_ArgError(ecode5), "in method '" "gsl_sort_int_largest" "', argument " "5"" of type '" "size_t""'");
}
arg5 = (size_t)(val5);
result = (int)gsl_sort_int_largest(arg1,arg2,(int const *)arg3,arg4,arg5);
ST(argvi) = SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(result)); argvi++ ;
XSRETURN(argvi);
fail:
SWIG_croak_null();
}
}
XS(_wrap_gsl_sort_int_largest_index) {
{
size_t *arg1 = (size_t *) 0 ;
size_t arg2 ;
int *arg3 = (int *) 0 ;
size_t arg4 ;
size_t arg5 ;
size_t val2 ;
int ecode2 = 0 ;
void *argp3 = 0 ;
int res3 = 0 ;
size_t val4 ;
int ecode4 = 0 ;
size_t val5 ;
int ecode5 = 0 ;
int argvi = 0;
int result;
dXSARGS;
if ((items < 5) || (items > 5)) {
SWIG_croak("Usage: gsl_sort_int_largest_index(p,k,src,stride,n);");
}
{
AV *tempav;
I32 len;
int i;
SV **tv;
if (!SvROK(ST(0)))
croak("Math::GSL : $p is not a reference!");
if (SvTYPE(SvRV(ST(0))) != SVt_PVAV)
croak("Math::GSL : $p is not an array ref!");
tempav = (AV*)SvRV(ST(0));
len = av_len(tempav);
/* Why does this need to be len+2 ? */
arg1 = (size_t *) malloc((len+2)*sizeof(size_t));
for (i = 0; i <= len; i++) {
tv = av_fetch(tempav, i, 0);
arg1[i] = (size_t) SvIV(*tv);
}
}
ecode2 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(1), &val2);
if (!SWIG_IsOK(ecode2)) {
SWIG_exception_fail(SWIG_ArgError(ecode2), "in method '" "gsl_sort_int_largest_index" "', argument " "2"" of type '" "size_t""'");
}
arg2 = (size_t)(val2);
res3 = SWIG_ConvertPtr(ST(2), &argp3,SWIGTYPE_p_int, 0 | 0 );
if (!SWIG_IsOK(res3)) {
SWIG_exception_fail(SWIG_ArgError(res3), "in method '" "gsl_sort_int_largest_index" "', argument " "3"" of type '" "int const *""'");
}
arg3 = (int *)(argp3);
ecode4 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(3), &val4);
if (!SWIG_IsOK(ecode4)) {
SWIG_exception_fail(SWIG_ArgError(ecode4), "in method '" "gsl_sort_int_largest_index" "', argument " "4"" of type '" "size_t""'");
}
arg4 = (size_t)(val4);
ecode5 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(4), &val5);
if (!SWIG_IsOK(ecode5)) {
SWIG_exception_fail(SWIG_ArgError(ecode5), "in method '" "gsl_sort_int_largest_index" "', argument " "5"" of type '" "size_t""'");
}
arg5 = (size_t)(val5);
result = (int)gsl_sort_int_largest_index(arg1,arg2,(int const *)arg3,arg4,arg5);
ST(argvi) = SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(result)); argvi++ ;
{
// if (arg1) free(arg1);
}
XSRETURN(argvi);
fail:
{
// if (arg1) free(arg1);
}
SWIG_croak_null();
}
}
XS(_wrap_gsl_sort_vector) {
{
gsl_vector *arg1 = (gsl_vector *) 0 ;
void *argp1 = 0 ;
int res1 = 0 ;
int argvi = 0;
dXSARGS;
if ((items < 1) || (items > 1)) {
SWIG_croak("Usage: gsl_sort_vector(v);");
}
res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_gsl_vector, 0 | 0 );
if (!SWIG_IsOK(res1)) {
SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "gsl_sort_vector" "', argument " "1"" of type '" "gsl_vector *""'");
}
arg1 = (gsl_vector *)(argp1);
gsl_sort_vector(arg1);
ST(argvi) = sv_newmortal();
XSRETURN(argvi);
fail:
SWIG_croak_null();
}
}
XS(_wrap_gsl_sort_vector2) {
{
gsl_vector *arg1 = (gsl_vector *) 0 ;
gsl_vector *arg2 = (gsl_vector *) 0 ;
void *argp1 = 0 ;
int res1 = 0 ;
void *argp2 = 0 ;
int res2 = 0 ;
int argvi = 0;
dXSARGS;
if ((items < 2) || (items > 2)) {
SWIG_croak("Usage: gsl_sort_vector2(v1,v2);");
}
res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_gsl_vector, 0 | 0 );
if (!SWIG_IsOK(res1)) {
SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "gsl_sort_vector2" "', argument " "1"" of type '" "gsl_vector *""'");
}
arg1 = (gsl_vector *)(argp1);
res2 = SWIG_ConvertPtr(ST(1), &argp2,SWIGTYPE_p_gsl_vector, 0 | 0 );
if (!SWIG_IsOK(res2)) {
SWIG_exception_fail(SWIG_ArgError(res2), "in method '" "gsl_sort_vector2" "', argument " "2"" of type '" "gsl_vector *""'");
}
arg2 = (gsl_vector *)(argp2);
gsl_sort_vector2(arg1,arg2);
ST(argvi) = sv_newmortal();
XSRETURN(argvi);
fail:
SWIG_croak_null();
}
}
XS(_wrap_gsl_sort_vector_index) {
{
gsl_permutation *arg1 = (gsl_permutation *) 0 ;
gsl_vector *arg2 = (gsl_vector *) 0 ;
void *argp1 = 0 ;
int res1 = 0 ;
void *argp2 = 0 ;
int res2 = 0 ;
int argvi = 0;
int result;
dXSARGS;
if ((items < 2) || (items > 2)) {
SWIG_croak("Usage: gsl_sort_vector_index(p,v);");
}
res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_gsl_permutation_struct, 0 | 0 );
if (!SWIG_IsOK(res1)) {
SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "gsl_sort_vector_index" "', argument " "1"" of type '" "gsl_permutation *""'");
}
arg1 = (gsl_permutation *)(argp1);
res2 = SWIG_ConvertPtr(ST(1), &argp2,SWIGTYPE_p_gsl_vector, 0 | 0 );
if (!SWIG_IsOK(res2)) {
SWIG_exception_fail(SWIG_ArgError(res2), "in method '" "gsl_sort_vector_index" "', argument " "2"" of type '" "gsl_vector const *""'");
}
arg2 = (gsl_vector *)(argp2);
result = (int)gsl_sort_vector_index(arg1,(gsl_vector const *)arg2);
ST(argvi) = SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(result)); argvi++ ;
XSRETURN(argvi);
fail:
SWIG_croak_null();
}
}
XS(_wrap_gsl_sort_vector_smallest) {
{
double *arg1 = (double *) 0 ;
size_t arg2 ;
gsl_vector *arg3 = (gsl_vector *) 0 ;
size_t val2 ;
int ecode2 = 0 ;
void *argp3 = 0 ;
int res3 = 0 ;
int argvi = 0;
SV * _saved[1] ;
int result;
dXSARGS;
if ((items < 3) || (items > 3)) {
SWIG_croak("Usage: gsl_sort_vector_smallest(dest,k,v);");
}
{
AV *tempav;
I32 len;
int i;
SV **tv;
if (!SvROK(ST(0)))
croak("Math::GSL : $dest is not a reference!");
if (SvTYPE(SvRV(ST(0))) != SVt_PVAV)
croak("Math::GSL : $dest is not an array ref!");
tempav = (AV*)SvRV(ST(0));
len = av_len(tempav);
arg1 = (double *) malloc((len+2)*sizeof(double));
for (i = 0; i <= len; i++) {
tv = av_fetch(tempav, i, 0);
arg1[i] = (double) SvNV(*tv);
}
}
ecode2 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(1), &val2);
if (!SWIG_IsOK(ecode2)) {
SWIG_exception_fail(SWIG_ArgError(ecode2), "in method '" "gsl_sort_vector_smallest" "', argument " "2"" of type '" "size_t""'");
}
arg2 = (size_t)(val2);
res3 = SWIG_ConvertPtr(ST(2), &argp3,SWIGTYPE_p_gsl_vector, 0 | 0 );
if (!SWIG_IsOK(res3)) {
SWIG_exception_fail(SWIG_ArgError(res3), "in method '" "gsl_sort_vector_smallest" "', argument " "3"" of type '" "gsl_vector const *""'");
}
arg3 = (gsl_vector *)(argp3);
_saved[0] = ST(0);
result = (int)gsl_sort_vector_smallest(arg1,arg2,(gsl_vector const *)arg3);
ST(argvi) = SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(result)); argvi++ ;
{
int i=0;
AV* tempav = newAV();
while( i < arg2 ) {
av_push(tempav, newSVnv((double) arg1[i]));
i++;
}
ST(argvi) = sv_2mortal( newRV_noinc( (SV*) tempav) );
argvi++;
}
{
if (arg1) free(arg1);
}
XSRETURN(argvi);
fail:
{
if (arg1) free(arg1);
}
SWIG_croak_null();
}
}
XS(_wrap_gsl_sort_vector_largest) {
{
double *arg1 = (double *) 0 ;
size_t arg2 ;
gsl_vector *arg3 = (gsl_vector *) 0 ;
size_t val2 ;
int ecode2 = 0 ;
void *argp3 = 0 ;
int res3 = 0 ;
int argvi = 0;
SV * _saved[1] ;
int result;
dXSARGS;
if ((items < 3) || (items > 3)) {
SWIG_croak("Usage: gsl_sort_vector_largest(dest,k,v);");
}
{
AV *tempav;
I32 len;
int i;
SV **tv;
if (!SvROK(ST(0)))
croak("Math::GSL : $dest is not a reference!");
if (SvTYPE(SvRV(ST(0))) != SVt_PVAV)
croak("Math::GSL : $dest is not an array ref!");
tempav = (AV*)SvRV(ST(0));
len = av_len(tempav);
arg1 = (double *) malloc((len+2)*sizeof(double));
for (i = 0; i <= len; i++) {
tv = av_fetch(tempav, i, 0);
arg1[i] = (double) SvNV(*tv);
}
}
ecode2 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(1), &val2);
if (!SWIG_IsOK(ecode2)) {
SWIG_exception_fail(SWIG_ArgError(ecode2), "in method '" "gsl_sort_vector_largest" "', argument " "2"" of type '" "size_t""'");
}
arg2 = (size_t)(val2);
res3 = SWIG_ConvertPtr(ST(2), &argp3,SWIGTYPE_p_gsl_vector, 0 | 0 );
if (!SWIG_IsOK(res3)) {
SWIG_exception_fail(SWIG_ArgError(res3), "in method '" "gsl_sort_vector_largest" "', argument " "3"" of type '" "gsl_vector const *""'");
}
arg3 = (gsl_vector *)(argp3);
_saved[0] = ST(0);
result = (int)gsl_sort_vector_largest(arg1,arg2,(gsl_vector const *)arg3);
ST(argvi) = SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(result)); argvi++ ;
{
int i=0;
AV* tempav = newAV();
while( i < arg2 ) {
av_push(tempav, newSVnv((double) arg1[i]));
i++;
}
ST(argvi) = sv_2mortal( newRV_noinc( (SV*) tempav) );
argvi++;
}
{
if (arg1) free(arg1);
}
XSRETURN(argvi);
fail:
{
if (arg1) free(arg1);
}
SWIG_croak_null();
}
}
XS(_wrap_gsl_sort_vector_smallest_index) {
{
size_t *arg1 = (size_t *) 0 ;
size_t arg2 ;
gsl_vector *arg3 = (gsl_vector *) 0 ;
size_t val2 ;
int ecode2 = 0 ;
void *argp3 = 0 ;
int res3 = 0 ;
int argvi = 0;
SV * _saved[1] ;
int result;
dXSARGS;
if ((items < 3) || (items > 3)) {
SWIG_croak("Usage: gsl_sort_vector_smallest_index(p,k,v);");
}
{
AV *tempav;
I32 len;
int i;
SV **tv;
if (!SvROK(ST(0)))
croak("Math::GSL : $p is not a reference!");
if (SvTYPE(SvRV(ST(0))) != SVt_PVAV)
croak("Math::GSL : $p is not an array ref!");
tempav = (AV*)SvRV(ST(0));
len = av_len(tempav);
/* Why does this need to be len+2 ? */
arg1 = (size_t *) malloc((len+2)*sizeof(size_t));
for (i = 0; i <= len; i++) {
tv = av_fetch(tempav, i, 0);
arg1[i] = (size_t) SvIV(*tv);
}
}
ecode2 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(1), &val2);
if (!SWIG_IsOK(ecode2)) {
SWIG_exception_fail(SWIG_ArgError(ecode2), "in method '" "gsl_sort_vector_smallest_index" "', argument " "2"" of type '" "size_t""'");
}
arg2 = (size_t)(val2);
res3 = SWIG_ConvertPtr(ST(2), &argp3,SWIGTYPE_p_gsl_vector, 0 | 0 );
if (!SWIG_IsOK(res3)) {
SWIG_exception_fail(SWIG_ArgError(res3), "in method '" "gsl_sort_vector_smallest_index" "', argument " "3"" of type '" "gsl_vector const *""'");
}
arg3 = (gsl_vector *)(argp3);
_saved[0] = ST(0);
result = (int)gsl_sort_vector_smallest_index(arg1,arg2,(gsl_vector const *)arg3);
ST(argvi) = SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(result)); argvi++ ;
{
int i=0;
AV* tempav = newAV();
while( i < arg2 ) {
av_push(tempav, newSVnv((size_t) arg1[i]));
i++;
}
ST(argvi) = sv_2mortal( newRV_noinc( (SV*) tempav) );
argvi++;
}
{
// if (arg1) free(arg1);
}
XSRETURN(argvi);
fail:
{
// if (arg1) free(arg1);
}
SWIG_croak_null();
}
}
XS(_wrap_gsl_sort_vector_largest_index) {
{
size_t *arg1 = (size_t *) 0 ;
size_t arg2 ;
gsl_vector *arg3 = (gsl_vector *) 0 ;
size_t val2 ;
int ecode2 = 0 ;
void *argp3 = 0 ;
int res3 = 0 ;
int argvi = 0;
SV * _saved[1] ;
int result;
dXSARGS;
if ((items < 3) || (items > 3)) {
SWIG_croak("Usage: gsl_sort_vector_largest_index(p,k,v);");
}
{
AV *tempav;
I32 len;
int i;
SV **tv;
if (!SvROK(ST(0)))
croak("Math::GSL : $p is not a reference!");
if (SvTYPE(SvRV(ST(0))) != SVt_PVAV)
croak("Math::GSL : $p is not an array ref!");
tempav = (AV*)SvRV(ST(0));
len = av_len(tempav);
/* Why does this need to be len+2 ? */
arg1 = (size_t *) malloc((len+2)*sizeof(size_t));
for (i = 0; i <= len; i++) {
tv = av_fetch(tempav, i, 0);
arg1[i] = (size_t) SvIV(*tv);
}
}
ecode2 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(1), &val2);
if (!SWIG_IsOK(ecode2)) {
SWIG_exception_fail(SWIG_ArgError(ecode2), "in method '" "gsl_sort_vector_largest_index" "', argument " "2"" of type '" "size_t""'");
}
arg2 = (size_t)(val2);
res3 = SWIG_ConvertPtr(ST(2), &argp3,SWIGTYPE_p_gsl_vector, 0 | 0 );
if (!SWIG_IsOK(res3)) {
SWIG_exception_fail(SWIG_ArgError(res3), "in method '" "gsl_sort_vector_largest_index" "', argument " "3"" of type '" "gsl_vector const *""'");
}
arg3 = (gsl_vector *)(argp3);
_saved[0] = ST(0);
result = (int)gsl_sort_vector_largest_index(arg1,arg2,(gsl_vector const *)arg3);
ST(argvi) = SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(result)); argvi++ ;
{
int i=0;
AV* tempav = newAV();
while( i < arg2 ) {
av_push(tempav, newSVnv((size_t) arg1[i]));
i++;
}
ST(argvi) = sv_2mortal( newRV_noinc( (SV*) tempav) );
argvi++;
}
{
// if (arg1) free(arg1);
}
XSRETURN(argvi);
fail:
{
// if (arg1) free(arg1);
}
SWIG_croak_null();
}
}
XS(_wrap_gsl_sort_vector_int) {
{
gsl_vector_int *arg1 = (gsl_vector_int *) 0 ;
void *argp1 = 0 ;
int res1 = 0 ;
int argvi = 0;
dXSARGS;
if ((items < 1) || (items > 1)) {
SWIG_croak("Usage: gsl_sort_vector_int(v);");
}
res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_gsl_vector_int, 0 | 0 );
if (!SWIG_IsOK(res1)) {
SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "gsl_sort_vector_int" "', argument " "1"" of type '" "gsl_vector_int *""'");
}
arg1 = (gsl_vector_int *)(argp1);
gsl_sort_vector_int(arg1);
ST(argvi) = sv_newmortal();
XSRETURN(argvi);
fail:
SWIG_croak_null();
}
}
XS(_wrap_gsl_sort_vector2_int) {
{
gsl_vector_int *arg1 = (gsl_vector_int *) 0 ;
gsl_vector_int *arg2 = (gsl_vector_int *) 0 ;
void *argp1 = 0 ;
int res1 = 0 ;
void *argp2 = 0 ;
int res2 = 0 ;
int argvi = 0;
dXSARGS;
if ((items < 2) || (items > 2)) {
SWIG_croak("Usage: gsl_sort_vector2_int(v1,v2);");
}
res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_gsl_vector_int, 0 | 0 );
if (!SWIG_IsOK(res1)) {
SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "gsl_sort_vector2_int" "', argument " "1"" of type '" "gsl_vector_int *""'");
}
arg1 = (gsl_vector_int *)(argp1);
res2 = SWIG_ConvertPtr(ST(1), &argp2,SWIGTYPE_p_gsl_vector_int, 0 | 0 );
if (!SWIG_IsOK(res2)) {
SWIG_exception_fail(SWIG_ArgError(res2), "in method '" "gsl_sort_vector2_int" "', argument " "2"" of type '" "gsl_vector_int *""'");
}
arg2 = (gsl_vector_int *)(argp2);
gsl_sort_vector2_int(arg1,arg2);
ST(argvi) = sv_newmortal();
XSRETURN(argvi);
fail:
SWIG_croak_null();
}
}
XS(_wrap_gsl_sort_vector_int_index) {
{
gsl_permutation *arg1 = (gsl_permutation *) 0 ;
gsl_vector_int *arg2 = (gsl_vector_int *) 0 ;
void *argp1 = 0 ;
int res1 = 0 ;
void *argp2 = 0 ;
int res2 = 0 ;
int argvi = 0;
int result;
dXSARGS;
if ((items < 2) || (items > 2)) {
SWIG_croak("Usage: gsl_sort_vector_int_index(p,v);");
}
res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_gsl_permutation_struct, 0 | 0 );
if (!SWIG_IsOK(res1)) {
SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "gsl_sort_vector_int_index" "', argument " "1"" of type '" "gsl_permutation *""'");
}
arg1 = (gsl_permutation *)(argp1);
res2 = SWIG_ConvertPtr(ST(1), &argp2,SWIGTYPE_p_gsl_vector_int, 0 | 0 );
if (!SWIG_IsOK(res2)) {
SWIG_exception_fail(SWIG_ArgError(res2), "in method '" "gsl_sort_vector_int_index" "', argument " "2"" of type '" "gsl_vector_int const *""'");
}
arg2 = (gsl_vector_int *)(argp2);
result = (int)gsl_sort_vector_int_index(arg1,(gsl_vector_int const *)arg2);
ST(argvi) = SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(result)); argvi++ ;
XSRETURN(argvi);
fail:
SWIG_croak_null();
}
}
XS(_wrap_gsl_sort_vector_int_smallest) {
{
int *arg1 = (int *) 0 ;
size_t arg2 ;
gsl_vector_int *arg3 = (gsl_vector_int *) 0 ;
void *argp1 = 0 ;
int res1 = 0 ;
size_t val2 ;
int ecode2 = 0 ;
void *argp3 = 0 ;
int res3 = 0 ;
int argvi = 0;
int result;
dXSARGS;
if ((items < 3) || (items > 3)) {
SWIG_croak("Usage: gsl_sort_vector_int_smallest(dest,k,v);");
}
res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_int, 0 | 0 );
if (!SWIG_IsOK(res1)) {
SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "gsl_sort_vector_int_smallest" "', argument " "1"" of type '" "int *""'");
}
arg1 = (int *)(argp1);
ecode2 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(1), &val2);
if (!SWIG_IsOK(ecode2)) {
SWIG_exception_fail(SWIG_ArgError(ecode2), "in method '" "gsl_sort_vector_int_smallest" "', argument " "2"" of type '" "size_t""'");
}
arg2 = (size_t)(val2);
res3 = SWIG_ConvertPtr(ST(2), &argp3,SWIGTYPE_p_gsl_vector_int, 0 | 0 );
if (!SWIG_IsOK(res3)) {
SWIG_exception_fail(SWIG_ArgError(res3), "in method '" "gsl_sort_vector_int_smallest" "', argument " "3"" of type '" "gsl_vector_int const *""'");
}
arg3 = (gsl_vector_int *)(argp3);
result = (int)gsl_sort_vector_int_smallest(arg1,arg2,(gsl_vector_int const *)arg3);
ST(argvi) = SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(result)); argvi++ ;
XSRETURN(argvi);
fail:
SWIG_croak_null();
}
}
XS(_wrap_gsl_sort_vector_int_largest) {
{
int *arg1 = (int *) 0 ;
size_t arg2 ;
gsl_vector_int *arg3 = (gsl_vector_int *) 0 ;
void *argp1 = 0 ;
int res1 = 0 ;
size_t val2 ;
int ecode2 = 0 ;
void *argp3 = 0 ;
int res3 = 0 ;
int argvi = 0;
int result;
dXSARGS;
if ((items < 3) || (items > 3)) {
SWIG_croak("Usage: gsl_sort_vector_int_largest(dest,k,v);");
}
res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_int, 0 | 0 );
if (!SWIG_IsOK(res1)) {
SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "gsl_sort_vector_int_largest" "', argument " "1"" of type '" "int *""'");
}
arg1 = (int *)(argp1);
ecode2 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(1), &val2);
if (!SWIG_IsOK(ecode2)) {
SWIG_exception_fail(SWIG_ArgError(ecode2), "in method '" "gsl_sort_vector_int_largest" "', argument " "2"" of type '" "size_t""'");
}
arg2 = (size_t)(val2);
res3 = SWIG_ConvertPtr(ST(2), &argp3,SWIGTYPE_p_gsl_vector_int, 0 | 0 );
if (!SWIG_IsOK(res3)) {
SWIG_exception_fail(SWIG_ArgError(res3), "in method '" "gsl_sort_vector_int_largest" "', argument " "3"" of type '" "gsl_vector_int const *""'");
}
arg3 = (gsl_vector_int *)(argp3);
result = (int)gsl_sort_vector_int_largest(arg1,arg2,(gsl_vector_int const *)arg3);
ST(argvi) = SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(result)); argvi++ ;
XSRETURN(argvi);
fail:
SWIG_croak_null();
}
}
XS(_wrap_gsl_sort_vector_int_smallest_index) {
{
size_t *arg1 = (size_t *) 0 ;
size_t arg2 ;
gsl_vector_int *arg3 = (gsl_vector_int *) 0 ;
size_t val2 ;
int ecode2 = 0 ;
void *argp3 = 0 ;
int res3 = 0 ;
int argvi = 0;
int result;
dXSARGS;
if ((items < 3) || (items > 3)) {
SWIG_croak("Usage: gsl_sort_vector_int_smallest_index(p,k,v);");
}
{
AV *tempav;
I32 len;
int i;
SV **tv;
if (!SvROK(ST(0)))
croak("Math::GSL : $p is not a reference!");
if (SvTYPE(SvRV(ST(0))) != SVt_PVAV)
croak("Math::GSL : $p is not an array ref!");
tempav = (AV*)SvRV(ST(0));
len = av_len(tempav);
/* Why does this need to be len+2 ? */
arg1 = (size_t *) malloc((len+2)*sizeof(size_t));
for (i = 0; i <= len; i++) {
tv = av_fetch(tempav, i, 0);
arg1[i] = (size_t) SvIV(*tv);
}
}
ecode2 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(1), &val2);
if (!SWIG_IsOK(ecode2)) {
SWIG_exception_fail(SWIG_ArgError(ecode2), "in method '" "gsl_sort_vector_int_smallest_index" "', argument " "2"" of type '" "size_t""'");
}
arg2 = (size_t)(val2);
res3 = SWIG_ConvertPtr(ST(2), &argp3,SWIGTYPE_p_gsl_vector_int, 0 | 0 );
if (!SWIG_IsOK(res3)) {
SWIG_exception_fail(SWIG_ArgError(res3), "in method '" "gsl_sort_vector_int_smallest_index" "', argument " "3"" of type '" "gsl_vector_int const *""'");
}
arg3 = (gsl_vector_int *)(argp3);
result = (int)gsl_sort_vector_int_smallest_index(arg1,arg2,(gsl_vector_int const *)arg3);
ST(argvi) = SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(result)); argvi++ ;
{
// if (arg1) free(arg1);
}
XSRETURN(argvi);
fail:
{
// if (arg1) free(arg1);
}
SWIG_croak_null();
}
}
XS(_wrap_gsl_sort_vector_int_largest_index) {
{
size_t *arg1 = (size_t *) 0 ;
size_t arg2 ;
gsl_vector_int *arg3 = (gsl_vector_int *) 0 ;
size_t val2 ;
int ecode2 = 0 ;
void *argp3 = 0 ;
int res3 = 0 ;
int argvi = 0;
int result;
dXSARGS;
if ((items < 3) || (items > 3)) {
SWIG_croak("Usage: gsl_sort_vector_int_largest_index(p,k,v);");
}
{
AV *tempav;
I32 len;
int i;
SV **tv;
if (!SvROK(ST(0)))
croak("Math::GSL : $p is not a reference!");
if (SvTYPE(SvRV(ST(0))) != SVt_PVAV)
croak("Math::GSL : $p is not an array ref!");
tempav = (AV*)SvRV(ST(0));
len = av_len(tempav);
/* Why does this need to be len+2 ? */
arg1 = (size_t *) malloc((len+2)*sizeof(size_t));
for (i = 0; i <= len; i++) {
tv = av_fetch(tempav, i, 0);
arg1[i] = (size_t) SvIV(*tv);
}
}
ecode2 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(1), &val2);
if (!SWIG_IsOK(ecode2)) {
SWIG_exception_fail(SWIG_ArgError(ecode2), "in method '" "gsl_sort_vector_int_largest_index" "', argument " "2"" of type '" "size_t""'");
}
arg2 = (size_t)(val2);
res3 = SWIG_ConvertPtr(ST(2), &argp3,SWIGTYPE_p_gsl_vector_int, 0 | 0 );
if (!SWIG_IsOK(res3)) {
SWIG_exception_fail(SWIG_ArgError(res3), "in method '" "gsl_sort_vector_int_largest_index" "', argument " "3"" of type '" "gsl_vector_int const *""'");
}
arg3 = (gsl_vector_int *)(argp3);
result = (int)gsl_sort_vector_int_largest_index(arg1,arg2,(gsl_vector_int const *)arg3);
ST(argvi) = SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(result)); argvi++ ;
{
// if (arg1) free(arg1);
}
XSRETURN(argvi);
fail:
{
// if (arg1) free(arg1);
}
SWIG_croak_null();
}
}
XS(_wrap_gsl_permutation_struct_size_set) {
{
struct gsl_permutation_struct *arg1 = (struct gsl_permutation_struct *) 0 ;
size_t arg2 ;
void *argp1 = 0 ;
int res1 = 0 ;
size_t val2 ;
int ecode2 = 0 ;
int argvi = 0;
dXSARGS;
if ((items < 2) || (items > 2)) {
SWIG_croak("Usage: gsl_permutation_struct_size_set(self,size);");
}
res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_gsl_permutation_struct, 0 | 0 );
if (!SWIG_IsOK(res1)) {
SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "gsl_permutation_struct_size_set" "', argument " "1"" of type '" "struct gsl_permutation_struct *""'");
}
arg1 = (struct gsl_permutation_struct *)(argp1);
ecode2 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(1), &val2);
if (!SWIG_IsOK(ecode2)) {
SWIG_exception_fail(SWIG_ArgError(ecode2), "in method '" "gsl_permutation_struct_size_set" "', argument " "2"" of type '" "size_t""'");
}
arg2 = (size_t)(val2);
if (arg1) (arg1)->size = arg2;
ST(argvi) = sv_newmortal();
XSRETURN(argvi);
fail:
SWIG_croak_null();
}
}
XS(_wrap_gsl_permutation_struct_size_get) {
{
struct gsl_permutation_struct *arg1 = (struct gsl_permutation_struct *) 0 ;
void *argp1 = 0 ;
int res1 = 0 ;
int argvi = 0;
size_t result;
dXSARGS;
if ((items < 1) || (items > 1)) {
SWIG_croak("Usage: gsl_permutation_struct_size_get(self);");
}
res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_gsl_permutation_struct, 0 | 0 );
if (!SWIG_IsOK(res1)) {
SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "gsl_permutation_struct_size_get" "', argument " "1"" of type '" "struct gsl_permutation_struct *""'");
}
arg1 = (struct gsl_permutation_struct *)(argp1);
result = ((arg1)->size);
ST(argvi) = SWIG_From_size_t SWIG_PERL_CALL_ARGS_1((size_t)(result)); argvi++ ;
XSRETURN(argvi);
fail:
SWIG_croak_null();
}
}
XS(_wrap_gsl_permutation_struct_data_set) {
{
struct gsl_permutation_struct *arg1 = (struct gsl_permutation_struct *) 0 ;
size_t *arg2 = (size_t *) 0 ;
void *argp1 = 0 ;
int res1 = 0 ;
void *argp2 = 0 ;
int res2 = 0 ;
int argvi = 0;
dXSARGS;
if ((items < 2) || (items > 2)) {
SWIG_croak("Usage: gsl_permutation_struct_data_set(self,data);");
}
res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_gsl_permutation_struct, 0 | 0 );
if (!SWIG_IsOK(res1)) {
SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "gsl_permutation_struct_data_set" "', argument " "1"" of type '" "struct gsl_permutation_struct *""'");
}
arg1 = (struct gsl_permutation_struct *)(argp1);
res2 = SWIG_ConvertPtr(ST(1), &argp2,SWIGTYPE_p_size_t, SWIG_POINTER_DISOWN | 0 );
if (!SWIG_IsOK(res2)) {
SWIG_exception_fail(SWIG_ArgError(res2), "in method '" "gsl_permutation_struct_data_set" "', argument " "2"" of type '" "size_t *""'");
}
arg2 = (size_t *)(argp2);
if (arg1) (arg1)->data = arg2;
ST(argvi) = sv_newmortal();
XSRETURN(argvi);
fail:
SWIG_croak_null();
}
}
XS(_wrap_gsl_permutation_struct_data_get) {
{
struct gsl_permutation_struct *arg1 = (struct gsl_permutation_struct *) 0 ;
void *argp1 = 0 ;
int res1 = 0 ;
int argvi = 0;
size_t *result = 0 ;
dXSARGS;
if ((items < 1) || (items > 1)) {
SWIG_croak("Usage: gsl_permutation_struct_data_get(self);");
}
res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_gsl_permutation_struct, 0 | 0 );
if (!SWIG_IsOK(res1)) {
SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "gsl_permutation_struct_data_get" "', argument " "1"" of type '" "struct gsl_permutation_struct *""'");
}
arg1 = (struct gsl_permutation_struct *)(argp1);
result = (size_t *) ((arg1)->data);
ST(argvi) = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_size_t, 0 | 0); argvi++ ;
XSRETURN(argvi);
fail:
SWIG_croak_null();
}
}
XS(_wrap_new_gsl_permutation_struct) {
{
int argvi = 0;
struct gsl_permutation_struct *result = 0 ;
dXSARGS;
if ((items < 0) || (items > 0)) {
SWIG_croak("Usage: new_gsl_permutation_struct();");
}
result = (struct gsl_permutation_struct *)calloc(1, sizeof(struct gsl_permutation_struct));
ST(argvi) = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_gsl_permutation_struct, SWIG_OWNER | SWIG_SHADOW); argvi++ ;
XSRETURN(argvi);
fail:
SWIG_croak_null();
}
}
XS(_wrap_delete_gsl_permutation_struct) {
{
struct gsl_permutation_struct *arg1 = (struct gsl_permutation_struct *) 0 ;
void *argp1 = 0 ;
int res1 = 0 ;
int argvi = 0;
dXSARGS;
if ((items < 1) || (items > 1)) {
SWIG_croak("Usage: delete_gsl_permutation_struct(self);");
}
res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_gsl_permutation_struct, SWIG_POINTER_DISOWN | 0 );
if (!SWIG_IsOK(res1)) {
SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "delete_gsl_permutation_struct" "', argument " "1"" of type '" "struct gsl_permutation_struct *""'");
}
arg1 = (struct gsl_permutation_struct *)(argp1);
free((char *) arg1);
ST(argvi) = sv_newmortal();
XSRETURN(argvi);
fail:
SWIG_croak_null();
}
}
XS(_wrap_gsl_permutation_alloc) {
{
size_t arg1 ;
size_t val1 ;
int ecode1 = 0 ;
int argvi = 0;
gsl_permutation *result = 0 ;
dXSARGS;
if ((items < 1) || (items > 1)) {
SWIG_croak("Usage: gsl_permutation_alloc(n);");
}
ecode1 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(0), &val1);
if (!SWIG_IsOK(ecode1)) {
SWIG_exception_fail(SWIG_ArgError(ecode1), "in method '" "gsl_permutation_alloc" "', argument " "1"" of type '" "size_t""'");
}
arg1 = (size_t)(val1);
result = (gsl_permutation *)gsl_permutation_alloc(arg1);
ST(argvi) = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_gsl_permutation_struct, 0 | SWIG_SHADOW); argvi++ ;
XSRETURN(argvi);
fail:
SWIG_croak_null();
}
}
XS(_wrap_gsl_permutation_calloc) {
{
size_t arg1 ;
size_t val1 ;
int ecode1 = 0 ;
int argvi = 0;
gsl_permutation *result = 0 ;
dXSARGS;
if ((items < 1) || (items > 1)) {
SWIG_croak("Usage: gsl_permutation_calloc(n);");
}
ecode1 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(0), &val1);
if (!SWIG_IsOK(ecode1)) {
SWIG_exception_fail(SWIG_ArgError(ecode1), "in method '" "gsl_permutation_calloc" "', argument " "1"" of type '" "size_t""'");
}
arg1 = (size_t)(val1);
result = (gsl_permutation *)gsl_permutation_calloc(arg1);
ST(argvi) = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_gsl_permutation_struct, 0 | SWIG_SHADOW); argvi++ ;
XSRETURN(argvi);
fail:
SWIG_croak_null();
}
}
XS(_wrap_gsl_permutation_init) {
{
gsl_permutation *arg1 = (gsl_permutation *) 0 ;
void *argp1 = 0 ;
int res1 = 0 ;
int argvi = 0;
dXSARGS;
if ((items < 1) || (items > 1)) {
SWIG_croak("Usage: gsl_permutation_init(p);");
}
res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_gsl_permutation_struct, 0 | 0 );
if (!SWIG_IsOK(res1)) {
SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "gsl_permutation_init" "', argument " "1"" of type '" "gsl_permutation *""'");
}
arg1 = (gsl_permutation *)(argp1);
gsl_permutation_init(arg1);
ST(argvi) = sv_newmortal();
XSRETURN(argvi);
fail:
SWIG_croak_null();
}
}
XS(_wrap_gsl_permutation_free) {
{
gsl_permutation *arg1 = (gsl_permutation *) 0 ;
void *argp1 = 0 ;
int res1 = 0 ;
int argvi = 0;
dXSARGS;
if ((items < 1) || (items > 1)) {
SWIG_croak("Usage: gsl_permutation_free(p);");
}
res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_gsl_permutation_struct, 0 | 0 );
if (!SWIG_IsOK(res1)) {
SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "gsl_permutation_free" "', argument " "1"" of type '" "gsl_permutation *""'");
}
arg1 = (gsl_permutation *)(argp1);
gsl_permutation_free(arg1);
ST(argvi) = sv_newmortal();
XSRETURN(argvi);
fail:
SWIG_croak_null();
}
}
XS(_wrap_gsl_permutation_memcpy) {
{
gsl_permutation *arg1 = (gsl_permutation *) 0 ;
gsl_permutation *arg2 = (gsl_permutation *) 0 ;
void *argp1 = 0 ;
int res1 = 0 ;
void *argp2 = 0 ;
int res2 = 0 ;
int argvi = 0;
int result;
dXSARGS;
if ((items < 2) || (items > 2)) {
SWIG_croak("Usage: gsl_permutation_memcpy(dest,src);");
}
res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_gsl_permutation_struct, 0 | 0 );
if (!SWIG_IsOK(res1)) {
SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "gsl_permutation_memcpy" "', argument " "1"" of type '" "gsl_permutation *""'");
}
arg1 = (gsl_permutation *)(argp1);
res2 = SWIG_ConvertPtr(ST(1), &argp2,SWIGTYPE_p_gsl_permutation_struct, 0 | 0 );
if (!SWIG_IsOK(res2)) {
SWIG_exception_fail(SWIG_ArgError(res2), "in method '" "gsl_permutation_memcpy" "', argument " "2"" of type '" "gsl_permutation const *""'");
}
arg2 = (gsl_permutation *)(argp2);
result = (int)gsl_permutation_memcpy(arg1,(struct gsl_permutation_struct const *)arg2);
ST(argvi) = SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(result)); argvi++ ;
XSRETURN(argvi);
fail:
SWIG_croak_null();
}
}
XS(_wrap_gsl_permutation_fread) {
{
FILE *arg1 = (FILE *) 0 ;
gsl_permutation *arg2 = (gsl_permutation *) 0 ;
void *argp1 = 0 ;
int res1 = 0 ;
void *argp2 = 0 ;
int res2 = 0 ;
int argvi = 0;
int result;
dXSARGS;
if ((items < 2) || (items > 2)) {
SWIG_croak("Usage: gsl_permutation_fread(stream,p);");
}
res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_FILE, 0 | 0 );
if (!SWIG_IsOK(res1)) {
SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "gsl_permutation_fread" "', argument " "1"" of type '" "FILE *""'");
}
arg1 = (FILE *)(argp1);
res2 = SWIG_ConvertPtr(ST(1), &argp2,SWIGTYPE_p_gsl_permutation_struct, 0 | 0 );
if (!SWIG_IsOK(res2)) {
SWIG_exception_fail(SWIG_ArgError(res2), "in method '" "gsl_permutation_fread" "', argument " "2"" of type '" "gsl_permutation *""'");
}
arg2 = (gsl_permutation *)(argp2);
result = (int)gsl_permutation_fread(arg1,arg2);
ST(argvi) = SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(result)); argvi++ ;
XSRETURN(argvi);
fail:
SWIG_croak_null();
}
}
XS(_wrap_gsl_permutation_fwrite) {
{
FILE *arg1 = (FILE *) 0 ;
gsl_permutation *arg2 = (gsl_permutation *) 0 ;
void *argp1 = 0 ;
int res1 = 0 ;
void *argp2 = 0 ;
int res2 = 0 ;
int argvi = 0;
int result;
dXSARGS;
if ((items < 2) || (items > 2)) {
SWIG_croak("Usage: gsl_permutation_fwrite(stream,p);");
}
res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_FILE, 0 | 0 );
if (!SWIG_IsOK(res1)) {
SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "gsl_permutation_fwrite" "', argument " "1"" of type '" "FILE *""'");
}
arg1 = (FILE *)(argp1);
res2 = SWIG_ConvertPtr(ST(1), &argp2,SWIGTYPE_p_gsl_permutation_struct, 0 | 0 );
if (!SWIG_IsOK(res2)) {
SWIG_exception_fail(SWIG_ArgError(res2), "in method '" "gsl_permutation_fwrite" "', argument " "2"" of type '" "gsl_permutation const *""'");
}
arg2 = (gsl_permutation *)(argp2);
result = (int)gsl_permutation_fwrite(arg1,(struct gsl_permutation_struct const *)arg2);
ST(argvi) = SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(result)); argvi++ ;
XSRETURN(argvi);
fail:
SWIG_croak_null();
}
}
XS(_wrap_gsl_permutation_fscanf) {
{
FILE *arg1 = (FILE *) 0 ;
gsl_permutation *arg2 = (gsl_permutation *) 0 ;
void *argp1 = 0 ;
int res1 = 0 ;
void *argp2 = 0 ;
int res2 = 0 ;
int argvi = 0;
int result;
dXSARGS;
if ((items < 2) || (items > 2)) {
SWIG_croak("Usage: gsl_permutation_fscanf(stream,p);");
}
res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_FILE, 0 | 0 );
if (!SWIG_IsOK(res1)) {
SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "gsl_permutation_fscanf" "', argument " "1"" of type '" "FILE *""'");
}
arg1 = (FILE *)(argp1);
res2 = SWIG_ConvertPtr(ST(1), &argp2,SWIGTYPE_p_gsl_permutation_struct, 0 | 0 );
if (!SWIG_IsOK(res2)) {
SWIG_exception_fail(SWIG_ArgError(res2), "in method '" "gsl_permutation_fscanf" "', argument " "2"" of type '" "gsl_permutation *""'");
}
arg2 = (gsl_permutation *)(argp2);
result = (int)gsl_permutation_fscanf(arg1,arg2);
ST(argvi) = SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(result)); argvi++ ;
XSRETURN(argvi);
fail:
SWIG_croak_null();
}
}
XS(_wrap_gsl_permutation_fprintf) {
{
FILE *arg1 = (FILE *) 0 ;
gsl_permutation *arg2 = (gsl_permutation *) 0 ;
char *arg3 = (char *) 0 ;
void *argp1 = 0 ;
int res1 = 0 ;
void *argp2 = 0 ;
int res2 = 0 ;
int res3 ;
char *buf3 = 0 ;
int alloc3 = 0 ;
int argvi = 0;
int result;
dXSARGS;
if ((items < 3) || (items > 3)) {
SWIG_croak("Usage: gsl_permutation_fprintf(stream,p,format);");
}
res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_FILE, 0 | 0 );
if (!SWIG_IsOK(res1)) {
SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "gsl_permutation_fprintf" "', argument " "1"" of type '" "FILE *""'");
}
arg1 = (FILE *)(argp1);
res2 = SWIG_ConvertPtr(ST(1), &argp2,SWIGTYPE_p_gsl_permutation_struct, 0 | 0 );
if (!SWIG_IsOK(res2)) {
SWIG_exception_fail(SWIG_ArgError(res2), "in method '" "gsl_permutation_fprintf" "', argument " "2"" of type '" "gsl_permutation const *""'");
}
arg2 = (gsl_permutation *)(argp2);
res3 = SWIG_AsCharPtrAndSize(ST(2), &buf3, NULL, &alloc3);
if (!SWIG_IsOK(res3)) {
SWIG_exception_fail(SWIG_ArgError(res3), "in method '" "gsl_permutation_fprintf" "', argument " "3"" of type '" "char const *""'");
}
arg3 = (char *)(buf3);
result = (int)gsl_permutation_fprintf(arg1,(struct gsl_permutation_struct const *)arg2,(char const *)arg3);
ST(argvi) = SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(result)); argvi++ ;
if (alloc3 == SWIG_NEWOBJ) free((char*)buf3);
XSRETURN(argvi);
fail:
if (alloc3 == SWIG_NEWOBJ) free((char*)buf3);
SWIG_croak_null();
}
}
XS(_wrap_gsl_permutation_size) {
{
gsl_permutation *arg1 = (gsl_permutation *) 0 ;
void *argp1 = 0 ;
int res1 = 0 ;
int argvi = 0;
size_t result;
dXSARGS;
if ((items < 1) || (items > 1)) {
SWIG_croak("Usage: gsl_permutation_size(p);");
}
res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_gsl_permutation_struct, 0 | 0 );
if (!SWIG_IsOK(res1)) {
SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "gsl_permutation_size" "', argument " "1"" of type '" "gsl_permutation const *""'");
}
arg1 = (gsl_permutation *)(argp1);
result = gsl_permutation_size((struct gsl_permutation_struct const *)arg1);
ST(argvi) = SWIG_From_size_t SWIG_PERL_CALL_ARGS_1((size_t)(result)); argvi++ ;
XSRETURN(argvi);
fail:
SWIG_croak_null();
}
}
XS(_wrap_gsl_permutation_data) {
{
gsl_permutation *arg1 = (gsl_permutation *) 0 ;
void *argp1 = 0 ;
int res1 = 0 ;
int argvi = 0;
size_t *result = 0 ;
dXSARGS;
if ((items < 1) || (items > 1)) {
SWIG_croak("Usage: gsl_permutation_data(p);");
}
res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_gsl_permutation_struct, 0 | 0 );
if (!SWIG_IsOK(res1)) {
SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "gsl_permutation_data" "', argument " "1"" of type '" "gsl_permutation const *""'");
}
arg1 = (gsl_permutation *)(argp1);
result = (size_t *)gsl_permutation_data((struct gsl_permutation_struct const *)arg1);
ST(argvi) = SWIG_NewPointerObj(SWIG_as_voidptr(result), SWIGTYPE_p_size_t, 0 | 0); argvi++ ;
XSRETURN(argvi);
fail:
SWIG_croak_null();
}
}
XS(_wrap_gsl_permutation_swap) {
{
gsl_permutation *arg1 = (gsl_permutation *) 0 ;
size_t arg2 ;
size_t arg3 ;
void *argp1 = 0 ;
int res1 = 0 ;
size_t val2 ;
int ecode2 = 0 ;
size_t val3 ;
int ecode3 = 0 ;
int argvi = 0;
int result;
dXSARGS;
if ((items < 3) || (items > 3)) {
SWIG_croak("Usage: gsl_permutation_swap(p,i,j);");
}
res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_gsl_permutation_struct, 0 | 0 );
if (!SWIG_IsOK(res1)) {
SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "gsl_permutation_swap" "', argument " "1"" of type '" "gsl_permutation *""'");
}
arg1 = (gsl_permutation *)(argp1);
ecode2 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(1), &val2);
if (!SWIG_IsOK(ecode2)) {
SWIG_exception_fail(SWIG_ArgError(ecode2), "in method '" "gsl_permutation_swap" "', argument " "2"" of type '" "size_t""'");
}
arg2 = (size_t)(val2);
ecode3 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(2), &val3);
if (!SWIG_IsOK(ecode3)) {
SWIG_exception_fail(SWIG_ArgError(ecode3), "in method '" "gsl_permutation_swap" "', argument " "3"" of type '" "size_t""'");
}
arg3 = (size_t)(val3);
result = (int)gsl_permutation_swap(arg1,arg2,arg3);
ST(argvi) = SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(result)); argvi++ ;
XSRETURN(argvi);
fail:
SWIG_croak_null();
}
}
XS(_wrap_gsl_permutation_valid) {
{
gsl_permutation *arg1 = (gsl_permutation *) 0 ;
void *argp1 = 0 ;
int res1 = 0 ;
int argvi = 0;
int result;
dXSARGS;
if ((items < 1) || (items > 1)) {
SWIG_croak("Usage: gsl_permutation_valid(p);");
}
res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_gsl_permutation_struct, 0 | 0 );
if (!SWIG_IsOK(res1)) {
SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "gsl_permutation_valid" "', argument " "1"" of type '" "gsl_permutation const *""'");
}
arg1 = (gsl_permutation *)(argp1);
result = (int)gsl_permutation_valid((struct gsl_permutation_struct const *)arg1);
ST(argvi) = SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(result)); argvi++ ;
XSRETURN(argvi);
fail:
SWIG_croak_null();
}
}
XS(_wrap_gsl_permutation_reverse) {
{
gsl_permutation *arg1 = (gsl_permutation *) 0 ;
void *argp1 = 0 ;
int res1 = 0 ;
int argvi = 0;
dXSARGS;
if ((items < 1) || (items > 1)) {
SWIG_croak("Usage: gsl_permutation_reverse(p);");
}
res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_gsl_permutation_struct, 0 | 0 );
if (!SWIG_IsOK(res1)) {
SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "gsl_permutation_reverse" "', argument " "1"" of type '" "gsl_permutation *""'");
}
arg1 = (gsl_permutation *)(argp1);
gsl_permutation_reverse(arg1);
ST(argvi) = sv_newmortal();
XSRETURN(argvi);
fail:
SWIG_croak_null();
}
}
XS(_wrap_gsl_permutation_inverse) {
{
gsl_permutation *arg1 = (gsl_permutation *) 0 ;
gsl_permutation *arg2 = (gsl_permutation *) 0 ;
void *argp1 = 0 ;
int res1 = 0 ;
void *argp2 = 0 ;
int res2 = 0 ;
int argvi = 0;
int result;
dXSARGS;
if ((items < 2) || (items > 2)) {
SWIG_croak("Usage: gsl_permutation_inverse(inv,p);");
}
res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_gsl_permutation_struct, 0 | 0 );
if (!SWIG_IsOK(res1)) {
SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "gsl_permutation_inverse" "', argument " "1"" of type '" "gsl_permutation *""'");
}
arg1 = (gsl_permutation *)(argp1);
res2 = SWIG_ConvertPtr(ST(1), &argp2,SWIGTYPE_p_gsl_permutation_struct, 0 | 0 );
if (!SWIG_IsOK(res2)) {
SWIG_exception_fail(SWIG_ArgError(res2), "in method '" "gsl_permutation_inverse" "', argument " "2"" of type '" "gsl_permutation const *""'");
}
arg2 = (gsl_permutation *)(argp2);
result = (int)gsl_permutation_inverse(arg1,(struct gsl_permutation_struct const *)arg2);
ST(argvi) = SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(result)); argvi++ ;
XSRETURN(argvi);
fail:
SWIG_croak_null();
}
}
XS(_wrap_gsl_permutation_next) {
{
gsl_permutation *arg1 = (gsl_permutation *) 0 ;
void *argp1 = 0 ;
int res1 = 0 ;
int argvi = 0;
int result;
dXSARGS;
if ((items < 1) || (items > 1)) {
SWIG_croak("Usage: gsl_permutation_next(p);");
}
res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_gsl_permutation_struct, 0 | 0 );
if (!SWIG_IsOK(res1)) {
SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "gsl_permutation_next" "', argument " "1"" of type '" "gsl_permutation *""'");
}
arg1 = (gsl_permutation *)(argp1);
result = (int)gsl_permutation_next(arg1);
ST(argvi) = SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(result)); argvi++ ;
XSRETURN(argvi);
fail:
SWIG_croak_null();
}
}
XS(_wrap_gsl_permutation_prev) {
{
gsl_permutation *arg1 = (gsl_permutation *) 0 ;
void *argp1 = 0 ;
int res1 = 0 ;
int argvi = 0;
int result;
dXSARGS;
if ((items < 1) || (items > 1)) {
SWIG_croak("Usage: gsl_permutation_prev(p);");
}
res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_gsl_permutation_struct, 0 | 0 );
if (!SWIG_IsOK(res1)) {
SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "gsl_permutation_prev" "', argument " "1"" of type '" "gsl_permutation *""'");
}
arg1 = (gsl_permutation *)(argp1);
result = (int)gsl_permutation_prev(arg1);
ST(argvi) = SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(result)); argvi++ ;
XSRETURN(argvi);
fail:
SWIG_croak_null();
}
}
XS(_wrap_gsl_permutation_mul) {
{
gsl_permutation *arg1 = (gsl_permutation *) 0 ;
gsl_permutation *arg2 = (gsl_permutation *) 0 ;
gsl_permutation *arg3 = (gsl_permutation *) 0 ;
void *argp1 = 0 ;
int res1 = 0 ;
void *argp2 = 0 ;
int res2 = 0 ;
void *argp3 = 0 ;
int res3 = 0 ;
int argvi = 0;
int result;
dXSARGS;
if ((items < 3) || (items > 3)) {
SWIG_croak("Usage: gsl_permutation_mul(p,pa,pb);");
}
res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_gsl_permutation_struct, 0 | 0 );
if (!SWIG_IsOK(res1)) {
SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "gsl_permutation_mul" "', argument " "1"" of type '" "gsl_permutation *""'");
}
arg1 = (gsl_permutation *)(argp1);
res2 = SWIG_ConvertPtr(ST(1), &argp2,SWIGTYPE_p_gsl_permutation_struct, 0 | 0 );
if (!SWIG_IsOK(res2)) {
SWIG_exception_fail(SWIG_ArgError(res2), "in method '" "gsl_permutation_mul" "', argument " "2"" of type '" "gsl_permutation const *""'");
}
arg2 = (gsl_permutation *)(argp2);
res3 = SWIG_ConvertPtr(ST(2), &argp3,SWIGTYPE_p_gsl_permutation_struct, 0 | 0 );
if (!SWIG_IsOK(res3)) {
SWIG_exception_fail(SWIG_ArgError(res3), "in method '" "gsl_permutation_mul" "', argument " "3"" of type '" "gsl_permutation const *""'");
}
arg3 = (gsl_permutation *)(argp3);
result = (int)gsl_permutation_mul(arg1,(struct gsl_permutation_struct const *)arg2,(struct gsl_permutation_struct const *)arg3);
ST(argvi) = SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(result)); argvi++ ;
XSRETURN(argvi);
fail:
SWIG_croak_null();
}
}
XS(_wrap_gsl_permutation_linear_to_canonical) {
{
gsl_permutation *arg1 = (gsl_permutation *) 0 ;
gsl_permutation *arg2 = (gsl_permutation *) 0 ;
void *argp1 = 0 ;
int res1 = 0 ;
void *argp2 = 0 ;
int res2 = 0 ;
int argvi = 0;
int result;
dXSARGS;
if ((items < 2) || (items > 2)) {
SWIG_croak("Usage: gsl_permutation_linear_to_canonical(q,p);");
}
res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_gsl_permutation_struct, 0 | 0 );
if (!SWIG_IsOK(res1)) {
SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "gsl_permutation_linear_to_canonical" "', argument " "1"" of type '" "gsl_permutation *""'");
}
arg1 = (gsl_permutation *)(argp1);
res2 = SWIG_ConvertPtr(ST(1), &argp2,SWIGTYPE_p_gsl_permutation_struct, 0 | 0 );
if (!SWIG_IsOK(res2)) {
SWIG_exception_fail(SWIG_ArgError(res2), "in method '" "gsl_permutation_linear_to_canonical" "', argument " "2"" of type '" "gsl_permutation const *""'");
}
arg2 = (gsl_permutation *)(argp2);
result = (int)gsl_permutation_linear_to_canonical(arg1,(struct gsl_permutation_struct const *)arg2);
ST(argvi) = SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(result)); argvi++ ;
XSRETURN(argvi);
fail:
SWIG_croak_null();
}
}
XS(_wrap_gsl_permutation_canonical_to_linear) {
{
gsl_permutation *arg1 = (gsl_permutation *) 0 ;
gsl_permutation *arg2 = (gsl_permutation *) 0 ;
void *argp1 = 0 ;
int res1 = 0 ;
void *argp2 = 0 ;
int res2 = 0 ;
int argvi = 0;
int result;
dXSARGS;
if ((items < 2) || (items > 2)) {
SWIG_croak("Usage: gsl_permutation_canonical_to_linear(p,q);");
}
res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_gsl_permutation_struct, 0 | 0 );
if (!SWIG_IsOK(res1)) {
SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "gsl_permutation_canonical_to_linear" "', argument " "1"" of type '" "gsl_permutation *""'");
}
arg1 = (gsl_permutation *)(argp1);
res2 = SWIG_ConvertPtr(ST(1), &argp2,SWIGTYPE_p_gsl_permutation_struct, 0 | 0 );
if (!SWIG_IsOK(res2)) {
SWIG_exception_fail(SWIG_ArgError(res2), "in method '" "gsl_permutation_canonical_to_linear" "', argument " "2"" of type '" "gsl_permutation const *""'");
}
arg2 = (gsl_permutation *)(argp2);
result = (int)gsl_permutation_canonical_to_linear(arg1,(struct gsl_permutation_struct const *)arg2);
ST(argvi) = SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(result)); argvi++ ;
XSRETURN(argvi);
fail:
SWIG_croak_null();
}
}
XS(_wrap_gsl_permutation_inversions) {
{
gsl_permutation *arg1 = (gsl_permutation *) 0 ;
void *argp1 = 0 ;
int res1 = 0 ;
int argvi = 0;
size_t result;
dXSARGS;
if ((items < 1) || (items > 1)) {
SWIG_croak("Usage: gsl_permutation_inversions(p);");
}
res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_gsl_permutation_struct, 0 | 0 );
if (!SWIG_IsOK(res1)) {
SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "gsl_permutation_inversions" "', argument " "1"" of type '" "gsl_permutation const *""'");
}
arg1 = (gsl_permutation *)(argp1);
result = gsl_permutation_inversions((struct gsl_permutation_struct const *)arg1);
ST(argvi) = SWIG_From_size_t SWIG_PERL_CALL_ARGS_1((size_t)(result)); argvi++ ;
XSRETURN(argvi);
fail:
SWIG_croak_null();
}
}
XS(_wrap_gsl_permutation_linear_cycles) {
{
gsl_permutation *arg1 = (gsl_permutation *) 0 ;
void *argp1 = 0 ;
int res1 = 0 ;
int argvi = 0;
size_t result;
dXSARGS;
if ((items < 1) || (items > 1)) {
SWIG_croak("Usage: gsl_permutation_linear_cycles(p);");
}
res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_gsl_permutation_struct, 0 | 0 );
if (!SWIG_IsOK(res1)) {
SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "gsl_permutation_linear_cycles" "', argument " "1"" of type '" "gsl_permutation const *""'");
}
arg1 = (gsl_permutation *)(argp1);
result = gsl_permutation_linear_cycles((struct gsl_permutation_struct const *)arg1);
ST(argvi) = SWIG_From_size_t SWIG_PERL_CALL_ARGS_1((size_t)(result)); argvi++ ;
XSRETURN(argvi);
fail:
SWIG_croak_null();
}
}
XS(_wrap_gsl_permutation_canonical_cycles) {
{
gsl_permutation *arg1 = (gsl_permutation *) 0 ;
void *argp1 = 0 ;
int res1 = 0 ;
int argvi = 0;
size_t result;
dXSARGS;
if ((items < 1) || (items > 1)) {
SWIG_croak("Usage: gsl_permutation_canonical_cycles(q);");
}
res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_gsl_permutation_struct, 0 | 0 );
if (!SWIG_IsOK(res1)) {
SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "gsl_permutation_canonical_cycles" "', argument " "1"" of type '" "gsl_permutation const *""'");
}
arg1 = (gsl_permutation *)(argp1);
result = gsl_permutation_canonical_cycles((struct gsl_permutation_struct const *)arg1);
ST(argvi) = SWIG_From_size_t SWIG_PERL_CALL_ARGS_1((size_t)(result)); argvi++ ;
XSRETURN(argvi);
fail:
SWIG_croak_null();
}
}
XS(_wrap_gsl_permutation_get) {
{
gsl_permutation *arg1 = (gsl_permutation *) 0 ;
size_t arg2 ;
void *argp1 = 0 ;
int res1 = 0 ;
size_t val2 ;
int ecode2 = 0 ;
int argvi = 0;
size_t result;
dXSARGS;
if ((items < 2) || (items > 2)) {
SWIG_croak("Usage: gsl_permutation_get(p,i);");
}
res1 = SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_gsl_permutation_struct, 0 | 0 );
if (!SWIG_IsOK(res1)) {
SWIG_exception_fail(SWIG_ArgError(res1), "in method '" "gsl_permutation_get" "', argument " "1"" of type '" "gsl_permutation const *""'");
}
arg1 = (gsl_permutation *)(argp1);
ecode2 = SWIG_AsVal_size_t SWIG_PERL_CALL_ARGS_2(ST(1), &val2);
if (!SWIG_IsOK(ecode2)) {
SWIG_exception_fail(SWIG_ArgError(ecode2), "in method '" "gsl_permutation_get" "', argument " "2"" of type '" "size_t""'");
}
arg2 = (size_t)(val2);
result = gsl_permutation_get((struct gsl_permutation_struct const *)arg1,arg2);
ST(argvi) = SWIG_From_size_t SWIG_PERL_CALL_ARGS_1((size_t)(result)); argvi++ ;
XSRETURN(argvi);
fail:
SWIG_croak_null();
}
}
/* -------- TYPE CONVERSION AND EQUIVALENCE RULES (BEGIN) -------- */
static swig_type_info _swigt__p_FILE = {"_p_FILE", "FILE *", 0, 0, (void*)0, 0};
static swig_type_info _swigt__p_char = {"_p_char", "char *", 0, 0, (void*)0, 0};
static swig_type_info _swigt__p_double = {"_p_double", "double *", 0, 0, (void*)0, 0};
static swig_type_info _swigt__p_f_p_q_const__char_p_q_const__char_int_int__void = {"_p_f_p_q_const__char_p_q_const__char_int_int__void", "void (*)(char const *,char const *,int,int)|gsl_error_handler_t *", 0, 0, (void*)0, 0};
static swig_type_info _swigt__p_f_p_q_const__char_p_q_const__char_int_p_q_const__char__void = {"_p_f_p_q_const__char_p_q_const__char_int_p_q_const__char__void", "gsl_stream_handler_t *|void (*)(char const *,char const *,int,char const *)", 0, 0, (void*)0, 0};
static swig_type_info _swigt__p_gsl_permutation_struct = {"_p_gsl_permutation_struct", "gsl_permutation *|struct gsl_permutation_struct *|gsl_permutation_struct *", 0, 0, (void*)"Math::GSL::Sort::gsl_permutation_struct", 0};
static swig_type_info _swigt__p_gsl_vector = {"_p_gsl_vector", "gsl_vector *", 0, 0, (void*)0, 0};
static swig_type_info _swigt__p_gsl_vector_int = {"_p_gsl_vector_int", "gsl_vector_int *", 0, 0, (void*)0, 0};
static swig_type_info _swigt__p_int = {"_p_int", "int *", 0, 0, (void*)0, 0};
static swig_type_info _swigt__p_size_t = {"_p_size_t", "size_t *", 0, 0, (void*)0, 0};
static swig_type_info *swig_type_initial[] = {
&_swigt__p_FILE,
&_swigt__p_char,
&_swigt__p_double,
&_swigt__p_f_p_q_const__char_p_q_const__char_int_int__void,
&_swigt__p_f_p_q_const__char_p_q_const__char_int_p_q_const__char__void,
&_swigt__p_gsl_permutation_struct,
&_swigt__p_gsl_vector,
&_swigt__p_gsl_vector_int,
&_swigt__p_int,
&_swigt__p_size_t,
};
static swig_cast_info _swigc__p_FILE[] = { {&_swigt__p_FILE, 0, 0, 0},{0, 0, 0, 0}};
static swig_cast_info _swigc__p_char[] = { {&_swigt__p_char, 0, 0, 0},{0, 0, 0, 0}};
static swig_cast_info _swigc__p_double[] = { {&_swigt__p_double, 0, 0, 0},{0, 0, 0, 0}};
static swig_cast_info _swigc__p_f_p_q_const__char_p_q_const__char_int_int__void[] = { {&_swigt__p_f_p_q_const__char_p_q_const__char_int_int__void, 0, 0, 0},{0, 0, 0, 0}};
static swig_cast_info _swigc__p_f_p_q_const__char_p_q_const__char_int_p_q_const__char__void[] = { {&_swigt__p_f_p_q_const__char_p_q_const__char_int_p_q_const__char__void, 0, 0, 0},{0, 0, 0, 0}};
static swig_cast_info _swigc__p_gsl_permutation_struct[] = { {&_swigt__p_gsl_permutation_struct, 0, 0, 0},{0, 0, 0, 0}};
static swig_cast_info _swigc__p_gsl_vector[] = { {&_swigt__p_gsl_vector, 0, 0, 0},{0, 0, 0, 0}};
static swig_cast_info _swigc__p_gsl_vector_int[] = { {&_swigt__p_gsl_vector_int, 0, 0, 0},{0, 0, 0, 0}};
static swig_cast_info _swigc__p_int[] = { {&_swigt__p_int, 0, 0, 0},{0, 0, 0, 0}};
static swig_cast_info _swigc__p_size_t[] = { {&_swigt__p_size_t, 0, 0, 0},{0, 0, 0, 0}};
static swig_cast_info *swig_cast_initial[] = {
_swigc__p_FILE,
_swigc__p_char,
_swigc__p_double,
_swigc__p_f_p_q_const__char_p_q_const__char_int_int__void,
_swigc__p_f_p_q_const__char_p_q_const__char_int_p_q_const__char__void,
_swigc__p_gsl_permutation_struct,
_swigc__p_gsl_vector,
_swigc__p_gsl_vector_int,
_swigc__p_int,
_swigc__p_size_t,
};
/* -------- TYPE CONVERSION AND EQUIVALENCE RULES (END) -------- */
static swig_constant_info swig_constants[] = {
{0,0,0,0,0,0}
};
#ifdef __cplusplus
}
#endif
static swig_variable_info swig_variables[] = {
{0,0,0,0}
};
static swig_command_info swig_commands[] = {
{"Math::GSL::Sortc::gsl_error", _wrap_gsl_error},
{"Math::GSL::Sortc::gsl_stream_printf", _wrap_gsl_stream_printf},
{"Math::GSL::Sortc::gsl_strerror", _wrap_gsl_strerror},
{"Math::GSL::Sortc::gsl_set_error_handler", _wrap_gsl_set_error_handler},
{"Math::GSL::Sortc::gsl_set_error_handler_off", _wrap_gsl_set_error_handler_off},
{"Math::GSL::Sortc::gsl_set_stream_handler", _wrap_gsl_set_stream_handler},
{"Math::GSL::Sortc::gsl_set_stream", _wrap_gsl_set_stream},
{"Math::GSL::Sortc::gsl_sort", _wrap_gsl_sort},
{"Math::GSL::Sortc::gsl_sort2", _wrap_gsl_sort2},
{"Math::GSL::Sortc::gsl_sort_index", _wrap_gsl_sort_index},
{"Math::GSL::Sortc::gsl_sort_smallest", _wrap_gsl_sort_smallest},
{"Math::GSL::Sortc::gsl_sort_smallest_index", _wrap_gsl_sort_smallest_index},
{"Math::GSL::Sortc::gsl_sort_largest", _wrap_gsl_sort_largest},
{"Math::GSL::Sortc::gsl_sort_largest_index", _wrap_gsl_sort_largest_index},
{"Math::GSL::Sortc::gsl_sort_int", _wrap_gsl_sort_int},
{"Math::GSL::Sortc::gsl_sort2_int", _wrap_gsl_sort2_int},
{"Math::GSL::Sortc::gsl_sort_int_index", _wrap_gsl_sort_int_index},
{"Math::GSL::Sortc::gsl_sort_int_smallest", _wrap_gsl_sort_int_smallest},
{"Math::GSL::Sortc::gsl_sort_int_smallest_index", _wrap_gsl_sort_int_smallest_index},
{"Math::GSL::Sortc::gsl_sort_int_largest", _wrap_gsl_sort_int_largest},
{"Math::GSL::Sortc::gsl_sort_int_largest_index", _wrap_gsl_sort_int_largest_index},
{"Math::GSL::Sortc::gsl_sort_vector", _wrap_gsl_sort_vector},
{"Math::GSL::Sortc::gsl_sort_vector2", _wrap_gsl_sort_vector2},
{"Math::GSL::Sortc::gsl_sort_vector_index", _wrap_gsl_sort_vector_index},
{"Math::GSL::Sortc::gsl_sort_vector_smallest", _wrap_gsl_sort_vector_smallest},
{"Math::GSL::Sortc::gsl_sort_vector_largest", _wrap_gsl_sort_vector_largest},
{"Math::GSL::Sortc::gsl_sort_vector_smallest_index", _wrap_gsl_sort_vector_smallest_index},
{"Math::GSL::Sortc::gsl_sort_vector_largest_index", _wrap_gsl_sort_vector_largest_index},
{"Math::GSL::Sortc::gsl_sort_vector_int", _wrap_gsl_sort_vector_int},
{"Math::GSL::Sortc::gsl_sort_vector2_int", _wrap_gsl_sort_vector2_int},
{"Math::GSL::Sortc::gsl_sort_vector_int_index", _wrap_gsl_sort_vector_int_index},
{"Math::GSL::Sortc::gsl_sort_vector_int_smallest", _wrap_gsl_sort_vector_int_smallest},
{"Math::GSL::Sortc::gsl_sort_vector_int_largest", _wrap_gsl_sort_vector_int_largest},
{"Math::GSL::Sortc::gsl_sort_vector_int_smallest_index", _wrap_gsl_sort_vector_int_smallest_index},
{"Math::GSL::Sortc::gsl_sort_vector_int_largest_index", _wrap_gsl_sort_vector_int_largest_index},
{"Math::GSL::Sortc::gsl_permutation_struct_size_set", _wrap_gsl_permutation_struct_size_set},
{"Math::GSL::Sortc::gsl_permutation_struct_size_get", _wrap_gsl_permutation_struct_size_get},
{"Math::GSL::Sortc::gsl_permutation_struct_data_set", _wrap_gsl_permutation_struct_data_set},
{"Math::GSL::Sortc::gsl_permutation_struct_data_get", _wrap_gsl_permutation_struct_data_get},
{"Math::GSL::Sortc::new_gsl_permutation_struct", _wrap_new_gsl_permutation_struct},
{"Math::GSL::Sortc::delete_gsl_permutation_struct", _wrap_delete_gsl_permutation_struct},
{"Math::GSL::Sortc::gsl_permutation_alloc", _wrap_gsl_permutation_alloc},
{"Math::GSL::Sortc::gsl_permutation_calloc", _wrap_gsl_permutation_calloc},
{"Math::GSL::Sortc::gsl_permutation_init", _wrap_gsl_permutation_init},
{"Math::GSL::Sortc::gsl_permutation_free", _wrap_gsl_permutation_free},
{"Math::GSL::Sortc::gsl_permutation_memcpy", _wrap_gsl_permutation_memcpy},
{"Math::GSL::Sortc::gsl_permutation_fread", _wrap_gsl_permutation_fread},
{"Math::GSL::Sortc::gsl_permutation_fwrite", _wrap_gsl_permutation_fwrite},
{"Math::GSL::Sortc::gsl_permutation_fscanf", _wrap_gsl_permutation_fscanf},
{"Math::GSL::Sortc::gsl_permutation_fprintf", _wrap_gsl_permutation_fprintf},
{"Math::GSL::Sortc::gsl_permutation_size", _wrap_gsl_permutation_size},
{"Math::GSL::Sortc::gsl_permutation_data", _wrap_gsl_permutation_data},
{"Math::GSL::Sortc::gsl_permutation_swap", _wrap_gsl_permutation_swap},
{"Math::GSL::Sortc::gsl_permutation_valid", _wrap_gsl_permutation_valid},
{"Math::GSL::Sortc::gsl_permutation_reverse", _wrap_gsl_permutation_reverse},
{"Math::GSL::Sortc::gsl_permutation_inverse", _wrap_gsl_permutation_inverse},
{"Math::GSL::Sortc::gsl_permutation_next", _wrap_gsl_permutation_next},
{"Math::GSL::Sortc::gsl_permutation_prev", _wrap_gsl_permutation_prev},
{"Math::GSL::Sortc::gsl_permutation_mul", _wrap_gsl_permutation_mul},
{"Math::GSL::Sortc::gsl_permutation_linear_to_canonical", _wrap_gsl_permutation_linear_to_canonical},
{"Math::GSL::Sortc::gsl_permutation_canonical_to_linear", _wrap_gsl_permutation_canonical_to_linear},
{"Math::GSL::Sortc::gsl_permutation_inversions", _wrap_gsl_permutation_inversions},
{"Math::GSL::Sortc::gsl_permutation_linear_cycles", _wrap_gsl_permutation_linear_cycles},
{"Math::GSL::Sortc::gsl_permutation_canonical_cycles", _wrap_gsl_permutation_canonical_cycles},
{"Math::GSL::Sortc::gsl_permutation_get", _wrap_gsl_permutation_get},
{0,0}
};
/* -----------------------------------------------------------------------------
* Type initialization:
* This problem is tough by the requirement that no dynamic
* memory is used. Also, since swig_type_info structures store pointers to
* swig_cast_info structures and swig_cast_info structures store pointers back
* to swig_type_info structures, we need some lookup code at initialization.
* The idea is that swig generates all the structures that are needed.
* The runtime then collects these partially filled structures.
* The SWIG_InitializeModule function takes these initial arrays out of
* swig_module, and does all the lookup, filling in the swig_module.types
* array with the correct data and linking the correct swig_cast_info
* structures together.
*
* The generated swig_type_info structures are assigned staticly to an initial
* array. We just loop through that array, and handle each type individually.
* First we lookup if this type has been already loaded, and if so, use the
* loaded structure instead of the generated one. Then we have to fill in the
* cast linked list. The cast data is initially stored in something like a
* two-dimensional array. Each row corresponds to a type (there are the same
* number of rows as there are in the swig_type_initial array). Each entry in
* a column is one of the swig_cast_info structures for that type.
* The cast_initial array is actually an array of arrays, because each row has
* a variable number of columns. So to actually build the cast linked list,
* we find the array of casts associated with the type, and loop through it
* adding the casts to the list. The one last trick we need to do is making
* sure the type pointer in the swig_cast_info struct is correct.
*
* First off, we lookup the cast->type name to see if it is already loaded.
* There are three cases to handle:
* 1) If the cast->type has already been loaded AND the type we are adding
* casting info to has not been loaded (it is in this module), THEN we
* replace the cast->type pointer with the type pointer that has already
* been loaded.
* 2) If BOTH types (the one we are adding casting info to, and the
* cast->type) are loaded, THEN the cast info has already been loaded by
* the previous module so we just ignore it.
* 3) Finally, if cast->type has not already been loaded, then we add that
* swig_cast_info to the linked list (because the cast->type) pointer will
* be correct.
* ----------------------------------------------------------------------------- */
#ifdef __cplusplus
extern "C" {
#if 0
} /* c-mode */
#endif
#endif
#if 0
#define SWIGRUNTIME_DEBUG
#endif
SWIGRUNTIME void
SWIG_InitializeModule(void *clientdata) {
size_t i;
swig_module_info *module_head, *iter;
int found, init;
/* check to see if the circular list has been setup, if not, set it up */
if (swig_module.next==0) {
/* Initialize the swig_module */
swig_module.type_initial = swig_type_initial;
swig_module.cast_initial = swig_cast_initial;
swig_module.next = &swig_module;
init = 1;
} else {
init = 0;
}
/* Try and load any already created modules */
module_head = SWIG_GetModule(clientdata);
if (!module_head) {
/* This is the first module loaded for this interpreter */
/* so set the swig module into the interpreter */
SWIG_SetModule(clientdata, &swig_module);
module_head = &swig_module;
} else {
/* the interpreter has loaded a SWIG module, but has it loaded this one? */
found=0;
iter=module_head;
do {
if (iter==&swig_module) {
found=1;
break;
}
iter=iter->next;
} while (iter!= module_head);
/* if the is found in the list, then all is done and we may leave */
if (found) return;
/* otherwise we must add out module into the list */
swig_module.next = module_head->next;
module_head->next = &swig_module;
}
/* When multiple interpreters are used, a module could have already been initialized in
a different interpreter, but not yet have a pointer in this interpreter.
In this case, we do not want to continue adding types... everything should be
set up already */
if (init == 0) return;
/* Now work on filling in swig_module.types */
#ifdef SWIGRUNTIME_DEBUG
printf("SWIG_InitializeModule: size %d\n", swig_module.size);
#endif
for (i = 0; i < swig_module.size; ++i) {
swig_type_info *type = 0;
swig_type_info *ret;
swig_cast_info *cast;
#ifdef SWIGRUNTIME_DEBUG
printf("SWIG_InitializeModule: type %d %s\n", i, swig_module.type_initial[i]->name);
#endif
/* if there is another module already loaded */
if (swig_module.next != &swig_module) {
type = SWIG_MangledTypeQueryModule(swig_module.next, &swig_module, swig_module.type_initial[i]->name);
}
if (type) {
/* Overwrite clientdata field */
#ifdef SWIGRUNTIME_DEBUG
printf("SWIG_InitializeModule: found type %s\n", type->name);
#endif
if (swig_module.type_initial[i]->clientdata) {
type->clientdata = swig_module.type_initial[i]->clientdata;
#ifdef SWIGRUNTIME_DEBUG
printf("SWIG_InitializeModule: found and overwrite type %s \n", type->name);
#endif
}
} else {
type = swig_module.type_initial[i];
}
/* Insert casting types */
cast = swig_module.cast_initial[i];
while (cast->type) {
/* Don't need to add information already in the list */
ret = 0;
#ifdef SWIGRUNTIME_DEBUG
printf("SWIG_InitializeModule: look cast %s\n", cast->type->name);
#endif
if (swig_module.next != &swig_module) {
ret = SWIG_MangledTypeQueryModule(swig_module.next, &swig_module, cast->type->name);
#ifdef SWIGRUNTIME_DEBUG
if (ret) printf("SWIG_InitializeModule: found cast %s\n", ret->name);
#endif
}
if (ret) {
if (type == swig_module.type_initial[i]) {
#ifdef SWIGRUNTIME_DEBUG
printf("SWIG_InitializeModule: skip old type %s\n", ret->name);
#endif
cast->type = ret;
ret = 0;
} else {
/* Check for casting already in the list */
swig_cast_info *ocast = SWIG_TypeCheck(ret->name, type);
#ifdef SWIGRUNTIME_DEBUG
if (ocast) printf("SWIG_InitializeModule: skip old cast %s\n", ret->name);
#endif
if (!ocast) ret = 0;
}
}
if (!ret) {
#ifdef SWIGRUNTIME_DEBUG
printf("SWIG_InitializeModule: adding cast %s\n", cast->type->name);
#endif
if (type->cast) {
type->cast->prev = cast;
cast->next = type->cast;
}
type->cast = cast;
}
cast++;
}
/* Set entry in modules->types array equal to the type */
swig_module.types[i] = type;
}
swig_module.types[i] = 0;
#ifdef SWIGRUNTIME_DEBUG
printf("**** SWIG_InitializeModule: Cast List ******\n");
for (i = 0; i < swig_module.size; ++i) {
int j = 0;
swig_cast_info *cast = swig_module.cast_initial[i];
printf("SWIG_InitializeModule: type %d %s\n", i, swig_module.type_initial[i]->name);
while (cast->type) {
printf("SWIG_InitializeModule: cast type %s\n", cast->type->name);
cast++;
++j;
}
printf("---- Total casts: %d\n",j);
}
printf("**** SWIG_InitializeModule: Cast List ******\n");
#endif
}
/* This function will propagate the clientdata field of type to
* any new swig_type_info structures that have been added into the list
* of equivalent types. It is like calling
* SWIG_TypeClientData(type, clientdata) a second time.
*/
SWIGRUNTIME void
SWIG_PropagateClientData(void) {
size_t i;
swig_cast_info *equiv;
static int init_run = 0;
if (init_run) return;
init_run = 1;
for (i = 0; i < swig_module.size; i++) {
if (swig_module.types[i]->clientdata) {
equiv = swig_module.types[i]->cast;
while (equiv) {
if (!equiv->converter) {
if (equiv->type && !equiv->type->clientdata)
SWIG_TypeClientData(equiv->type, swig_module.types[i]->clientdata);
}
equiv = equiv->next;
}
}
}
}
#ifdef __cplusplus
#if 0
{
/* c-mode */
#endif
}
#endif
#ifdef __cplusplus
extern "C"
#endif
XS(SWIG_init) {
dXSARGS;
int i;
SWIG_InitializeModule(0);
/* Install commands */
for (i = 0; swig_commands[i].name; i++) {
/* Casts only needed for Perl < 5.10. */
#ifdef __cplusplus
newXS(const_cast<char*>(swig_commands[i].name), swig_commands[i].wrapper, const_cast<char*>(__FILE__));
#else
newXS((char*)swig_commands[i].name, swig_commands[i].wrapper, (char*)__FILE__);
#endif
}
/* Install variables */
for (i = 0; swig_variables[i].name; i++) {
SV *sv;
sv = get_sv(swig_variables[i].name, TRUE | 0x2 | GV_ADDMULTI);
if (swig_variables[i].type) {
SWIG_MakePtr(sv,(void *)1, *swig_variables[i].type,0);
} else {
sv_setiv(sv,(IV) 0);
}
swig_create_magic(sv, swig_variables[i].name, swig_variables[i].set, swig_variables[i].get);
}
/* Install constant */
for (i = 0; swig_constants[i].type; i++) {
SV *sv;
sv = get_sv(swig_constants[i].name, TRUE | 0x2 | GV_ADDMULTI);
switch(swig_constants[i].type) {
case SWIG_INT:
sv_setiv(sv, (IV) swig_constants[i].lvalue);
break;
case SWIG_FLOAT:
sv_setnv(sv, (double) swig_constants[i].dvalue);
break;
case SWIG_STRING:
sv_setpv(sv, (const char *) swig_constants[i].pvalue);
break;
case SWIG_POINTER:
SWIG_MakePtr(sv, swig_constants[i].pvalue, *(swig_constants[i].ptype),0);
break;
case SWIG_BINARY:
SWIG_MakePackedObj(sv, swig_constants[i].pvalue, swig_constants[i].lvalue, *(swig_constants[i].ptype));
break;
default:
break;
}
SvREADONLY_on(sv);
}
/*@SWIG:/usr/local/Cellar/swig2/2.0.12/share/swig/2.0.12/perl5/perltypemaps.swg,65,%set_constant@*/ do {
SV *sv = get_sv((char*) SWIG_prefix "GSL_MAJOR_VERSION", TRUE | 0x2 | GV_ADDMULTI);
sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(2)));
SvREADONLY_on(sv);
} while(0) /*@SWIG@*/;
/*@SWIG:/usr/local/Cellar/swig2/2.0.12/share/swig/2.0.12/perl5/perltypemaps.swg,65,%set_constant@*/ do {
SV *sv = get_sv((char*) SWIG_prefix "GSL_MINOR_VERSION", TRUE | 0x2 | GV_ADDMULTI);
sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(2)));
SvREADONLY_on(sv);
} while(0) /*@SWIG@*/;
/*@SWIG:/usr/local/Cellar/swig2/2.0.12/share/swig/2.0.12/perl5/perltypemaps.swg,65,%set_constant@*/ do {
SV *sv = get_sv((char*) SWIG_prefix "GSL_POSZERO", TRUE | 0x2 | GV_ADDMULTI);
sv_setsv(sv, SWIG_From_double SWIG_PERL_CALL_ARGS_1((double)((+0.0))));
SvREADONLY_on(sv);
} while(0) /*@SWIG@*/;
/*@SWIG:/usr/local/Cellar/swig2/2.0.12/share/swig/2.0.12/perl5/perltypemaps.swg,65,%set_constant@*/ do {
SV *sv = get_sv((char*) SWIG_prefix "GSL_NEGZERO", TRUE | 0x2 | GV_ADDMULTI);
sv_setsv(sv, SWIG_From_double SWIG_PERL_CALL_ARGS_1((double)((-0.0))));
SvREADONLY_on(sv);
} while(0) /*@SWIG@*/;
/*@SWIG:/usr/local/Cellar/swig2/2.0.12/share/swig/2.0.12/perl5/perltypemaps.swg,65,%set_constant@*/ do {
SV *sv = get_sv((char*) SWIG_prefix "GSL_SUCCESS", TRUE | 0x2 | GV_ADDMULTI);
sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_SUCCESS)));
SvREADONLY_on(sv);
} while(0) /*@SWIG@*/;
/*@SWIG:/usr/local/Cellar/swig2/2.0.12/share/swig/2.0.12/perl5/perltypemaps.swg,65,%set_constant@*/ do {
SV *sv = get_sv((char*) SWIG_prefix "GSL_FAILURE", TRUE | 0x2 | GV_ADDMULTI);
sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_FAILURE)));
SvREADONLY_on(sv);
} while(0) /*@SWIG@*/;
/*@SWIG:/usr/local/Cellar/swig2/2.0.12/share/swig/2.0.12/perl5/perltypemaps.swg,65,%set_constant@*/ do {
SV *sv = get_sv((char*) SWIG_prefix "GSL_CONTINUE", TRUE | 0x2 | GV_ADDMULTI);
sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_CONTINUE)));
SvREADONLY_on(sv);
} while(0) /*@SWIG@*/;
/*@SWIG:/usr/local/Cellar/swig2/2.0.12/share/swig/2.0.12/perl5/perltypemaps.swg,65,%set_constant@*/ do {
SV *sv = get_sv((char*) SWIG_prefix "GSL_EDOM", TRUE | 0x2 | GV_ADDMULTI);
sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_EDOM)));
SvREADONLY_on(sv);
} while(0) /*@SWIG@*/;
/*@SWIG:/usr/local/Cellar/swig2/2.0.12/share/swig/2.0.12/perl5/perltypemaps.swg,65,%set_constant@*/ do {
SV *sv = get_sv((char*) SWIG_prefix "GSL_ERANGE", TRUE | 0x2 | GV_ADDMULTI);
sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_ERANGE)));
SvREADONLY_on(sv);
} while(0) /*@SWIG@*/;
/*@SWIG:/usr/local/Cellar/swig2/2.0.12/share/swig/2.0.12/perl5/perltypemaps.swg,65,%set_constant@*/ do {
SV *sv = get_sv((char*) SWIG_prefix "GSL_EFAULT", TRUE | 0x2 | GV_ADDMULTI);
sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_EFAULT)));
SvREADONLY_on(sv);
} while(0) /*@SWIG@*/;
/*@SWIG:/usr/local/Cellar/swig2/2.0.12/share/swig/2.0.12/perl5/perltypemaps.swg,65,%set_constant@*/ do {
SV *sv = get_sv((char*) SWIG_prefix "GSL_EINVAL", TRUE | 0x2 | GV_ADDMULTI);
sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_EINVAL)));
SvREADONLY_on(sv);
} while(0) /*@SWIG@*/;
/*@SWIG:/usr/local/Cellar/swig2/2.0.12/share/swig/2.0.12/perl5/perltypemaps.swg,65,%set_constant@*/ do {
SV *sv = get_sv((char*) SWIG_prefix "GSL_EFAILED", TRUE | 0x2 | GV_ADDMULTI);
sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_EFAILED)));
SvREADONLY_on(sv);
} while(0) /*@SWIG@*/;
/*@SWIG:/usr/local/Cellar/swig2/2.0.12/share/swig/2.0.12/perl5/perltypemaps.swg,65,%set_constant@*/ do {
SV *sv = get_sv((char*) SWIG_prefix "GSL_EFACTOR", TRUE | 0x2 | GV_ADDMULTI);
sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_EFACTOR)));
SvREADONLY_on(sv);
} while(0) /*@SWIG@*/;
/*@SWIG:/usr/local/Cellar/swig2/2.0.12/share/swig/2.0.12/perl5/perltypemaps.swg,65,%set_constant@*/ do {
SV *sv = get_sv((char*) SWIG_prefix "GSL_ESANITY", TRUE | 0x2 | GV_ADDMULTI);
sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_ESANITY)));
SvREADONLY_on(sv);
} while(0) /*@SWIG@*/;
/*@SWIG:/usr/local/Cellar/swig2/2.0.12/share/swig/2.0.12/perl5/perltypemaps.swg,65,%set_constant@*/ do {
SV *sv = get_sv((char*) SWIG_prefix "GSL_ENOMEM", TRUE | 0x2 | GV_ADDMULTI);
sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_ENOMEM)));
SvREADONLY_on(sv);
} while(0) /*@SWIG@*/;
/*@SWIG:/usr/local/Cellar/swig2/2.0.12/share/swig/2.0.12/perl5/perltypemaps.swg,65,%set_constant@*/ do {
SV *sv = get_sv((char*) SWIG_prefix "GSL_EBADFUNC", TRUE | 0x2 | GV_ADDMULTI);
sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_EBADFUNC)));
SvREADONLY_on(sv);
} while(0) /*@SWIG@*/;
/*@SWIG:/usr/local/Cellar/swig2/2.0.12/share/swig/2.0.12/perl5/perltypemaps.swg,65,%set_constant@*/ do {
SV *sv = get_sv((char*) SWIG_prefix "GSL_ERUNAWAY", TRUE | 0x2 | GV_ADDMULTI);
sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_ERUNAWAY)));
SvREADONLY_on(sv);
} while(0) /*@SWIG@*/;
/*@SWIG:/usr/local/Cellar/swig2/2.0.12/share/swig/2.0.12/perl5/perltypemaps.swg,65,%set_constant@*/ do {
SV *sv = get_sv((char*) SWIG_prefix "GSL_EMAXITER", TRUE | 0x2 | GV_ADDMULTI);
sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_EMAXITER)));
SvREADONLY_on(sv);
} while(0) /*@SWIG@*/;
/*@SWIG:/usr/local/Cellar/swig2/2.0.12/share/swig/2.0.12/perl5/perltypemaps.swg,65,%set_constant@*/ do {
SV *sv = get_sv((char*) SWIG_prefix "GSL_EZERODIV", TRUE | 0x2 | GV_ADDMULTI);
sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_EZERODIV)));
SvREADONLY_on(sv);
} while(0) /*@SWIG@*/;
/*@SWIG:/usr/local/Cellar/swig2/2.0.12/share/swig/2.0.12/perl5/perltypemaps.swg,65,%set_constant@*/ do {
SV *sv = get_sv((char*) SWIG_prefix "GSL_EBADTOL", TRUE | 0x2 | GV_ADDMULTI);
sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_EBADTOL)));
SvREADONLY_on(sv);
} while(0) /*@SWIG@*/;
/*@SWIG:/usr/local/Cellar/swig2/2.0.12/share/swig/2.0.12/perl5/perltypemaps.swg,65,%set_constant@*/ do {
SV *sv = get_sv((char*) SWIG_prefix "GSL_ETOL", TRUE | 0x2 | GV_ADDMULTI);
sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_ETOL)));
SvREADONLY_on(sv);
} while(0) /*@SWIG@*/;
/*@SWIG:/usr/local/Cellar/swig2/2.0.12/share/swig/2.0.12/perl5/perltypemaps.swg,65,%set_constant@*/ do {
SV *sv = get_sv((char*) SWIG_prefix "GSL_EUNDRFLW", TRUE | 0x2 | GV_ADDMULTI);
sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_EUNDRFLW)));
SvREADONLY_on(sv);
} while(0) /*@SWIG@*/;
/*@SWIG:/usr/local/Cellar/swig2/2.0.12/share/swig/2.0.12/perl5/perltypemaps.swg,65,%set_constant@*/ do {
SV *sv = get_sv((char*) SWIG_prefix "GSL_EOVRFLW", TRUE | 0x2 | GV_ADDMULTI);
sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_EOVRFLW)));
SvREADONLY_on(sv);
} while(0) /*@SWIG@*/;
/*@SWIG:/usr/local/Cellar/swig2/2.0.12/share/swig/2.0.12/perl5/perltypemaps.swg,65,%set_constant@*/ do {
SV *sv = get_sv((char*) SWIG_prefix "GSL_ELOSS", TRUE | 0x2 | GV_ADDMULTI);
sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_ELOSS)));
SvREADONLY_on(sv);
} while(0) /*@SWIG@*/;
/*@SWIG:/usr/local/Cellar/swig2/2.0.12/share/swig/2.0.12/perl5/perltypemaps.swg,65,%set_constant@*/ do {
SV *sv = get_sv((char*) SWIG_prefix "GSL_EROUND", TRUE | 0x2 | GV_ADDMULTI);
sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_EROUND)));
SvREADONLY_on(sv);
} while(0) /*@SWIG@*/;
/*@SWIG:/usr/local/Cellar/swig2/2.0.12/share/swig/2.0.12/perl5/perltypemaps.swg,65,%set_constant@*/ do {
SV *sv = get_sv((char*) SWIG_prefix "GSL_EBADLEN", TRUE | 0x2 | GV_ADDMULTI);
sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_EBADLEN)));
SvREADONLY_on(sv);
} while(0) /*@SWIG@*/;
/*@SWIG:/usr/local/Cellar/swig2/2.0.12/share/swig/2.0.12/perl5/perltypemaps.swg,65,%set_constant@*/ do {
SV *sv = get_sv((char*) SWIG_prefix "GSL_ENOTSQR", TRUE | 0x2 | GV_ADDMULTI);
sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_ENOTSQR)));
SvREADONLY_on(sv);
} while(0) /*@SWIG@*/;
/*@SWIG:/usr/local/Cellar/swig2/2.0.12/share/swig/2.0.12/perl5/perltypemaps.swg,65,%set_constant@*/ do {
SV *sv = get_sv((char*) SWIG_prefix "GSL_ESING", TRUE | 0x2 | GV_ADDMULTI);
sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_ESING)));
SvREADONLY_on(sv);
} while(0) /*@SWIG@*/;
/*@SWIG:/usr/local/Cellar/swig2/2.0.12/share/swig/2.0.12/perl5/perltypemaps.swg,65,%set_constant@*/ do {
SV *sv = get_sv((char*) SWIG_prefix "GSL_EDIVERGE", TRUE | 0x2 | GV_ADDMULTI);
sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_EDIVERGE)));
SvREADONLY_on(sv);
} while(0) /*@SWIG@*/;
/*@SWIG:/usr/local/Cellar/swig2/2.0.12/share/swig/2.0.12/perl5/perltypemaps.swg,65,%set_constant@*/ do {
SV *sv = get_sv((char*) SWIG_prefix "GSL_EUNSUP", TRUE | 0x2 | GV_ADDMULTI);
sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_EUNSUP)));
SvREADONLY_on(sv);
} while(0) /*@SWIG@*/;
/*@SWIG:/usr/local/Cellar/swig2/2.0.12/share/swig/2.0.12/perl5/perltypemaps.swg,65,%set_constant@*/ do {
SV *sv = get_sv((char*) SWIG_prefix "GSL_EUNIMPL", TRUE | 0x2 | GV_ADDMULTI);
sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_EUNIMPL)));
SvREADONLY_on(sv);
} while(0) /*@SWIG@*/;
/*@SWIG:/usr/local/Cellar/swig2/2.0.12/share/swig/2.0.12/perl5/perltypemaps.swg,65,%set_constant@*/ do {
SV *sv = get_sv((char*) SWIG_prefix "GSL_ECACHE", TRUE | 0x2 | GV_ADDMULTI);
sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_ECACHE)));
SvREADONLY_on(sv);
} while(0) /*@SWIG@*/;
/*@SWIG:/usr/local/Cellar/swig2/2.0.12/share/swig/2.0.12/perl5/perltypemaps.swg,65,%set_constant@*/ do {
SV *sv = get_sv((char*) SWIG_prefix "GSL_ETABLE", TRUE | 0x2 | GV_ADDMULTI);
sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_ETABLE)));
SvREADONLY_on(sv);
} while(0) /*@SWIG@*/;
/*@SWIG:/usr/local/Cellar/swig2/2.0.12/share/swig/2.0.12/perl5/perltypemaps.swg,65,%set_constant@*/ do {
SV *sv = get_sv((char*) SWIG_prefix "GSL_ENOPROG", TRUE | 0x2 | GV_ADDMULTI);
sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_ENOPROG)));
SvREADONLY_on(sv);
} while(0) /*@SWIG@*/;
/*@SWIG:/usr/local/Cellar/swig2/2.0.12/share/swig/2.0.12/perl5/perltypemaps.swg,65,%set_constant@*/ do {
SV *sv = get_sv((char*) SWIG_prefix "GSL_ENOPROGJ", TRUE | 0x2 | GV_ADDMULTI);
sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_ENOPROGJ)));
SvREADONLY_on(sv);
} while(0) /*@SWIG@*/;
/*@SWIG:/usr/local/Cellar/swig2/2.0.12/share/swig/2.0.12/perl5/perltypemaps.swg,65,%set_constant@*/ do {
SV *sv = get_sv((char*) SWIG_prefix "GSL_ETOLF", TRUE | 0x2 | GV_ADDMULTI);
sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_ETOLF)));
SvREADONLY_on(sv);
} while(0) /*@SWIG@*/;
/*@SWIG:/usr/local/Cellar/swig2/2.0.12/share/swig/2.0.12/perl5/perltypemaps.swg,65,%set_constant@*/ do {
SV *sv = get_sv((char*) SWIG_prefix "GSL_ETOLX", TRUE | 0x2 | GV_ADDMULTI);
sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_ETOLX)));
SvREADONLY_on(sv);
} while(0) /*@SWIG@*/;
/*@SWIG:/usr/local/Cellar/swig2/2.0.12/share/swig/2.0.12/perl5/perltypemaps.swg,65,%set_constant@*/ do {
SV *sv = get_sv((char*) SWIG_prefix "GSL_ETOLG", TRUE | 0x2 | GV_ADDMULTI);
sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_ETOLG)));
SvREADONLY_on(sv);
} while(0) /*@SWIG@*/;
/*@SWIG:/usr/local/Cellar/swig2/2.0.12/share/swig/2.0.12/perl5/perltypemaps.swg,65,%set_constant@*/ do {
SV *sv = get_sv((char*) SWIG_prefix "GSL_EOF", TRUE | 0x2 | GV_ADDMULTI);
sv_setsv(sv, SWIG_From_int SWIG_PERL_CALL_ARGS_1((int)(GSL_EOF)));
SvREADONLY_on(sv);
} while(0) /*@SWIG@*/;
SWIG_TypeClientData(SWIGTYPE_p_gsl_permutation_struct, (void*) "Math::GSL::Sort::gsl_permutation_struct");
ST(0) = &PL_sv_yes;
XSRETURN(1);
}