[Scipy-svn] r3158 - in trunk/Lib/sandbox: . multigrid multigrid/multigridtools
scipy-svn at scipy.org
scipy-svn at scipy.org
Wed Jul 11 01:14:52 EDT 2007
Author: wnbell
Date: 2007-07-11 00:14:36 -0500 (Wed, 11 Jul 2007)
New Revision: 3158
Added:
trunk/Lib/sandbox/multigrid/
trunk/Lib/sandbox/multigrid/multigrid.py
trunk/Lib/sandbox/multigrid/multigridtools.py
trunk/Lib/sandbox/multigrid/multigridtools/
trunk/Lib/sandbox/multigrid/multigridtools/multigridtools.i
trunk/Lib/sandbox/multigrid/multigridtools/multigridtools_wrap.cxx
trunk/Lib/sandbox/multigrid/multigridtools/ruge_stuben.h
trunk/Lib/sandbox/multigrid/multigridtools/smoothed_aggregation.h
trunk/Lib/sandbox/multigrid/multilevel.py
trunk/Lib/sandbox/multigrid/relaxation.py
trunk/Lib/sandbox/multigrid/simple_test.py
Log:
initial include of AMG (algebraic multigrid) codes
Added: trunk/Lib/sandbox/multigrid/multigrid.py
===================================================================
--- trunk/Lib/sandbox/multigrid/multigrid.py 2007-07-10 17:36:06 UTC (rev 3157)
+++ trunk/Lib/sandbox/multigrid/multigrid.py 2007-07-11 05:14:36 UTC (rev 3158)
@@ -0,0 +1,110 @@
+from scipy import *
+
+import multigridtools
+import scipy
+import numpy
+#import scipy.linsolve.umfpack as um
+
+
+from pydec import gauss_seidel,diag_sparse,inf_norm
+
+def poisson_problem(N):
+ """
+ Return a sparse CSC matrix for the 2d N*N poisson problem
+ with standard 5-point finite difference stencil
+ """
+ D = 4*numpy.ones(N*N)
+ T = -numpy.ones(N*N)
+ O = -numpy.ones(N*N)
+ T[N-1::N] = 0
+ return scipy.sparse.spdiags([D,O,T,T,O],[0,-N,-1,1,N],N*N,N*N)
+
+
+def rs_strong_connections(A,theta):
+ if not scipy.sparse.isspmatrix_csr(A): raise TypeError('expected sparse.csr_matrix')
+
+ Sp,Sj,Sx = multigridtools.rs_strong_connections(A.shape[0],theta,A.indptr,A.indices,A.data)
+ return scipy.sparse.csr_matrix((Sx,Sj,Sp),A.shape)
+
+
+def rs_interpolation(A,theta=0.25):
+ if not scipy.sparse.isspmatrix_csr(A): raise TypeError('expected sparse.csr_matrix')
+
+ S = rs_strong_connections(A,theta)
+
+ T = S.T.tocsr()
+
+ print "RS on A ",A.shape
+
+ Ip,Ij,Ix = multigridtools.rs_interpolation(A.shape[0],\
+ A.indptr,A.indices,A.data,\
+ S.indptr,S.indices,S.data,\
+ T.indptr,T.indices,T.data)
+
+ return scipy.sparse.csr_matrix((Ix,Ij,Ip))
+
+
+def sa_strong_connections(A,epsilon):
+ if not scipy.sparse.isspmatrix_csr(A): raise TypeError('expected sparse.csr_matrix')
+
+ Sp,Sj,Sx = multigridtools.sa_strong_connections(A.shape[0],epsilon,A.indptr,A.indices,A.data)
+ return scipy.sparse.csr_matrix((Sx,Sj,Sp),A.shape)
+
+
+def sa_constant_interpolation(A,epsilon=0.08):
+ if not scipy.sparse.isspmatrix_csr(A): raise TypeError('expected sparse.csr_matrix')
+
+ S = sa_strong_connections(A,epsilon)
+
+ #tentative (non-smooth) interpolation operator I
+ Ij = multigridtools.sa_get_aggregates(A.shape[0],S.indptr,S.indices)
+ Ip = numpy.arange(len(Ij)+1)
+ Ix = numpy.ones(len(Ij))
+
+ return scipy.sparse.csr_matrix((Ix,Ij,Ip))
+
+
+def sa_interpolation(A,epsilon=0.08,omega=4.0/3.0):
+ if not scipy.sparse.isspmatrix_csr(A): raise TypeError('expected sparse.csr_matrix')
+
+ print "SA on A ",A.shape
+
+ I = sa_constant_interpolation(A,epsilon)
+
+ D_inv = diag_sparse(1.0/diag_sparse(A))
+
+ D_inv_A = D_inv * A
+ D_inv_A *= -omega/inf_norm(D_inv_A)
+
+ #S = (scipy.sparse.spidentity(A.shape[0]).T + D_inv_A)
+ #P = S*I
+
+ P = I + (D_inv_A*I) #same as P=S*I, but faster
+
+ return P,I
+
+
+##def sa_interpolation(A,epsilon=0.08,omega=4.0/3.0):
+## if not scipy.sparse.isspmatrix_csr(A): raise TypeError('expected sparse.csr_matrix')
+
+## S = sa_strong_connections(A,epsilon)
+
+## print "SA on A ",A.shape
+
+## #tentative (non-smooth) interpolation operator I
+## Ij = multigridtools.sa_get_aggregates(A.shape[0],S.indptr,S.indices)
+## Ip = numpy.arange(len(Ij)+1)
+## Ix = numpy.ones(len(Ij))
+
+## I = scipy.sparse.csr_matrix((Ix,Ij,Ip))
+
+## # (I - \omega D^-1 Af)
+## Jp,Jj,Jx = multigridtools.sa_smoother(A.shape[0],omega,
+## A.indptr,A.indices,A.data,
+## S.indptr,S.indices,S.data)
+
+## J = scipy.sparse.csr_matrix((Jx,Jj,Jp))
+
+## return J*I
+
+
Added: trunk/Lib/sandbox/multigrid/multigridtools/multigridtools.i
===================================================================
--- trunk/Lib/sandbox/multigrid/multigridtools/multigridtools.i 2007-07-10 17:36:06 UTC (rev 3157)
+++ trunk/Lib/sandbox/multigrid/multigridtools/multigridtools.i 2007-07-11 05:14:36 UTC (rev 3158)
@@ -0,0 +1,169 @@
+/* -*- C -*- (not really, but good for syntax highlighting) */
+%module multigridtools
+
+ /* why does SWIG complain about int arrays? a typecheck is provided */
+#pragma SWIG nowarn=467
+
+%{
+#define SWIG_FILE_WITH_INIT
+#include "numpy/arrayobject.h"
+
+#include "ruge_stuben.h"
+#include "smoothed_aggregation.h"
+#include "relaxation.h"
+
+%}
+
+%feature("autodoc", "1");
+
+%include "../../../sparse/sparsetools/numpy.i"
+
+%init %{
+ import_array();
+%}
+
+
+
+
+
+ /*
+ * IN types
+ */
+%define I_IN_ARRAY1( ctype )
+%apply ctype * IN_ARRAY1 {
+ const ctype Ap [ ],
+ const ctype Ai [ ],
+ const ctype Aj [ ],
+ const ctype Bp [ ],
+ const ctype Bi [ ],
+ const ctype Bj [ ],
+ const ctype Sp [ ],
+ const ctype Si [ ],
+ const ctype Sj [ ],
+ const ctype Tp [ ],
+ const ctype Ti [ ],
+ const ctype Tj [ ]
+};
+%enddef
+
+%define T_IN_ARRAY1( ctype )
+%apply ctype * IN_ARRAY1 {
+ const ctype Ax [ ],
+ const ctype Bx [ ],
+ const ctype Sx [ ],
+ const ctype Tx [ ],
+ const ctype Xx [ ],
+ const ctype Yx [ ],
+ const ctype x [ ],
+ const ctype y [ ],
+ const ctype b [ ]
+};
+%enddef
+
+
+I_IN_ARRAY1( int )
+T_IN_ARRAY1( float )
+T_IN_ARRAY1( double )
+
+
+
+ /*
+ * OUT types
+ */
+%define I_ARRAY_ARGOUT( ctype, atype )
+VEC_ARRAY_ARGOUT( ctype, atype )
+%apply std::vector<ctype>* array_argout {
+ std::vector<ctype>* Ap,
+ std::vector<ctype>* Ai,
+ std::vector<ctype>* Aj,
+ std::vector<ctype>* Bp,
+ std::vector<ctype>* Bi,
+ std::vector<ctype>* Bj,
+ std::vector<ctype>* Cp,
+ std::vector<ctype>* Ci,
+ std::vector<ctype>* Cj,
+ std::vector<ctype>* Sp,
+ std::vector<ctype>* Si,
+ std::vector<ctype>* Sj,
+ std::vector<ctype>* Tp,
+ std::vector<ctype>* Ti,
+ std::vector<ctype>* Tj
+};
+%enddef
+
+%define T_ARRAY_ARGOUT( ctype, atype )
+VEC_ARRAY_ARGOUT( ctype, atype )
+%apply std::vector<ctype>* array_argout {
+ std::vector<ctype>* Ax,
+ std::vector<ctype>* Bx,
+ std::vector<ctype>* Cx,
+ std::vector<ctype>* Sx,
+ std::vector<ctype>* Tx,
+ std::vector<ctype>* Xx,
+ std::vector<ctype>* Yx
+};
+%enddef
+
+I_ARRAY_ARGOUT( int, INT)
+T_ARRAY_ARGOUT( float, FLOAT )
+T_ARRAY_ARGOUT( double, DOUBLE )
+
+
+
+ /*
+ * INPLACE types
+ */
+%define I_INPLACE_ARRAY1( ctype )
+%apply ctype * INPLACE_ARRAY {
+ ctype Aj [ ]
+};
+%enddef
+
+%define T_INPLACE_ARRAY1( ctype )
+%apply ctype * INPLACE_ARRAY {
+ ctype x [ ],
+ ctype temp [ ]
+};
+%enddef
+
+I_INPLACE_ARRAY1( int )
+T_INPLACE_ARRAY1( float )
+T_INPLACE_ARRAY1( double )
+
+
+%include "ruge_stuben.h"
+%include "smoothed_aggregation.h"
+%include "relaxation.h"
+
+ /*
+ * Order may be important here, list float before double
+ */
+
+%define INSTANTIATE_BOTH( f_name )
+%template(f_name) f_name<int,float>;
+%template(f_name) f_name<int,double>;
+/* 64-bit indices would go here */
+%enddef
+
+%define INSTANTIATE_INDEX( f_name )
+%template(f_name) f_name<int>;
+/* 64-bit indices would go here */
+%enddef
+
+%define INSTANTIATE_DATA( f_name )
+%template(f_name) f_name<float>;
+%template(f_name) f_name<double>;
+%enddef
+
+
+
+INSTANTIATE_DATA(rs_strong_connections)
+INSTANTIATE_DATA(rs_interpolation)
+
+INSTANTIATE_DATA(sa_strong_connections)
+INSTANTIATE_DATA(sa_smoother)
+/*INSTANTIATE_INDEX(sa_get_aggregates)*/
+
+INSTANTIATE_BOTH(gauss_seidel)
+INSTANTIATE_BOTH(jacobi)
+
Added: trunk/Lib/sandbox/multigrid/multigridtools/multigridtools_wrap.cxx
===================================================================
--- trunk/Lib/sandbox/multigrid/multigridtools/multigridtools_wrap.cxx 2007-07-10 17:36:06 UTC (rev 3157)
+++ trunk/Lib/sandbox/multigrid/multigridtools/multigridtools_wrap.cxx 2007-07-11 05:14:36 UTC (rev 3158)
@@ -0,0 +1,6216 @@
+/* ----------------------------------------------------------------------------
+ * This file was automatically generated by SWIG (http://www.swig.org).
+ * Version 1.3.32
+ *
+ * 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 SWIGPYTHON
+#define SWIG_PYTHON_DIRECTOR_NO_VTABLE
+
+#ifdef __cplusplus
+template<class T> class SwigValueWrapper {
+ T *tt;
+public:
+ SwigValueWrapper() : tt(0) { }
+ SwigValueWrapper(const SwigValueWrapper<T>& rhs) : tt(new T(*rhs.tt)) { }
+ SwigValueWrapper(const T& t) : tt(new T(t)) { }
+ ~SwigValueWrapper() { delete tt; }
+ SwigValueWrapper& operator=(const T& t) { delete tt; tt = new T(t); return *this; }
+ operator T&() const { return *tt; }
+ T *operator&() { return tt; }
+private:
+ SwigValueWrapper& operator=(const SwigValueWrapper<T>& rhs);
+};
+#endif
+
+/* -----------------------------------------------------------------------------
+ * 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 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
+
+
+/* Python.h has to appear first */
+#include <Python.h>
+
+/* -----------------------------------------------------------------------------
+ * swigrun.swg
+ *
+ * This file contains generic CAPI 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 "3"
+
+/* 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 is strictly necessary, ie, if you have problems
+ with your compiler or so.
+*/
+
+#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
+
+/* Flags for new pointer objects */
+#define SWIG_POINTER_OWN 0x1
+
+
+/*
+ Flags/methods for returning states.
+
+ The swig conversion methods, as ConvertPtr, return and 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 swig versions, you usually write code as:
+
+ if (SWIG_ConvertPtr(obj,vptr,ty.flags) != -1) {
+ // success code
+ } else {
+ //fail code
+ }
+
+ Now you can be more explicit as:
+
+ int res = SWIG_ConvertPtr(obj,vptr,ty.flags);
+ if (SWIG_IsOK(res)) {
+ // success code
+ } else {
+ // fail code
+ }
+
+ that seems to be the same, 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
+ requires also to SWIG_ConvertPtr to return new result values, 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
+# define SWIG_CheckState(r) (SWIG_IsOK(r) ? 1 : 0)
+#endif
+
+
+
+
+#include <string.h>
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+typedef void *(*swig_converter_func)(void *);
+typedef struct swig_type_info *(*swig_dycast_func)(void **);
+
+/* Structure to store inforomation 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 (l1 - f1) - (l2 - f2);
+}
+
+/*
+ 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) {
+ int equiv = 0;
+ const char* te = tb + strlen(tb);
+ const char* ne = nb;
+ while (!equiv && *ne) {
+ for (nb = ne; *ne; ++ne) {
+ if (*ne == '|') break;
+ }
+ equiv = (SWIG_TypeNameComp(nb, ne, tb, te) == 0) ? 1 : 0;
+ if (*ne) ++ne;
+ }
+ return equiv;
+}
+
+/*
+ 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_TypeCompare(const char *nb, const char *tb) {
+ int equiv = 0;
+ const char* te = tb + strlen(tb);
+ const char* ne = nb;
+ while (!equiv && *ne) {
+ for (nb = ne; *ne; ++ne) {
+ if (*ne == '|') break;
+ }
+ equiv = (SWIG_TypeNameComp(nb, ne, tb, te) == 0) ? 1 : 0;
+ if (*ne) ++ne;
+ }
+ return equiv;
+}
+
+
+/* think of this as a c++ template<> or a scheme macro */
+#define SWIG_TypeCheck_Template(comparison, ty) \
+ if (ty) { \
+ swig_cast_info *iter = ty->cast; \
+ while (iter) { \
+ if (comparison) { \
+ 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
+
+/*
+ Check the typename
+*/
+SWIGRUNTIME swig_cast_info *
+SWIG_TypeCheck(const char *c, swig_type_info *ty) {
+ SWIG_TypeCheck_Template(strcmp(iter->type->name, c) == 0, ty);
+}
+
+/* Same as previous function, except strcmp is replaced with a pointer comparison */
+SWIGRUNTIME swig_cast_info *
+SWIG_TypeCheckStruct(swig_type_info *from, swig_type_info *into) {
+ SWIG_TypeCheck_Template(iter->type == from, into);
+}
+
+/*
+ Cast a pointer up an inheritance hierarchy
+*/
+SWIGRUNTIMEINLINE void *
+SWIG_TypeCast(swig_cast_info *ty, void *ptr) {
+ return ((!ty) || (!ty->converter)) ? ptr : (*ty->converter)(ptr);
+}
+
+/*
+ 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
+
+
+
+
+/* Add PyOS_snprintf for old Pythons */
+#if PY_VERSION_HEX < 0x02020000
+# if defined(_MSC_VER) || defined(__BORLANDC__) || defined(_WATCOM)
+# define PyOS_snprintf _snprintf
+# else
+# define PyOS_snprintf snprintf
+# endif
+#endif
+
+/* A crude PyString_FromFormat implementation for old Pythons */
+#if PY_VERSION_HEX < 0x02020000
+
+#ifndef SWIG_PYBUFFER_SIZE
+# define SWIG_PYBUFFER_SIZE 1024
+#endif
+
+static PyObject *
+PyString_FromFormat(const char *fmt, ...) {
+ va_list ap;
+ char buf[SWIG_PYBUFFER_SIZE * 2];
+ int res;
+ va_start(ap, fmt);
+ res = vsnprintf(buf, sizeof(buf), fmt, ap);
+ va_end(ap);
+ return (res < 0 || res >= (int)sizeof(buf)) ? 0 : PyString_FromString(buf);
+}
+#endif
+
+/* Add PyObject_Del for old Pythons */
+#if PY_VERSION_HEX < 0x01060000
+# define PyObject_Del(op) PyMem_DEL((op))
+#endif
+#ifndef PyObject_DEL
+# define PyObject_DEL PyObject_Del
+#endif
+
+/* A crude PyExc_StopIteration exception for old Pythons */
+#if PY_VERSION_HEX < 0x02020000
+# ifndef PyExc_StopIteration
+# define PyExc_StopIteration PyExc_RuntimeError
+# endif
+# ifndef PyObject_GenericGetAttr
+# define PyObject_GenericGetAttr 0
+# endif
+#endif
+/* Py_NotImplemented is defined in 2.1 and up. */
+#if PY_VERSION_HEX < 0x02010000
+# ifndef Py_NotImplemented
+# define Py_NotImplemented PyExc_RuntimeError
+# endif
+#endif
+
+
+/* A crude PyString_AsStringAndSize implementation for old Pythons */
+#if PY_VERSION_HEX < 0x02010000
+# ifndef PyString_AsStringAndSize
+# define PyString_AsStringAndSize(obj, s, len) {*s = PyString_AsString(obj); *len = *s ? strlen(*s) : 0;}
+# endif
+#endif
+
+/* PySequence_Size for old Pythons */
+#if PY_VERSION_HEX < 0x02000000
+# ifndef PySequence_Size
+# define PySequence_Size PySequence_Length
+# endif
+#endif
+
+
+/* PyBool_FromLong for old Pythons */
+#if PY_VERSION_HEX < 0x02030000
+static
+PyObject *PyBool_FromLong(long ok)
+{
+ PyObject *result = ok ? Py_True : Py_False;
+ Py_INCREF(result);
+ return result;
+}
+#endif
+
+/* Py_ssize_t for old Pythons */
+/* This code is as recommended by: */
+/* http://www.python.org/dev/peps/pep-0353/#conversion-guidelines */
+#if PY_VERSION_HEX < 0x02050000 && !defined(PY_SSIZE_T_MIN)
+typedef int Py_ssize_t;
+# define PY_SSIZE_T_MAX INT_MAX
+# define PY_SSIZE_T_MIN INT_MIN
+#endif
+
+/* -----------------------------------------------------------------------------
+ * error manipulation
+ * ----------------------------------------------------------------------------- */
+
+SWIGRUNTIME PyObject*
+SWIG_Python_ErrorType(int code) {
+ PyObject* type = 0;
+ switch(code) {
+ case SWIG_MemoryError:
+ type = PyExc_MemoryError;
+ break;
+ case SWIG_IOError:
+ type = PyExc_IOError;
+ break;
+ case SWIG_RuntimeError:
+ type = PyExc_RuntimeError;
+ break;
+ case SWIG_IndexError:
+ type = PyExc_IndexError;
+ break;
+ case SWIG_TypeError:
+ type = PyExc_TypeError;
+ break;
+ case SWIG_DivisionByZero:
+ type = PyExc_ZeroDivisionError;
+ break;
+ case SWIG_OverflowError:
+ type = PyExc_OverflowError;
+ break;
+ case SWIG_SyntaxError:
+ type = PyExc_SyntaxError;
+ break;
+ case SWIG_ValueError:
+ type = PyExc_ValueError;
+ break;
+ case SWIG_SystemError:
+ type = PyExc_SystemError;
+ break;
+ case SWIG_AttributeError:
+ type = PyExc_AttributeError;
+ break;
+ default:
+ type = PyExc_RuntimeError;
+ }
+ return type;
+}
+
+
+SWIGRUNTIME void
+SWIG_Python_AddErrorMsg(const char* mesg)
+{
+ PyObject *type = 0;
+ PyObject *value = 0;
+ PyObject *traceback = 0;
+
+ if (PyErr_Occurred()) PyErr_Fetch(&type, &value, &traceback);
+ if (value) {
+ PyObject *old_str = PyObject_Str(value);
+ PyErr_Clear();
+ Py_XINCREF(type);
+ PyErr_Format(type, "%s %s", PyString_AsString(old_str), mesg);
+ Py_DECREF(old_str);
+ Py_DECREF(value);
+ } else {
+ PyErr_Format(PyExc_RuntimeError, mesg);
+ }
+}
+
+
+
+#if defined(SWIG_PYTHON_NO_THREADS)
+# if defined(SWIG_PYTHON_THREADS)
+# undef SWIG_PYTHON_THREADS
+# endif
+#endif
+#if defined(SWIG_PYTHON_THREADS) /* Threading support is enabled */
+# if !defined(SWIG_PYTHON_USE_GIL) && !defined(SWIG_PYTHON_NO_USE_GIL)
+# if (PY_VERSION_HEX >= 0x02030000) /* For 2.3 or later, use the PyGILState calls */
+# define SWIG_PYTHON_USE_GIL
+# endif
+# endif
+# if defined(SWIG_PYTHON_USE_GIL) /* Use PyGILState threads calls */
+# ifndef SWIG_PYTHON_INITIALIZE_THREADS
+# define SWIG_PYTHON_INITIALIZE_THREADS PyEval_InitThreads()
+# endif
+# ifdef __cplusplus /* C++ code */
+ class SWIG_Python_Thread_Block {
+ bool status;
+ PyGILState_STATE state;
+ public:
+ void end() { if (status) { PyGILState_Release(state); status = false;} }
+ SWIG_Python_Thread_Block() : status(true), state(PyGILState_Ensure()) {}
+ ~SWIG_Python_Thread_Block() { end(); }
+ };
+ class SWIG_Python_Thread_Allow {
+ bool status;
+ PyThreadState *save;
+ public:
+ void end() { if (status) { PyEval_RestoreThread(save); status = false; }}
+ SWIG_Python_Thread_Allow() : status(true), save(PyEval_SaveThread()) {}
+ ~SWIG_Python_Thread_Allow() { end(); }
+ };
+# define SWIG_PYTHON_THREAD_BEGIN_BLOCK SWIG_Python_Thread_Block _swig_thread_block
+# define SWIG_PYTHON_THREAD_END_BLOCK _swig_thread_block.end()
+# define SWIG_PYTHON_THREAD_BEGIN_ALLOW SWIG_Python_Thread_Allow _swig_thread_allow
+# define SWIG_PYTHON_THREAD_END_ALLOW _swig_thread_allow.end()
+# else /* C code */
+# define SWIG_PYTHON_THREAD_BEGIN_BLOCK PyGILState_STATE _swig_thread_block = PyGILState_Ensure()
+# define SWIG_PYTHON_THREAD_END_BLOCK PyGILState_Release(_swig_thread_block)
+# define SWIG_PYTHON_THREAD_BEGIN_ALLOW PyThreadState *_swig_thread_allow = PyEval_SaveThread()
+# define SWIG_PYTHON_THREAD_END_ALLOW PyEval_RestoreThread(_swig_thread_allow)
+# endif
+# else /* Old thread way, not implemented, user must provide it */
+# if !defined(SWIG_PYTHON_INITIALIZE_THREADS)
+# define SWIG_PYTHON_INITIALIZE_THREADS
+# endif
+# if !defined(SWIG_PYTHON_THREAD_BEGIN_BLOCK)
+# define SWIG_PYTHON_THREAD_BEGIN_BLOCK
+# endif
+# if !defined(SWIG_PYTHON_THREAD_END_BLOCK)
+# define SWIG_PYTHON_THREAD_END_BLOCK
+# endif
+# if !defined(SWIG_PYTHON_THREAD_BEGIN_ALLOW)
+# define SWIG_PYTHON_THREAD_BEGIN_ALLOW
+# endif
+# if !defined(SWIG_PYTHON_THREAD_END_ALLOW)
+# define SWIG_PYTHON_THREAD_END_ALLOW
+# endif
+# endif
+#else /* No thread support */
+# define SWIG_PYTHON_INITIALIZE_THREADS
+# define SWIG_PYTHON_THREAD_BEGIN_BLOCK
+# define SWIG_PYTHON_THREAD_END_BLOCK
+# define SWIG_PYTHON_THREAD_BEGIN_ALLOW
+# define SWIG_PYTHON_THREAD_END_ALLOW
+#endif
+
+/* -----------------------------------------------------------------------------
+ * Python API portion that goes into the runtime
+ * ----------------------------------------------------------------------------- */
+
+#ifdef __cplusplus
+extern "C" {
+#if 0
+} /* cc-mode */
+#endif
+#endif
+
+/* -----------------------------------------------------------------------------
+ * Constant declarations
+ * ----------------------------------------------------------------------------- */
+
+/* Constant Types */
+#define SWIG_PY_POINTER 4
+#define SWIG_PY_BINARY 5
+
+/* Constant information structure */
+typedef struct swig_const_info {
+ int type;
+ char *name;
+ long lvalue;
+ double dvalue;
+ void *pvalue;
+ swig_type_info **ptype;
+} swig_const_info;
+
+#ifdef __cplusplus
+#if 0
+{ /* cc-mode */
+#endif
+}
+#endif
+
+
+/* -----------------------------------------------------------------------------
+ * See the LICENSE file for information on copyright, usage and redistribution
+ * of SWIG, and the README file for authors - http://www.swig.org/release.html.
+ *
+ * pyrun.swg
+ *
+ * This file contains the runtime support for Python modules
+ * and includes code for managing global variables and pointer
+ * type checking.
+ *
+ * ----------------------------------------------------------------------------- */
+
+/* Common SWIG API */
+
+/* for raw pointers */
+#define SWIG_Python_ConvertPtr(obj, pptr, type, flags) SWIG_Python_ConvertPtrAndOwn(obj, pptr, type, flags, 0)
+#define SWIG_ConvertPtr(obj, pptr, type, flags) SWIG_Python_ConvertPtr(obj, pptr, type, flags)
+#define SWIG_ConvertPtrAndOwn(obj,pptr,type,flags,own) SWIG_Python_ConvertPtrAndOwn(obj, pptr, type, flags, own)
+#define SWIG_NewPointerObj(ptr, type, flags) SWIG_Python_NewPointerObj(ptr, type, flags)
+#define SWIG_CheckImplicit(ty) SWIG_Python_CheckImplicit(ty)
+#define SWIG_AcquirePtr(ptr, src) SWIG_Python_AcquirePtr(ptr, src)
+#define swig_owntype int
+
+/* for raw packed data */
+#define SWIG_ConvertPacked(obj, ptr, sz, ty) SWIG_Python_ConvertPacked(obj, ptr, sz, ty)
+#define SWIG_NewPackedObj(ptr, sz, type) SWIG_Python_NewPackedObj(ptr, sz, 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_Python_ConvertFunctionPtr(obj, pptr, type)
+#define SWIG_NewFunctionPtrObj(ptr, type) SWIG_Python_NewPointerObj(ptr, type, 0)
+
+/* for C++ member pointers, ie, member methods */
+#define SWIG_ConvertMember(obj, ptr, sz, ty) SWIG_Python_ConvertPacked(obj, ptr, sz, ty)
+#define SWIG_NewMemberObj(ptr, sz, type) SWIG_Python_NewPackedObj(ptr, sz, type)
+
+
+/* Runtime API */
+
+#define SWIG_GetModule(clientdata) SWIG_Python_GetModule()
+#define SWIG_SetModule(clientdata, pointer) SWIG_Python_SetModule(pointer)
+#define SWIG_NewClientData(obj) PySwigClientData_New(obj)
+
+#define SWIG_SetErrorObj SWIG_Python_SetErrorObj
+#define SWIG_SetErrorMsg SWIG_Python_SetErrorMsg
+#define SWIG_ErrorType(code) SWIG_Python_ErrorType(code)
+#define SWIG_Error(code, msg) SWIG_Python_SetErrorMsg(SWIG_ErrorType(code), msg)
+#define SWIG_fail goto fail
+
+
+/* Runtime API implementation */
+
+/* Error manipulation */
+
+SWIGINTERN void
+SWIG_Python_SetErrorObj(PyObject *errtype, PyObject *obj) {
+ SWIG_PYTHON_THREAD_BEGIN_BLOCK;
+ PyErr_SetObject(errtype, obj);
+ Py_DECREF(obj);
+ SWIG_PYTHON_THREAD_END_BLOCK;
+}
+
+SWIGINTERN void
+SWIG_Python_SetErrorMsg(PyObject *errtype, const char *msg) {
+ SWIG_PYTHON_THREAD_BEGIN_BLOCK;
+ PyErr_SetString(errtype, (char *) msg);
+ SWIG_PYTHON_THREAD_END_BLOCK;
+}
+
+#define SWIG_Python_Raise(obj, type, desc) SWIG_Python_SetErrorObj(SWIG_Python_ExceptionType(desc), obj)
+
+/* Set a constant value */
+
+SWIGINTERN void
+SWIG_Python_SetConstant(PyObject *d, const char *name, PyObject *obj) {
+ PyDict_SetItemString(d, (char*) name, obj);
+ Py_DECREF(obj);
+}
+
+/* Append a value to the result obj */
+
+SWIGINTERN PyObject*
+SWIG_Python_AppendOutput(PyObject* result, PyObject* obj) {
+#if !defined(SWIG_PYTHON_OUTPUT_TUPLE)
+ if (!result) {
+ result = obj;
+ } else if (result == Py_None) {
+ Py_DECREF(result);
+ result = obj;
+ } else {
+ if (!PyList_Check(result)) {
+ PyObject *o2 = result;
+ result = PyList_New(1);
+ PyList_SetItem(result, 0, o2);
+ }
+ PyList_Append(result,obj);
+ Py_DECREF(obj);
+ }
+ return result;
+#else
+ PyObject* o2;
+ PyObject* o3;
+ if (!result) {
+ result = obj;
+ } else if (result == Py_None) {
+ Py_DECREF(result);
+ result = obj;
+ } else {
+ if (!PyTuple_Check(result)) {
+ o2 = result;
+ result = PyTuple_New(1);
+ PyTuple_SET_ITEM(result, 0, o2);
+ }
+ o3 = PyTuple_New(1);
+ PyTuple_SET_ITEM(o3, 0, obj);
+ o2 = result;
+ result = PySequence_Concat(o2, o3);
+ Py_DECREF(o2);
+ Py_DECREF(o3);
+ }
+ return result;
+#endif
+}
+
+/* Unpack the argument tuple */
+
+SWIGINTERN int
+SWIG_Python_UnpackTuple(PyObject *args, const char *name, int min, int max, PyObject **objs)
+{
+ if (!args) {
+ if (!min && !max) {
+ return 1;
+ } else {
+ PyErr_Format(PyExc_TypeError, "%s expected %s%d arguments, got none",
+ name, (min == max ? "" : "at least "), min);
+ return 0;
+ }
+ }
+ if (!PyTuple_Check(args)) {
+ PyErr_SetString(PyExc_SystemError, "UnpackTuple() argument list is not a tuple");
+ return 0;
+ } else {
+ register int l = PyTuple_GET_SIZE(args);
+ if (l < min) {
+ PyErr_Format(PyExc_TypeError, "%s expected %s%d arguments, got %d",
+ name, (min == max ? "" : "at least "), min, l);
+ return 0;
+ } else if (l > max) {
+ PyErr_Format(PyExc_TypeError, "%s expected %s%d arguments, got %d",
+ name, (min == max ? "" : "at most "), max, l);
+ return 0;
+ } else {
+ register int i;
+ for (i = 0; i < l; ++i) {
+ objs[i] = PyTuple_GET_ITEM(args, i);
+ }
+ for (; l < max; ++l) {
+ objs[l] = 0;
+ }
+ return i + 1;
+ }
+ }
+}
+
+/* A functor is a function object with one single object argument */
+#if PY_VERSION_HEX >= 0x02020000
+#define SWIG_Python_CallFunctor(functor, obj) PyObject_CallFunctionObjArgs(functor, obj, NULL);
+#else
+#define SWIG_Python_CallFunctor(functor, obj) PyObject_CallFunction(functor, "O", obj);
+#endif
+
+/*
+ Helper for static pointer initialization for both C and C++ code, for example
+ static PyObject *SWIG_STATIC_POINTER(MyVar) = NewSomething(...);
+*/
+#ifdef __cplusplus
+#define SWIG_STATIC_POINTER(var) var
+#else
+#define SWIG_STATIC_POINTER(var) var = 0; if (!var) var
+#endif
+
+/* -----------------------------------------------------------------------------
+ * Pointer declarations
+ * ----------------------------------------------------------------------------- */
+
+/* Flags for new pointer objects */
+#define SWIG_POINTER_NOSHADOW (SWIG_POINTER_OWN << 1)
+#define SWIG_POINTER_NEW (SWIG_POINTER_NOSHADOW | SWIG_POINTER_OWN)
+
+#define SWIG_POINTER_IMPLICIT_CONV (SWIG_POINTER_DISOWN << 1)
+
+#ifdef __cplusplus
+extern "C" {
+#if 0
+} /* cc-mode */
+#endif
+#endif
+
+/* How to access Py_None */
+#if defined(_WIN32) || defined(__WIN32__) || defined(__CYGWIN__)
+# ifndef SWIG_PYTHON_NO_BUILD_NONE
+# ifndef SWIG_PYTHON_BUILD_NONE
+# define SWIG_PYTHON_BUILD_NONE
+# endif
+# endif
+#endif
+
+#ifdef SWIG_PYTHON_BUILD_NONE
+# ifdef Py_None
+# undef Py_None
+# define Py_None SWIG_Py_None()
+# endif
+SWIGRUNTIMEINLINE PyObject *
+_SWIG_Py_None(void)
+{
+ PyObject *none = Py_BuildValue((char*)"");
+ Py_DECREF(none);
+ return none;
+}
+SWIGRUNTIME PyObject *
+SWIG_Py_None(void)
+{
+ static PyObject *SWIG_STATIC_POINTER(none) = _SWIG_Py_None();
+ return none;
+}
+#endif
+
+/* The python void return value */
+
+SWIGRUNTIMEINLINE PyObject *
+SWIG_Py_Void(void)
+{
+ PyObject *none = Py_None;
+ Py_INCREF(none);
+ return none;
+}
+
+/* PySwigClientData */
+
+typedef struct {
+ PyObject *klass;
+ PyObject *newraw;
+ PyObject *newargs;
+ PyObject *destroy;
+ int delargs;
+ int implicitconv;
+} PySwigClientData;
+
+SWIGRUNTIMEINLINE int
+SWIG_Python_CheckImplicit(swig_type_info *ty)
+{
+ PySwigClientData *data = (PySwigClientData *)ty->clientdata;
+ return data ? data->implicitconv : 0;
+}
+
+SWIGRUNTIMEINLINE PyObject *
+SWIG_Python_ExceptionType(swig_type_info *desc) {
+ PySwigClientData *data = desc ? (PySwigClientData *) desc->clientdata : 0;
+ PyObject *klass = data ? data->klass : 0;
+ return (klass ? klass : PyExc_RuntimeError);
+}
+
+
+SWIGRUNTIME PySwigClientData *
+PySwigClientData_New(PyObject* obj)
+{
+ if (!obj) {
+ return 0;
+ } else {
+ PySwigClientData *data = (PySwigClientData *)malloc(sizeof(PySwigClientData));
+ /* the klass element */
+ data->klass = obj;
+ Py_INCREF(data->klass);
+ /* the newraw method and newargs arguments used to create a new raw instance */
+ if (PyClass_Check(obj)) {
+ data->newraw = 0;
+ data->newargs = obj;
+ Py_INCREF(obj);
+ } else {
+#if (PY_VERSION_HEX < 0x02020000)
+ data->newraw = 0;
+#else
+ data->newraw = PyObject_GetAttrString(data->klass, (char *)"__new__");
+#endif
+ if (data->newraw) {
+ Py_INCREF(data->newraw);
+ data->newargs = PyTuple_New(1);
+ PyTuple_SetItem(data->newargs, 0, obj);
+ } else {
+ data->newargs = obj;
+ }
+ Py_INCREF(data->newargs);
+ }
+ /* the destroy method, aka as the C++ delete method */
+ data->destroy = PyObject_GetAttrString(data->klass, (char *)"__swig_destroy__");
+ if (PyErr_Occurred()) {
+ PyErr_Clear();
+ data->destroy = 0;
+ }
+ if (data->destroy) {
+ int flags;
+ Py_INCREF(data->destroy);
+ flags = PyCFunction_GET_FLAGS(data->destroy);
+#ifdef METH_O
+ data->delargs = !(flags & (METH_O));
+#else
+ data->delargs = 0;
+#endif
+ } else {
+ data->delargs = 0;
+ }
+ data->implicitconv = 0;
+ return data;
+ }
+}
+
+SWIGRUNTIME void
+PySwigClientData_Del(PySwigClientData* data)
+{
+ Py_XDECREF(data->newraw);
+ Py_XDECREF(data->newargs);
+ Py_XDECREF(data->destroy);
+}
+
+/* =============== PySwigObject =====================*/
+
+typedef struct {
+ PyObject_HEAD
+ void *ptr;
+ swig_type_info *ty;
+ int own;
+ PyObject *next;
+} PySwigObject;
+
+SWIGRUNTIME PyObject *
+PySwigObject_long(PySwigObject *v)
+{
+ return PyLong_FromVoidPtr(v->ptr);
+}
+
+SWIGRUNTIME PyObject *
+PySwigObject_format(const char* fmt, PySwigObject *v)
+{
+ PyObject *res = NULL;
+ PyObject *args = PyTuple_New(1);
+ if (args) {
+ if (PyTuple_SetItem(args, 0, PySwigObject_long(v)) == 0) {
+ PyObject *ofmt = PyString_FromString(fmt);
+ if (ofmt) {
+ res = PyString_Format(ofmt,args);
+ Py_DECREF(ofmt);
+ }
+ Py_DECREF(args);
+ }
+ }
+ return res;
+}
+
+SWIGRUNTIME PyObject *
+PySwigObject_oct(PySwigObject *v)
+{
+ return PySwigObject_format("%o",v);
+}
+
+SWIGRUNTIME PyObject *
+PySwigObject_hex(PySwigObject *v)
+{
+ return PySwigObject_format("%x",v);
+}
+
+SWIGRUNTIME PyObject *
+#ifdef METH_NOARGS
+PySwigObject_repr(PySwigObject *v)
+#else
+PySwigObject_repr(PySwigObject *v, PyObject *args)
+#endif
+{
+ const char *name = SWIG_TypePrettyName(v->ty);
+ PyObject *hex = PySwigObject_hex(v);
+ PyObject *repr = PyString_FromFormat("<Swig Object of type '%s' at 0x%s>", name, PyString_AsString(hex));
+ Py_DECREF(hex);
+ if (v->next) {
+#ifdef METH_NOARGS
+ PyObject *nrep = PySwigObject_repr((PySwigObject *)v->next);
+#else
+ PyObject *nrep = PySwigObject_repr((PySwigObject *)v->next, args);
+#endif
+ PyString_ConcatAndDel(&repr,nrep);
+ }
+ return repr;
+}
+
+SWIGRUNTIME int
+PySwigObject_print(PySwigObject *v, FILE *fp, int SWIGUNUSEDPARM(flags))
+{
+#ifdef METH_NOARGS
+ PyObject *repr = PySwigObject_repr(v);
+#else
+ PyObject *repr = PySwigObject_repr(v, NULL);
+#endif
+ if (repr) {
+ fputs(PyString_AsString(repr), fp);
+ Py_DECREF(repr);
+ return 0;
+ } else {
+ return 1;
+ }
+}
+
+SWIGRUNTIME PyObject *
+PySwigObject_str(PySwigObject *v)
+{
+ char result[SWIG_BUFFER_SIZE];
+ return SWIG_PackVoidPtr(result, v->ptr, v->ty->name, sizeof(result)) ?
+ PyString_FromString(result) : 0;
+}
+
+SWIGRUNTIME int
+PySwigObject_compare(PySwigObject *v, PySwigObject *w)
+{
+ void *i = v->ptr;
+ void *j = w->ptr;
+ return (i < j) ? -1 : ((i > j) ? 1 : 0);
+}
+
+SWIGRUNTIME PyTypeObject* _PySwigObject_type(void);
+
+SWIGRUNTIME PyTypeObject*
+PySwigObject_type(void) {
+ static PyTypeObject *SWIG_STATIC_POINTER(type) = _PySwigObject_type();
+ return type;
+}
+
+SWIGRUNTIMEINLINE int
+PySwigObject_Check(PyObject *op) {
+ return ((op)->ob_type == PySwigObject_type())
+ || (strcmp((op)->ob_type->tp_name,"PySwigObject") == 0);
+}
+
+SWIGRUNTIME PyObject *
+PySwigObject_New(void *ptr, swig_type_info *ty, int own);
+
+SWIGRUNTIME void
+PySwigObject_dealloc(PyObject *v)
+{
+ PySwigObject *sobj = (PySwigObject *) v;
+ PyObject *next = sobj->next;
+ if (sobj->own) {
+ swig_type_info *ty = sobj->ty;
+ PySwigClientData *data = ty ? (PySwigClientData *) ty->clientdata : 0;
+ PyObject *destroy = data ? data->destroy : 0;
+ if (destroy) {
+ /* destroy is always a VARARGS method */
+ PyObject *res;
+ if (data->delargs) {
+ /* we need to create a temporal object to carry the destroy operation */
+ PyObject *tmp = PySwigObject_New(sobj->ptr, ty, 0);
+ res = SWIG_Python_CallFunctor(destroy, tmp);
+ Py_DECREF(tmp);
+ } else {
+ PyCFunction meth = PyCFunction_GET_FUNCTION(destroy);
+ PyObject *mself = PyCFunction_GET_SELF(destroy);
+ res = ((*meth)(mself, v));
+ }
+ Py_XDECREF(res);
+ } else {
+ const char *name = SWIG_TypePrettyName(ty);
+#if !defined(SWIG_PYTHON_SILENT_MEMLEAK)
+ printf("swig/python detected a memory leak of type '%s', no destructor found.\n", name);
+#endif
+ }
+ }
+ Py_XDECREF(next);
+ PyObject_DEL(v);
+}
+
+SWIGRUNTIME PyObject*
+PySwigObject_append(PyObject* v, PyObject* next)
+{
+ PySwigObject *sobj = (PySwigObject *) v;
+#ifndef METH_O
+ PyObject *tmp = 0;
+ if (!PyArg_ParseTuple(next,(char *)"O:append", &tmp)) return NULL;
+ next = tmp;
+#endif
+ if (!PySwigObject_Check(next)) {
+ return NULL;
+ }
+ sobj->next = next;
+ Py_INCREF(next);
+ return SWIG_Py_Void();
+}
+
+SWIGRUNTIME PyObject*
+#ifdef METH_NOARGS
+PySwigObject_next(PyObject* v)
+#else
+PySwigObject_next(PyObject* v, PyObject *SWIGUNUSEDPARM(args))
+#endif
+{
+ PySwigObject *sobj = (PySwigObject *) v;
+ if (sobj->next) {
+ Py_INCREF(sobj->next);
+ return sobj->next;
+ } else {
+ return SWIG_Py_Void();
+ }
+}
+
+SWIGINTERN PyObject*
+#ifdef METH_NOARGS
+PySwigObject_disown(PyObject *v)
+#else
+PySwigObject_disown(PyObject* v, PyObject *SWIGUNUSEDPARM(args))
+#endif
+{
+ PySwigObject *sobj = (PySwigObject *)v;
+ sobj->own = 0;
+ return SWIG_Py_Void();
+}
+
+SWIGINTERN PyObject*
+#ifdef METH_NOARGS
+PySwigObject_acquire(PyObject *v)
+#else
+PySwigObject_acquire(PyObject* v, PyObject *SWIGUNUSEDPARM(args))
+#endif
+{
+ PySwigObject *sobj = (PySwigObject *)v;
+ sobj->own = SWIG_POINTER_OWN;
+ return SWIG_Py_Void();
+}
+
+SWIGINTERN PyObject*
+PySwigObject_own(PyObject *v, PyObject *args)
+{
+ PyObject *val = 0;
+#if (PY_VERSION_HEX < 0x02020000)
+ if (!PyArg_ParseTuple(args,(char *)"|O:own",&val))
+#else
+ if (!PyArg_UnpackTuple(args, (char *)"own", 0, 1, &val))
+#endif
+ {
+ return NULL;
+ }
+ else
+ {
+ PySwigObject *sobj = (PySwigObject *)v;
+ PyObject *obj = PyBool_FromLong(sobj->own);
+ if (val) {
+#ifdef METH_NOARGS
+ if (PyObject_IsTrue(val)) {
+ PySwigObject_acquire(v);
+ } else {
+ PySwigObject_disown(v);
+ }
+#else
+ if (PyObject_IsTrue(val)) {
+ PySwigObject_acquire(v,args);
+ } else {
+ PySwigObject_disown(v,args);
+ }
+#endif
+ }
+ return obj;
+ }
+}
+
+#ifdef METH_O
+static PyMethodDef
+swigobject_methods[] = {
+ {(char *)"disown", (PyCFunction)PySwigObject_disown, METH_NOARGS, (char *)"releases ownership of the pointer"},
+ {(char *)"acquire", (PyCFunction)PySwigObject_acquire, METH_NOARGS, (char *)"aquires ownership of the pointer"},
+ {(char *)"own", (PyCFunction)PySwigObject_own, METH_VARARGS, (char *)"returns/sets ownership of the pointer"},
+ {(char *)"append", (PyCFunction)PySwigObject_append, METH_O, (char *)"appends another 'this' object"},
+ {(char *)"next", (PyCFunction)PySwigObject_next, METH_NOARGS, (char *)"returns the next 'this' object"},
+ {(char *)"__repr__",(PyCFunction)PySwigObject_repr, METH_NOARGS, (char *)"returns object representation"},
+ {0, 0, 0, 0}
+};
+#else
+static PyMethodDef
+swigobject_methods[] = {
+ {(char *)"disown", (PyCFunction)PySwigObject_disown, METH_VARARGS, (char *)"releases ownership of the pointer"},
+ {(char *)"acquire", (PyCFunction)PySwigObject_acquire, METH_VARARGS, (char *)"aquires ownership of the pointer"},
+ {(char *)"own", (PyCFunction)PySwigObject_own, METH_VARARGS, (char *)"returns/sets ownership of the pointer"},
+ {(char *)"append", (PyCFunction)PySwigObject_append, METH_VARARGS, (char *)"appends another 'this' object"},
+ {(char *)"next", (PyCFunction)PySwigObject_next, METH_VARARGS, (char *)"returns the next 'this' object"},
+ {(char *)"__repr__",(PyCFunction)PySwigObject_repr, METH_VARARGS, (char *)"returns object representation"},
+ {0, 0, 0, 0}
+};
+#endif
+
+#if PY_VERSION_HEX < 0x02020000
+SWIGINTERN PyObject *
+PySwigObject_getattr(PySwigObject *sobj,char *name)
+{
+ return Py_FindMethod(swigobject_methods, (PyObject *)sobj, name);
+}
+#endif
+
+SWIGRUNTIME PyTypeObject*
+_PySwigObject_type(void) {
+ static char swigobject_doc[] = "Swig object carries a C/C++ instance pointer";
+
+ static PyNumberMethods PySwigObject_as_number = {
+ (binaryfunc)0, /*nb_add*/
+ (binaryfunc)0, /*nb_subtract*/
+ (binaryfunc)0, /*nb_multiply*/
+ (binaryfunc)0, /*nb_divide*/
+ (binaryfunc)0, /*nb_remainder*/
+ (binaryfunc)0, /*nb_divmod*/
+ (ternaryfunc)0,/*nb_power*/
+ (unaryfunc)0, /*nb_negative*/
+ (unaryfunc)0, /*nb_positive*/
+ (unaryfunc)0, /*nb_absolute*/
+ (inquiry)0, /*nb_nonzero*/
+ 0, /*nb_invert*/
+ 0, /*nb_lshift*/
+ 0, /*nb_rshift*/
+ 0, /*nb_and*/
+ 0, /*nb_xor*/
+ 0, /*nb_or*/
+ (coercion)0, /*nb_coerce*/
+ (unaryfunc)PySwigObject_long, /*nb_int*/
+ (unaryfunc)PySwigObject_long, /*nb_long*/
+ (unaryfunc)0, /*nb_float*/
+ (unaryfunc)PySwigObject_oct, /*nb_oct*/
+ (unaryfunc)PySwigObject_hex, /*nb_hex*/
+#if PY_VERSION_HEX >= 0x02050000 /* 2.5.0 */
+ 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 /* nb_inplace_add -> nb_index */
+#elif PY_VERSION_HEX >= 0x02020000 /* 2.2.0 */
+ 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 /* nb_inplace_add -> nb_inplace_true_divide */
+#elif PY_VERSION_HEX >= 0x02000000 /* 2.0.0 */
+ 0,0,0,0,0,0,0,0,0,0,0 /* nb_inplace_add -> nb_inplace_or */
+#endif
+ };
+
+ static PyTypeObject pyswigobject_type;
+ static int type_init = 0;
+ if (!type_init) {
+ const PyTypeObject tmp
+ = {
+ PyObject_HEAD_INIT(NULL)
+ 0, /* ob_size */
+ (char *)"PySwigObject", /* tp_name */
+ sizeof(PySwigObject), /* tp_basicsize */
+ 0, /* tp_itemsize */
+ (destructor)PySwigObject_dealloc, /* tp_dealloc */
+ (printfunc)PySwigObject_print, /* tp_print */
+#if PY_VERSION_HEX < 0x02020000
+ (getattrfunc)PySwigObject_getattr, /* tp_getattr */
+#else
+ (getattrfunc)0, /* tp_getattr */
+#endif
+ (setattrfunc)0, /* tp_setattr */
+ (cmpfunc)PySwigObject_compare, /* tp_compare */
+ (reprfunc)PySwigObject_repr, /* tp_repr */
+ &PySwigObject_as_number, /* tp_as_number */
+ 0, /* tp_as_sequence */
+ 0, /* tp_as_mapping */
+ (hashfunc)0, /* tp_hash */
+ (ternaryfunc)0, /* tp_call */
+ (reprfunc)PySwigObject_str, /* tp_str */
+ PyObject_GenericGetAttr, /* tp_getattro */
+ 0, /* tp_setattro */
+ 0, /* tp_as_buffer */
+ Py_TPFLAGS_DEFAULT, /* tp_flags */
+ swigobject_doc, /* tp_doc */
+ 0, /* tp_traverse */
+ 0, /* tp_clear */
+ 0, /* tp_richcompare */
+ 0, /* tp_weaklistoffset */
+#if PY_VERSION_HEX >= 0x02020000
+ 0, /* tp_iter */
+ 0, /* tp_iternext */
+ swigobject_methods, /* tp_methods */
+ 0, /* tp_members */
+ 0, /* tp_getset */
+ 0, /* tp_base */
+ 0, /* tp_dict */
+ 0, /* tp_descr_get */
+ 0, /* tp_descr_set */
+ 0, /* tp_dictoffset */
+ 0, /* tp_init */
+ 0, /* tp_alloc */
+ 0, /* tp_new */
+ 0, /* tp_free */
+ 0, /* tp_is_gc */
+ 0, /* tp_bases */
+ 0, /* tp_mro */
+ 0, /* tp_cache */
+ 0, /* tp_subclasses */
+ 0, /* tp_weaklist */
+#endif
+#if PY_VERSION_HEX >= 0x02030000
+ 0, /* tp_del */
+#endif
+#ifdef COUNT_ALLOCS
+ 0,0,0,0 /* tp_alloc -> tp_next */
+#endif
+ };
+ pyswigobject_type = tmp;
+ pyswigobject_type.ob_type = &PyType_Type;
+ type_init = 1;
+ }
+ return &pyswigobject_type;
+}
+
+SWIGRUNTIME PyObject *
+PySwigObject_New(void *ptr, swig_type_info *ty, int own)
+{
+ PySwigObject *sobj = PyObject_NEW(PySwigObject, PySwigObject_type());
+ if (sobj) {
+ sobj->ptr = ptr;
+ sobj->ty = ty;
+ sobj->own = own;
+ sobj->next = 0;
+ }
+ return (PyObject *)sobj;
+}
+
+/* -----------------------------------------------------------------------------
+ * Implements a simple Swig Packed type, and use it instead of string
+ * ----------------------------------------------------------------------------- */
+
+typedef struct {
+ PyObject_HEAD
+ void *pack;
+ swig_type_info *ty;
+ size_t size;
+} PySwigPacked;
+
+SWIGRUNTIME int
+PySwigPacked_print(PySwigPacked *v, FILE *fp, int SWIGUNUSEDPARM(flags))
+{
+ char result[SWIG_BUFFER_SIZE];
+ fputs("<Swig Packed ", fp);
+ if (SWIG_PackDataName(result, v->pack, v->size, 0, sizeof(result))) {
+ fputs("at ", fp);
+ fputs(result, fp);
+ }
+ fputs(v->ty->name,fp);
+ fputs(">", fp);
+ return 0;
+}
+
+SWIGRUNTIME PyObject *
+PySwigPacked_repr(PySwigPacked *v)
+{
+ char result[SWIG_BUFFER_SIZE];
+ if (SWIG_PackDataName(result, v->pack, v->size, 0, sizeof(result))) {
+ return PyString_FromFormat("<Swig Packed at %s%s>", result, v->ty->name);
+ } else {
+ return PyString_FromFormat("<Swig Packed %s>", v->ty->name);
+ }
+}
+
+SWIGRUNTIME PyObject *
+PySwigPacked_str(PySwigPacked *v)
+{
+ char result[SWIG_BUFFER_SIZE];
+ if (SWIG_PackDataName(result, v->pack, v->size, 0, sizeof(result))){
+ return PyString_FromFormat("%s%s", result, v->ty->name);
+ } else {
+ return PyString_FromString(v->ty->name);
+ }
+}
+
+SWIGRUNTIME int
+PySwigPacked_compare(PySwigPacked *v, PySwigPacked *w)
+{
+ size_t i = v->size;
+ size_t j = w->size;
+ int s = (i < j) ? -1 : ((i > j) ? 1 : 0);
+ return s ? s : strncmp((char *)v->pack, (char *)w->pack, 2*v->size);
+}
+
+SWIGRUNTIME PyTypeObject* _PySwigPacked_type(void);
+
+SWIGRUNTIME PyTypeObject*
+PySwigPacked_type(void) {
+ static PyTypeObject *SWIG_STATIC_POINTER(type) = _PySwigPacked_type();
+ return type;
+}
+
+SWIGRUNTIMEINLINE int
+PySwigPacked_Check(PyObject *op) {
+ return ((op)->ob_type == _PySwigPacked_type())
+ || (strcmp((op)->ob_type->tp_name,"PySwigPacked") == 0);
+}
+
+SWIGRUNTIME void
+PySwigPacked_dealloc(PyObject *v)
+{
+ if (PySwigPacked_Check(v)) {
+ PySwigPacked *sobj = (PySwigPacked *) v;
+ free(sobj->pack);
+ }
+ PyObject_DEL(v);
+}
+
+SWIGRUNTIME PyTypeObject*
+_PySwigPacked_type(void) {
+ static char swigpacked_doc[] = "Swig object carries a C/C++ instance pointer";
+ static PyTypeObject pyswigpacked_type;
+ static int type_init = 0;
+ if (!type_init) {
+ const PyTypeObject tmp
+ = {
+ PyObject_HEAD_INIT(NULL)
+ 0, /* ob_size */
+ (char *)"PySwigPacked", /* tp_name */
+ sizeof(PySwigPacked), /* tp_basicsize */
+ 0, /* tp_itemsize */
+ (destructor)PySwigPacked_dealloc, /* tp_dealloc */
+ (printfunc)PySwigPacked_print, /* tp_print */
+ (getattrfunc)0, /* tp_getattr */
+ (setattrfunc)0, /* tp_setattr */
+ (cmpfunc)PySwigPacked_compare, /* tp_compare */
+ (reprfunc)PySwigPacked_repr, /* tp_repr */
+ 0, /* tp_as_number */
+ 0, /* tp_as_sequence */
+ 0, /* tp_as_mapping */
+ (hashfunc)0, /* tp_hash */
+ (ternaryfunc)0, /* tp_call */
+ (reprfunc)PySwigPacked_str, /* tp_str */
+ PyObject_GenericGetAttr, /* tp_getattro */
+ 0, /* tp_setattro */
+ 0, /* tp_as_buffer */
+ Py_TPFLAGS_DEFAULT, /* tp_flags */
+ swigpacked_doc, /* tp_doc */
+ 0, /* tp_traverse */
+ 0, /* tp_clear */
+ 0, /* tp_richcompare */
+ 0, /* tp_weaklistoffset */
+#if PY_VERSION_HEX >= 0x02020000
+ 0, /* tp_iter */
+ 0, /* tp_iternext */
+ 0, /* tp_methods */
+ 0, /* tp_members */
+ 0, /* tp_getset */
+ 0, /* tp_base */
+ 0, /* tp_dict */
+ 0, /* tp_descr_get */
+ 0, /* tp_descr_set */
+ 0, /* tp_dictoffset */
+ 0, /* tp_init */
+ 0, /* tp_alloc */
+ 0, /* tp_new */
+ 0, /* tp_free */
+ 0, /* tp_is_gc */
+ 0, /* tp_bases */
+ 0, /* tp_mro */
+ 0, /* tp_cache */
+ 0, /* tp_subclasses */
+ 0, /* tp_weaklist */
+#endif
+#if PY_VERSION_HEX >= 0x02030000
+ 0, /* tp_del */
+#endif
+#ifdef COUNT_ALLOCS
+ 0,0,0,0 /* tp_alloc -> tp_next */
+#endif
+ };
+ pyswigpacked_type = tmp;
+ pyswigpacked_type.ob_type = &PyType_Type;
+ type_init = 1;
+ }
+ return &pyswigpacked_type;
+}
+
+SWIGRUNTIME PyObject *
+PySwigPacked_New(void *ptr, size_t size, swig_type_info *ty)
+{
+ PySwigPacked *sobj = PyObject_NEW(PySwigPacked, PySwigPacked_type());
+ if (sobj) {
+ void *pack = malloc(size);
+ if (pack) {
+ memcpy(pack, ptr, size);
+ sobj->pack = pack;
+ sobj->ty = ty;
+ sobj->size = size;
+ } else {
+ PyObject_DEL((PyObject *) sobj);
+ sobj = 0;
+ }
+ }
+ return (PyObject *) sobj;
+}
+
+SWIGRUNTIME swig_type_info *
+PySwigPacked_UnpackData(PyObject *obj, void *ptr, size_t size)
+{
+ if (PySwigPacked_Check(obj)) {
+ PySwigPacked *sobj = (PySwigPacked *)obj;
+ if (sobj->size != size) return 0;
+ memcpy(ptr, sobj->pack, size);
+ return sobj->ty;
+ } else {
+ return 0;
+ }
+}
+
+/* -----------------------------------------------------------------------------
+ * pointers/data manipulation
+ * ----------------------------------------------------------------------------- */
+
+SWIGRUNTIMEINLINE PyObject *
+_SWIG_This(void)
+{
+ return PyString_FromString("this");
+}
+
+SWIGRUNTIME PyObject *
+SWIG_This(void)
+{
+ static PyObject *SWIG_STATIC_POINTER(swig_this) = _SWIG_This();
+ return swig_this;
+}
+
+/* #define SWIG_PYTHON_SLOW_GETSET_THIS */
+
+SWIGRUNTIME PySwigObject *
+SWIG_Python_GetSwigThis(PyObject *pyobj)
+{
+ if (PySwigObject_Check(pyobj)) {
+ return (PySwigObject *) pyobj;
+ } else {
+ PyObject *obj = 0;
+#if (!defined(SWIG_PYTHON_SLOW_GETSET_THIS) && (PY_VERSION_HEX >= 0x02030000))
+ if (PyInstance_Check(pyobj)) {
+ obj = _PyInstance_Lookup(pyobj, SWIG_This());
+ } else {
+ PyObject **dictptr = _PyObject_GetDictPtr(pyobj);
+ if (dictptr != NULL) {
+ PyObject *dict = *dictptr;
+ obj = dict ? PyDict_GetItem(dict, SWIG_This()) : 0;
+ } else {
+#ifdef PyWeakref_CheckProxy
+ if (PyWeakref_CheckProxy(pyobj)) {
+ PyObject *wobj = PyWeakref_GET_OBJECT(pyobj);
+ return wobj ? SWIG_Python_GetSwigThis(wobj) : 0;
+ }
+#endif
+ obj = PyObject_GetAttr(pyobj,SWIG_This());
+ if (obj) {
+ Py_DECREF(obj);
+ } else {
+ if (PyErr_Occurred()) PyErr_Clear();
+ return 0;
+ }
+ }
+ }
+#else
+ obj = PyObject_GetAttr(pyobj,SWIG_This());
+ if (obj) {
+ Py_DECREF(obj);
+ } else {
+ if (PyErr_Occurred()) PyErr_Clear();
+ return 0;
+ }
+#endif
+ if (obj && !PySwigObject_Check(obj)) {
+ /* a PyObject is called 'this', try to get the 'real this'
+ PySwigObject from it */
+ return SWIG_Python_GetSwigThis(obj);
+ }
+ return (PySwigObject *)obj;
+ }
+}
+
+/* Acquire a pointer value */
+
+SWIGRUNTIME int
+SWIG_Python_AcquirePtr(PyObject *obj, int own) {
+ if (own) {
+ PySwigObject *sobj = SWIG_Python_GetSwigThis(obj);
+ if (sobj) {
+ int oldown = sobj->own;
+ sobj->own = own;
+ return oldown;
+ }
+ }
+ return 0;
+}
+
+/* Convert a pointer value */
+
+SWIGRUNTIME int
+SWIG_Python_ConvertPtrAndOwn(PyObject *obj, void **ptr, swig_type_info *ty, int flags, int *own) {
+ if (!obj) return SWIG_ERROR;
+ if (obj == Py_None) {
+ if (ptr) *ptr = 0;
+ return SWIG_OK;
+ } else {
+ PySwigObject *sobj = SWIG_Python_GetSwigThis(obj);
+ while (sobj) {
+ void *vptr = sobj->ptr;
+ if (ty) {
+ swig_type_info *to = sobj->ty;
+ if (to == ty) {
+ /* no type cast needed */
+ if (ptr) *ptr = vptr;
+ break;
+ } else {
+ swig_cast_info *tc = SWIG_TypeCheck(to->name,ty);
+ if (!tc) {
+ sobj = (PySwigObject *)sobj->next;
+ } else {
+ if (ptr) *ptr = SWIG_TypeCast(tc,vptr);
+ break;
+ }
+ }
+ } else {
+ if (ptr) *ptr = vptr;
+ break;
+ }
+ }
+ if (sobj) {
+ if (own) *own = sobj->own;
+ if (flags & SWIG_POINTER_DISOWN) {
+ sobj->own = 0;
+ }
+ return SWIG_OK;
+ } else {
+ int res = SWIG_ERROR;
+ if (flags & SWIG_POINTER_IMPLICIT_CONV) {
+ PySwigClientData *data = ty ? (PySwigClientData *) ty->clientdata : 0;
+ if (data && !data->implicitconv) {
+ PyObject *klass = data->klass;
+ if (klass) {
+ PyObject *impconv;
+ data->implicitconv = 1; /* avoid recursion and call 'explicit' constructors*/
+ impconv = SWIG_Python_CallFunctor(klass, obj);
+ data->implicitconv = 0;
+ if (PyErr_Occurred()) {
+ PyErr_Clear();
+ impconv = 0;
+ }
+ if (impconv) {
+ PySwigObject *iobj = SWIG_Python_GetSwigThis(impconv);
+ if (iobj) {
+ void *vptr;
+ res = SWIG_Python_ConvertPtrAndOwn((PyObject*)iobj, &vptr, ty, 0, 0);
+ if (SWIG_IsOK(res)) {
+ if (ptr) {
+ *ptr = vptr;
+ /* transfer the ownership to 'ptr' */
+ iobj->own = 0;
+ res = SWIG_AddCast(res);
+ res = SWIG_AddNewMask(res);
+ } else {
+ res = SWIG_AddCast(res);
+ }
+ }
+ }
+ Py_DECREF(impconv);
+ }
+ }
+ }
+ }
+ return res;
+ }
+ }
+}
+
+/* Convert a function ptr value */
+
+SWIGRUNTIME int
+SWIG_Python_ConvertFunctionPtr(PyObject *obj, void **ptr, swig_type_info *ty) {
+ if (!PyCFunction_Check(obj)) {
+ return SWIG_ConvertPtr(obj, ptr, ty, 0);
+ } else {
+ void *vptr = 0;
+
+ /* here we get the method pointer for callbacks */
+ const char *doc = (((PyCFunctionObject *)obj) -> m_ml -> ml_doc);
+ const char *desc = doc ? strstr(doc, "swig_ptr: ") : 0;
+ if (desc) {
+ desc = ty ? SWIG_UnpackVoidPtr(desc + 10, &vptr, ty->name) : 0;
+ if (!desc) return SWIG_ERROR;
+ }
+ if (ty) {
+ swig_cast_info *tc = SWIG_TypeCheck(desc,ty);
+ if (!tc) return SWIG_ERROR;
+ *ptr = SWIG_TypeCast(tc,vptr);
+ } else {
+ *ptr = vptr;
+ }
+ return SWIG_OK;
+ }
+}
+
+/* Convert a packed value value */
+
+SWIGRUNTIME int
+SWIG_Python_ConvertPacked(PyObject *obj, void *ptr, size_t sz, swig_type_info *ty) {
+ swig_type_info *to = PySwigPacked_UnpackData(obj, ptr, sz);
+ if (!to) return SWIG_ERROR;
+ if (ty) {
+ if (to != ty) {
+ /* check type cast? */
+ swig_cast_info *tc = SWIG_TypeCheck(to->name,ty);
+ if (!tc) return SWIG_ERROR;
+ }
+ }
+ return SWIG_OK;
+}
+
+/* -----------------------------------------------------------------------------
+ * Create a new pointer object
+ * ----------------------------------------------------------------------------- */
+
+/*
+ Create a new instance object, whitout calling __init__, and set the
+ 'this' attribute.
+*/
+
+SWIGRUNTIME PyObject*
+SWIG_Python_NewShadowInstance(PySwigClientData *data, PyObject *swig_this)
+{
+#if (PY_VERSION_HEX >= 0x02020000)
+ PyObject *inst = 0;
+ PyObject *newraw = data->newraw;
+ if (newraw) {
+ inst = PyObject_Call(newraw, data->newargs, NULL);
+ if (inst) {
+#if !defined(SWIG_PYTHON_SLOW_GETSET_THIS)
+ PyObject **dictptr = _PyObject_GetDictPtr(inst);
+ if (dictptr != NULL) {
+ PyObject *dict = *dictptr;
+ if (dict == NULL) {
+ dict = PyDict_New();
+ *dictptr = dict;
+ PyDict_SetItem(dict, SWIG_This(), swig_this);
+ }
+ }
+#else
+ PyObject *key = SWIG_This();
+ PyObject_SetAttr(inst, key, swig_this);
+#endif
+ }
+ } else {
+ PyObject *dict = PyDict_New();
+ PyDict_SetItem(dict, SWIG_This(), swig_this);
+ inst = PyInstance_NewRaw(data->newargs, dict);
+ Py_DECREF(dict);
+ }
+ return inst;
+#else
+#if (PY_VERSION_HEX >= 0x02010000)
+ PyObject *inst;
+ PyObject *dict = PyDict_New();
+ PyDict_SetItem(dict, SWIG_This(), swig_this);
+ inst = PyInstance_NewRaw(data->newargs, dict);
+ Py_DECREF(dict);
+ return (PyObject *) inst;
+#else
+ PyInstanceObject *inst = PyObject_NEW(PyInstanceObject, &PyInstance_Type);
+ if (inst == NULL) {
+ return NULL;
+ }
+ inst->in_class = (PyClassObject *)data->newargs;
+ Py_INCREF(inst->in_class);
+ inst->in_dict = PyDict_New();
+ if (inst->in_dict == NULL) {
+ Py_DECREF(inst);
+ return NULL;
+ }
+#ifdef Py_TPFLAGS_HAVE_WEAKREFS
+ inst->in_weakreflist = NULL;
+#endif
+#ifdef Py_TPFLAGS_GC
+ PyObject_GC_Init(inst);
+#endif
+ PyDict_SetItem(inst->in_dict, SWIG_This(), swig_this);
+ return (PyObject *) inst;
+#endif
+#endif
+}
+
+SWIGRUNTIME void
+SWIG_Python_SetSwigThis(PyObject *inst, PyObject *swig_this)
+{
+ PyObject *dict;
+#if (PY_VERSION_HEX >= 0x02020000) && !defined(SWIG_PYTHON_SLOW_GETSET_THIS)
+ PyObject **dictptr = _PyObject_GetDictPtr(inst);
+ if (dictptr != NULL) {
+ dict = *dictptr;
+ if (dict == NULL) {
+ dict = PyDict_New();
+ *dictptr = dict;
+ }
+ PyDict_SetItem(dict, SWIG_This(), swig_this);
+ return;
+ }
+#endif
+ dict = PyObject_GetAttrString(inst, (char*)"__dict__");
+ PyDict_SetItem(dict, SWIG_This(), swig_this);
+ Py_DECREF(dict);
+}
+
+
+SWIGINTERN PyObject *
+SWIG_Python_InitShadowInstance(PyObject *args) {
+ PyObject *obj[2];
+ if (!SWIG_Python_UnpackTuple(args,(char*)"swiginit", 2, 2, obj)) {
+ return NULL;
+ } else {
+ PySwigObject *sthis = SWIG_Python_GetSwigThis(obj[0]);
+ if (sthis) {
+ PySwigObject_append((PyObject*) sthis, obj[1]);
+ } else {
+ SWIG_Python_SetSwigThis(obj[0], obj[1]);
+ }
+ return SWIG_Py_Void();
+ }
+}
+
+/* Create a new pointer object */
+
+SWIGRUNTIME PyObject *
+SWIG_Python_NewPointerObj(void *ptr, swig_type_info *type, int flags) {
+ if (!ptr) {
+ return SWIG_Py_Void();
+ } else {
+ int own = (flags & SWIG_POINTER_OWN) ? SWIG_POINTER_OWN : 0;
+ PyObject *robj = PySwigObject_New(ptr, type, own);
+ PySwigClientData *clientdata = type ? (PySwigClientData *)(type->clientdata) : 0;
+ if (clientdata && !(flags & SWIG_POINTER_NOSHADOW)) {
+ PyObject *inst = SWIG_Python_NewShadowInstance(clientdata, robj);
+ if (inst) {
+ Py_DECREF(robj);
+ robj = inst;
+ }
+ }
+ return robj;
+ }
+}
+
+/* Create a new packed object */
+
+SWIGRUNTIMEINLINE PyObject *
+SWIG_Python_NewPackedObj(void *ptr, size_t sz, swig_type_info *type) {
+ return ptr ? PySwigPacked_New((void *) ptr, sz, type) : SWIG_Py_Void();
+}
+
+/* -----------------------------------------------------------------------------*
+ * Get type list
+ * -----------------------------------------------------------------------------*/
+
+#ifdef SWIG_LINK_RUNTIME
+void *SWIG_ReturnGlobalTypeList(void *);
+#endif
+
+SWIGRUNTIME swig_module_info *
+SWIG_Python_GetModule(void) {
+ static void *type_pointer = (void *)0;
+ /* first check if module already created */
+ if (!type_pointer) {
+#ifdef SWIG_LINK_RUNTIME
+ type_pointer = SWIG_ReturnGlobalTypeList((void *)0);
+#else
+ type_pointer = PyCObject_Import((char*)"swig_runtime_data" SWIG_RUNTIME_VERSION,
+ (char*)"type_pointer" SWIG_TYPE_TABLE_NAME);
+ if (PyErr_Occurred()) {
+ PyErr_Clear();
+ type_pointer = (void *)0;
+ }
+#endif
+ }
+ return (swig_module_info *) type_pointer;
+}
+
+#if PY_MAJOR_VERSION < 2
+/* PyModule_AddObject function was introduced in Python 2.0. The following function
+ is copied out of Python/modsupport.c in python version 2.3.4 */
+SWIGINTERN int
+PyModule_AddObject(PyObject *m, char *name, PyObject *o)
+{
+ PyObject *dict;
+ if (!PyModule_Check(m)) {
+ PyErr_SetString(PyExc_TypeError,
+ "PyModule_AddObject() needs module as first arg");
+ return SWIG_ERROR;
+ }
+ if (!o) {
+ PyErr_SetString(PyExc_TypeError,
+ "PyModule_AddObject() needs non-NULL value");
+ return SWIG_ERROR;
+ }
+
+ dict = PyModule_GetDict(m);
+ if (dict == NULL) {
+ /* Internal error -- modules must have a dict! */
+ PyErr_Format(PyExc_SystemError, "module '%s' has no __dict__",
+ PyModule_GetName(m));
+ return SWIG_ERROR;
+ }
+ if (PyDict_SetItemString(dict, name, o))
+ return SWIG_ERROR;
+ Py_DECREF(o);
+ return SWIG_OK;
+}
+#endif
+
+SWIGRUNTIME void
+SWIG_Python_DestroyModule(void *vptr)
+{
+ swig_module_info *swig_module = (swig_module_info *) vptr;
+ swig_type_info **types = swig_module->types;
+ size_t i;
+ for (i =0; i < swig_module->size; ++i) {
+ swig_type_info *ty = types[i];
+ if (ty->owndata) {
+ PySwigClientData *data = (PySwigClientData *) ty->clientdata;
+ if (data) PySwigClientData_Del(data);
+ }
+ }
+ Py_DECREF(SWIG_This());
+}
+
+SWIGRUNTIME void
+SWIG_Python_SetModule(swig_module_info *swig_module) {
+ static PyMethodDef swig_empty_runtime_method_table[] = { {NULL, NULL, 0, NULL} };/* Sentinel */
+
+ PyObject *module = Py_InitModule((char*)"swig_runtime_data" SWIG_RUNTIME_VERSION,
+ swig_empty_runtime_method_table);
+ PyObject *pointer = PyCObject_FromVoidPtr((void *) swig_module, SWIG_Python_DestroyModule);
+ if (pointer && module) {
+ PyModule_AddObject(module, (char*)"type_pointer" SWIG_TYPE_TABLE_NAME, pointer);
+ } else {
+ Py_XDECREF(pointer);
+ }
+}
+
+/* The python cached type query */
+SWIGRUNTIME PyObject *
+SWIG_Python_TypeCache(void) {
+ static PyObject *SWIG_STATIC_POINTER(cache) = PyDict_New();
+ return cache;
+}
+
+SWIGRUNTIME swig_type_info *
+SWIG_Python_TypeQuery(const char *type)
+{
+ PyObject *cache = SWIG_Python_TypeCache();
+ PyObject *key = PyString_FromString(type);
+ PyObject *obj = PyDict_GetItem(cache, key);
+ swig_type_info *descriptor;
+ if (obj) {
+ descriptor = (swig_type_info *) PyCObject_AsVoidPtr(obj);
+ } else {
+ swig_module_info *swig_module = SWIG_Python_GetModule();
+ descriptor = SWIG_TypeQueryModule(swig_module, swig_module, type);
+ if (descriptor) {
+ obj = PyCObject_FromVoidPtr(descriptor, NULL);
+ PyDict_SetItem(cache, key, obj);
+ Py_DECREF(obj);
+ }
+ }
+ Py_DECREF(key);
+ return descriptor;
+}
+
+/*
+ For backward compatibility only
+*/
+#define SWIG_POINTER_EXCEPTION 0
+#define SWIG_arg_fail(arg) SWIG_Python_ArgFail(arg)
+#define SWIG_MustGetPtr(p, type, argnum, flags) SWIG_Python_MustGetPtr(p, type, argnum, flags)
+
+SWIGRUNTIME int
+SWIG_Python_AddErrMesg(const char* mesg, int infront)
+{
+ if (PyErr_Occurred()) {
+ PyObject *type = 0;
+ PyObject *value = 0;
+ PyObject *traceback = 0;
+ PyErr_Fetch(&type, &value, &traceback);
+ if (value) {
+ PyObject *old_str = PyObject_Str(value);
+ Py_XINCREF(type);
+ PyErr_Clear();
+ if (infront) {
+ PyErr_Format(type, "%s %s", mesg, PyString_AsString(old_str));
+ } else {
+ PyErr_Format(type, "%s %s", PyString_AsString(old_str), mesg);
+ }
+ Py_DECREF(old_str);
+ }
+ return 1;
+ } else {
+ return 0;
+ }
+}
+
+SWIGRUNTIME int
+SWIG_Python_ArgFail(int argnum)
+{
+ if (PyErr_Occurred()) {
+ /* add information about failing argument */
+ char mesg[256];
+ PyOS_snprintf(mesg, sizeof(mesg), "argument number %d:", argnum);
+ return SWIG_Python_AddErrMesg(mesg, 1);
+ } else {
+ return 0;
+ }
+}
+
+SWIGRUNTIMEINLINE const char *
+PySwigObject_GetDesc(PyObject *self)
+{
+ PySwigObject *v = (PySwigObject *)self;
+ swig_type_info *ty = v ? v->ty : 0;
+ return ty ? ty->str : (char*)"";
+}
+
+SWIGRUNTIME void
+SWIG_Python_TypeError(const char *type, PyObject *obj)
+{
+ if (type) {
+#if defined(SWIG_COBJECT_TYPES)
+ if (obj && PySwigObject_Check(obj)) {
+ const char *otype = (const char *) PySwigObject_GetDesc(obj);
+ if (otype) {
+ PyErr_Format(PyExc_TypeError, "a '%s' is expected, 'PySwigObject(%s)' is received",
+ type, otype);
+ return;
+ }
+ } else
+#endif
+ {
+ const char *otype = (obj ? obj->ob_type->tp_name : 0);
+ if (otype) {
+ PyObject *str = PyObject_Str(obj);
+ const char *cstr = str ? PyString_AsString(str) : 0;
+ if (cstr) {
+ PyErr_Format(PyExc_TypeError, "a '%s' is expected, '%s(%s)' is received",
+ type, otype, cstr);
+ } else {
+ PyErr_Format(PyExc_TypeError, "a '%s' is expected, '%s' is received",
+ type, otype);
+ }
+ Py_XDECREF(str);
+ return;
+ }
+ }
+ PyErr_Format(PyExc_TypeError, "a '%s' is expected", type);
+ } else {
+ PyErr_Format(PyExc_TypeError, "unexpected type is received");
+ }
+}
+
+
+/* Convert a pointer value, signal an exception on a type mismatch */
+SWIGRUNTIME void *
+SWIG_Python_MustGetPtr(PyObject *obj, swig_type_info *ty, int argnum, int flags) {
+ void *result;
+ if (SWIG_Python_ConvertPtr(obj, &result, ty, flags) == -1) {
+ PyErr_Clear();
+ if (flags & SWIG_POINTER_EXCEPTION) {
+ SWIG_Python_TypeError(SWIG_TypePrettyName(ty), obj);
+ SWIG_Python_ArgFail(argnum);
+ }
+ }
+ return result;
+}
+
+
+#ifdef __cplusplus
+#if 0
+{ /* cc-mode */
+#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_char swig_types[0]
+#define SWIGTYPE_p_std__vectorTdouble_t swig_types[1]
+#define SWIGTYPE_p_std__vectorTfloat_t swig_types[2]
+#define SWIGTYPE_p_std__vectorTint_t swig_types[3]
+static swig_type_info *swig_types[5];
+static swig_module_info swig_module = {swig_types, 4, 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) -------- */
+
+#if (PY_VERSION_HEX <= 0x02000000)
+# if !defined(SWIG_PYTHON_CLASSIC)
+# error "This python version requires swig to be run with the '-classic' option"
+# endif
+#endif
+
+/*-----------------------------------------------
+ @(target):= _multigridtools.so
+ ------------------------------------------------*/
+#define SWIG_init init_multigridtools
+
+#define SWIG_name "_multigridtools"
+
+#define SWIGVERSION 0x010332
+#define SWIG_VERSION SWIGVERSION
+
+
+#define SWIG_as_voidptr(a) const_cast< void * >(static_cast< const void * >(a))
+#define SWIG_as_voidptrptr(a) ((void)SWIG_as_voidptr(*a),reinterpret_cast< void** >(a))
+
+
+#include <stdexcept>
+
+
+namespace swig {
+ class PyObject_ptr {
+ protected:
+ PyObject *_obj;
+
+ public:
+ PyObject_ptr() :_obj(0)
+ {
+ }
+
+ PyObject_ptr(const PyObject_ptr& item) : _obj(item._obj)
+ {
+ Py_XINCREF(_obj);
+ }
+
+ PyObject_ptr(PyObject *obj, bool initial_ref = true) :_obj(obj)
+ {
+ if (initial_ref) Py_XINCREF(_obj);
+ }
+
+ PyObject_ptr & operator=(const PyObject_ptr& item)
+ {
+ Py_XINCREF(item._obj);
+ Py_XDECREF(_obj);
+ _obj = item._obj;
+ return *this;
+ }
+
+ ~PyObject_ptr()
+ {
+ Py_XDECREF(_obj);
+ }
+
+ operator PyObject *() const
+ {
+ return _obj;
+ }
+
+ PyObject *operator->() const
+ {
+ return _obj;
+ }
+ };
+}
+
+
+namespace swig {
+ struct PyObject_var : PyObject_ptr {
+ PyObject_var(PyObject* obj = 0) : PyObject_ptr(obj, false) { }
+
+ PyObject_var & operator = (PyObject* obj)
+ {
+ Py_XDECREF(_obj);
+ _obj = obj;
+ return *this;
+ }
+ };
+}
+
+
+#define SWIG_FILE_WITH_INIT
+#include "numpy/arrayobject.h"
+
+#include "ruge_stuben.h"
+#include "smoothed_aggregation.h"
+#include "relaxation.h"
+
+
+
+#ifndef SWIG_FILE_WITH_INIT
+# define NO_IMPORT_ARRAY
+#endif
+#include "stdio.h"
+#include <numpy/arrayobject.h>
+
+/* The following code originally appeared in enthought/kiva/agg/src/numeric.i,
+ * author unknown. It was translated from C++ to C by John Hunter. Bill
+ * Spotz has modified it slightly to fix some minor bugs, add some comments
+ * and some functionality.
+ */
+
+/* Macros to extract array attributes.
+ */
+#define is_array(a) ((a) && PyArray_Check((PyArrayObject *)a))
+#define array_type(a) (int)(PyArray_TYPE(a))
+#define array_dimensions(a) (((PyArrayObject *)a)->nd)
+#define array_size(a,i) (((PyArrayObject *)a)->dimensions[i])
+#define array_is_contiguous(a) (PyArray_ISCONTIGUOUS(a))
+
+
+/* Given a PyObject, return a string describing its type.
+ */
+char* pytype_string(PyObject* py_obj) {
+ if (py_obj == NULL ) return "C NULL value";
+ if (PyCallable_Check(py_obj)) return "callable" ;
+ if (PyString_Check( py_obj)) return "string" ;
+ if (PyInt_Check( py_obj)) return "int" ;
+ if (PyFloat_Check( py_obj)) return "float" ;
+ if (PyDict_Check( py_obj)) return "dict" ;
+ if (PyList_Check( py_obj)) return "list" ;
+ if (PyTuple_Check( py_obj)) return "tuple" ;
+ if (PyFile_Check( py_obj)) return "file" ;
+ if (PyModule_Check( py_obj)) return "module" ;
+ if (PyInstance_Check(py_obj)) return "instance" ;
+
+ return "unkown type";
+}
+
+/* Given a Numeric typecode, return a string describing the type.
+ */
+char* type_names[20] = {"char","unsigned byte","byte","short",
+ "unsigned short","int","unsigned int","long",
+ "float","double","complex float","complex double",
+ "object","ntype","unkown"};
+ char* typecode_string(int typecode) {
+ if(typecode < 0 || typecode > 19)
+ typecode = 19;
+
+ return type_names[typecode];
+}
+
+/* Make sure input has correct numeric type. Allow character and byte
+ * to match. Also allow int and long to match.
+ */
+int type_match(int actual_type, int desired_type) {
+ return PyArray_EquivTypenums(actual_type, desired_type);
+}
+
+/* Given a PyObject pointer, cast it to a PyArrayObject pointer if
+ * legal. If not, set the python error string appropriately and
+ * return NULL./
+ */
+PyArrayObject* obj_to_array_no_conversion(PyObject* input, int typecode) {
+ PyArrayObject* ary = NULL;
+ if (is_array(input) && (typecode == PyArray_NOTYPE ||
+ PyArray_EquivTypenums(array_type(input),
+ typecode))) {
+ ary = (PyArrayObject*) input;
+ }
+ else if is_array(input) {
+ char* desired_type = typecode_string(typecode);
+ char* actual_type = typecode_string(array_type(input));
+ PyErr_Format(PyExc_TypeError,
+ "Array of type '%s' required. Array of type '%s' given",
+ desired_type, actual_type);
+ ary = NULL;
+ }
+ else {
+ char * desired_type = typecode_string(typecode);
+ char * actual_type = pytype_string(input);
+ PyErr_Format(PyExc_TypeError,
+ "Array of type '%s' required. A %s was given",
+ desired_type, actual_type);
+ ary = NULL;
+ }
+ return ary;
+}
+
+/* Convert the given PyObject to a Numeric array with the given
+ * typecode. On Success, return a valid PyArrayObject* with the
+ * correct type. On failure, the python error string will be set and
+ * the routine returns NULL.
+ */
+PyArrayObject* obj_to_array_allow_conversion(PyObject* input, int typecode,
+ int* is_new_object)
+{
+ PyArrayObject* ary = NULL;
+ PyObject* py_obj;
+ if (is_array(input) && (typecode == PyArray_NOTYPE || type_match(array_type(input),typecode))) {
+ ary = (PyArrayObject*) input;
+ *is_new_object = 0;
+ }
+ else {
+ py_obj = PyArray_FromObject(input, typecode, 0, 0);
+ /* If NULL, PyArray_FromObject will have set python error value.*/
+ ary = (PyArrayObject*) py_obj;
+ *is_new_object = 1;
+ }
+ return ary;
+}
+
+/* Given a PyArrayObject, check to see if it is contiguous. If so,
+ * return the input pointer and flag it as not a new object. If it is
+ * not contiguous, create a new PyArrayObject using the original data,
+ * flag it as a new object and return the pointer.
+ */
+PyArrayObject* make_contiguous(PyArrayObject* ary, int* is_new_object,
+ int min_dims, int max_dims)
+{
+ PyArrayObject* result;
+ if (array_is_contiguous(ary)) {
+ result = ary;
+ *is_new_object = 0;
+ }
+ else {
+ result = (PyArrayObject*) PyArray_ContiguousFromObject((PyObject*)ary,
+ array_type(ary),
+ min_dims,
+ max_dims);
+ *is_new_object = 1;
+ }
+ return result;
+}
+
+/* Convert a given PyObject to a contiguous PyArrayObject of the
+ * specified type. If the input object is not a contiguous
+ * PyArrayObject, a new one will be created and the new object flag
+ * will be set.
+ */
+PyArrayObject* obj_to_array_contiguous_allow_conversion(PyObject* input,
+ int typecode,
+ int* is_new_object) {
+ int is_new1 = 0;
+ int is_new2 = 0;
+ PyArrayObject* ary2;
+ PyArrayObject* ary1 = obj_to_array_allow_conversion(input, typecode,
+ &is_new1);
+ if (ary1) {
+ ary2 = make_contiguous(ary1, &is_new2, 0, 0);
+ if ( is_new1 && is_new2) {
+ Py_DECREF(ary1);
+ }
+ ary1 = ary2;
+ }
+ *is_new_object = is_new1 || is_new2;
+ return ary1;
+}
+
+/* Test whether a python object is contiguous. If array is
+ * contiguous, return 1. Otherwise, set the python error string and
+ * return 0.
+ */
+int require_contiguous(PyArrayObject* ary) {
+ int contiguous = 1;
+ if (!array_is_contiguous(ary)) {
+ PyErr_SetString(PyExc_TypeError, "Array must be contiguous. A discontiguous array was given");
+ contiguous = 0;
+ }
+ return contiguous;
+}
+
+/* Require the given PyArrayObject to have a specified number of
+ * dimensions. If the array has the specified number of dimensions,
+ * return 1. Otherwise, set the python error string and return 0.
+ */
+int require_dimensions(PyArrayObject* ary, int exact_dimensions) {
+ int success = 1;
+ if (array_dimensions(ary) != exact_dimensions) {
+ PyErr_Format(PyExc_TypeError,
+ "Array must be have %d dimensions. Given array has %d dimensions",
+ exact_dimensions, array_dimensions(ary));
+ success = 0;
+ }
+ return success;
+}
+
+/* Require the given PyArrayObject to have one of a list of specified
+ * number of dimensions. If the array has one of the specified number
+ * of dimensions, return 1. Otherwise, set the python error string
+ * and return 0.
+ */
+int require_dimensions_n(PyArrayObject* ary, int* exact_dimensions, int n) {
+ int success = 0;
+ int i;
+ char dims_str[255] = "";
+ char s[255];
+ for (i = 0; i < n && !success; i++) {
+ if (array_dimensions(ary) == exact_dimensions[i]) {
+ success = 1;
+ }
+ }
+ if (!success) {
+ for (i = 0; i < n-1; i++) {
+ sprintf(s, "%d, ", exact_dimensions[i]);
+ strcat(dims_str,s);
+ }
+ sprintf(s, " or %d", exact_dimensions[n-1]);
+ strcat(dims_str,s);
+ PyErr_Format(PyExc_TypeError,
+ "Array must be have %s dimensions. Given array has %d dimensions",
+ dims_str, array_dimensions(ary));
+ }
+ return success;
+}
+
+/* Require the given PyArrayObject to have a specified shape. If the
+ * array has the specified shape, return 1. Otherwise, set the python
+ * error string and return 0.
+ */
+int require_size(PyArrayObject* ary, npy_intp * size, int n) {
+ int i;
+ int success = 1;
+ int len;
+ char desired_dims[255] = "[";
+ char s[255];
+ char actual_dims[255] = "[";
+ for(i=0; i < n;i++) {
+ if (size[i] != -1 && size[i] != array_size(ary,i)) {
+ success = 0;
+ }
+ }
+ if (!success) {
+ for (i = 0; i < n; i++) {
+ if (size[i] == -1) {
+ sprintf(s, "*,");
+ }
+ else
+ {
+ sprintf(s,"%" NPY_INTP_FMT ",", size[i]);
+ }
+ strcat(desired_dims,s);
+ }
+ len = strlen(desired_dims);
+ desired_dims[len-1] = ']';
+ for (i = 0; i < n; i++) {
+ sprintf(s,"%" NPY_INTP_FMT ",", array_size(ary,i));
+ strcat(actual_dims,s);
+ }
+ len = strlen(actual_dims);
+ actual_dims[len-1] = ']';
+ PyErr_Format(PyExc_TypeError,
+ "Array must be have shape of %s. Given array has shape of %s",
+ desired_dims, actual_dims);
+ }
+ return success;
+}
+/* End John Hunter translation (with modifications by Bill Spotz) */
+
+
+
+
+
+/*!
+ Appends @a what to @a where. On input, @a where need not to be a tuple, but on
+ return it always is.
+
+ @par Revision history:
+ - 17.02.2005, c
+*/
+PyObject *helper_appendToTuple( PyObject *where, PyObject *what ) {
+ PyObject *o2, *o3;
+
+ if ((!where) || (where == Py_None)) {
+ where = what;
+ } else {
+ if (!PyTuple_Check( where )) {
+ o2 = where;
+ where = PyTuple_New( 1 );
+ PyTuple_SetItem( where, 0, o2 );
+ }
+ o3 = PyTuple_New( 1 );
+ PyTuple_SetItem( o3, 0, what );
+ o2 = where;
+ where = PySequence_Concat( o2, o3 );
+ Py_DECREF( o2 );
+ Py_DECREF( o3 );
+ }
+ return where;
+}
+
+
+
+
+
+
+ #define SWIG_From_long PyInt_FromLong
+
+
+SWIGINTERNINLINE PyObject *
+SWIG_From_int (int value)
+{
+ return SWIG_From_long (value);
+}
+
+
+#include <limits.h>
+#ifndef LLONG_MIN
+# define LLONG_MIN LONG_LONG_MIN
+#endif
+#ifndef LLONG_MAX
+# define LLONG_MAX LONG_LONG_MAX
+#endif
+#ifndef ULLONG_MAX
+# define ULLONG_MAX ULONG_LONG_MAX
+#endif
+
+
+SWIGINTERN int
+SWIG_AsVal_double (PyObject *obj, double *val)
+{
+ int res = SWIG_TypeError;
+ if (PyFloat_Check(obj)) {
+ if (val) *val = PyFloat_AsDouble(obj);
+ return SWIG_OK;
+ } else if (PyInt_Check(obj)) {
+ if (val) *val = PyInt_AsLong(obj);
+ return SWIG_OK;
+ } else if (PyLong_Check(obj)) {
+ double v = PyLong_AsDouble(obj);
+ if (!PyErr_Occurred()) {
+ if (val) *val = v;
+ return SWIG_OK;
+ } else {
+ PyErr_Clear();
+ }
+ }
+#ifdef SWIG_PYTHON_CAST_MODE
+ {
+ int dispatch = 0;
+ double d = PyFloat_AsDouble(obj);
+ if (!PyErr_Occurred()) {
+ if (val) *val = d;
+ return SWIG_AddCast(SWIG_OK);
+ } else {
+ PyErr_Clear();
+ }
+ if (!dispatch) {
+ long v = PyLong_AsLong(obj);
+ if (!PyErr_Occurred()) {
+ if (val) *val = v;
+ return SWIG_AddCast(SWIG_AddCast(SWIG_OK));
+ } else {
+ PyErr_Clear();
+ }
+ }
+ }
+#endif
+ return res;
+}
+
+
+#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 (PyObject *obj, long* val)
+{
+ if (PyInt_Check(obj)) {
+ if (val) *val = PyInt_AsLong(obj);
+ return SWIG_OK;
+ } else if (PyLong_Check(obj)) {
+ long v = PyLong_AsLong(obj);
+ if (!PyErr_Occurred()) {
+ if (val) *val = v;
+ return SWIG_OK;
+ } else {
+ PyErr_Clear();
+ }
+ }
+#ifdef SWIG_PYTHON_CAST_MODE
+ {
+ int dispatch = 0;
+ long v = PyInt_AsLong(obj);
+ if (!PyErr_Occurred()) {
+ if (val) *val = v;
+ return SWIG_AddCast(SWIG_OK);
+ } else {
+ PyErr_Clear();
+ }
+ if (!dispatch) {
+ double d;
+ int res = SWIG_AddCast(SWIG_AsVal_double (obj,&d));
+ if (SWIG_IsOK(res) && SWIG_CanCastAsInteger(&d, LONG_MIN, LONG_MAX)) {
+ if (val) *val = (long)(d);
+ return res;
+ }
+ }
+ }
+#endif
+ return SWIG_TypeError;
+}
+
+
+SWIGINTERN int
+SWIG_AsVal_int (PyObject * obj, int *val)
+{
+ long v;
+ int res = SWIG_AsVal_long (obj, &v);
+ if (SWIG_IsOK(res)) {
+ if ((v < INT_MIN || v > INT_MAX)) {
+ return SWIG_OverflowError;
+ } else {
+ if (val) *val = static_cast< int >(v);
+ }
+ }
+ return res;
+}
+
+
+SWIGINTERN int
+SWIG_AsVal_float (PyObject * obj, float *val)
+{
+ double v;
+ int res = SWIG_AsVal_double (obj, &v);
+ if (SWIG_IsOK(res)) {
+ if ((v < -FLT_MAX || v > FLT_MAX)) {
+ return SWIG_OverflowError;
+ } else {
+ if (val) *val = static_cast< float >(v);
+ }
+ }
+ return res;
+}
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+SWIGINTERN PyObject *_wrap_sa_get_aggregates(PyObject *SWIGUNUSEDPARM(self), PyObject *args) {
+ PyObject *resultobj = 0;
+ int arg1 ;
+ int *arg2 ;
+ int *arg3 ;
+ std::vector<int > *arg4 = (std::vector<int > *) 0 ;
+ int val1 ;
+ int ecode1 = 0 ;
+ PyArrayObject *array2 = NULL ;
+ int is_new_object2 ;
+ PyArrayObject *array3 = NULL ;
+ int is_new_object3 ;
+ std::vector<int > *tmp4 ;
+ PyObject * obj0 = 0 ;
+ PyObject * obj1 = 0 ;
+ PyObject * obj2 = 0 ;
+
+ {
+ tmp4 = new std::vector<int>();
+ arg4 = tmp4;
+ }
+ if (!PyArg_ParseTuple(args,(char *)"OOO:sa_get_aggregates",&obj0,&obj1,&obj2)) SWIG_fail;
+ ecode1 = SWIG_AsVal_int(obj0, &val1);
+ if (!SWIG_IsOK(ecode1)) {
+ SWIG_exception_fail(SWIG_ArgError(ecode1), "in method '" "sa_get_aggregates" "', argument " "1"" of type '" "int""'");
+ }
+ arg1 = static_cast< int >(val1);
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array2 = obj_to_array_contiguous_allow_conversion(obj1, PyArray_INT, &is_new_object2);
+ if (!array2 || !require_dimensions(array2,1) || !require_size(array2,size,1)) SWIG_fail;
+ arg2 = (int*) array2->data;
+ }
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array3 = obj_to_array_contiguous_allow_conversion(obj2, PyArray_INT, &is_new_object3);
+ if (!array3 || !require_dimensions(array3,1) || !require_size(array3,size,1)) SWIG_fail;
+ arg3 = (int*) array3->data;
+ }
+ sa_get_aggregates(arg1,(int const (*))arg2,(int const (*))arg3,arg4);
+ resultobj = SWIG_Py_Void();
+ {
+ int length = (arg4)->size();
+ PyObject *obj = PyArray_FromDims(1, &length, PyArray_INT);
+ memcpy(PyArray_DATA(obj),&((*(arg4))[0]),sizeof(int)*length);
+ delete arg4;
+ resultobj = helper_appendToTuple( resultobj, (PyObject *)obj );
+ }
+ {
+ if (is_new_object2 && array2) Py_DECREF(array2);
+ }
+ {
+ if (is_new_object3 && array3) Py_DECREF(array3);
+ }
+ return resultobj;
+fail:
+ {
+ if (is_new_object2 && array2) Py_DECREF(array2);
+ }
+ {
+ if (is_new_object3 && array3) Py_DECREF(array3);
+ }
+ return NULL;
+}
+
+
+SWIGINTERN PyObject *_wrap_rs_strong_connections__SWIG_1(PyObject *SWIGUNUSEDPARM(self), PyObject *args) {
+ PyObject *resultobj = 0;
+ int arg1 ;
+ float arg2 ;
+ int *arg3 ;
+ int *arg4 ;
+ float *arg5 ;
+ std::vector<int > *arg6 = (std::vector<int > *) 0 ;
+ std::vector<int > *arg7 = (std::vector<int > *) 0 ;
+ std::vector<float > *arg8 = (std::vector<float > *) 0 ;
+ int val1 ;
+ int ecode1 = 0 ;
+ float val2 ;
+ int ecode2 = 0 ;
+ PyArrayObject *array3 = NULL ;
+ int is_new_object3 ;
+ PyArrayObject *array4 = NULL ;
+ int is_new_object4 ;
+ PyArrayObject *array5 = NULL ;
+ int is_new_object5 ;
+ std::vector<int > *tmp6 ;
+ std::vector<int > *tmp7 ;
+ std::vector<float > *tmp8 ;
+ PyObject * obj0 = 0 ;
+ PyObject * obj1 = 0 ;
+ PyObject * obj2 = 0 ;
+ PyObject * obj3 = 0 ;
+ PyObject * obj4 = 0 ;
+
+ {
+ tmp6 = new std::vector<int>();
+ arg6 = tmp6;
+ }
+ {
+ tmp7 = new std::vector<int>();
+ arg7 = tmp7;
+ }
+ {
+ tmp8 = new std::vector<float>();
+ arg8 = tmp8;
+ }
+ if (!PyArg_ParseTuple(args,(char *)"OOOOO:rs_strong_connections",&obj0,&obj1,&obj2,&obj3,&obj4)) SWIG_fail;
+ ecode1 = SWIG_AsVal_int(obj0, &val1);
+ if (!SWIG_IsOK(ecode1)) {
+ SWIG_exception_fail(SWIG_ArgError(ecode1), "in method '" "rs_strong_connections" "', argument " "1"" of type '" "int""'");
+ }
+ arg1 = static_cast< int >(val1);
+ ecode2 = SWIG_AsVal_float(obj1, &val2);
+ if (!SWIG_IsOK(ecode2)) {
+ SWIG_exception_fail(SWIG_ArgError(ecode2), "in method '" "rs_strong_connections" "', argument " "2"" of type '" "float""'");
+ }
+ arg2 = static_cast< float >(val2);
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array3 = obj_to_array_contiguous_allow_conversion(obj2, PyArray_INT, &is_new_object3);
+ if (!array3 || !require_dimensions(array3,1) || !require_size(array3,size,1)) SWIG_fail;
+ arg3 = (int*) array3->data;
+ }
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array4 = obj_to_array_contiguous_allow_conversion(obj3, PyArray_INT, &is_new_object4);
+ if (!array4 || !require_dimensions(array4,1) || !require_size(array4,size,1)) SWIG_fail;
+ arg4 = (int*) array4->data;
+ }
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array5 = obj_to_array_contiguous_allow_conversion(obj4, PyArray_FLOAT, &is_new_object5);
+ if (!array5 || !require_dimensions(array5,1) || !require_size(array5,size,1)) SWIG_fail;
+ arg5 = (float*) array5->data;
+ }
+ rs_strong_connections<float >(arg1,arg2,(int const (*))arg3,(int const (*))arg4,(float const (*))arg5,arg6,arg7,arg8);
+ resultobj = SWIG_Py_Void();
+ {
+ int length = (arg6)->size();
+ PyObject *obj = PyArray_FromDims(1, &length, PyArray_INT);
+ memcpy(PyArray_DATA(obj),&((*(arg6))[0]),sizeof(int)*length);
+ delete arg6;
+ resultobj = helper_appendToTuple( resultobj, (PyObject *)obj );
+ }
+ {
+ int length = (arg7)->size();
+ PyObject *obj = PyArray_FromDims(1, &length, PyArray_INT);
+ memcpy(PyArray_DATA(obj),&((*(arg7))[0]),sizeof(int)*length);
+ delete arg7;
+ resultobj = helper_appendToTuple( resultobj, (PyObject *)obj );
+ }
+ {
+ int length = (arg8)->size();
+ PyObject *obj = PyArray_FromDims(1, &length, PyArray_FLOAT);
+ memcpy(PyArray_DATA(obj),&((*(arg8))[0]),sizeof(float)*length);
+ delete arg8;
+ resultobj = helper_appendToTuple( resultobj, (PyObject *)obj );
+ }
+ {
+ if (is_new_object3 && array3) Py_DECREF(array3);
+ }
+ {
+ if (is_new_object4 && array4) Py_DECREF(array4);
+ }
+ {
+ if (is_new_object5 && array5) Py_DECREF(array5);
+ }
+ return resultobj;
+fail:
+ {
+ if (is_new_object3 && array3) Py_DECREF(array3);
+ }
+ {
+ if (is_new_object4 && array4) Py_DECREF(array4);
+ }
+ {
+ if (is_new_object5 && array5) Py_DECREF(array5);
+ }
+ return NULL;
+}
+
+
+SWIGINTERN PyObject *_wrap_rs_strong_connections__SWIG_2(PyObject *SWIGUNUSEDPARM(self), PyObject *args) {
+ PyObject *resultobj = 0;
+ int arg1 ;
+ double arg2 ;
+ int *arg3 ;
+ int *arg4 ;
+ double *arg5 ;
+ std::vector<int > *arg6 = (std::vector<int > *) 0 ;
+ std::vector<int > *arg7 = (std::vector<int > *) 0 ;
+ std::vector<double > *arg8 = (std::vector<double > *) 0 ;
+ int val1 ;
+ int ecode1 = 0 ;
+ double val2 ;
+ int ecode2 = 0 ;
+ PyArrayObject *array3 = NULL ;
+ int is_new_object3 ;
+ PyArrayObject *array4 = NULL ;
+ int is_new_object4 ;
+ PyArrayObject *array5 = NULL ;
+ int is_new_object5 ;
+ std::vector<int > *tmp6 ;
+ std::vector<int > *tmp7 ;
+ std::vector<double > *tmp8 ;
+ PyObject * obj0 = 0 ;
+ PyObject * obj1 = 0 ;
+ PyObject * obj2 = 0 ;
+ PyObject * obj3 = 0 ;
+ PyObject * obj4 = 0 ;
+
+ {
+ tmp6 = new std::vector<int>();
+ arg6 = tmp6;
+ }
+ {
+ tmp7 = new std::vector<int>();
+ arg7 = tmp7;
+ }
+ {
+ tmp8 = new std::vector<double>();
+ arg8 = tmp8;
+ }
+ if (!PyArg_ParseTuple(args,(char *)"OOOOO:rs_strong_connections",&obj0,&obj1,&obj2,&obj3,&obj4)) SWIG_fail;
+ ecode1 = SWIG_AsVal_int(obj0, &val1);
+ if (!SWIG_IsOK(ecode1)) {
+ SWIG_exception_fail(SWIG_ArgError(ecode1), "in method '" "rs_strong_connections" "', argument " "1"" of type '" "int""'");
+ }
+ arg1 = static_cast< int >(val1);
+ ecode2 = SWIG_AsVal_double(obj1, &val2);
+ if (!SWIG_IsOK(ecode2)) {
+ SWIG_exception_fail(SWIG_ArgError(ecode2), "in method '" "rs_strong_connections" "', argument " "2"" of type '" "double""'");
+ }
+ arg2 = static_cast< double >(val2);
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array3 = obj_to_array_contiguous_allow_conversion(obj2, PyArray_INT, &is_new_object3);
+ if (!array3 || !require_dimensions(array3,1) || !require_size(array3,size,1)) SWIG_fail;
+ arg3 = (int*) array3->data;
+ }
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array4 = obj_to_array_contiguous_allow_conversion(obj3, PyArray_INT, &is_new_object4);
+ if (!array4 || !require_dimensions(array4,1) || !require_size(array4,size,1)) SWIG_fail;
+ arg4 = (int*) array4->data;
+ }
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array5 = obj_to_array_contiguous_allow_conversion(obj4, PyArray_DOUBLE, &is_new_object5);
+ if (!array5 || !require_dimensions(array5,1) || !require_size(array5,size,1)) SWIG_fail;
+ arg5 = (double*) array5->data;
+ }
+ rs_strong_connections<double >(arg1,arg2,(int const (*))arg3,(int const (*))arg4,(double const (*))arg5,arg6,arg7,arg8);
+ resultobj = SWIG_Py_Void();
+ {
+ int length = (arg6)->size();
+ PyObject *obj = PyArray_FromDims(1, &length, PyArray_INT);
+ memcpy(PyArray_DATA(obj),&((*(arg6))[0]),sizeof(int)*length);
+ delete arg6;
+ resultobj = helper_appendToTuple( resultobj, (PyObject *)obj );
+ }
+ {
+ int length = (arg7)->size();
+ PyObject *obj = PyArray_FromDims(1, &length, PyArray_INT);
+ memcpy(PyArray_DATA(obj),&((*(arg7))[0]),sizeof(int)*length);
+ delete arg7;
+ resultobj = helper_appendToTuple( resultobj, (PyObject *)obj );
+ }
+ {
+ int length = (arg8)->size();
+ PyObject *obj = PyArray_FromDims(1, &length, PyArray_DOUBLE);
+ memcpy(PyArray_DATA(obj),&((*(arg8))[0]),sizeof(double)*length);
+ delete arg8;
+ resultobj = helper_appendToTuple( resultobj, (PyObject *)obj );
+ }
+ {
+ if (is_new_object3 && array3) Py_DECREF(array3);
+ }
+ {
+ if (is_new_object4 && array4) Py_DECREF(array4);
+ }
+ {
+ if (is_new_object5 && array5) Py_DECREF(array5);
+ }
+ return resultobj;
+fail:
+ {
+ if (is_new_object3 && array3) Py_DECREF(array3);
+ }
+ {
+ if (is_new_object4 && array4) Py_DECREF(array4);
+ }
+ {
+ if (is_new_object5 && array5) Py_DECREF(array5);
+ }
+ return NULL;
+}
+
+
+SWIGINTERN PyObject *_wrap_rs_strong_connections(PyObject *self, PyObject *args) {
+ int argc;
+ PyObject *argv[6];
+ int ii;
+
+ if (!PyTuple_Check(args)) SWIG_fail;
+ argc = PyObject_Length(args);
+ for (ii = 0; (ii < argc) && (ii < 5); ii++) {
+ argv[ii] = PyTuple_GET_ITEM(args,ii);
+ }
+ if (argc == 5) {
+ int _v;
+ {
+ int res = SWIG_AsVal_int(argv[0], NULL);
+ _v = SWIG_CheckState(res);
+ }
+ if (_v) {
+ {
+ int res = SWIG_AsVal_float(argv[1], NULL);
+ _v = SWIG_CheckState(res);
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[2]) && PyArray_CanCastSafely(PyArray_TYPE(argv[2]),PyArray_INT)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[3]) && PyArray_CanCastSafely(PyArray_TYPE(argv[3]),PyArray_INT)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[4]) && PyArray_CanCastSafely(PyArray_TYPE(argv[4]),PyArray_FLOAT)) ? 1 : 0;
+ }
+ if (_v) {
+ return _wrap_rs_strong_connections__SWIG_1(self, args);
+ }
+ }
+ }
+ }
+ }
+ }
+ if (argc == 5) {
+ int _v;
+ {
+ int res = SWIG_AsVal_int(argv[0], NULL);
+ _v = SWIG_CheckState(res);
+ }
+ if (_v) {
+ {
+ int res = SWIG_AsVal_double(argv[1], NULL);
+ _v = SWIG_CheckState(res);
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[2]) && PyArray_CanCastSafely(PyArray_TYPE(argv[2]),PyArray_INT)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[3]) && PyArray_CanCastSafely(PyArray_TYPE(argv[3]),PyArray_INT)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[4]) && PyArray_CanCastSafely(PyArray_TYPE(argv[4]),PyArray_DOUBLE)) ? 1 : 0;
+ }
+ if (_v) {
+ return _wrap_rs_strong_connections__SWIG_2(self, args);
+ }
+ }
+ }
+ }
+ }
+ }
+
+fail:
+ SWIG_SetErrorMsg(PyExc_NotImplementedError,"Wrong number of arguments for overloaded function 'rs_strong_connections'.\n Possible C/C++ prototypes are:\n rs_strong_connections<(float)>(int const,float const,int const [],int const [],float const [],std::vector<int > *,std::vector<int > *,std::vector<float > *)\n rs_strong_connections<(double)>(int const,double const,int const [],int const [],double const [],std::vector<int > *,std::vector<int > *,std::vector<double > *)\n");
+ return NULL;
+}
+
+
+SWIGINTERN PyObject *_wrap_rs_interpolation__SWIG_1(PyObject *SWIGUNUSEDPARM(self), PyObject *args) {
+ PyObject *resultobj = 0;
+ int arg1 ;
+ int *arg2 ;
+ int *arg3 ;
+ float *arg4 ;
+ int *arg5 ;
+ int *arg6 ;
+ float *arg7 ;
+ int *arg8 ;
+ int *arg9 ;
+ float *arg10 ;
+ std::vector<int > *arg11 = (std::vector<int > *) 0 ;
+ std::vector<int > *arg12 = (std::vector<int > *) 0 ;
+ std::vector<float > *arg13 = (std::vector<float > *) 0 ;
+ int val1 ;
+ int ecode1 = 0 ;
+ PyArrayObject *array2 = NULL ;
+ int is_new_object2 ;
+ PyArrayObject *array3 = NULL ;
+ int is_new_object3 ;
+ PyArrayObject *array4 = NULL ;
+ int is_new_object4 ;
+ PyArrayObject *array5 = NULL ;
+ int is_new_object5 ;
+ PyArrayObject *array6 = NULL ;
+ int is_new_object6 ;
+ PyArrayObject *array7 = NULL ;
+ int is_new_object7 ;
+ PyArrayObject *array8 = NULL ;
+ int is_new_object8 ;
+ PyArrayObject *array9 = NULL ;
+ int is_new_object9 ;
+ PyArrayObject *array10 = NULL ;
+ int is_new_object10 ;
+ std::vector<int > *tmp11 ;
+ std::vector<int > *tmp12 ;
+ std::vector<float > *tmp13 ;
+ PyObject * obj0 = 0 ;
+ PyObject * obj1 = 0 ;
+ PyObject * obj2 = 0 ;
+ PyObject * obj3 = 0 ;
+ PyObject * obj4 = 0 ;
+ PyObject * obj5 = 0 ;
+ PyObject * obj6 = 0 ;
+ PyObject * obj7 = 0 ;
+ PyObject * obj8 = 0 ;
+ PyObject * obj9 = 0 ;
+
+ {
+ tmp11 = new std::vector<int>();
+ arg11 = tmp11;
+ }
+ {
+ tmp12 = new std::vector<int>();
+ arg12 = tmp12;
+ }
+ {
+ tmp13 = new std::vector<float>();
+ arg13 = tmp13;
+ }
+ if (!PyArg_ParseTuple(args,(char *)"OOOOOOOOOO:rs_interpolation",&obj0,&obj1,&obj2,&obj3,&obj4,&obj5,&obj6,&obj7,&obj8,&obj9)) SWIG_fail;
+ ecode1 = SWIG_AsVal_int(obj0, &val1);
+ if (!SWIG_IsOK(ecode1)) {
+ SWIG_exception_fail(SWIG_ArgError(ecode1), "in method '" "rs_interpolation" "', argument " "1"" of type '" "int""'");
+ }
+ arg1 = static_cast< int >(val1);
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array2 = obj_to_array_contiguous_allow_conversion(obj1, PyArray_INT, &is_new_object2);
+ if (!array2 || !require_dimensions(array2,1) || !require_size(array2,size,1)) SWIG_fail;
+ arg2 = (int*) array2->data;
+ }
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array3 = obj_to_array_contiguous_allow_conversion(obj2, PyArray_INT, &is_new_object3);
+ if (!array3 || !require_dimensions(array3,1) || !require_size(array3,size,1)) SWIG_fail;
+ arg3 = (int*) array3->data;
+ }
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array4 = obj_to_array_contiguous_allow_conversion(obj3, PyArray_FLOAT, &is_new_object4);
+ if (!array4 || !require_dimensions(array4,1) || !require_size(array4,size,1)) SWIG_fail;
+ arg4 = (float*) array4->data;
+ }
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array5 = obj_to_array_contiguous_allow_conversion(obj4, PyArray_INT, &is_new_object5);
+ if (!array5 || !require_dimensions(array5,1) || !require_size(array5,size,1)) SWIG_fail;
+ arg5 = (int*) array5->data;
+ }
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array6 = obj_to_array_contiguous_allow_conversion(obj5, PyArray_INT, &is_new_object6);
+ if (!array6 || !require_dimensions(array6,1) || !require_size(array6,size,1)) SWIG_fail;
+ arg6 = (int*) array6->data;
+ }
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array7 = obj_to_array_contiguous_allow_conversion(obj6, PyArray_FLOAT, &is_new_object7);
+ if (!array7 || !require_dimensions(array7,1) || !require_size(array7,size,1)) SWIG_fail;
+ arg7 = (float*) array7->data;
+ }
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array8 = obj_to_array_contiguous_allow_conversion(obj7, PyArray_INT, &is_new_object8);
+ if (!array8 || !require_dimensions(array8,1) || !require_size(array8,size,1)) SWIG_fail;
+ arg8 = (int*) array8->data;
+ }
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array9 = obj_to_array_contiguous_allow_conversion(obj8, PyArray_INT, &is_new_object9);
+ if (!array9 || !require_dimensions(array9,1) || !require_size(array9,size,1)) SWIG_fail;
+ arg9 = (int*) array9->data;
+ }
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array10 = obj_to_array_contiguous_allow_conversion(obj9, PyArray_FLOAT, &is_new_object10);
+ if (!array10 || !require_dimensions(array10,1) || !require_size(array10,size,1)) SWIG_fail;
+ arg10 = (float*) array10->data;
+ }
+ rs_interpolation<float >(arg1,(int const (*))arg2,(int const (*))arg3,(float const (*))arg4,(int const (*))arg5,(int const (*))arg6,(float const (*))arg7,(int const (*))arg8,(int const (*))arg9,(float const (*))arg10,arg11,arg12,arg13);
+ resultobj = SWIG_Py_Void();
+ {
+ int length = (arg11)->size();
+ PyObject *obj = PyArray_FromDims(1, &length, PyArray_INT);
+ memcpy(PyArray_DATA(obj),&((*(arg11))[0]),sizeof(int)*length);
+ delete arg11;
+ resultobj = helper_appendToTuple( resultobj, (PyObject *)obj );
+ }
+ {
+ int length = (arg12)->size();
+ PyObject *obj = PyArray_FromDims(1, &length, PyArray_INT);
+ memcpy(PyArray_DATA(obj),&((*(arg12))[0]),sizeof(int)*length);
+ delete arg12;
+ resultobj = helper_appendToTuple( resultobj, (PyObject *)obj );
+ }
+ {
+ int length = (arg13)->size();
+ PyObject *obj = PyArray_FromDims(1, &length, PyArray_FLOAT);
+ memcpy(PyArray_DATA(obj),&((*(arg13))[0]),sizeof(float)*length);
+ delete arg13;
+ resultobj = helper_appendToTuple( resultobj, (PyObject *)obj );
+ }
+ {
+ if (is_new_object2 && array2) Py_DECREF(array2);
+ }
+ {
+ if (is_new_object3 && array3) Py_DECREF(array3);
+ }
+ {
+ if (is_new_object4 && array4) Py_DECREF(array4);
+ }
+ {
+ if (is_new_object5 && array5) Py_DECREF(array5);
+ }
+ {
+ if (is_new_object6 && array6) Py_DECREF(array6);
+ }
+ {
+ if (is_new_object7 && array7) Py_DECREF(array7);
+ }
+ {
+ if (is_new_object8 && array8) Py_DECREF(array8);
+ }
+ {
+ if (is_new_object9 && array9) Py_DECREF(array9);
+ }
+ {
+ if (is_new_object10 && array10) Py_DECREF(array10);
+ }
+ return resultobj;
+fail:
+ {
+ if (is_new_object2 && array2) Py_DECREF(array2);
+ }
+ {
+ if (is_new_object3 && array3) Py_DECREF(array3);
+ }
+ {
+ if (is_new_object4 && array4) Py_DECREF(array4);
+ }
+ {
+ if (is_new_object5 && array5) Py_DECREF(array5);
+ }
+ {
+ if (is_new_object6 && array6) Py_DECREF(array6);
+ }
+ {
+ if (is_new_object7 && array7) Py_DECREF(array7);
+ }
+ {
+ if (is_new_object8 && array8) Py_DECREF(array8);
+ }
+ {
+ if (is_new_object9 && array9) Py_DECREF(array9);
+ }
+ {
+ if (is_new_object10 && array10) Py_DECREF(array10);
+ }
+ return NULL;
+}
+
+
+SWIGINTERN PyObject *_wrap_rs_interpolation__SWIG_2(PyObject *SWIGUNUSEDPARM(self), PyObject *args) {
+ PyObject *resultobj = 0;
+ int arg1 ;
+ int *arg2 ;
+ int *arg3 ;
+ double *arg4 ;
+ int *arg5 ;
+ int *arg6 ;
+ double *arg7 ;
+ int *arg8 ;
+ int *arg9 ;
+ double *arg10 ;
+ std::vector<int > *arg11 = (std::vector<int > *) 0 ;
+ std::vector<int > *arg12 = (std::vector<int > *) 0 ;
+ std::vector<double > *arg13 = (std::vector<double > *) 0 ;
+ int val1 ;
+ int ecode1 = 0 ;
+ PyArrayObject *array2 = NULL ;
+ int is_new_object2 ;
+ PyArrayObject *array3 = NULL ;
+ int is_new_object3 ;
+ PyArrayObject *array4 = NULL ;
+ int is_new_object4 ;
+ PyArrayObject *array5 = NULL ;
+ int is_new_object5 ;
+ PyArrayObject *array6 = NULL ;
+ int is_new_object6 ;
+ PyArrayObject *array7 = NULL ;
+ int is_new_object7 ;
+ PyArrayObject *array8 = NULL ;
+ int is_new_object8 ;
+ PyArrayObject *array9 = NULL ;
+ int is_new_object9 ;
+ PyArrayObject *array10 = NULL ;
+ int is_new_object10 ;
+ std::vector<int > *tmp11 ;
+ std::vector<int > *tmp12 ;
+ std::vector<double > *tmp13 ;
+ PyObject * obj0 = 0 ;
+ PyObject * obj1 = 0 ;
+ PyObject * obj2 = 0 ;
+ PyObject * obj3 = 0 ;
+ PyObject * obj4 = 0 ;
+ PyObject * obj5 = 0 ;
+ PyObject * obj6 = 0 ;
+ PyObject * obj7 = 0 ;
+ PyObject * obj8 = 0 ;
+ PyObject * obj9 = 0 ;
+
+ {
+ tmp11 = new std::vector<int>();
+ arg11 = tmp11;
+ }
+ {
+ tmp12 = new std::vector<int>();
+ arg12 = tmp12;
+ }
+ {
+ tmp13 = new std::vector<double>();
+ arg13 = tmp13;
+ }
+ if (!PyArg_ParseTuple(args,(char *)"OOOOOOOOOO:rs_interpolation",&obj0,&obj1,&obj2,&obj3,&obj4,&obj5,&obj6,&obj7,&obj8,&obj9)) SWIG_fail;
+ ecode1 = SWIG_AsVal_int(obj0, &val1);
+ if (!SWIG_IsOK(ecode1)) {
+ SWIG_exception_fail(SWIG_ArgError(ecode1), "in method '" "rs_interpolation" "', argument " "1"" of type '" "int""'");
+ }
+ arg1 = static_cast< int >(val1);
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array2 = obj_to_array_contiguous_allow_conversion(obj1, PyArray_INT, &is_new_object2);
+ if (!array2 || !require_dimensions(array2,1) || !require_size(array2,size,1)) SWIG_fail;
+ arg2 = (int*) array2->data;
+ }
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array3 = obj_to_array_contiguous_allow_conversion(obj2, PyArray_INT, &is_new_object3);
+ if (!array3 || !require_dimensions(array3,1) || !require_size(array3,size,1)) SWIG_fail;
+ arg3 = (int*) array3->data;
+ }
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array4 = obj_to_array_contiguous_allow_conversion(obj3, PyArray_DOUBLE, &is_new_object4);
+ if (!array4 || !require_dimensions(array4,1) || !require_size(array4,size,1)) SWIG_fail;
+ arg4 = (double*) array4->data;
+ }
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array5 = obj_to_array_contiguous_allow_conversion(obj4, PyArray_INT, &is_new_object5);
+ if (!array5 || !require_dimensions(array5,1) || !require_size(array5,size,1)) SWIG_fail;
+ arg5 = (int*) array5->data;
+ }
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array6 = obj_to_array_contiguous_allow_conversion(obj5, PyArray_INT, &is_new_object6);
+ if (!array6 || !require_dimensions(array6,1) || !require_size(array6,size,1)) SWIG_fail;
+ arg6 = (int*) array6->data;
+ }
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array7 = obj_to_array_contiguous_allow_conversion(obj6, PyArray_DOUBLE, &is_new_object7);
+ if (!array7 || !require_dimensions(array7,1) || !require_size(array7,size,1)) SWIG_fail;
+ arg7 = (double*) array7->data;
+ }
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array8 = obj_to_array_contiguous_allow_conversion(obj7, PyArray_INT, &is_new_object8);
+ if (!array8 || !require_dimensions(array8,1) || !require_size(array8,size,1)) SWIG_fail;
+ arg8 = (int*) array8->data;
+ }
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array9 = obj_to_array_contiguous_allow_conversion(obj8, PyArray_INT, &is_new_object9);
+ if (!array9 || !require_dimensions(array9,1) || !require_size(array9,size,1)) SWIG_fail;
+ arg9 = (int*) array9->data;
+ }
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array10 = obj_to_array_contiguous_allow_conversion(obj9, PyArray_DOUBLE, &is_new_object10);
+ if (!array10 || !require_dimensions(array10,1) || !require_size(array10,size,1)) SWIG_fail;
+ arg10 = (double*) array10->data;
+ }
+ rs_interpolation<double >(arg1,(int const (*))arg2,(int const (*))arg3,(double const (*))arg4,(int const (*))arg5,(int const (*))arg6,(double const (*))arg7,(int const (*))arg8,(int const (*))arg9,(double const (*))arg10,arg11,arg12,arg13);
+ resultobj = SWIG_Py_Void();
+ {
+ int length = (arg11)->size();
+ PyObject *obj = PyArray_FromDims(1, &length, PyArray_INT);
+ memcpy(PyArray_DATA(obj),&((*(arg11))[0]),sizeof(int)*length);
+ delete arg11;
+ resultobj = helper_appendToTuple( resultobj, (PyObject *)obj );
+ }
+ {
+ int length = (arg12)->size();
+ PyObject *obj = PyArray_FromDims(1, &length, PyArray_INT);
+ memcpy(PyArray_DATA(obj),&((*(arg12))[0]),sizeof(int)*length);
+ delete arg12;
+ resultobj = helper_appendToTuple( resultobj, (PyObject *)obj );
+ }
+ {
+ int length = (arg13)->size();
+ PyObject *obj = PyArray_FromDims(1, &length, PyArray_DOUBLE);
+ memcpy(PyArray_DATA(obj),&((*(arg13))[0]),sizeof(double)*length);
+ delete arg13;
+ resultobj = helper_appendToTuple( resultobj, (PyObject *)obj );
+ }
+ {
+ if (is_new_object2 && array2) Py_DECREF(array2);
+ }
+ {
+ if (is_new_object3 && array3) Py_DECREF(array3);
+ }
+ {
+ if (is_new_object4 && array4) Py_DECREF(array4);
+ }
+ {
+ if (is_new_object5 && array5) Py_DECREF(array5);
+ }
+ {
+ if (is_new_object6 && array6) Py_DECREF(array6);
+ }
+ {
+ if (is_new_object7 && array7) Py_DECREF(array7);
+ }
+ {
+ if (is_new_object8 && array8) Py_DECREF(array8);
+ }
+ {
+ if (is_new_object9 && array9) Py_DECREF(array9);
+ }
+ {
+ if (is_new_object10 && array10) Py_DECREF(array10);
+ }
+ return resultobj;
+fail:
+ {
+ if (is_new_object2 && array2) Py_DECREF(array2);
+ }
+ {
+ if (is_new_object3 && array3) Py_DECREF(array3);
+ }
+ {
+ if (is_new_object4 && array4) Py_DECREF(array4);
+ }
+ {
+ if (is_new_object5 && array5) Py_DECREF(array5);
+ }
+ {
+ if (is_new_object6 && array6) Py_DECREF(array6);
+ }
+ {
+ if (is_new_object7 && array7) Py_DECREF(array7);
+ }
+ {
+ if (is_new_object8 && array8) Py_DECREF(array8);
+ }
+ {
+ if (is_new_object9 && array9) Py_DECREF(array9);
+ }
+ {
+ if (is_new_object10 && array10) Py_DECREF(array10);
+ }
+ return NULL;
+}
+
+
+SWIGINTERN PyObject *_wrap_rs_interpolation(PyObject *self, PyObject *args) {
+ int argc;
+ PyObject *argv[11];
+ int ii;
+
+ if (!PyTuple_Check(args)) SWIG_fail;
+ argc = PyObject_Length(args);
+ for (ii = 0; (ii < argc) && (ii < 10); ii++) {
+ argv[ii] = PyTuple_GET_ITEM(args,ii);
+ }
+ if (argc == 10) {
+ int _v;
+ {
+ int res = SWIG_AsVal_int(argv[0], NULL);
+ _v = SWIG_CheckState(res);
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[1]) && PyArray_CanCastSafely(PyArray_TYPE(argv[1]),PyArray_INT)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[2]) && PyArray_CanCastSafely(PyArray_TYPE(argv[2]),PyArray_INT)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[3]) && PyArray_CanCastSafely(PyArray_TYPE(argv[3]),PyArray_FLOAT)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[4]) && PyArray_CanCastSafely(PyArray_TYPE(argv[4]),PyArray_INT)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[5]) && PyArray_CanCastSafely(PyArray_TYPE(argv[5]),PyArray_INT)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[6]) && PyArray_CanCastSafely(PyArray_TYPE(argv[6]),PyArray_FLOAT)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[7]) && PyArray_CanCastSafely(PyArray_TYPE(argv[7]),PyArray_INT)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[8]) && PyArray_CanCastSafely(PyArray_TYPE(argv[8]),PyArray_INT)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[9]) && PyArray_CanCastSafely(PyArray_TYPE(argv[9]),PyArray_FLOAT)) ? 1 : 0;
+ }
+ if (_v) {
+ return _wrap_rs_interpolation__SWIG_1(self, args);
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+ if (argc == 10) {
+ int _v;
+ {
+ int res = SWIG_AsVal_int(argv[0], NULL);
+ _v = SWIG_CheckState(res);
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[1]) && PyArray_CanCastSafely(PyArray_TYPE(argv[1]),PyArray_INT)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[2]) && PyArray_CanCastSafely(PyArray_TYPE(argv[2]),PyArray_INT)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[3]) && PyArray_CanCastSafely(PyArray_TYPE(argv[3]),PyArray_DOUBLE)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[4]) && PyArray_CanCastSafely(PyArray_TYPE(argv[4]),PyArray_INT)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[5]) && PyArray_CanCastSafely(PyArray_TYPE(argv[5]),PyArray_INT)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[6]) && PyArray_CanCastSafely(PyArray_TYPE(argv[6]),PyArray_DOUBLE)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[7]) && PyArray_CanCastSafely(PyArray_TYPE(argv[7]),PyArray_INT)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[8]) && PyArray_CanCastSafely(PyArray_TYPE(argv[8]),PyArray_INT)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[9]) && PyArray_CanCastSafely(PyArray_TYPE(argv[9]),PyArray_DOUBLE)) ? 1 : 0;
+ }
+ if (_v) {
+ return _wrap_rs_interpolation__SWIG_2(self, args);
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+
+fail:
+ SWIG_SetErrorMsg(PyExc_NotImplementedError,"Wrong number of arguments for overloaded function 'rs_interpolation'.\n Possible C/C++ prototypes are:\n rs_interpolation<(float)>(int const,int const [],int const [],float const [],int const [],int const [],float const [],int const [],int const [],float const [],std::vector<int > *,std::vector<int > *,std::vector<float > *)\n rs_interpolation<(double)>(int const,int const [],int const [],double const [],int const [],int const [],double const [],int const [],int const [],double const [],std::vector<int > *,std::vector<int > *,std::vector<double > *)\n");
+ return NULL;
+}
+
+
+SWIGINTERN PyObject *_wrap_sa_strong_connections__SWIG_1(PyObject *SWIGUNUSEDPARM(self), PyObject *args) {
+ PyObject *resultobj = 0;
+ int arg1 ;
+ float arg2 ;
+ int *arg3 ;
+ int *arg4 ;
+ float *arg5 ;
+ std::vector<int > *arg6 = (std::vector<int > *) 0 ;
+ std::vector<int > *arg7 = (std::vector<int > *) 0 ;
+ std::vector<float > *arg8 = (std::vector<float > *) 0 ;
+ int val1 ;
+ int ecode1 = 0 ;
+ float val2 ;
+ int ecode2 = 0 ;
+ PyArrayObject *array3 = NULL ;
+ int is_new_object3 ;
+ PyArrayObject *array4 = NULL ;
+ int is_new_object4 ;
+ PyArrayObject *array5 = NULL ;
+ int is_new_object5 ;
+ std::vector<int > *tmp6 ;
+ std::vector<int > *tmp7 ;
+ std::vector<float > *tmp8 ;
+ PyObject * obj0 = 0 ;
+ PyObject * obj1 = 0 ;
+ PyObject * obj2 = 0 ;
+ PyObject * obj3 = 0 ;
+ PyObject * obj4 = 0 ;
+
+ {
+ tmp6 = new std::vector<int>();
+ arg6 = tmp6;
+ }
+ {
+ tmp7 = new std::vector<int>();
+ arg7 = tmp7;
+ }
+ {
+ tmp8 = new std::vector<float>();
+ arg8 = tmp8;
+ }
+ if (!PyArg_ParseTuple(args,(char *)"OOOOO:sa_strong_connections",&obj0,&obj1,&obj2,&obj3,&obj4)) SWIG_fail;
+ ecode1 = SWIG_AsVal_int(obj0, &val1);
+ if (!SWIG_IsOK(ecode1)) {
+ SWIG_exception_fail(SWIG_ArgError(ecode1), "in method '" "sa_strong_connections" "', argument " "1"" of type '" "int""'");
+ }
+ arg1 = static_cast< int >(val1);
+ ecode2 = SWIG_AsVal_float(obj1, &val2);
+ if (!SWIG_IsOK(ecode2)) {
+ SWIG_exception_fail(SWIG_ArgError(ecode2), "in method '" "sa_strong_connections" "', argument " "2"" of type '" "float""'");
+ }
+ arg2 = static_cast< float >(val2);
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array3 = obj_to_array_contiguous_allow_conversion(obj2, PyArray_INT, &is_new_object3);
+ if (!array3 || !require_dimensions(array3,1) || !require_size(array3,size,1)) SWIG_fail;
+ arg3 = (int*) array3->data;
+ }
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array4 = obj_to_array_contiguous_allow_conversion(obj3, PyArray_INT, &is_new_object4);
+ if (!array4 || !require_dimensions(array4,1) || !require_size(array4,size,1)) SWIG_fail;
+ arg4 = (int*) array4->data;
+ }
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array5 = obj_to_array_contiguous_allow_conversion(obj4, PyArray_FLOAT, &is_new_object5);
+ if (!array5 || !require_dimensions(array5,1) || !require_size(array5,size,1)) SWIG_fail;
+ arg5 = (float*) array5->data;
+ }
+ sa_strong_connections<float >(arg1,arg2,(int const (*))arg3,(int const (*))arg4,(float const (*))arg5,arg6,arg7,arg8);
+ resultobj = SWIG_Py_Void();
+ {
+ int length = (arg6)->size();
+ PyObject *obj = PyArray_FromDims(1, &length, PyArray_INT);
+ memcpy(PyArray_DATA(obj),&((*(arg6))[0]),sizeof(int)*length);
+ delete arg6;
+ resultobj = helper_appendToTuple( resultobj, (PyObject *)obj );
+ }
+ {
+ int length = (arg7)->size();
+ PyObject *obj = PyArray_FromDims(1, &length, PyArray_INT);
+ memcpy(PyArray_DATA(obj),&((*(arg7))[0]),sizeof(int)*length);
+ delete arg7;
+ resultobj = helper_appendToTuple( resultobj, (PyObject *)obj );
+ }
+ {
+ int length = (arg8)->size();
+ PyObject *obj = PyArray_FromDims(1, &length, PyArray_FLOAT);
+ memcpy(PyArray_DATA(obj),&((*(arg8))[0]),sizeof(float)*length);
+ delete arg8;
+ resultobj = helper_appendToTuple( resultobj, (PyObject *)obj );
+ }
+ {
+ if (is_new_object3 && array3) Py_DECREF(array3);
+ }
+ {
+ if (is_new_object4 && array4) Py_DECREF(array4);
+ }
+ {
+ if (is_new_object5 && array5) Py_DECREF(array5);
+ }
+ return resultobj;
+fail:
+ {
+ if (is_new_object3 && array3) Py_DECREF(array3);
+ }
+ {
+ if (is_new_object4 && array4) Py_DECREF(array4);
+ }
+ {
+ if (is_new_object5 && array5) Py_DECREF(array5);
+ }
+ return NULL;
+}
+
+
+SWIGINTERN PyObject *_wrap_sa_strong_connections__SWIG_2(PyObject *SWIGUNUSEDPARM(self), PyObject *args) {
+ PyObject *resultobj = 0;
+ int arg1 ;
+ double arg2 ;
+ int *arg3 ;
+ int *arg4 ;
+ double *arg5 ;
+ std::vector<int > *arg6 = (std::vector<int > *) 0 ;
+ std::vector<int > *arg7 = (std::vector<int > *) 0 ;
+ std::vector<double > *arg8 = (std::vector<double > *) 0 ;
+ int val1 ;
+ int ecode1 = 0 ;
+ double val2 ;
+ int ecode2 = 0 ;
+ PyArrayObject *array3 = NULL ;
+ int is_new_object3 ;
+ PyArrayObject *array4 = NULL ;
+ int is_new_object4 ;
+ PyArrayObject *array5 = NULL ;
+ int is_new_object5 ;
+ std::vector<int > *tmp6 ;
+ std::vector<int > *tmp7 ;
+ std::vector<double > *tmp8 ;
+ PyObject * obj0 = 0 ;
+ PyObject * obj1 = 0 ;
+ PyObject * obj2 = 0 ;
+ PyObject * obj3 = 0 ;
+ PyObject * obj4 = 0 ;
+
+ {
+ tmp6 = new std::vector<int>();
+ arg6 = tmp6;
+ }
+ {
+ tmp7 = new std::vector<int>();
+ arg7 = tmp7;
+ }
+ {
+ tmp8 = new std::vector<double>();
+ arg8 = tmp8;
+ }
+ if (!PyArg_ParseTuple(args,(char *)"OOOOO:sa_strong_connections",&obj0,&obj1,&obj2,&obj3,&obj4)) SWIG_fail;
+ ecode1 = SWIG_AsVal_int(obj0, &val1);
+ if (!SWIG_IsOK(ecode1)) {
+ SWIG_exception_fail(SWIG_ArgError(ecode1), "in method '" "sa_strong_connections" "', argument " "1"" of type '" "int""'");
+ }
+ arg1 = static_cast< int >(val1);
+ ecode2 = SWIG_AsVal_double(obj1, &val2);
+ if (!SWIG_IsOK(ecode2)) {
+ SWIG_exception_fail(SWIG_ArgError(ecode2), "in method '" "sa_strong_connections" "', argument " "2"" of type '" "double""'");
+ }
+ arg2 = static_cast< double >(val2);
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array3 = obj_to_array_contiguous_allow_conversion(obj2, PyArray_INT, &is_new_object3);
+ if (!array3 || !require_dimensions(array3,1) || !require_size(array3,size,1)) SWIG_fail;
+ arg3 = (int*) array3->data;
+ }
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array4 = obj_to_array_contiguous_allow_conversion(obj3, PyArray_INT, &is_new_object4);
+ if (!array4 || !require_dimensions(array4,1) || !require_size(array4,size,1)) SWIG_fail;
+ arg4 = (int*) array4->data;
+ }
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array5 = obj_to_array_contiguous_allow_conversion(obj4, PyArray_DOUBLE, &is_new_object5);
+ if (!array5 || !require_dimensions(array5,1) || !require_size(array5,size,1)) SWIG_fail;
+ arg5 = (double*) array5->data;
+ }
+ sa_strong_connections<double >(arg1,arg2,(int const (*))arg3,(int const (*))arg4,(double const (*))arg5,arg6,arg7,arg8);
+ resultobj = SWIG_Py_Void();
+ {
+ int length = (arg6)->size();
+ PyObject *obj = PyArray_FromDims(1, &length, PyArray_INT);
+ memcpy(PyArray_DATA(obj),&((*(arg6))[0]),sizeof(int)*length);
+ delete arg6;
+ resultobj = helper_appendToTuple( resultobj, (PyObject *)obj );
+ }
+ {
+ int length = (arg7)->size();
+ PyObject *obj = PyArray_FromDims(1, &length, PyArray_INT);
+ memcpy(PyArray_DATA(obj),&((*(arg7))[0]),sizeof(int)*length);
+ delete arg7;
+ resultobj = helper_appendToTuple( resultobj, (PyObject *)obj );
+ }
+ {
+ int length = (arg8)->size();
+ PyObject *obj = PyArray_FromDims(1, &length, PyArray_DOUBLE);
+ memcpy(PyArray_DATA(obj),&((*(arg8))[0]),sizeof(double)*length);
+ delete arg8;
+ resultobj = helper_appendToTuple( resultobj, (PyObject *)obj );
+ }
+ {
+ if (is_new_object3 && array3) Py_DECREF(array3);
+ }
+ {
+ if (is_new_object4 && array4) Py_DECREF(array4);
+ }
+ {
+ if (is_new_object5 && array5) Py_DECREF(array5);
+ }
+ return resultobj;
+fail:
+ {
+ if (is_new_object3 && array3) Py_DECREF(array3);
+ }
+ {
+ if (is_new_object4 && array4) Py_DECREF(array4);
+ }
+ {
+ if (is_new_object5 && array5) Py_DECREF(array5);
+ }
+ return NULL;
+}
+
+
+SWIGINTERN PyObject *_wrap_sa_strong_connections(PyObject *self, PyObject *args) {
+ int argc;
+ PyObject *argv[6];
+ int ii;
+
+ if (!PyTuple_Check(args)) SWIG_fail;
+ argc = PyObject_Length(args);
+ for (ii = 0; (ii < argc) && (ii < 5); ii++) {
+ argv[ii] = PyTuple_GET_ITEM(args,ii);
+ }
+ if (argc == 5) {
+ int _v;
+ {
+ int res = SWIG_AsVal_int(argv[0], NULL);
+ _v = SWIG_CheckState(res);
+ }
+ if (_v) {
+ {
+ int res = SWIG_AsVal_float(argv[1], NULL);
+ _v = SWIG_CheckState(res);
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[2]) && PyArray_CanCastSafely(PyArray_TYPE(argv[2]),PyArray_INT)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[3]) && PyArray_CanCastSafely(PyArray_TYPE(argv[3]),PyArray_INT)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[4]) && PyArray_CanCastSafely(PyArray_TYPE(argv[4]),PyArray_FLOAT)) ? 1 : 0;
+ }
+ if (_v) {
+ return _wrap_sa_strong_connections__SWIG_1(self, args);
+ }
+ }
+ }
+ }
+ }
+ }
+ if (argc == 5) {
+ int _v;
+ {
+ int res = SWIG_AsVal_int(argv[0], NULL);
+ _v = SWIG_CheckState(res);
+ }
+ if (_v) {
+ {
+ int res = SWIG_AsVal_double(argv[1], NULL);
+ _v = SWIG_CheckState(res);
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[2]) && PyArray_CanCastSafely(PyArray_TYPE(argv[2]),PyArray_INT)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[3]) && PyArray_CanCastSafely(PyArray_TYPE(argv[3]),PyArray_INT)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[4]) && PyArray_CanCastSafely(PyArray_TYPE(argv[4]),PyArray_DOUBLE)) ? 1 : 0;
+ }
+ if (_v) {
+ return _wrap_sa_strong_connections__SWIG_2(self, args);
+ }
+ }
+ }
+ }
+ }
+ }
+
+fail:
+ SWIG_SetErrorMsg(PyExc_NotImplementedError,"Wrong number of arguments for overloaded function 'sa_strong_connections'.\n Possible C/C++ prototypes are:\n sa_strong_connections<(float)>(int const,float const,int const [],int const [],float const [],std::vector<int > *,std::vector<int > *,std::vector<float > *)\n sa_strong_connections<(double)>(int const,double const,int const [],int const [],double const [],std::vector<int > *,std::vector<int > *,std::vector<double > *)\n");
+ return NULL;
+}
+
+
+SWIGINTERN PyObject *_wrap_sa_smoother__SWIG_1(PyObject *SWIGUNUSEDPARM(self), PyObject *args) {
+ PyObject *resultobj = 0;
+ int arg1 ;
+ float arg2 ;
+ int *arg3 ;
+ int *arg4 ;
+ float *arg5 ;
+ int *arg6 ;
+ int *arg7 ;
+ float *arg8 ;
+ std::vector<int > *arg9 = (std::vector<int > *) 0 ;
+ std::vector<int > *arg10 = (std::vector<int > *) 0 ;
+ std::vector<float > *arg11 = (std::vector<float > *) 0 ;
+ int val1 ;
+ int ecode1 = 0 ;
+ float val2 ;
+ int ecode2 = 0 ;
+ PyArrayObject *array3 = NULL ;
+ int is_new_object3 ;
+ PyArrayObject *array4 = NULL ;
+ int is_new_object4 ;
+ PyArrayObject *array5 = NULL ;
+ int is_new_object5 ;
+ PyArrayObject *array6 = NULL ;
+ int is_new_object6 ;
+ PyArrayObject *array7 = NULL ;
+ int is_new_object7 ;
+ PyArrayObject *array8 = NULL ;
+ int is_new_object8 ;
+ std::vector<int > *tmp9 ;
+ std::vector<int > *tmp10 ;
+ std::vector<float > *tmp11 ;
+ PyObject * obj0 = 0 ;
+ PyObject * obj1 = 0 ;
+ PyObject * obj2 = 0 ;
+ PyObject * obj3 = 0 ;
+ PyObject * obj4 = 0 ;
+ PyObject * obj5 = 0 ;
+ PyObject * obj6 = 0 ;
+ PyObject * obj7 = 0 ;
+
+ {
+ tmp9 = new std::vector<int>();
+ arg9 = tmp9;
+ }
+ {
+ tmp10 = new std::vector<int>();
+ arg10 = tmp10;
+ }
+ {
+ tmp11 = new std::vector<float>();
+ arg11 = tmp11;
+ }
+ if (!PyArg_ParseTuple(args,(char *)"OOOOOOOO:sa_smoother",&obj0,&obj1,&obj2,&obj3,&obj4,&obj5,&obj6,&obj7)) SWIG_fail;
+ ecode1 = SWIG_AsVal_int(obj0, &val1);
+ if (!SWIG_IsOK(ecode1)) {
+ SWIG_exception_fail(SWIG_ArgError(ecode1), "in method '" "sa_smoother" "', argument " "1"" of type '" "int""'");
+ }
+ arg1 = static_cast< int >(val1);
+ ecode2 = SWIG_AsVal_float(obj1, &val2);
+ if (!SWIG_IsOK(ecode2)) {
+ SWIG_exception_fail(SWIG_ArgError(ecode2), "in method '" "sa_smoother" "', argument " "2"" of type '" "float""'");
+ }
+ arg2 = static_cast< float >(val2);
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array3 = obj_to_array_contiguous_allow_conversion(obj2, PyArray_INT, &is_new_object3);
+ if (!array3 || !require_dimensions(array3,1) || !require_size(array3,size,1)) SWIG_fail;
+ arg3 = (int*) array3->data;
+ }
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array4 = obj_to_array_contiguous_allow_conversion(obj3, PyArray_INT, &is_new_object4);
+ if (!array4 || !require_dimensions(array4,1) || !require_size(array4,size,1)) SWIG_fail;
+ arg4 = (int*) array4->data;
+ }
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array5 = obj_to_array_contiguous_allow_conversion(obj4, PyArray_FLOAT, &is_new_object5);
+ if (!array5 || !require_dimensions(array5,1) || !require_size(array5,size,1)) SWIG_fail;
+ arg5 = (float*) array5->data;
+ }
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array6 = obj_to_array_contiguous_allow_conversion(obj5, PyArray_INT, &is_new_object6);
+ if (!array6 || !require_dimensions(array6,1) || !require_size(array6,size,1)) SWIG_fail;
+ arg6 = (int*) array6->data;
+ }
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array7 = obj_to_array_contiguous_allow_conversion(obj6, PyArray_INT, &is_new_object7);
+ if (!array7 || !require_dimensions(array7,1) || !require_size(array7,size,1)) SWIG_fail;
+ arg7 = (int*) array7->data;
+ }
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array8 = obj_to_array_contiguous_allow_conversion(obj7, PyArray_FLOAT, &is_new_object8);
+ if (!array8 || !require_dimensions(array8,1) || !require_size(array8,size,1)) SWIG_fail;
+ arg8 = (float*) array8->data;
+ }
+ sa_smoother<float >(arg1,arg2,(int const (*))arg3,(int const (*))arg4,(float const (*))arg5,(int const (*))arg6,(int const (*))arg7,(float const (*))arg8,arg9,arg10,arg11);
+ resultobj = SWIG_Py_Void();
+ {
+ int length = (arg9)->size();
+ PyObject *obj = PyArray_FromDims(1, &length, PyArray_INT);
+ memcpy(PyArray_DATA(obj),&((*(arg9))[0]),sizeof(int)*length);
+ delete arg9;
+ resultobj = helper_appendToTuple( resultobj, (PyObject *)obj );
+ }
+ {
+ int length = (arg10)->size();
+ PyObject *obj = PyArray_FromDims(1, &length, PyArray_INT);
+ memcpy(PyArray_DATA(obj),&((*(arg10))[0]),sizeof(int)*length);
+ delete arg10;
+ resultobj = helper_appendToTuple( resultobj, (PyObject *)obj );
+ }
+ {
+ int length = (arg11)->size();
+ PyObject *obj = PyArray_FromDims(1, &length, PyArray_FLOAT);
+ memcpy(PyArray_DATA(obj),&((*(arg11))[0]),sizeof(float)*length);
+ delete arg11;
+ resultobj = helper_appendToTuple( resultobj, (PyObject *)obj );
+ }
+ {
+ if (is_new_object3 && array3) Py_DECREF(array3);
+ }
+ {
+ if (is_new_object4 && array4) Py_DECREF(array4);
+ }
+ {
+ if (is_new_object5 && array5) Py_DECREF(array5);
+ }
+ {
+ if (is_new_object6 && array6) Py_DECREF(array6);
+ }
+ {
+ if (is_new_object7 && array7) Py_DECREF(array7);
+ }
+ {
+ if (is_new_object8 && array8) Py_DECREF(array8);
+ }
+ return resultobj;
+fail:
+ {
+ if (is_new_object3 && array3) Py_DECREF(array3);
+ }
+ {
+ if (is_new_object4 && array4) Py_DECREF(array4);
+ }
+ {
+ if (is_new_object5 && array5) Py_DECREF(array5);
+ }
+ {
+ if (is_new_object6 && array6) Py_DECREF(array6);
+ }
+ {
+ if (is_new_object7 && array7) Py_DECREF(array7);
+ }
+ {
+ if (is_new_object8 && array8) Py_DECREF(array8);
+ }
+ return NULL;
+}
+
+
+SWIGINTERN PyObject *_wrap_sa_smoother__SWIG_2(PyObject *SWIGUNUSEDPARM(self), PyObject *args) {
+ PyObject *resultobj = 0;
+ int arg1 ;
+ double arg2 ;
+ int *arg3 ;
+ int *arg4 ;
+ double *arg5 ;
+ int *arg6 ;
+ int *arg7 ;
+ double *arg8 ;
+ std::vector<int > *arg9 = (std::vector<int > *) 0 ;
+ std::vector<int > *arg10 = (std::vector<int > *) 0 ;
+ std::vector<double > *arg11 = (std::vector<double > *) 0 ;
+ int val1 ;
+ int ecode1 = 0 ;
+ double val2 ;
+ int ecode2 = 0 ;
+ PyArrayObject *array3 = NULL ;
+ int is_new_object3 ;
+ PyArrayObject *array4 = NULL ;
+ int is_new_object4 ;
+ PyArrayObject *array5 = NULL ;
+ int is_new_object5 ;
+ PyArrayObject *array6 = NULL ;
+ int is_new_object6 ;
+ PyArrayObject *array7 = NULL ;
+ int is_new_object7 ;
+ PyArrayObject *array8 = NULL ;
+ int is_new_object8 ;
+ std::vector<int > *tmp9 ;
+ std::vector<int > *tmp10 ;
+ std::vector<double > *tmp11 ;
+ PyObject * obj0 = 0 ;
+ PyObject * obj1 = 0 ;
+ PyObject * obj2 = 0 ;
+ PyObject * obj3 = 0 ;
+ PyObject * obj4 = 0 ;
+ PyObject * obj5 = 0 ;
+ PyObject * obj6 = 0 ;
+ PyObject * obj7 = 0 ;
+
+ {
+ tmp9 = new std::vector<int>();
+ arg9 = tmp9;
+ }
+ {
+ tmp10 = new std::vector<int>();
+ arg10 = tmp10;
+ }
+ {
+ tmp11 = new std::vector<double>();
+ arg11 = tmp11;
+ }
+ if (!PyArg_ParseTuple(args,(char *)"OOOOOOOO:sa_smoother",&obj0,&obj1,&obj2,&obj3,&obj4,&obj5,&obj6,&obj7)) SWIG_fail;
+ ecode1 = SWIG_AsVal_int(obj0, &val1);
+ if (!SWIG_IsOK(ecode1)) {
+ SWIG_exception_fail(SWIG_ArgError(ecode1), "in method '" "sa_smoother" "', argument " "1"" of type '" "int""'");
+ }
+ arg1 = static_cast< int >(val1);
+ ecode2 = SWIG_AsVal_double(obj1, &val2);
+ if (!SWIG_IsOK(ecode2)) {
+ SWIG_exception_fail(SWIG_ArgError(ecode2), "in method '" "sa_smoother" "', argument " "2"" of type '" "double""'");
+ }
+ arg2 = static_cast< double >(val2);
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array3 = obj_to_array_contiguous_allow_conversion(obj2, PyArray_INT, &is_new_object3);
+ if (!array3 || !require_dimensions(array3,1) || !require_size(array3,size,1)) SWIG_fail;
+ arg3 = (int*) array3->data;
+ }
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array4 = obj_to_array_contiguous_allow_conversion(obj3, PyArray_INT, &is_new_object4);
+ if (!array4 || !require_dimensions(array4,1) || !require_size(array4,size,1)) SWIG_fail;
+ arg4 = (int*) array4->data;
+ }
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array5 = obj_to_array_contiguous_allow_conversion(obj4, PyArray_DOUBLE, &is_new_object5);
+ if (!array5 || !require_dimensions(array5,1) || !require_size(array5,size,1)) SWIG_fail;
+ arg5 = (double*) array5->data;
+ }
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array6 = obj_to_array_contiguous_allow_conversion(obj5, PyArray_INT, &is_new_object6);
+ if (!array6 || !require_dimensions(array6,1) || !require_size(array6,size,1)) SWIG_fail;
+ arg6 = (int*) array6->data;
+ }
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array7 = obj_to_array_contiguous_allow_conversion(obj6, PyArray_INT, &is_new_object7);
+ if (!array7 || !require_dimensions(array7,1) || !require_size(array7,size,1)) SWIG_fail;
+ arg7 = (int*) array7->data;
+ }
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array8 = obj_to_array_contiguous_allow_conversion(obj7, PyArray_DOUBLE, &is_new_object8);
+ if (!array8 || !require_dimensions(array8,1) || !require_size(array8,size,1)) SWIG_fail;
+ arg8 = (double*) array8->data;
+ }
+ sa_smoother<double >(arg1,arg2,(int const (*))arg3,(int const (*))arg4,(double const (*))arg5,(int const (*))arg6,(int const (*))arg7,(double const (*))arg8,arg9,arg10,arg11);
+ resultobj = SWIG_Py_Void();
+ {
+ int length = (arg9)->size();
+ PyObject *obj = PyArray_FromDims(1, &length, PyArray_INT);
+ memcpy(PyArray_DATA(obj),&((*(arg9))[0]),sizeof(int)*length);
+ delete arg9;
+ resultobj = helper_appendToTuple( resultobj, (PyObject *)obj );
+ }
+ {
+ int length = (arg10)->size();
+ PyObject *obj = PyArray_FromDims(1, &length, PyArray_INT);
+ memcpy(PyArray_DATA(obj),&((*(arg10))[0]),sizeof(int)*length);
+ delete arg10;
+ resultobj = helper_appendToTuple( resultobj, (PyObject *)obj );
+ }
+ {
+ int length = (arg11)->size();
+ PyObject *obj = PyArray_FromDims(1, &length, PyArray_DOUBLE);
+ memcpy(PyArray_DATA(obj),&((*(arg11))[0]),sizeof(double)*length);
+ delete arg11;
+ resultobj = helper_appendToTuple( resultobj, (PyObject *)obj );
+ }
+ {
+ if (is_new_object3 && array3) Py_DECREF(array3);
+ }
+ {
+ if (is_new_object4 && array4) Py_DECREF(array4);
+ }
+ {
+ if (is_new_object5 && array5) Py_DECREF(array5);
+ }
+ {
+ if (is_new_object6 && array6) Py_DECREF(array6);
+ }
+ {
+ if (is_new_object7 && array7) Py_DECREF(array7);
+ }
+ {
+ if (is_new_object8 && array8) Py_DECREF(array8);
+ }
+ return resultobj;
+fail:
+ {
+ if (is_new_object3 && array3) Py_DECREF(array3);
+ }
+ {
+ if (is_new_object4 && array4) Py_DECREF(array4);
+ }
+ {
+ if (is_new_object5 && array5) Py_DECREF(array5);
+ }
+ {
+ if (is_new_object6 && array6) Py_DECREF(array6);
+ }
+ {
+ if (is_new_object7 && array7) Py_DECREF(array7);
+ }
+ {
+ if (is_new_object8 && array8) Py_DECREF(array8);
+ }
+ return NULL;
+}
+
+
+SWIGINTERN PyObject *_wrap_sa_smoother(PyObject *self, PyObject *args) {
+ int argc;
+ PyObject *argv[9];
+ int ii;
+
+ if (!PyTuple_Check(args)) SWIG_fail;
+ argc = PyObject_Length(args);
+ for (ii = 0; (ii < argc) && (ii < 8); ii++) {
+ argv[ii] = PyTuple_GET_ITEM(args,ii);
+ }
+ if (argc == 8) {
+ int _v;
+ {
+ int res = SWIG_AsVal_int(argv[0], NULL);
+ _v = SWIG_CheckState(res);
+ }
+ if (_v) {
+ {
+ int res = SWIG_AsVal_float(argv[1], NULL);
+ _v = SWIG_CheckState(res);
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[2]) && PyArray_CanCastSafely(PyArray_TYPE(argv[2]),PyArray_INT)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[3]) && PyArray_CanCastSafely(PyArray_TYPE(argv[3]),PyArray_INT)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[4]) && PyArray_CanCastSafely(PyArray_TYPE(argv[4]),PyArray_FLOAT)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[5]) && PyArray_CanCastSafely(PyArray_TYPE(argv[5]),PyArray_INT)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[6]) && PyArray_CanCastSafely(PyArray_TYPE(argv[6]),PyArray_INT)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[7]) && PyArray_CanCastSafely(PyArray_TYPE(argv[7]),PyArray_FLOAT)) ? 1 : 0;
+ }
+ if (_v) {
+ return _wrap_sa_smoother__SWIG_1(self, args);
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+ if (argc == 8) {
+ int _v;
+ {
+ int res = SWIG_AsVal_int(argv[0], NULL);
+ _v = SWIG_CheckState(res);
+ }
+ if (_v) {
+ {
+ int res = SWIG_AsVal_double(argv[1], NULL);
+ _v = SWIG_CheckState(res);
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[2]) && PyArray_CanCastSafely(PyArray_TYPE(argv[2]),PyArray_INT)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[3]) && PyArray_CanCastSafely(PyArray_TYPE(argv[3]),PyArray_INT)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[4]) && PyArray_CanCastSafely(PyArray_TYPE(argv[4]),PyArray_DOUBLE)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[5]) && PyArray_CanCastSafely(PyArray_TYPE(argv[5]),PyArray_INT)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[6]) && PyArray_CanCastSafely(PyArray_TYPE(argv[6]),PyArray_INT)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[7]) && PyArray_CanCastSafely(PyArray_TYPE(argv[7]),PyArray_DOUBLE)) ? 1 : 0;
+ }
+ if (_v) {
+ return _wrap_sa_smoother__SWIG_2(self, args);
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+
+fail:
+ SWIG_SetErrorMsg(PyExc_NotImplementedError,"Wrong number of arguments for overloaded function 'sa_smoother'.\n Possible C/C++ prototypes are:\n sa_smoother<(float)>(int const,float const,int const [],int const [],float const [],int const [],int const [],float const [],std::vector<int > *,std::vector<int > *,std::vector<float > *)\n sa_smoother<(double)>(int const,double const,int const [],int const [],double const [],int const [],int const [],double const [],std::vector<int > *,std::vector<int > *,std::vector<double > *)\n");
+ return NULL;
+}
+
+
+SWIGINTERN PyObject *_wrap_gauss_seidel__SWIG_1(PyObject *SWIGUNUSEDPARM(self), PyObject *args) {
+ PyObject *resultobj = 0;
+ int arg1 ;
+ int *arg2 ;
+ int *arg3 ;
+ float *arg4 ;
+ float *arg5 ;
+ float *arg6 ;
+ int arg7 ;
+ int arg8 ;
+ int arg9 ;
+ int val1 ;
+ int ecode1 = 0 ;
+ PyArrayObject *array2 = NULL ;
+ int is_new_object2 ;
+ PyArrayObject *array3 = NULL ;
+ int is_new_object3 ;
+ PyArrayObject *array4 = NULL ;
+ int is_new_object4 ;
+ PyArrayObject *temp5 = NULL ;
+ PyArrayObject *array6 = NULL ;
+ int is_new_object6 ;
+ int val7 ;
+ int ecode7 = 0 ;
+ int val8 ;
+ int ecode8 = 0 ;
+ int val9 ;
+ int ecode9 = 0 ;
+ PyObject * obj0 = 0 ;
+ PyObject * obj1 = 0 ;
+ PyObject * obj2 = 0 ;
+ PyObject * obj3 = 0 ;
+ PyObject * obj4 = 0 ;
+ PyObject * obj5 = 0 ;
+ PyObject * obj6 = 0 ;
+ PyObject * obj7 = 0 ;
+ PyObject * obj8 = 0 ;
+
+ if (!PyArg_ParseTuple(args,(char *)"OOOOOOOOO:gauss_seidel",&obj0,&obj1,&obj2,&obj3,&obj4,&obj5,&obj6,&obj7,&obj8)) SWIG_fail;
+ ecode1 = SWIG_AsVal_int(obj0, &val1);
+ if (!SWIG_IsOK(ecode1)) {
+ SWIG_exception_fail(SWIG_ArgError(ecode1), "in method '" "gauss_seidel" "', argument " "1"" of type '" "int""'");
+ }
+ arg1 = static_cast< int >(val1);
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array2 = obj_to_array_contiguous_allow_conversion(obj1, PyArray_INT, &is_new_object2);
+ if (!array2 || !require_dimensions(array2,1) || !require_size(array2,size,1)) SWIG_fail;
+ arg2 = (int*) array2->data;
+ }
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array3 = obj_to_array_contiguous_allow_conversion(obj2, PyArray_INT, &is_new_object3);
+ if (!array3 || !require_dimensions(array3,1) || !require_size(array3,size,1)) SWIG_fail;
+ arg3 = (int*) array3->data;
+ }
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array4 = obj_to_array_contiguous_allow_conversion(obj3, PyArray_FLOAT, &is_new_object4);
+ if (!array4 || !require_dimensions(array4,1) || !require_size(array4,size,1)) SWIG_fail;
+ arg4 = (float*) array4->data;
+ }
+ {
+ temp5 = obj_to_array_no_conversion(obj4,PyArray_FLOAT);
+ if (!temp5 || !require_contiguous(temp5)) SWIG_fail;
+ arg5 = (float*) temp5->data;
+ }
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array6 = obj_to_array_contiguous_allow_conversion(obj5, PyArray_FLOAT, &is_new_object6);
+ if (!array6 || !require_dimensions(array6,1) || !require_size(array6,size,1)) SWIG_fail;
+ arg6 = (float*) array6->data;
+ }
+ ecode7 = SWIG_AsVal_int(obj6, &val7);
+ if (!SWIG_IsOK(ecode7)) {
+ SWIG_exception_fail(SWIG_ArgError(ecode7), "in method '" "gauss_seidel" "', argument " "7"" of type '" "int""'");
+ }
+ arg7 = static_cast< int >(val7);
+ ecode8 = SWIG_AsVal_int(obj7, &val8);
+ if (!SWIG_IsOK(ecode8)) {
+ SWIG_exception_fail(SWIG_ArgError(ecode8), "in method '" "gauss_seidel" "', argument " "8"" of type '" "int""'");
+ }
+ arg8 = static_cast< int >(val8);
+ ecode9 = SWIG_AsVal_int(obj8, &val9);
+ if (!SWIG_IsOK(ecode9)) {
+ SWIG_exception_fail(SWIG_ArgError(ecode9), "in method '" "gauss_seidel" "', argument " "9"" of type '" "int""'");
+ }
+ arg9 = static_cast< int >(val9);
+ gauss_seidel<int,float >(arg1,(int const (*))arg2,(int const (*))arg3,(float const (*))arg4,arg5,(float const (*))arg6,arg7,arg8,arg9);
+ resultobj = SWIG_Py_Void();
+ {
+ if (is_new_object2 && array2) Py_DECREF(array2);
+ }
+ {
+ if (is_new_object3 && array3) Py_DECREF(array3);
+ }
+ {
+ if (is_new_object4 && array4) Py_DECREF(array4);
+ }
+ {
+ if (is_new_object6 && array6) Py_DECREF(array6);
+ }
+ return resultobj;
+fail:
+ {
+ if (is_new_object2 && array2) Py_DECREF(array2);
+ }
+ {
+ if (is_new_object3 && array3) Py_DECREF(array3);
+ }
+ {
+ if (is_new_object4 && array4) Py_DECREF(array4);
+ }
+ {
+ if (is_new_object6 && array6) Py_DECREF(array6);
+ }
+ return NULL;
+}
+
+
+SWIGINTERN PyObject *_wrap_gauss_seidel__SWIG_2(PyObject *SWIGUNUSEDPARM(self), PyObject *args) {
+ PyObject *resultobj = 0;
+ int arg1 ;
+ int *arg2 ;
+ int *arg3 ;
+ double *arg4 ;
+ double *arg5 ;
+ double *arg6 ;
+ int arg7 ;
+ int arg8 ;
+ int arg9 ;
+ int val1 ;
+ int ecode1 = 0 ;
+ PyArrayObject *array2 = NULL ;
+ int is_new_object2 ;
+ PyArrayObject *array3 = NULL ;
+ int is_new_object3 ;
+ PyArrayObject *array4 = NULL ;
+ int is_new_object4 ;
+ PyArrayObject *temp5 = NULL ;
+ PyArrayObject *array6 = NULL ;
+ int is_new_object6 ;
+ int val7 ;
+ int ecode7 = 0 ;
+ int val8 ;
+ int ecode8 = 0 ;
+ int val9 ;
+ int ecode9 = 0 ;
+ PyObject * obj0 = 0 ;
+ PyObject * obj1 = 0 ;
+ PyObject * obj2 = 0 ;
+ PyObject * obj3 = 0 ;
+ PyObject * obj4 = 0 ;
+ PyObject * obj5 = 0 ;
+ PyObject * obj6 = 0 ;
+ PyObject * obj7 = 0 ;
+ PyObject * obj8 = 0 ;
+
+ if (!PyArg_ParseTuple(args,(char *)"OOOOOOOOO:gauss_seidel",&obj0,&obj1,&obj2,&obj3,&obj4,&obj5,&obj6,&obj7,&obj8)) SWIG_fail;
+ ecode1 = SWIG_AsVal_int(obj0, &val1);
+ if (!SWIG_IsOK(ecode1)) {
+ SWIG_exception_fail(SWIG_ArgError(ecode1), "in method '" "gauss_seidel" "', argument " "1"" of type '" "int""'");
+ }
+ arg1 = static_cast< int >(val1);
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array2 = obj_to_array_contiguous_allow_conversion(obj1, PyArray_INT, &is_new_object2);
+ if (!array2 || !require_dimensions(array2,1) || !require_size(array2,size,1)) SWIG_fail;
+ arg2 = (int*) array2->data;
+ }
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array3 = obj_to_array_contiguous_allow_conversion(obj2, PyArray_INT, &is_new_object3);
+ if (!array3 || !require_dimensions(array3,1) || !require_size(array3,size,1)) SWIG_fail;
+ arg3 = (int*) array3->data;
+ }
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array4 = obj_to_array_contiguous_allow_conversion(obj3, PyArray_DOUBLE, &is_new_object4);
+ if (!array4 || !require_dimensions(array4,1) || !require_size(array4,size,1)) SWIG_fail;
+ arg4 = (double*) array4->data;
+ }
+ {
+ temp5 = obj_to_array_no_conversion(obj4,PyArray_DOUBLE);
+ if (!temp5 || !require_contiguous(temp5)) SWIG_fail;
+ arg5 = (double*) temp5->data;
+ }
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array6 = obj_to_array_contiguous_allow_conversion(obj5, PyArray_DOUBLE, &is_new_object6);
+ if (!array6 || !require_dimensions(array6,1) || !require_size(array6,size,1)) SWIG_fail;
+ arg6 = (double*) array6->data;
+ }
+ ecode7 = SWIG_AsVal_int(obj6, &val7);
+ if (!SWIG_IsOK(ecode7)) {
+ SWIG_exception_fail(SWIG_ArgError(ecode7), "in method '" "gauss_seidel" "', argument " "7"" of type '" "int""'");
+ }
+ arg7 = static_cast< int >(val7);
+ ecode8 = SWIG_AsVal_int(obj7, &val8);
+ if (!SWIG_IsOK(ecode8)) {
+ SWIG_exception_fail(SWIG_ArgError(ecode8), "in method '" "gauss_seidel" "', argument " "8"" of type '" "int""'");
+ }
+ arg8 = static_cast< int >(val8);
+ ecode9 = SWIG_AsVal_int(obj8, &val9);
+ if (!SWIG_IsOK(ecode9)) {
+ SWIG_exception_fail(SWIG_ArgError(ecode9), "in method '" "gauss_seidel" "', argument " "9"" of type '" "int""'");
+ }
+ arg9 = static_cast< int >(val9);
+ gauss_seidel<int,double >(arg1,(int const (*))arg2,(int const (*))arg3,(double const (*))arg4,arg5,(double const (*))arg6,arg7,arg8,arg9);
+ resultobj = SWIG_Py_Void();
+ {
+ if (is_new_object2 && array2) Py_DECREF(array2);
+ }
+ {
+ if (is_new_object3 && array3) Py_DECREF(array3);
+ }
+ {
+ if (is_new_object4 && array4) Py_DECREF(array4);
+ }
+ {
+ if (is_new_object6 && array6) Py_DECREF(array6);
+ }
+ return resultobj;
+fail:
+ {
+ if (is_new_object2 && array2) Py_DECREF(array2);
+ }
+ {
+ if (is_new_object3 && array3) Py_DECREF(array3);
+ }
+ {
+ if (is_new_object4 && array4) Py_DECREF(array4);
+ }
+ {
+ if (is_new_object6 && array6) Py_DECREF(array6);
+ }
+ return NULL;
+}
+
+
+SWIGINTERN PyObject *_wrap_gauss_seidel(PyObject *self, PyObject *args) {
+ int argc;
+ PyObject *argv[10];
+ int ii;
+
+ if (!PyTuple_Check(args)) SWIG_fail;
+ argc = PyObject_Length(args);
+ for (ii = 0; (ii < argc) && (ii < 9); ii++) {
+ argv[ii] = PyTuple_GET_ITEM(args,ii);
+ }
+ if (argc == 9) {
+ int _v;
+ {
+ int res = SWIG_AsVal_int(argv[0], NULL);
+ _v = SWIG_CheckState(res);
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[1]) && PyArray_CanCastSafely(PyArray_TYPE(argv[1]),PyArray_INT)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[2]) && PyArray_CanCastSafely(PyArray_TYPE(argv[2]),PyArray_INT)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[3]) && PyArray_CanCastSafely(PyArray_TYPE(argv[3]),PyArray_FLOAT)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[4]) && PyArray_CanCastSafely(PyArray_TYPE(argv[4]),PyArray_FLOAT)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[5]) && PyArray_CanCastSafely(PyArray_TYPE(argv[5]),PyArray_FLOAT)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ int res = SWIG_AsVal_int(argv[6], NULL);
+ _v = SWIG_CheckState(res);
+ }
+ if (_v) {
+ {
+ int res = SWIG_AsVal_int(argv[7], NULL);
+ _v = SWIG_CheckState(res);
+ }
+ if (_v) {
+ {
+ int res = SWIG_AsVal_int(argv[8], NULL);
+ _v = SWIG_CheckState(res);
+ }
+ if (_v) {
+ return _wrap_gauss_seidel__SWIG_1(self, args);
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+ if (argc == 9) {
+ int _v;
+ {
+ int res = SWIG_AsVal_int(argv[0], NULL);
+ _v = SWIG_CheckState(res);
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[1]) && PyArray_CanCastSafely(PyArray_TYPE(argv[1]),PyArray_INT)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[2]) && PyArray_CanCastSafely(PyArray_TYPE(argv[2]),PyArray_INT)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[3]) && PyArray_CanCastSafely(PyArray_TYPE(argv[3]),PyArray_DOUBLE)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[4]) && PyArray_CanCastSafely(PyArray_TYPE(argv[4]),PyArray_DOUBLE)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[5]) && PyArray_CanCastSafely(PyArray_TYPE(argv[5]),PyArray_DOUBLE)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ int res = SWIG_AsVal_int(argv[6], NULL);
+ _v = SWIG_CheckState(res);
+ }
+ if (_v) {
+ {
+ int res = SWIG_AsVal_int(argv[7], NULL);
+ _v = SWIG_CheckState(res);
+ }
+ if (_v) {
+ {
+ int res = SWIG_AsVal_int(argv[8], NULL);
+ _v = SWIG_CheckState(res);
+ }
+ if (_v) {
+ return _wrap_gauss_seidel__SWIG_2(self, args);
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+
+fail:
+ SWIG_SetErrorMsg(PyExc_NotImplementedError,"Wrong number of arguments for overloaded function 'gauss_seidel'.\n Possible C/C++ prototypes are:\n gauss_seidel<(int,float)>(int const,int const [],int const [],float const [],float [],float const [],int const,int const,int const)\n gauss_seidel<(int,double)>(int const,int const [],int const [],double const [],double [],double const [],int const,int const,int const)\n");
+ return NULL;
+}
+
+
+SWIGINTERN PyObject *_wrap_jacobi__SWIG_1(PyObject *SWIGUNUSEDPARM(self), PyObject *args) {
+ PyObject *resultobj = 0;
+ int arg1 ;
+ int *arg2 ;
+ int *arg3 ;
+ float *arg4 ;
+ float *arg5 ;
+ float *arg6 ;
+ float *arg7 ;
+ int arg8 ;
+ int arg9 ;
+ int arg10 ;
+ float arg11 ;
+ int val1 ;
+ int ecode1 = 0 ;
+ PyArrayObject *array2 = NULL ;
+ int is_new_object2 ;
+ PyArrayObject *array3 = NULL ;
+ int is_new_object3 ;
+ PyArrayObject *array4 = NULL ;
+ int is_new_object4 ;
+ PyArrayObject *temp5 = NULL ;
+ PyArrayObject *array6 = NULL ;
+ int is_new_object6 ;
+ PyArrayObject *temp7 = NULL ;
+ int val8 ;
+ int ecode8 = 0 ;
+ int val9 ;
+ int ecode9 = 0 ;
+ int val10 ;
+ int ecode10 = 0 ;
+ float val11 ;
+ int ecode11 = 0 ;
+ PyObject * obj0 = 0 ;
+ PyObject * obj1 = 0 ;
+ PyObject * obj2 = 0 ;
+ PyObject * obj3 = 0 ;
+ PyObject * obj4 = 0 ;
+ PyObject * obj5 = 0 ;
+ PyObject * obj6 = 0 ;
+ PyObject * obj7 = 0 ;
+ PyObject * obj8 = 0 ;
+ PyObject * obj9 = 0 ;
+ PyObject * obj10 = 0 ;
+
+ if (!PyArg_ParseTuple(args,(char *)"OOOOOOOOOOO:jacobi",&obj0,&obj1,&obj2,&obj3,&obj4,&obj5,&obj6,&obj7,&obj8,&obj9,&obj10)) SWIG_fail;
+ ecode1 = SWIG_AsVal_int(obj0, &val1);
+ if (!SWIG_IsOK(ecode1)) {
+ SWIG_exception_fail(SWIG_ArgError(ecode1), "in method '" "jacobi" "', argument " "1"" of type '" "int""'");
+ }
+ arg1 = static_cast< int >(val1);
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array2 = obj_to_array_contiguous_allow_conversion(obj1, PyArray_INT, &is_new_object2);
+ if (!array2 || !require_dimensions(array2,1) || !require_size(array2,size,1)) SWIG_fail;
+ arg2 = (int*) array2->data;
+ }
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array3 = obj_to_array_contiguous_allow_conversion(obj2, PyArray_INT, &is_new_object3);
+ if (!array3 || !require_dimensions(array3,1) || !require_size(array3,size,1)) SWIG_fail;
+ arg3 = (int*) array3->data;
+ }
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array4 = obj_to_array_contiguous_allow_conversion(obj3, PyArray_FLOAT, &is_new_object4);
+ if (!array4 || !require_dimensions(array4,1) || !require_size(array4,size,1)) SWIG_fail;
+ arg4 = (float*) array4->data;
+ }
+ {
+ temp5 = obj_to_array_no_conversion(obj4,PyArray_FLOAT);
+ if (!temp5 || !require_contiguous(temp5)) SWIG_fail;
+ arg5 = (float*) temp5->data;
+ }
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array6 = obj_to_array_contiguous_allow_conversion(obj5, PyArray_FLOAT, &is_new_object6);
+ if (!array6 || !require_dimensions(array6,1) || !require_size(array6,size,1)) SWIG_fail;
+ arg6 = (float*) array6->data;
+ }
+ {
+ temp7 = obj_to_array_no_conversion(obj6,PyArray_FLOAT);
+ if (!temp7 || !require_contiguous(temp7)) SWIG_fail;
+ arg7 = (float*) temp7->data;
+ }
+ ecode8 = SWIG_AsVal_int(obj7, &val8);
+ if (!SWIG_IsOK(ecode8)) {
+ SWIG_exception_fail(SWIG_ArgError(ecode8), "in method '" "jacobi" "', argument " "8"" of type '" "int""'");
+ }
+ arg8 = static_cast< int >(val8);
+ ecode9 = SWIG_AsVal_int(obj8, &val9);
+ if (!SWIG_IsOK(ecode9)) {
+ SWIG_exception_fail(SWIG_ArgError(ecode9), "in method '" "jacobi" "', argument " "9"" of type '" "int""'");
+ }
+ arg9 = static_cast< int >(val9);
+ ecode10 = SWIG_AsVal_int(obj9, &val10);
+ if (!SWIG_IsOK(ecode10)) {
+ SWIG_exception_fail(SWIG_ArgError(ecode10), "in method '" "jacobi" "', argument " "10"" of type '" "int""'");
+ }
+ arg10 = static_cast< int >(val10);
+ ecode11 = SWIG_AsVal_float(obj10, &val11);
+ if (!SWIG_IsOK(ecode11)) {
+ SWIG_exception_fail(SWIG_ArgError(ecode11), "in method '" "jacobi" "', argument " "11"" of type '" "float""'");
+ }
+ arg11 = static_cast< float >(val11);
+ jacobi<int,float >(arg1,(int const (*))arg2,(int const (*))arg3,(float const (*))arg4,arg5,(float const (*))arg6,arg7,arg8,arg9,arg10,arg11);
+ resultobj = SWIG_Py_Void();
+ {
+ if (is_new_object2 && array2) Py_DECREF(array2);
+ }
+ {
+ if (is_new_object3 && array3) Py_DECREF(array3);
+ }
+ {
+ if (is_new_object4 && array4) Py_DECREF(array4);
+ }
+ {
+ if (is_new_object6 && array6) Py_DECREF(array6);
+ }
+ return resultobj;
+fail:
+ {
+ if (is_new_object2 && array2) Py_DECREF(array2);
+ }
+ {
+ if (is_new_object3 && array3) Py_DECREF(array3);
+ }
+ {
+ if (is_new_object4 && array4) Py_DECREF(array4);
+ }
+ {
+ if (is_new_object6 && array6) Py_DECREF(array6);
+ }
+ return NULL;
+}
+
+
+SWIGINTERN PyObject *_wrap_jacobi__SWIG_2(PyObject *SWIGUNUSEDPARM(self), PyObject *args) {
+ PyObject *resultobj = 0;
+ int arg1 ;
+ int *arg2 ;
+ int *arg3 ;
+ double *arg4 ;
+ double *arg5 ;
+ double *arg6 ;
+ double *arg7 ;
+ int arg8 ;
+ int arg9 ;
+ int arg10 ;
+ double arg11 ;
+ int val1 ;
+ int ecode1 = 0 ;
+ PyArrayObject *array2 = NULL ;
+ int is_new_object2 ;
+ PyArrayObject *array3 = NULL ;
+ int is_new_object3 ;
+ PyArrayObject *array4 = NULL ;
+ int is_new_object4 ;
+ PyArrayObject *temp5 = NULL ;
+ PyArrayObject *array6 = NULL ;
+ int is_new_object6 ;
+ PyArrayObject *temp7 = NULL ;
+ int val8 ;
+ int ecode8 = 0 ;
+ int val9 ;
+ int ecode9 = 0 ;
+ int val10 ;
+ int ecode10 = 0 ;
+ double val11 ;
+ int ecode11 = 0 ;
+ PyObject * obj0 = 0 ;
+ PyObject * obj1 = 0 ;
+ PyObject * obj2 = 0 ;
+ PyObject * obj3 = 0 ;
+ PyObject * obj4 = 0 ;
+ PyObject * obj5 = 0 ;
+ PyObject * obj6 = 0 ;
+ PyObject * obj7 = 0 ;
+ PyObject * obj8 = 0 ;
+ PyObject * obj9 = 0 ;
+ PyObject * obj10 = 0 ;
+
+ if (!PyArg_ParseTuple(args,(char *)"OOOOOOOOOOO:jacobi",&obj0,&obj1,&obj2,&obj3,&obj4,&obj5,&obj6,&obj7,&obj8,&obj9,&obj10)) SWIG_fail;
+ ecode1 = SWIG_AsVal_int(obj0, &val1);
+ if (!SWIG_IsOK(ecode1)) {
+ SWIG_exception_fail(SWIG_ArgError(ecode1), "in method '" "jacobi" "', argument " "1"" of type '" "int""'");
+ }
+ arg1 = static_cast< int >(val1);
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array2 = obj_to_array_contiguous_allow_conversion(obj1, PyArray_INT, &is_new_object2);
+ if (!array2 || !require_dimensions(array2,1) || !require_size(array2,size,1)) SWIG_fail;
+ arg2 = (int*) array2->data;
+ }
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array3 = obj_to_array_contiguous_allow_conversion(obj2, PyArray_INT, &is_new_object3);
+ if (!array3 || !require_dimensions(array3,1) || !require_size(array3,size,1)) SWIG_fail;
+ arg3 = (int*) array3->data;
+ }
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array4 = obj_to_array_contiguous_allow_conversion(obj3, PyArray_DOUBLE, &is_new_object4);
+ if (!array4 || !require_dimensions(array4,1) || !require_size(array4,size,1)) SWIG_fail;
+ arg4 = (double*) array4->data;
+ }
+ {
+ temp5 = obj_to_array_no_conversion(obj4,PyArray_DOUBLE);
+ if (!temp5 || !require_contiguous(temp5)) SWIG_fail;
+ arg5 = (double*) temp5->data;
+ }
+ {
+ npy_intp size[1] = {
+ -1
+ };
+ array6 = obj_to_array_contiguous_allow_conversion(obj5, PyArray_DOUBLE, &is_new_object6);
+ if (!array6 || !require_dimensions(array6,1) || !require_size(array6,size,1)) SWIG_fail;
+ arg6 = (double*) array6->data;
+ }
+ {
+ temp7 = obj_to_array_no_conversion(obj6,PyArray_DOUBLE);
+ if (!temp7 || !require_contiguous(temp7)) SWIG_fail;
+ arg7 = (double*) temp7->data;
+ }
+ ecode8 = SWIG_AsVal_int(obj7, &val8);
+ if (!SWIG_IsOK(ecode8)) {
+ SWIG_exception_fail(SWIG_ArgError(ecode8), "in method '" "jacobi" "', argument " "8"" of type '" "int""'");
+ }
+ arg8 = static_cast< int >(val8);
+ ecode9 = SWIG_AsVal_int(obj8, &val9);
+ if (!SWIG_IsOK(ecode9)) {
+ SWIG_exception_fail(SWIG_ArgError(ecode9), "in method '" "jacobi" "', argument " "9"" of type '" "int""'");
+ }
+ arg9 = static_cast< int >(val9);
+ ecode10 = SWIG_AsVal_int(obj9, &val10);
+ if (!SWIG_IsOK(ecode10)) {
+ SWIG_exception_fail(SWIG_ArgError(ecode10), "in method '" "jacobi" "', argument " "10"" of type '" "int""'");
+ }
+ arg10 = static_cast< int >(val10);
+ ecode11 = SWIG_AsVal_double(obj10, &val11);
+ if (!SWIG_IsOK(ecode11)) {
+ SWIG_exception_fail(SWIG_ArgError(ecode11), "in method '" "jacobi" "', argument " "11"" of type '" "double""'");
+ }
+ arg11 = static_cast< double >(val11);
+ jacobi<int,double >(arg1,(int const (*))arg2,(int const (*))arg3,(double const (*))arg4,arg5,(double const (*))arg6,arg7,arg8,arg9,arg10,arg11);
+ resultobj = SWIG_Py_Void();
+ {
+ if (is_new_object2 && array2) Py_DECREF(array2);
+ }
+ {
+ if (is_new_object3 && array3) Py_DECREF(array3);
+ }
+ {
+ if (is_new_object4 && array4) Py_DECREF(array4);
+ }
+ {
+ if (is_new_object6 && array6) Py_DECREF(array6);
+ }
+ return resultobj;
+fail:
+ {
+ if (is_new_object2 && array2) Py_DECREF(array2);
+ }
+ {
+ if (is_new_object3 && array3) Py_DECREF(array3);
+ }
+ {
+ if (is_new_object4 && array4) Py_DECREF(array4);
+ }
+ {
+ if (is_new_object6 && array6) Py_DECREF(array6);
+ }
+ return NULL;
+}
+
+
+SWIGINTERN PyObject *_wrap_jacobi(PyObject *self, PyObject *args) {
+ int argc;
+ PyObject *argv[12];
+ int ii;
+
+ if (!PyTuple_Check(args)) SWIG_fail;
+ argc = PyObject_Length(args);
+ for (ii = 0; (ii < argc) && (ii < 11); ii++) {
+ argv[ii] = PyTuple_GET_ITEM(args,ii);
+ }
+ if (argc == 11) {
+ int _v;
+ {
+ int res = SWIG_AsVal_int(argv[0], NULL);
+ _v = SWIG_CheckState(res);
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[1]) && PyArray_CanCastSafely(PyArray_TYPE(argv[1]),PyArray_INT)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[2]) && PyArray_CanCastSafely(PyArray_TYPE(argv[2]),PyArray_INT)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[3]) && PyArray_CanCastSafely(PyArray_TYPE(argv[3]),PyArray_FLOAT)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[4]) && PyArray_CanCastSafely(PyArray_TYPE(argv[4]),PyArray_FLOAT)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[5]) && PyArray_CanCastSafely(PyArray_TYPE(argv[5]),PyArray_FLOAT)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[6]) && PyArray_CanCastSafely(PyArray_TYPE(argv[6]),PyArray_FLOAT)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ int res = SWIG_AsVal_int(argv[7], NULL);
+ _v = SWIG_CheckState(res);
+ }
+ if (_v) {
+ {
+ int res = SWIG_AsVal_int(argv[8], NULL);
+ _v = SWIG_CheckState(res);
+ }
+ if (_v) {
+ {
+ int res = SWIG_AsVal_int(argv[9], NULL);
+ _v = SWIG_CheckState(res);
+ }
+ if (_v) {
+ {
+ int res = SWIG_AsVal_float(argv[10], NULL);
+ _v = SWIG_CheckState(res);
+ }
+ if (_v) {
+ return _wrap_jacobi__SWIG_1(self, args);
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+ if (argc == 11) {
+ int _v;
+ {
+ int res = SWIG_AsVal_int(argv[0], NULL);
+ _v = SWIG_CheckState(res);
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[1]) && PyArray_CanCastSafely(PyArray_TYPE(argv[1]),PyArray_INT)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[2]) && PyArray_CanCastSafely(PyArray_TYPE(argv[2]),PyArray_INT)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[3]) && PyArray_CanCastSafely(PyArray_TYPE(argv[3]),PyArray_DOUBLE)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[4]) && PyArray_CanCastSafely(PyArray_TYPE(argv[4]),PyArray_DOUBLE)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[5]) && PyArray_CanCastSafely(PyArray_TYPE(argv[5]),PyArray_DOUBLE)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ _v = (is_array(argv[6]) && PyArray_CanCastSafely(PyArray_TYPE(argv[6]),PyArray_DOUBLE)) ? 1 : 0;
+ }
+ if (_v) {
+ {
+ int res = SWIG_AsVal_int(argv[7], NULL);
+ _v = SWIG_CheckState(res);
+ }
+ if (_v) {
+ {
+ int res = SWIG_AsVal_int(argv[8], NULL);
+ _v = SWIG_CheckState(res);
+ }
+ if (_v) {
+ {
+ int res = SWIG_AsVal_int(argv[9], NULL);
+ _v = SWIG_CheckState(res);
+ }
+ if (_v) {
+ {
+ int res = SWIG_AsVal_double(argv[10], NULL);
+ _v = SWIG_CheckState(res);
+ }
+ if (_v) {
+ return _wrap_jacobi__SWIG_2(self, args);
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+ }
+
+fail:
+ SWIG_SetErrorMsg(PyExc_NotImplementedError,"Wrong number of arguments for overloaded function 'jacobi'.\n Possible C/C++ prototypes are:\n jacobi<(int,float)>(int const,int const [],int const [],float const [],float [],float const [],float [],int const,int const,int const,float const)\n jacobi<(int,double)>(int const,int const [],int const [],double const [],double [],double const [],double [],int const,int const,int const,double const)\n");
+ return NULL;
+}
+
+
+static PyMethodDef SwigMethods[] = {
+ { (char *)"sa_get_aggregates", _wrap_sa_get_aggregates, METH_VARARGS, (char *)"sa_get_aggregates(int n_row, int Ap, int Aj, std::vector<(int)> Bj)"},
+ { (char *)"rs_strong_connections", _wrap_rs_strong_connections, METH_VARARGS, (char *)"\n"
+ "rs_strong_connections(int n_row, float theta, int Ap, int Aj, float Ax, std::vector<(int)> Sp, \n"
+ " std::vector<(int)> Sj, \n"
+ " std::vector<(float)> Sx)\n"
+ "rs_strong_connections(int n_row, double theta, int Ap, int Aj, double Ax, \n"
+ " std::vector<(int)> Sp, std::vector<(int)> Sj, \n"
+ " std::vector<(double)> Sx)\n"
+ ""},
+ { (char *)"rs_interpolation", _wrap_rs_interpolation, METH_VARARGS, (char *)"\n"
+ "rs_interpolation(int n_nodes, int Ap, int Aj, float Ax, int Sp, int Sj, \n"
+ " float Sx, int Tp, int Tj, float Tx, std::vector<(int)> Bp, \n"
+ " std::vector<(int)> Bj, std::vector<(float)> Bx)\n"
+ "rs_interpolation(int n_nodes, int Ap, int Aj, double Ax, int Sp, int Sj, \n"
+ " double Sx, int Tp, int Tj, double Tx, std::vector<(int)> Bp, \n"
+ " std::vector<(int)> Bj, std::vector<(double)> Bx)\n"
+ ""},
+ { (char *)"sa_strong_connections", _wrap_sa_strong_connections, METH_VARARGS, (char *)"\n"
+ "sa_strong_connections(int n_row, float epsilon, int Ap, int Aj, float Ax, \n"
+ " std::vector<(int)> Sp, std::vector<(int)> Sj, \n"
+ " std::vector<(float)> Sx)\n"
+ "sa_strong_connections(int n_row, double epsilon, int Ap, int Aj, double Ax, \n"
+ " std::vector<(int)> Sp, std::vector<(int)> Sj, \n"
+ " std::vector<(double)> Sx)\n"
+ ""},
+ { (char *)"sa_smoother", _wrap_sa_smoother, METH_VARARGS, (char *)"\n"
+ "sa_smoother(int n_row, float omega, int Ap, int Aj, float Ax, int Sp, \n"
+ " int Sj, float Sx, std::vector<(int)> Bp, \n"
+ " std::vector<(int)> Bj, std::vector<(float)> Bx)\n"
+ "sa_smoother(int n_row, double omega, int Ap, int Aj, double Ax, \n"
+ " int Sp, int Sj, double Sx, std::vector<(int)> Bp, \n"
+ " std::vector<(int)> Bj, std::vector<(double)> Bx)\n"
+ ""},
+ { (char *)"gauss_seidel", _wrap_gauss_seidel, METH_VARARGS, (char *)"\n"
+ "gauss_seidel(int n_row, int Ap, int Aj, float Ax, float x, float b, \n"
+ " int row_start, int row_stop, int row_step)\n"
+ "gauss_seidel(int n_row, int Ap, int Aj, double Ax, double x, double b, \n"
+ " int row_start, int row_stop, int row_step)\n"
+ ""},
+ { (char *)"jacobi", _wrap_jacobi, METH_VARARGS, (char *)"\n"
+ "jacobi(int n_row, int Ap, int Aj, float Ax, float x, float b, \n"
+ " float temp, int row_start, int row_stop, \n"
+ " int row_step, float omega)\n"
+ "jacobi(int n_row, int Ap, int Aj, double Ax, double x, double b, \n"
+ " double temp, int row_start, int row_stop, \n"
+ " int row_step, double omega)\n"
+ ""},
+ { NULL, NULL, 0, NULL }
+};
+
+
+/* -------- TYPE CONVERSION AND EQUIVALENCE RULES (BEGIN) -------- */
+
+static swig_type_info _swigt__p_char = {"_p_char", "char *", 0, 0, (void*)0, 0};
+static swig_type_info _swigt__p_std__vectorTdouble_t = {"_p_std__vectorTdouble_t", "std::vector<double > *", 0, 0, (void*)0, 0};
+static swig_type_info _swigt__p_std__vectorTfloat_t = {"_p_std__vectorTfloat_t", "std::vector<float > *", 0, 0, (void*)0, 0};
+static swig_type_info _swigt__p_std__vectorTint_t = {"_p_std__vectorTint_t", "std::vector<int > *", 0, 0, (void*)0, 0};
+
+static swig_type_info *swig_type_initial[] = {
+ &_swigt__p_char,
+ &_swigt__p_std__vectorTdouble_t,
+ &_swigt__p_std__vectorTfloat_t,
+ &_swigt__p_std__vectorTint_t,
+};
+
+static swig_cast_info _swigc__p_char[] = { {&_swigt__p_char, 0, 0, 0},{0, 0, 0, 0}};
+static swig_cast_info _swigc__p_std__vectorTdouble_t[] = { {&_swigt__p_std__vectorTdouble_t, 0, 0, 0},{0, 0, 0, 0}};
+static swig_cast_info _swigc__p_std__vectorTfloat_t[] = { {&_swigt__p_std__vectorTfloat_t, 0, 0, 0},{0, 0, 0, 0}};
+static swig_cast_info _swigc__p_std__vectorTint_t[] = { {&_swigt__p_std__vectorTint_t, 0, 0, 0},{0, 0, 0, 0}};
+
+static swig_cast_info *swig_cast_initial[] = {
+ _swigc__p_char,
+ _swigc__p_std__vectorTdouble_t,
+ _swigc__p_std__vectorTfloat_t,
+ _swigc__p_std__vectorTint_t,
+};
+
+
+/* -------- TYPE CONVERSION AND EQUIVALENCE RULES (END) -------- */
+
+static swig_const_info swig_const_table[] = {
+{0, 0, 0, 0.0, 0, 0}};
+
+#ifdef __cplusplus
+}
+#endif
+/* -----------------------------------------------------------------------------
+ * 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;
+
+ clientdata = clientdata;
+
+ /* 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;
+ }
+
+ /* 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;
+ }
+
+ /* 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
+
+ /* Python-specific SWIG API */
+#define SWIG_newvarlink() SWIG_Python_newvarlink()
+#define SWIG_addvarlink(p, name, get_attr, set_attr) SWIG_Python_addvarlink(p, name, get_attr, set_attr)
+#define SWIG_InstallConstants(d, constants) SWIG_Python_InstallConstants(d, constants)
+
+ /* -----------------------------------------------------------------------------
+ * global variable support code.
+ * ----------------------------------------------------------------------------- */
+
+ typedef struct swig_globalvar {
+ char *name; /* Name of global variable */
+ PyObject *(*get_attr)(void); /* Return the current value */
+ int (*set_attr)(PyObject *); /* Set the value */
+ struct swig_globalvar *next;
+ } swig_globalvar;
+
+ typedef struct swig_varlinkobject {
+ PyObject_HEAD
+ swig_globalvar *vars;
+ } swig_varlinkobject;
+
+ SWIGINTERN PyObject *
+ swig_varlink_repr(swig_varlinkobject *SWIGUNUSEDPARM(v)) {
+ return PyString_FromString("<Swig global variables>");
+ }
+
+ SWIGINTERN PyObject *
+ swig_varlink_str(swig_varlinkobject *v) {
+ PyObject *str = PyString_FromString("(");
+ swig_globalvar *var;
+ for (var = v->vars; var; var=var->next) {
+ PyString_ConcatAndDel(&str,PyString_FromString(var->name));
+ if (var->next) PyString_ConcatAndDel(&str,PyString_FromString(", "));
+ }
+ PyString_ConcatAndDel(&str,PyString_FromString(")"));
+ return str;
+ }
+
+ SWIGINTERN int
+ swig_varlink_print(swig_varlinkobject *v, FILE *fp, int SWIGUNUSEDPARM(flags)) {
+ PyObject *str = swig_varlink_str(v);
+ fprintf(fp,"Swig global variables ");
+ fprintf(fp,"%s\n", PyString_AsString(str));
+ Py_DECREF(str);
+ return 0;
+ }
+
+ SWIGINTERN void
+ swig_varlink_dealloc(swig_varlinkobject *v) {
+ swig_globalvar *var = v->vars;
+ while (var) {
+ swig_globalvar *n = var->next;
+ free(var->name);
+ free(var);
+ var = n;
+ }
+ }
+
+ SWIGINTERN PyObject *
+ swig_varlink_getattr(swig_varlinkobject *v, char *n) {
+ PyObject *res = NULL;
+ swig_globalvar *var = v->vars;
+ while (var) {
+ if (strcmp(var->name,n) == 0) {
+ res = (*var->get_attr)();
+ break;
+ }
+ var = var->next;
+ }
+ if (res == NULL && !PyErr_Occurred()) {
+ PyErr_SetString(PyExc_NameError,"Unknown C global variable");
+ }
+ return res;
+ }
+
+ SWIGINTERN int
+ swig_varlink_setattr(swig_varlinkobject *v, char *n, PyObject *p) {
+ int res = 1;
+ swig_globalvar *var = v->vars;
+ while (var) {
+ if (strcmp(var->name,n) == 0) {
+ res = (*var->set_attr)(p);
+ break;
+ }
+ var = var->next;
+ }
+ if (res == 1 && !PyErr_Occurred()) {
+ PyErr_SetString(PyExc_NameError,"Unknown C global variable");
+ }
+ return res;
+ }
+
+ SWIGINTERN PyTypeObject*
+ swig_varlink_type(void) {
+ static char varlink__doc__[] = "Swig var link object";
+ static PyTypeObject varlink_type;
+ static int type_init = 0;
+ if (!type_init) {
+ const PyTypeObject tmp
+ = {
+ PyObject_HEAD_INIT(NULL)
+ 0, /* Number of items in variable part (ob_size) */
+ (char *)"swigvarlink", /* Type name (tp_name) */
+ sizeof(swig_varlinkobject), /* Basic size (tp_basicsize) */
+ 0, /* Itemsize (tp_itemsize) */
+ (destructor) swig_varlink_dealloc, /* Deallocator (tp_dealloc) */
+ (printfunc) swig_varlink_print, /* Print (tp_print) */
+ (getattrfunc) swig_varlink_getattr, /* get attr (tp_getattr) */
+ (setattrfunc) swig_varlink_setattr, /* Set attr (tp_setattr) */
+ 0, /* tp_compare */
+ (reprfunc) swig_varlink_repr, /* tp_repr */
+ 0, /* tp_as_number */
+ 0, /* tp_as_sequence */
+ 0, /* tp_as_mapping */
+ 0, /* tp_hash */
+ 0, /* tp_call */
+ (reprfunc)swig_varlink_str, /* tp_str */
+ 0, /* tp_getattro */
+ 0, /* tp_setattro */
+ 0, /* tp_as_buffer */
+ 0, /* tp_flags */
+ varlink__doc__, /* tp_doc */
+ 0, /* tp_traverse */
+ 0, /* tp_clear */
+ 0, /* tp_richcompare */
+ 0, /* tp_weaklistoffset */
+#if PY_VERSION_HEX >= 0x02020000
+ 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, /* tp_iter -> tp_weaklist */
+#endif
+#if PY_VERSION_HEX >= 0x02030000
+ 0, /* tp_del */
+#endif
+#ifdef COUNT_ALLOCS
+ 0,0,0,0 /* tp_alloc -> tp_next */
+#endif
+ };
+ varlink_type = tmp;
+ varlink_type.ob_type = &PyType_Type;
+ type_init = 1;
+ }
+ return &varlink_type;
+ }
+
+ /* Create a variable linking object for use later */
+ SWIGINTERN PyObject *
+ SWIG_Python_newvarlink(void) {
+ swig_varlinkobject *result = PyObject_NEW(swig_varlinkobject, swig_varlink_type());
+ if (result) {
+ result->vars = 0;
+ }
+ return ((PyObject*) result);
+ }
+
+ SWIGINTERN void
+ SWIG_Python_addvarlink(PyObject *p, char *name, PyObject *(*get_attr)(void), int (*set_attr)(PyObject *p)) {
+ swig_varlinkobject *v = (swig_varlinkobject *) p;
+ swig_globalvar *gv = (swig_globalvar *) malloc(sizeof(swig_globalvar));
+ if (gv) {
+ size_t size = strlen(name)+1;
+ gv->name = (char *)malloc(size);
+ if (gv->name) {
+ strncpy(gv->name,name,size);
+ gv->get_attr = get_attr;
+ gv->set_attr = set_attr;
+ gv->next = v->vars;
+ }
+ }
+ v->vars = gv;
+ }
+
+ SWIGINTERN PyObject *
+ SWIG_globals(void) {
+ static PyObject *_SWIG_globals = 0;
+ if (!_SWIG_globals) _SWIG_globals = SWIG_newvarlink();
+ return _SWIG_globals;
+ }
+
+ /* -----------------------------------------------------------------------------
+ * constants/methods manipulation
+ * ----------------------------------------------------------------------------- */
+
+ /* Install Constants */
+ SWIGINTERN void
+ SWIG_Python_InstallConstants(PyObject *d, swig_const_info constants[]) {
+ PyObject *obj = 0;
+ size_t i;
+ for (i = 0; constants[i].type; ++i) {
+ switch(constants[i].type) {
+ case SWIG_PY_POINTER:
+ obj = SWIG_NewPointerObj(constants[i].pvalue, *(constants[i]).ptype,0);
+ break;
+ case SWIG_PY_BINARY:
+ obj = SWIG_NewPackedObj(constants[i].pvalue, constants[i].lvalue, *(constants[i].ptype));
+ break;
+ default:
+ obj = 0;
+ break;
+ }
+ if (obj) {
+ PyDict_SetItemString(d, constants[i].name, obj);
+ Py_DECREF(obj);
+ }
+ }
+ }
+
+ /* -----------------------------------------------------------------------------*/
+ /* Fix SwigMethods to carry the callback ptrs when needed */
+ /* -----------------------------------------------------------------------------*/
+
+ SWIGINTERN void
+ SWIG_Python_FixMethods(PyMethodDef *methods,
+ swig_const_info *const_table,
+ swig_type_info **types,
+ swig_type_info **types_initial) {
+ size_t i;
+ for (i = 0; methods[i].ml_name; ++i) {
+ const char *c = methods[i].ml_doc;
+ if (c && (c = strstr(c, "swig_ptr: "))) {
+ int j;
+ swig_const_info *ci = 0;
+ const char *name = c + 10;
+ for (j = 0; const_table[j].type; ++j) {
+ if (strncmp(const_table[j].name, name,
+ strlen(const_table[j].name)) == 0) {
+ ci = &(const_table[j]);
+ break;
+ }
+ }
+ if (ci) {
+ size_t shift = (ci->ptype) - types;
+ swig_type_info *ty = types_initial[shift];
+ size_t ldoc = (c - methods[i].ml_doc);
+ size_t lptr = strlen(ty->name)+2*sizeof(void*)+2;
+ char *ndoc = (char*)malloc(ldoc + lptr + 10);
+ if (ndoc) {
+ char *buff = ndoc;
+ void *ptr = (ci->type == SWIG_PY_POINTER) ? ci->pvalue : 0;
+ if (ptr) {
+ strncpy(buff, methods[i].ml_doc, ldoc);
+ buff += ldoc;
+ strncpy(buff, "swig_ptr: ", 10);
+ buff += 10;
+ SWIG_PackVoidPtr(buff, ptr, ty->name, lptr);
+ methods[i].ml_doc = ndoc;
+ }
+ }
+ }
+ }
+ }
+ }
+
+#ifdef __cplusplus
+}
+#endif
+
+/* -----------------------------------------------------------------------------*
+ * Partial Init method
+ * -----------------------------------------------------------------------------*/
+
+#ifdef __cplusplus
+extern "C"
+#endif
+SWIGEXPORT void SWIG_init(void) {
+ PyObject *m, *d;
+
+ /* Fix SwigMethods to carry the callback ptrs when needed */
+ SWIG_Python_FixMethods(SwigMethods, swig_const_table, swig_types, swig_type_initial);
+
+ m = Py_InitModule((char *) SWIG_name, SwigMethods);
+ d = PyModule_GetDict(m);
+
+ SWIG_InitializeModule(0);
+ SWIG_InstallConstants(d,swig_const_table);
+
+
+
+ import_array();
+
+ SWIG_Python_SetConstant(d, "U_NODE",SWIG_From_int(static_cast< int >(U_NODE)));
+ SWIG_Python_SetConstant(d, "C_NODE",SWIG_From_int(static_cast< int >(C_NODE)));
+ SWIG_Python_SetConstant(d, "F_NODE",SWIG_From_int(static_cast< int >(F_NODE)));
+}
+
Added: trunk/Lib/sandbox/multigrid/multigridtools/ruge_stuben.h
===================================================================
--- trunk/Lib/sandbox/multigrid/multigridtools/ruge_stuben.h 2007-07-10 17:36:06 UTC (rev 3157)
+++ trunk/Lib/sandbox/multigrid/multigridtools/ruge_stuben.h 2007-07-11 05:14:36 UTC (rev 3158)
@@ -0,0 +1,387 @@
+#ifndef RUGE_STUBEN_H
+#define RUGE_STUBEN_H
+
+#include <iostream>
+#include <vector>
+#include <iterator>
+#include <assert.h>
+
+
+//this will increase the complexity greatly!
+//#define DEBUG
+
+enum NodeType {U_NODE, C_NODE, F_NODE};
+
+
+template<class T>
+void rs_strong_connections(const int n_row,
+ const T theta,
+ const int Ap[], const int Aj[], const T Ax[],
+ std::vector<int> * Sp, std::vector<int> * Sj, std::vector<T> * Sx){
+ //Sp,Sj form a CSR representation where the i-th row contains
+ //the indices of all the strong connections from node i
+ Sp->push_back(0);
+
+ //Compute lambdas for each node
+ for(int i = 0; i < n_row; i++){
+ T min_offdiagonal = 0.0;
+
+ int row_start = Ap[i];
+ int row_end = Ap[i+1];
+ for(int jj = row_start; jj < row_end; jj++){
+ min_offdiagonal = std::min(min_offdiagonal,Ax[jj]); //assumes diagonal is positive!
+ }
+
+ T threshold = theta*min_offdiagonal;
+ for(int jj = row_start; jj < row_end; jj++){
+ if(Ax[jj] < threshold){
+ Sj->push_back(Aj[jj]);
+ Sx->push_back(Ax[jj]);
+ }
+ }
+
+ Sp->push_back(Sj->size());
+ }
+}
+
+
+
+
+template<class T>
+void rs_interpolation(const int n_nodes,
+ const int Ap[], const int Aj[], const T Ax[],
+ const int Sp[], const int Sj[], const T Sx[],
+ const int Tp[], const int Tj[], const T Tx[],
+ std::vector<int> * Bp, std::vector<int> * Bj, std::vector<T> * Bx){
+
+ std::vector<int> lambda(n_nodes,0);
+
+ //compute lambdas
+ for(int i = 0; i < n_nodes; i++){
+ lambda[i] = Tp[i+1] - Tp[i];
+ }
+
+
+ //for each value of lambda, create an interval of nodes with that value
+ // ptr - is the first index of the interval
+ // count - is the number of indices in that interval
+ // index to node - the node located at a given index
+ // node to index - the index of a given node
+ std::vector<int> interval_ptr(n_nodes,0);
+ std::vector<int> interval_count(n_nodes,0);
+ std::vector<int> index_to_node(n_nodes);
+ std::vector<int> node_to_index(n_nodes);
+
+ for(int i = 0; i < n_nodes; i++){
+ interval_count[lambda[i]]++;
+ }
+ for(int i = 0, cumsum = 0; i < n_nodes; i++){
+ interval_ptr[i] = cumsum;
+ cumsum += interval_count[i];
+ interval_count[i] = 0;
+ }
+ for(int i = 0; i < n_nodes; i++){
+ int lambda_i = lambda[i];
+ int index = interval_ptr[lambda_i]+interval_count[lambda_i];
+ index_to_node[index] = i;
+ node_to_index[i] = index;
+ interval_count[lambda_i]++;
+ }
+
+
+
+
+
+ std::vector<NodeType> NodeSets(n_nodes,U_NODE);
+
+ //Now add elements to C and F, in decending order of lambda
+ for(int top_index = n_nodes - 1; top_index > -1; top_index--){
+ int i = index_to_node[top_index];
+ int lambda_i = lambda[i];
+#ifdef DEBUG
+ {
+#ifdef DEBUG_PRINT
+ std::cout << "top_index " << top_index << std::endl;
+ std::cout << "i " << i << std::endl;
+ std::cout << "lambda_i " << lambda_i << std::endl;
+
+ for(int i = 0; i < n_nodes; i++){
+ std::cout << i << "=";
+ if(NodeSets[i] == U_NODE)
+ std::cout << "U";
+ else if(NodeSets[i] == F_NODE)
+ std::cout << "F";
+ else
+ std::cout << "C";
+ std::cout << " ";
+ }
+ std::cout << std::endl;
+
+ std::cout << "node_to_index" << std::endl;
+ for(int i = 0; i < n_nodes; i++){
+ std::cout << i << "->" << node_to_index[i] << " ";
+ }
+ std::cout << std::endl;
+ std::cout << "index_to_node" << std::endl;
+ for(int i = 0; i < n_nodes; i++){
+ std::cout << i << "->" << index_to_node[i] << " ";
+ }
+ std::cout << std::endl;
+
+ std::cout << "interval_count ";
+ for(int i = 0; i < n_nodes; i++){
+ std::cout << interval_count[i] << " ";
+ }
+ std::cout << std::endl;
+#endif
+
+ //make sure arrays are correct
+ for(int n = 0; n < n_nodes; n++){
+ assert(index_to_node[node_to_index[n]] == n);
+ }
+
+ //make sure intervals are reasonable
+ int sum_intervals = 0;
+ for(int n = 0; n < n_nodes; n++){
+ assert(interval_count[n] >= 0);
+ if(interval_count[n] > 0){
+ assert(interval_ptr[n] == sum_intervals);
+ }
+ sum_intervals += interval_count[n];
+ }
+ assert(sum_intervals == top_index+1);
+
+
+ if(interval_count[lambda_i] <= 0){
+ std::cout << "top_index " << top_index << std::endl;
+ std::cout << "lambda_i " << lambda_i << std::endl;
+ std::cout << "interval_count[lambda_i] " << interval_count[lambda_i] << std::endl;
+ std::cout << "top_index " << top_index << std::endl;
+ std::cout << "i " << i << std::endl;
+ std::cout << "lambda_i " << lambda_i << std::endl;
+ }
+
+
+ for(int n = 0; n <= top_index; n++){
+ assert(NodeSets[index_to_node[n]] != C_NODE);
+ }
+ }
+ assert(node_to_index[i] == top_index);
+ assert(interval_ptr[lambda_i] + interval_count[lambda_i] - 1 == top_index);
+ //max interval should have at least one element
+ assert(interval_count[lambda_i] > 0);
+#endif
+
+
+ //remove i from its interval
+ interval_count[lambda_i]--;
+
+
+ if(NodeSets[i] == F_NODE){
+ continue;
+ } else {
+ assert(NodeSets[i] == U_NODE);
+
+ NodeSets[i] = C_NODE;
+
+ //For each j in S^T_i /\ U
+ for(int jj = Tp[i]; jj < Tp[i+1]; jj++){
+ int j = Tj[jj];
+
+ if(NodeSets[j] == U_NODE){
+ NodeSets[j] = F_NODE;
+
+ //For each k in S_j /\ U
+ for(int kk = Sp[j]; kk < Sp[j+1]; kk++){
+ int k = Sj[kk];
+
+ if(NodeSets[k] == U_NODE){
+ //move k to the end of its current interval
+ assert(lambda[j] < n_nodes - 1);//this would cause problems!
+
+ int lambda_k = lambda[k];
+ int old_pos = node_to_index[k];
+ int new_pos = interval_ptr[lambda_k] + interval_count[lambda_k] - 1;
+
+ node_to_index[index_to_node[old_pos]] = new_pos;
+ node_to_index[index_to_node[new_pos]] = old_pos;
+ std::swap(index_to_node[old_pos],index_to_node[new_pos]);
+
+ //update intervals
+ interval_count[lambda_k] -= 1;
+ interval_count[lambda_k+1] += 1;
+ interval_ptr[lambda_k+1] = new_pos;
+
+ //increment lambda_k
+ lambda[k]++;
+
+#ifdef DEBUG
+ assert(interval_count[lambda_k] >= 0);
+ assert(interval_count[lambda_k+1] > 0);
+ assert(interval_ptr[lambda[k]] <= node_to_index[k]);
+ assert(node_to_index[k] < interval_ptr[lambda[k]] + interval_count[lambda[k]]);
+#endif
+ }
+ }
+ }
+ }
+
+ //For each j in S_i /\ U
+ for(int jj = Sp[i]; jj < Sp[i+1]; jj++){
+ int j = Sj[jj];
+ if(NodeSets[j] == U_NODE){ //decrement lambda for node j
+ assert(lambda[j] > 0);//this would cause problems!
+
+ //move j to the beginning of its current interval
+ int lambda_j = lambda[j];
+ int old_pos = node_to_index[j];
+ int new_pos = interval_ptr[lambda_j];
+
+ node_to_index[index_to_node[old_pos]] = new_pos;
+ node_to_index[index_to_node[new_pos]] = old_pos;
+ std::swap(index_to_node[old_pos],index_to_node[new_pos]);
+
+ //update intervals
+ interval_count[lambda_j] -= 1;
+ interval_count[lambda_j-1] += 1;
+ interval_ptr[lambda_j] += 1;
+ interval_ptr[lambda_j-1] = interval_ptr[lambda_j] - interval_count[lambda_j-1];
+
+ //decrement lambda_j
+ lambda[j]--;
+
+#ifdef DEBUG
+ assert(interval_count[lambda_j] >= 0);
+ assert(interval_count[lambda_j-1] > 0);
+ assert(interval_ptr[lambda[j]] <= node_to_index[j]);
+ assert(node_to_index[j] < interval_ptr[lambda[j]] + interval_count[lambda[j]]);
+#endif
+ }
+ }
+ }
+ }
+
+
+
+
+#ifdef DEBUG
+ //make sure each f-node has at least one strong c-node neighbor
+ for(int i = 0; i < n_nodes; i++){
+ if(NodeSets[i] == F_NODE){
+ int row_start = Sp[i];
+ int row_end = Sp[i+1];
+ bool has_c_neighbor = false;
+ for(int jj = row_start; jj < row_end; jj++){
+ if(NodeSets[Sj[jj]] == C_NODE){
+ has_c_neighbor = true;
+ break;
+ }
+ }
+ assert(has_c_neighbor);
+ }
+ }
+#endif
+
+ //Now construct interpolation operator
+ std::vector<T> d_k(n_nodes,0);
+ std::vector<bool> C_i(n_nodes,0);
+ Bp->push_back(0);
+ for(int i = 0; i < n_nodes; i++){
+ if(NodeSets[i] == C_NODE){
+ //interpolate directly
+ Bj->push_back(i);
+ Bx->push_back(1);
+ Bp->push_back(Bj->size());
+ } else {
+ //F_NODE
+
+ //Step 4
+ T d_i = 0; //denominator for this row
+ for(int jj = Ap[i]; jj < Ap[i+1]; jj++){ d_i += Ax[jj]; }
+ for(int jj = Sp[i]; jj < Sp[i+1]; jj++){ d_i -= Sx[jj]; }
+
+ //Create C_i, initialize d_k
+ for(int jj = Sp[i]; jj < Sp[i+1]; jj++){
+ int j = Sj[jj];
+ if(NodeSets[j] == C_NODE){
+ C_i[j] = true;
+ d_k[j] = Sx[jj];
+ }
+ }
+
+ bool Sj_intersects_Ci = true; //in the case that i has no F-neighbors
+ for(int jj = Sp[i]; jj < Sp[i+1]; jj++){ //for j in D^s_i
+ int j = Sj[jj];
+ T a_ij = Sx[jj];
+ T a_jl = 0;
+
+ if(NodeSets[j] != F_NODE){continue;}
+
+ //Step 5
+ Sj_intersects_Ci = false;
+
+ //compute sum a_jl
+ for(int ll = Sp[j]; ll < Sp[j+1]; ll++){
+ if(C_i[Sj[ll]]){
+ Sj_intersects_Ci = true;
+ a_jl += Sx[ll];
+ }
+ }
+
+ if(!Sj_intersects_Ci){ break; }
+
+ for(int kk = Sp[j]; kk < Sp[j+1]; kk++){
+ int k = Sj[kk];
+ T a_jk = Sx[kk];
+ if(C_i[k]){
+ d_k[k] += a_ij*a_jk / a_jl;
+ }
+ }
+ }
+
+ //Step 6
+ if(Sj_intersects_Ci){
+ for(int jj = Sp[i]; jj < Sp[i+1]; jj++){
+ int j = Sj[jj];
+ if(NodeSets[j] == C_NODE){
+ Bj->push_back(j);
+ Bx->push_back(-d_k[j]/d_i);
+ }
+ }
+ Bp->push_back(Bj->size());
+ } else { //make i a C_NODE
+ NodeSets[i] = C_NODE;
+ Bj->push_back(i);
+ Bx->push_back(1);
+ Bp->push_back(Bj->size());
+ }
+
+
+ //Clear C_i,d_k
+ for(int jj = Sp[i]; jj < Sp[i+1]; jj++){
+ int j = Sj[jj];
+ C_i[j] = false;
+ d_k[j] = 0;
+ }
+
+ }
+
+ }
+
+ //for each c-node, determine its index in the coarser lvl
+ std::vector<int> cnode_index(n_nodes,-1);
+ int n_cnodes = 0;
+ for(int i = 0; i < n_nodes; i++){
+ if(NodeSets[i] == C_NODE)
+ cnode_index[i] = n_cnodes++;
+ }
+ //map old C indices to coarse indices
+ for(std::vector<int>::iterator i = Bj->begin(); i != Bj->end(); i++){
+ *i = cnode_index[*i];
+ }
+
+
+
+}
+
+#endif
Added: trunk/Lib/sandbox/multigrid/multigridtools/smoothed_aggregation.h
===================================================================
--- trunk/Lib/sandbox/multigrid/multigridtools/smoothed_aggregation.h 2007-07-10 17:36:06 UTC (rev 3157)
+++ trunk/Lib/sandbox/multigrid/multigridtools/smoothed_aggregation.h 2007-07-11 05:14:36 UTC (rev 3158)
@@ -0,0 +1,203 @@
+#ifndef SMOOTHED_AGGREGATION_H
+#define SMOOTHED_AGGREGATION_H
+
+#include <iostream>
+#include <vector>
+#include <iterator>
+#include <assert.h>
+
+
+#define DEBUG
+
+
+template<class T>
+void sa_strong_connections(const int n_row,
+ const T epsilon,
+ const int Ap[], const int Aj[], const T Ax[],
+ std::vector<int> * Sp, std::vector<int> * Sj, std::vector<T> * Sx){
+ //Sp,Sj form a CSR representation where the i-th row contains
+ //the indices of all the strong connections from node i
+ Sp->push_back(0);
+
+ //compute diagonal values
+ std::vector<T> diags(n_row);
+ for(int i = 0; i < n_row; i++){
+ int row_start = Ap[i];
+ int row_end = Ap[i+1];
+ for(int jj = row_start; jj < row_end; jj++){
+ if(Aj[jj] == i){
+ diags[i] = Ax[jj];
+ break;
+ }
+ }
+ }
+
+#ifdef DEBUG
+ for(int i = 0; i < n_row; i++){ assert(diags[i] > 0); }
+#endif
+
+
+
+ for(int i = 0; i < n_row; i++){
+ int row_start = Ap[i];
+ int row_end = Ap[i+1];
+
+ T eps_Aii = epsilon*epsilon*diags[i];
+
+ for(int jj = row_start; jj < row_end; jj++){
+ const int& j = Aj[jj];
+ const T& Aij = Ax[jj];
+
+ if(i == j){continue;}
+
+ if(Aij*Aij >= eps_Aii * diags[j]){
+ Sj->push_back(j);
+ Sx->push_back(Aij);
+ }
+ }
+ Sp->push_back(Sj->size());
+ }
+}
+
+
+void sa_get_aggregates(const int n_row,
+ const int Ap[], const int Aj[],
+ std::vector<int> * Bj){
+
+ std::vector<int> aggregates(n_row,-1);
+
+ int num_aggregates = 0;
+
+ //Pass #1
+ for(int i = 0; i < n_row; i++){
+ if(aggregates[i] >= 0){ continue; } //already marked
+
+ const int& row_start = Ap[i];
+ const int& row_end = Ap[i+1];
+
+
+ //Determine whether all neighbors of this node are free (not already aggregates)
+ bool free_neighborhood = true;
+ for(int jj = row_start; jj < row_end; jj++){
+ if(aggregates[Aj[jj]] >= 0){
+ free_neighborhood = false;
+ break;
+ }
+ }
+ if(!free_neighborhood){ continue; } //bail out
+
+
+ //Make an aggregate out of this node and its strong neigbors
+ aggregates[i] = num_aggregates;
+ for(int jj = row_start; jj < row_end; jj++){
+ aggregates[Aj[jj]] = num_aggregates;
+ }
+ num_aggregates++;
+ }
+
+
+
+ //Pass #2
+ std::vector<int> aggregates_copy(aggregates);
+ for(int i = 0; i < n_row; i++){
+ if(aggregates[i] >= 0){ continue; } //already marked
+
+ const int& row_start = Ap[i];
+ const int& row_end = Ap[i+1];
+
+ for(int jj = row_start; jj < row_end; jj++){
+ const int& j = Aj[jj];
+
+ if(aggregates_copy[j] >= 0){
+ aggregates[i] = aggregates_copy[j];
+ break;
+ }
+ }
+ }
+
+
+
+ //Pass #3
+ for(int i = 0; i < n_row; i++){
+ if(aggregates[i] >= 0){ continue; } //already marked
+
+ const int& row_start = Ap[i];
+ const int& row_end = Ap[i+1];
+
+ aggregates[i] = num_aggregates;
+
+ for(int jj = row_start; jj < row_end; jj++){
+ const int& j = Aj[jj];
+
+ if(aggregates[j] < 0){ //unmarked neighbors
+ aggregates[j] = num_aggregates;
+ }
+ }
+ num_aggregates++;
+ }
+
+
+#ifdef DEBUG
+ for(int i = 0; i < n_row; i++){ assert(aggregates[i] >= 0 && aggregates[i] < num_aggregates); }
+#endif
+
+ *Bj = aggregates;
+}
+
+
+
+
+
+
+template<class T>
+void sa_smoother(const int n_row,
+ const T omega,
+ const int Ap[], const int Aj[], const T Ax[],
+ const int Sp[], const int Sj[], const T Sx[],
+ std::vector<int> * Bp, std::vector<int> * Bj, std::vector<T> * Bx){
+
+
+ //compute filtered diagonal
+ std::vector<T> diags(n_row,0);
+
+ for(int i = 0; i < n_row; i++){
+ int row_start = Ap[i];
+ int row_end = Ap[i+1];
+ for(int jj = row_start; jj < row_end; jj++){
+ diags[i] += Ax[jj];
+ }
+ }
+ for(int i = 0; i < n_row; i++){
+ int row_start = Sp[i];
+ int row_end = Sp[i+1];
+ for(int jj = row_start; jj < row_end; jj++){
+ diags[i] -= Sx[jj];
+ }
+ }
+
+#ifdef DEBUG
+ for(int i = 0; i < n_row; i++){ assert(diags[i] > 0); }
+#endif
+
+
+ //compute omega Jacobi smoother
+ Bp->push_back(0);
+ for(int i = 0; i < n_row; i++){
+ int row_start = Sp[i];
+ int row_end = Sp[i+1];
+ const T row_scale = -omega/diags[i];
+
+ Bx->push_back(1.0);
+ Bj->push_back( i );
+
+ for(int jj = row_start; jj < row_end; jj++){
+ Bx->push_back(row_scale*Sx[jj]);
+ Bj->push_back(Sj[jj]);
+ }
+ Bp->push_back(Bj->size());
+ }
+}
+
+
+
+#endif
Added: trunk/Lib/sandbox/multigrid/multigridtools.py
===================================================================
--- trunk/Lib/sandbox/multigrid/multigridtools.py 2007-07-10 17:36:06 UTC (rev 3157)
+++ trunk/Lib/sandbox/multigrid/multigridtools.py 2007-07-11 05:14:36 UTC (rev 3158)
@@ -0,0 +1,123 @@
+# This file was automatically generated by SWIG (http://www.swig.org).
+# Version 1.3.32
+#
+# Don't modify this file, modify the SWIG interface instead.
+# This file is compatible with both classic and new-style classes.
+
+import _multigridtools
+import new
+new_instancemethod = new.instancemethod
+try:
+ _swig_property = property
+except NameError:
+ pass # Python < 2.2 doesn't have 'property'.
+def _swig_setattr_nondynamic(self,class_type,name,value,static=1):
+ if (name == "thisown"): return self.this.own(value)
+ if (name == "this"):
+ if type(value).__name__ == 'PySwigObject':
+ self.__dict__[name] = value
+ return
+ method = class_type.__swig_setmethods__.get(name,None)
+ if method: return method(self,value)
+ if (not static) or hasattr(self,name):
+ self.__dict__[name] = value
+ else:
+ raise AttributeError("You cannot add attributes to %s" % self)
+
+def _swig_setattr(self,class_type,name,value):
+ return _swig_setattr_nondynamic(self,class_type,name,value,0)
+
+def _swig_getattr(self,class_type,name):
+ if (name == "thisown"): return self.this.own()
+ method = class_type.__swig_getmethods__.get(name,None)
+ if method: return method(self)
+ raise AttributeError,name
+
+def _swig_repr(self):
+ try: strthis = "proxy of " + self.this.__repr__()
+ except: strthis = ""
+ return "<%s.%s; %s >" % (self.__class__.__module__, self.__class__.__name__, strthis,)
+
+import types
+try:
+ _object = types.ObjectType
+ _newclass = 1
+except AttributeError:
+ class _object : pass
+ _newclass = 0
+del types
+
+
+U_NODE = _multigridtools.U_NODE
+C_NODE = _multigridtools.C_NODE
+F_NODE = _multigridtools.F_NODE
+
+def sa_get_aggregates(*args):
+ """sa_get_aggregates(int n_row, int Ap, int Aj, std::vector<(int)> Bj)"""
+ return _multigridtools.sa_get_aggregates(*args)
+
+
+def rs_strong_connections(*args):
+ """
+ rs_strong_connections(int n_row, float theta, int Ap, int Aj, float Ax, std::vector<(int)> Sp,
+ std::vector<(int)> Sj,
+ std::vector<(float)> Sx)
+ rs_strong_connections(int n_row, double theta, int Ap, int Aj, double Ax,
+ std::vector<(int)> Sp, std::vector<(int)> Sj,
+ std::vector<(double)> Sx)
+ """
+ return _multigridtools.rs_strong_connections(*args)
+
+def rs_interpolation(*args):
+ """
+ rs_interpolation(int n_nodes, int Ap, int Aj, float Ax, int Sp, int Sj,
+ float Sx, int Tp, int Tj, float Tx, std::vector<(int)> Bp,
+ std::vector<(int)> Bj, std::vector<(float)> Bx)
+ rs_interpolation(int n_nodes, int Ap, int Aj, double Ax, int Sp, int Sj,
+ double Sx, int Tp, int Tj, double Tx, std::vector<(int)> Bp,
+ std::vector<(int)> Bj, std::vector<(double)> Bx)
+ """
+ return _multigridtools.rs_interpolation(*args)
+
+def sa_strong_connections(*args):
+ """
+ sa_strong_connections(int n_row, float epsilon, int Ap, int Aj, float Ax,
+ std::vector<(int)> Sp, std::vector<(int)> Sj,
+ std::vector<(float)> Sx)
+ sa_strong_connections(int n_row, double epsilon, int Ap, int Aj, double Ax,
+ std::vector<(int)> Sp, std::vector<(int)> Sj,
+ std::vector<(double)> Sx)
+ """
+ return _multigridtools.sa_strong_connections(*args)
+
+def sa_smoother(*args):
+ """
+ sa_smoother(int n_row, float omega, int Ap, int Aj, float Ax, int Sp,
+ int Sj, float Sx, std::vector<(int)> Bp,
+ std::vector<(int)> Bj, std::vector<(float)> Bx)
+ sa_smoother(int n_row, double omega, int Ap, int Aj, double Ax,
+ int Sp, int Sj, double Sx, std::vector<(int)> Bp,
+ std::vector<(int)> Bj, std::vector<(double)> Bx)
+ """
+ return _multigridtools.sa_smoother(*args)
+
+def gauss_seidel(*args):
+ """
+ gauss_seidel(int n_row, int Ap, int Aj, float Ax, float x, float b,
+ int row_start, int row_stop, int row_step)
+ gauss_seidel(int n_row, int Ap, int Aj, double Ax, double x, double b,
+ int row_start, int row_stop, int row_step)
+ """
+ return _multigridtools.gauss_seidel(*args)
+
+def jacobi(*args):
+ """
+ jacobi(int n_row, int Ap, int Aj, float Ax, float x, float b,
+ float temp, int row_start, int row_stop,
+ int row_step, float omega)
+ jacobi(int n_row, int Ap, int Aj, double Ax, double x, double b,
+ double temp, int row_start, int row_stop,
+ int row_step, double omega)
+ """
+ return _multigridtools.jacobi(*args)
+
Added: trunk/Lib/sandbox/multigrid/multilevel.py
===================================================================
--- trunk/Lib/sandbox/multigrid/multilevel.py 2007-07-10 17:36:06 UTC (rev 3157)
+++ trunk/Lib/sandbox/multigrid/multilevel.py 2007-07-11 05:14:36 UTC (rev 3158)
@@ -0,0 +1,327 @@
+from scipy import ones,zeros,rand,array,array_split,hstack,transpose,sum,ones_like,sqrt
+from scipy.sparse import spidentity
+from numpy.linalg import norm
+
+import pydec
+from pydec import diag_sparse,inf_norm, mls_polynomial_coeffs,polynomial_smoother
+
+from multigrid import sa_interpolation,rs_interpolation
+import multigrid
+import multigridtools
+from relaxation import gauss_seidel,jacobi
+
+import scipy
+import numpy
+
+
+## import scipy.sandbox.arpack as arpack
+## eigs,vecs = arpack.eigen(A,maxiter=10)
+## raise ValueError
+## return eigs.max()
+
+
+def avg_work_per_digit(ml_solver,residuals):
+ digits = numpy.log(residuals[0]/residuals[-1])/numpy.log(10)
+ return (ml_solver.cycle_complexity() * len(residuals)) / digits
+
+
+def avg_convergence_rate(residuals):
+ return (residuals[-1]/residuals[0]) ** (1.0/len(residuals))
+
+
+def asym_work_per_digit(ml_solver,residuals):
+ digits = numpy.log(residuals[-2]/residuals[-1])/numpy.log(10)
+ return (ml_solver.cycle_complexity()) / digits
+
+
+
+
+class coarse_grid_solver:
+ def __init__(self,A,options):
+ self.opts = options
+
+ self.A = A
+
+ solver = self.opts['coarse: type']
+
+ if solver == 'pinv':
+ self.pinv = scipy.linalg.pinv(self.A.todense())
+ self.nnz = self.pinv.size
+ self.__solve = lambda b : numpy.dot(self.pinv,b)
+ elif solver == 'pinv2':
+ self.pinv = scipy.linalg.pinv2(self.A.todense())
+ self.nnz = self.pinv.size
+ self.__solve = lambda b : numpy.dot(self.pinv,b)
+ elif solver == 'splu':
+ import scipy.linsolve.umfpack as um
+ self.umfpack = um.UmfpackContext()
+ self.umfpack.numeric( self.A )
+ self.nnz = self.umfpack.info[um.umfDefines['UMFPACK_LU_ENTRIES']]
+ self.__solve = lambda b : self.umfpack.solve( um.UMFPACK_A, self.A, b, autoTranspose = True )
+ elif solver in ['bicg','bicgstab','cg','cgs','gmres','qmr']:
+ #self.__solve = lambda b : scipy.linalg.cg(self.A,b,tol=1e-12,maxiter=100)[0]
+ #it_solver = getattr(scipy.linalg.iterative,solver)
+
+ it_solver = pydec.numerical.iterative.cg
+ self.__solve = lambda b : it_solver(self.A,b,tol=1e-12)[0]
+ else:
+ raise ValueError,('unknown solver: %s' % solver)
+
+ def solve(self,b):
+ #M = self.A.todense()
+ #val,vec = scipy.linalg.eig(M)
+ #pet = vec[:,val < 1e-8][:,0]
+ #print pet
+ #return self.__solve(b) + pet
+ return self.__solve(b)
+
+ def nnz(self):
+ return self.nnz
+
+
+class multilevel_solver(list):
+ class grid_data:
+ pass
+
+ class options(dict):
+ def __repr__(self):
+ keys = sorted([k for k in self.keys() if ':' not in k])
+ keys += sorted([k for k in self.keys() if ':' in k])
+
+ output = "solver options:\n"
+ for k in keys:
+ output += " %-25s %-30s\n" % (k,self[k])
+ return output
+ def sub_options(self,sub_opt):
+ """
+ Filter options with a given prefix
+
+ Example:
+ opts.sub_options('smoother:')
+
+ """
+ return dict([ (k,v) for (k,v) in self.iteritems() if k.startswith(sub_opt)])
+
+ def __init__(self,A,options=None):
+ assert(False) #should not instantiated
+
+
+ def __repr__(self):
+ output = '%s\n'% type(self).__name__
+ output += 'Number of Levels: %d (max: %d)\n' % (len(self),self.opts['max levels'])
+ output += 'Operator Complexity: %6.3f\n' % self.operator_complexity()
+ output += 'Grid Complexity: %6.3f\n' % self.grid_complexity()
+ output += 'Cycle Complexity: %6.3f\n' % self.cycle_complexity()
+
+ total_nnz = sum([lvl.A.nnz for lvl in self])
+
+ for lvl,data in enumerate(self):
+ output += ' [level %2d] unknowns: %10d nnz: %5.2f%%\n' % (lvl,data.A.shape[1],(100*float(data.A.nnz)/float(total_nnz)))
+
+ #output += '\n' + repr(self.opts)
+ return output
+
+
+
+ def operator_complexity(self):
+ """number of nonzeros on all levels / number of nonzeros on the finest level"""
+ return sum([lvl.A.nnz for lvl in self])/float(self[0].A.nnz)
+ def grid_complexity(self):
+ """number of unknowns on all levels / number of unknowns on the finest level"""
+ return sum([lvl.A.shape[0] for lvl in self])/float(self[0].A.shape[0])
+ def cycle_complexity(self):
+ """total FLOPs in one MG cycle / FLOPs in single smoother sweep on the finest level"""
+ return self.cycle_flops()/float(self[0].A.nnz)
+ def cycle_flops(self):
+ """total FLOPs in one MG cycle"""
+ total_flops = 0
+
+ gamma = self.opts['cycle: gamma']
+ passes = self.opts['smoother: passes']
+
+ if self.opts['smoother: type'] in ['jacobi','symmetric gauss-seidel','richardson']:
+ passes *= 2
+ passes += 1 #residual computation
+
+ if self.opts['smoother: type'] in ['polynomial']:
+ print "poly degree:",len(self.opts['smoother: omega'][-1])
+ passes *= 2*len(self.opts['smoother: omega'][-1])
+ #residual computation already factored in
+
+
+ for n,lvl in enumerate(self):
+ total_flops += (gamma**n)*lvl.A.nnz*passes
+
+ #account for iterative solver using this as a preconditioner
+ if self.opts['solver: type'] != 'standalone':
+ total_flops += self.A.nnz
+
+ return total_flops
+
+ def solve(self,b, x0=None, tol=1e-5, maxiter=100, callback=None, return_residuals=False, precond=False):
+
+ if x0 is None:
+ x = zeros(b.shape,max(self.A.dtype,b.dtype))
+ else:
+ x = x0.copy()
+
+
+ #was invoked as a preconditioner
+ if precond:
+ #return b #no precond
+ self.__solve(0,x,b)
+ return x
+
+
+ if self.opts['solver: type'] == 'standalone':
+ residuals = [norm(b-self[0].A*x,2)]
+
+ while len(residuals) <= maxiter and residuals[-1]/residuals[0] > tol:
+ self.__solve(0,x,b)
+
+ residuals.append(scipy.linalg.norm(b-self[0].A*x,2))
+
+ if callback is not None:
+ callback(x)
+
+ else:
+ #using acceleration
+
+ #residuals = [scipy.linalg.norm(b-self[0].A*x,2)]
+ #callback = lambda x_k : residuals.append(scipy.linalg.norm(b-self[0].A*x_k,2))
+ #solver = getattr(scipy.linalg.iterative,self.opts['solver: type'])
+
+ assert(self.opts['solver: type'] == 'cg') #only CG supported now
+ solver = pydec.iterative.cg
+
+ mtx = self[0].A
+ mtx.psolve = lambda b : self.solve(b,precond=True)
+
+ x,residuals = solver(mtx,b,x0=x,tol=tol,maxiter=maxiter,callback=callback)
+
+ if return_residuals:
+ return x,residuals
+ else:
+ return x
+
+
+
+
+ def __smooth(self,lvl,x,b,which):
+ smoother_type = self.opts['smoother: type']
+ smoother_passes = self.opts['smoother: passes']
+
+ A = self[lvl].A
+
+ if smoother_type == 'jacobi':
+ omega = self.opts['smoother: omega'][lvl]
+ jacobi(A,x,b,iterations=smoother_passes,omega=omega)
+ elif smoother_type == 'richardson':
+ omega = self.opts['smoother: omega'][lvl]
+ x += omega*(b - A*x)
+ elif smoother_type == 'polynomial':
+ coeffs = self.opts['smoother: omega'][lvl]
+ polynomial_smoother(A,x,b,coeffs)
+ elif smoother_type == 'symmetric gauss-seidel':
+ if which == 'pre':
+ gauss_seidel(A,x,b,iterations=smoother_passes,sweep="forward")
+ else:
+ gauss_seidel(A,x,b,iterations=smoother_passes,sweep="backward")
+ else:
+ raise ValueError,'unknown smoother'
+
+ def __solve(self,lvl,x,b):
+
+ if len(self) == 1:
+ x[:] = self[0].coarse_solver.solve(b)
+ return
+
+ A = self[lvl].A
+
+ self.__smooth(lvl,x,b,which='pre')
+
+ residual = b - A*x
+
+ coarse_x = zeros((self[lvl+1].A.shape[0]))
+ coarse_b = self[lvl].P.T * residual
+
+ if lvl == len(self) - 2:
+ coarse_x[:] = self[-1].coarse_solver.solve(coarse_b)
+ else:
+ for i in range(self.opts['cycle: gamma']):
+ self.__solve(lvl+1,coarse_x,coarse_b)
+
+ x += self[lvl].P * coarse_x
+
+ self.__smooth(lvl,x,b,which='post')
+
+
+
+
+
+
+class scalar_solver(multilevel_solver):
+ def __init__(self,A,options=None):
+ self.A = A
+
+ if options is None:
+ self.opts = scalar_solver.default_options()
+ else:
+ self.opts = options
+
+ self.__construct_hierarchy()
+
+ def default_options():
+ opts = multilevel_solver.options()
+ opts['max levels'] = 8
+ opts['cycle: gamma'] = 1
+ opts['coarse: type'] = 'splu'
+ opts['coarse: max size'] = 2000
+ opts['aggregation: type'] = 'SA'
+ opts['aggregation: epsilon'] = 0.05
+ opts['smoother: passes'] = 1
+ opts['smoother: type'] = 'symmetric gauss-seidel'
+# opts['smoother: type'] = 'jacobi'
+ opts['solver: type'] = 'cg'
+ return opts
+ default_options = staticmethod(default_options)
+
+ def __construct_hierarchy(self):
+ A = self.A
+
+ agg_type = self.opts['aggregation: type']
+ max_levels = self.opts['max levels']
+ max_coarse = self.opts['coarse: max size']
+
+ while len(self) < max_levels and A.shape[0] > max_coarse:
+ self.append(self.grid_data())
+
+ if agg_type == 'SA':
+ P,I = sa_interpolation(A)
+ elif agg_type == 'RS':
+ P = rs_interpolation(A)
+ else:
+ raise ValueError,'unknown aggregation type: %s' % agg_type
+
+ self[-1].A = A
+ self[-1].P = P
+
+ A = (P.T.tocsr() * A) * P
+
+ self.append(self.grid_data())
+
+ self[-1].coarse_solver = coarse_grid_solver(A,self.opts.sub_options('coarse:'))
+ self[-1].A = A
+
+ if self.opts['smoother: type'] == 'jacobi':
+ omegas = []
+ for lvl in self:
+ A = lvl.A
+ D_inv = diag_sparse(1.0/diag_sparse(A))
+
+ D_inv_A = D_inv * A
+ omegas.append((4.0/3.0)/inf_norm(D_inv_A))
+ self.opts['smoother: omega'] = omegas
+
+
+
Added: trunk/Lib/sandbox/multigrid/relaxation.py
===================================================================
--- trunk/Lib/sandbox/multigrid/relaxation.py 2007-07-10 17:36:06 UTC (rev 3157)
+++ trunk/Lib/sandbox/multigrid/relaxation.py 2007-07-11 05:14:36 UTC (rev 3158)
@@ -0,0 +1,56 @@
+import multigridtools
+import numpy
+
+def gauss_seidel(A,x,b,iterations=1,sweep="forward"):
+ """
+ Perform Gauss-Seidel iteration on the linear system Ax=b
+
+ Input:
+ A - NxN csr_matrix
+ x - rank 1 ndarray of length N
+ b - rank 1 ndarray of length N
+ Optional:
+ iterations - number of iterations to perform (default: 1)
+ sweep - slice of unknowns to relax (default: all in forward direction)
+ """
+ if sweep == 'forward':
+ row_start,row_stop,row_step = 0,len(x),1
+ elif sweep == 'backward':
+ row_start,row_stop,row_step = len(x)-1,-1,-1
+ else:
+ raise ValueError,'valid sweep directions are \'forward\' and \'backward\''
+
+ for iter in xrange(iterations):
+ multigridtools.gauss_seidel(A.shape[0],
+ A.indptr, A.indices, A.data,
+ x, b,
+ row_start, row_stop, row_step)
+
+def jacobi(A,x,b,iterations=1,omega=1.0):
+ """
+ Perform Gauss-Seidel iteration on the linear system Ax=b
+
+ Input:
+ A - NxN csr_matrix
+ x - rank 1 ndarray of length N
+ b - rank 1 ndarray of length N
+ Optional:
+ iterations - number of iterations to perform (default: 1)
+ sweep - slice of unknowns to relax (default: all in forward direction)
+ """
+ sweep = slice(None)
+ (row_start,row_stop,row_step) = sweep.indices(A.shape[0])
+
+ if (row_stop - row_start) * row_step <= 0: #no work to do
+ return
+
+ temp = numpy.empty_like(x)
+
+ for iter in xrange(iterations):
+ multigridtools.jacobi(A.shape[0],
+ A.indptr, A.indices, A.data,
+ x, b, temp,
+ row_start, row_stop, row_step,
+ omega)
+
+
Added: trunk/Lib/sandbox/multigrid/simple_test.py
===================================================================
--- trunk/Lib/sandbox/multigrid/simple_test.py 2007-07-10 17:36:06 UTC (rev 3157)
+++ trunk/Lib/sandbox/multigrid/simple_test.py 2007-07-11 05:14:36 UTC (rev 3158)
@@ -0,0 +1,14 @@
+from multilevel import *
+from multigrid import *
+from scipy import *
+
+A = poisson_problem(300).T
+s = scalar_solver(A)
+b = rand(A.shape[0])
+x,res = s.solve(b,return_residuals=True)
+r = (b - A*x)
+print abs(r).max()
+
+
+
+
More information about the Scipy-svn
mailing list