miriad 4.1.0.0

data/ext/miriad_ruby.i

@@ -0,0 +1,443 @@
+/* Ruby specific typemaps for MIRIAD Swig wrapper */
+
+#if defined SWIGRUBY
+
+%{
+VALUE mirlib_eMirlibError;
+%}
+
+%init %{
+  mirlib_eMirlibError = rb_define_class("MirlibError", rb_eStandardError);
+%}
+
+// Requires NArray Ruby extension
+%include "narray_ruby.swg"
+
+// Typemaps for preamble
+%typemap(in) (double *preamble) {
+  // If FIXNUM allocate NA_DFLOAT array that many
+  // This only makes sense for reads (or writing zeros)
+  if(TYPE($input) == T_FIXNUM) {
+    int rank = 1;
+    int shape = FIX2INT($input);
+    VALUE naclass = rb_const_get(rb_cObject,rb_intern("NArray"));
+    $input = na_make_object(NA_DFLOAT,rank,&shape,naclass);
+  }
+  // If NArray
+  if(NA_IsNArray($input)) {
+    Check_NArrayType($input,NA_DFLOAT);
+    $1 = NA_PTR_TYPE($input,$1_type);
+  } else {
+    int i;
+    Check_Type($input, T_ARRAY);
+    // Get the length of the array
+    // TODO Bounds checking somehow?
+    int n = RARRAY($input)->len; 
+    $1 = ALLOCA_N(double, n);
+    // Get the first element in array
+    VALUE *ptr = RARRAY($input)->ptr; 
+    for (i=0; i < n; i++) {
+      // Convert Ruby Object to double
+      $1[i] = NUM2DBL(ptr[i]); 
+    }
+  }
+}
+
+%typemap(argout) (double *preamble) {
+  // If NArray, data are already in place
+  if(TYPE($input) == T_ARRAY) {
+    int i;
+    // Get the length of the array
+    // TODO Bounds checking somehow?
+    int n = RARRAY($input)->len; 
+    // Get the first element in array
+    VALUE *ptr = RARRAY($input)->ptr; 
+    for (i=0; i < n; i++) {
+      // Store or convert doubles to Ruby Objects
+      if(TYPE(ptr[i]) == T_FLOAT) {
+        // TODO Is this legit?
+        RFLOAT(ptr[i])->value = $1[i];
+      } else {
+        ptr[i] = rb_float_new($1[i]);
+      }
+    }
+  }
+  $result = SWIG_AppendOutput($result,$input);
+}
+
+// Typemaps for visibility data/flags/n
+// Length of complex data must be twice the length of flags
+%typemap(in) (float * data) (int ndata) {
+  int i;
+  // If FIXNUM or BIGNUM, allocate NA_SCOMPLEX array that many
+  // This only makes sense for reads (or writing zeros)
+  if(TYPE($input) == T_FIXNUM || TYPE($input) == T_BIGNUM) {
+    ndata = NUM2INT($input);
+    int rank = 1;
+    int shape = ndata;
+    VALUE naclass = rb_const_get(rb_cObject,rb_intern("NArray"));
+    $input = na_make_object(NA_SCOMPLEX,rank,&shape,naclass);
+  }
+  // If NArray
+  if(NA_IsNArray($input)) {
+    Check_NArrayType2($input,NA_SFLOAT,NA_SCOMPLEX);
+    $1 = NA_PTR_TYPE($input,$1_type);
+    ndata = NA_TOTAL($input);
+    if(NA_TYPE($input) == NA_SFLOAT) {
+      ndata /= 2;
+    }
+  } else {
+    Check_Type($input, T_ARRAY);
+    // Allocate C array on stack
+    ndata = RARRAY($input)->len;
+    $1 = ALLOCA_N(float,ndata);
+    VALUE * ptr = RARRAY($input)->ptr;
+    // TODO Use $symname in #if to avoid copying on read?
+    for(i=0; i < ndata; i++) {
+      $1[i] = NUM2DBL(ptr[i]);
+    }
+    ndata /= 2;
+  }
+}
+
+%typemap(argout) (float * data) {
+  int ndata;
+  int i;
+  // If NArray, data are already in place
+  if(TYPE($input) == T_ARRAY) {
+    ndata = RARRAY($input)->len;
+    VALUE * ptr = RARRAY($input)->ptr;
+    for(i=0; i < ndata; i++) {
+      // Store or convert doubles to Ruby Objects
+      if(TYPE(ptr[i]) == T_FLOAT) {
+        // TODO Is this legit?
+        RFLOAT(ptr[i])->value = $1[i];
+      } else {
+        ptr[i] = rb_float_new($1[i]);
+      }
+    }
+  }
+  $result = SWIG_AppendOutput($result,$input);
+}
+
+// Typemaps for visibility data/flags/n
+// Passed as a two arguments
+// Length of complex data must be twice the length of flags
+%typemap(in) (int * flags, int n) (int nflag) {
+  int i;
+  // If FIXNUM or BIGNUM, allocate NA_LINT array that many
+  // This only makes sense for reads (or writing zeros)
+  if(TYPE($input) == T_FIXNUM || TYPE($input) == T_BIGNUM) {
+    nflag = NUM2INT($input);
+    int rank = 1;
+    int shape = nflag;
+    VALUE naclass = rb_const_get(rb_cObject,rb_intern("NArray"));
+    $input = na_make_object(NA_LINT,rank,&shape,naclass);
+  }
+  // If NArray
+  if(NA_IsNArray($input)) {
+    Check_NArrayType($input,NA_LINT);
+    $1 = NA_PTR_TYPE($input,$1_type);
+    nflag = NA_TOTAL($input);
+  } else {
+    Check_Type($input, T_ARRAY);
+    nflag = RARRAY($input)->len;
+    $1 = ALLOCA_N(int,nflag);
+    VALUE * ptr = RARRAY($input)->ptr;
+    for(i=0; i < nflag; i++) {
+      $1[i] = FIX2INT(ptr[i]);
+    }
+  }
+
+  $2 = nflag;
+}
+
+%typemap(argout) (int * flags, int n) {
+  int nflag;
+  int i;
+  // If NArray, data are already in place
+  if(TYPE($input) == T_ARRAY) {
+    nflag = RARRAY($input)->len;
+    VALUE * ptr = RARRAY($input)->ptr;
+    for(i=0; i < nflag; i++) {
+      ptr[i] = INT2FIX($1[i]);
+    }
+  }
+  $result = SWIG_AppendOutput($result,$input);
+}
+
+%typemap(check) (double * preamble, float * data, int * flags, int n) {
+  if(ndata3 != nflag4) {
+    rb_raise(rb_eArgError,
+      "lengths of complex data (%d) and flags (%d) do not match", ndata3, nflag4);
+  }
+}
+
+// Typemaps for "nread" parameter
+// Set the input argument to point to a temporary variable
+%typemap(in, numinputs=0) (int *nread) (int temp) {
+  $1 = &temp;
+}
+
+%typemap(argout) (int *nread) {
+  rb_ary_unshift($result,INT2NUM(*$1));
+}
+
+#if 0
+// Maybe ($*1_ltype temp)?
+%define PUTVRX_TYPEMAP(type_code, type, converter)
+%typemap(in) (type * value, int n) (type temp)
+{
+  // If NArray
+  if(NA_IsNArray($input)) {
+    Check_NArrayType($input,type_code);
+    $1 = NA_PTR_TYPE($input,$1_type);
+    $2 = NA_TOTAL($input);
+  } else if(TYPE($input) == T_ARRAY) {
+    int i;
+    // Get the length of the array
+    $2 = RARRAY($input)->len; 
+    $1 = ALLOCA_N(type, $2);
+    // Get the first element in array
+    VALUE *ptr = RARRAY($input)->ptr; 
+    for (i=0; i < $2; i++) {
+      // Convert Ruby Object to int
+      $1[i]= (type)converter(ptr[i]); 
+    }
+  } else {
+    temp = ($*1_type)converter($input);
+    $1 = &temp;
+    $2 = 1;
+  }
+}
+%enddef
+
+PUTVRX_TYPEMAP(NA_LINT,int,NUM2INT);
+PUTVRX_TYPEMAP(NA_SFLOAT,float,NUM2DBL);
+PUTVRX_TYPEMAP(NA_DFLOAT,double,NUM2DBL);
+#endif
+
+// putvr typemap.  Converts from NArray or Ruby type
+%typemap(in) (char * data, int n) (VALUE vinput, int datatype) {
+  // If NArray
+  if(NA_IsNArray($input)) {
+    int type_code = NA_TYPE($input);
+    switch(type_code) {
+      case NA_SINT:
+      case NA_LINT: datatype = H_INT; break;
+      case NA_SFLOAT: datatype = H_REAL; break;
+      case NA_DFLOAT: datatype = H_DBLE; break;
+      default:
+        rb_raise(rb_eTypeError, "unsupported type code '%s'",
+            na_typestring[type_code]);
+    }
+    $1 = NA_PTR_TYPE($input,char *);
+    $2 = NA_TOTAL($input);
+
+  // Else, treat as Ruby type
+  } else {
+    VALUE elem0 = $input;
+    if(TYPE($input) == T_ARRAY) {
+      $2 = RARRAY($input)->len; 
+      elem0 = rb_ary_entry($input,0);
+    } else {
+      // Convert into one element array
+      $2 = 1;
+      $input = rb_ary_new3(1,$input);
+    }
+    // Autodetect Miriad type from Ruby type
+    // (Convenient, but not always a good idea)
+    switch(TYPE(elem0)) {
+      case T_FIXNUM:
+      case T_BIGNUM: datatype = H_INT; break;
+      case T_FLOAT: datatype = H_DBLE; break;
+      case T_STRING: datatype = H_BYTE; break;
+      default:
+        rb_raise(rb_eArgError,
+            "invalid or unsupported type for uv variable (%d)", TYPE(elem0));
+    }
+  }
+  vinput = $input;
+}
+
+// putvr typemap.
+%typemap(in) (int type) {
+  $1 = NUM2INT($input);
+  switch($1) {
+    case 'a': $1 = H_BYTE; break;
+    case 'i': $1 = H_INT; break;
+    case 'd': $1 = H_DBLE; break;
+    case 'r': $1 = H_REAL; break;
+  }
+}
+
+// References "vinput" and "datatype" locals from previous typemap as "vinput3"
+// and "datatype3"
+%typemap(check) (char * data, int n, int type) {
+  int i;
+  if($3 == -1) {
+    // Autodetect from Ruby type
+    $3 = datatype3;
+  }
+  // NArray input will have already set pointer
+  if(TYPE(vinput3) == T_ARRAY) {
+    switch($3) {
+      case H_INT:
+        $1 = (char *)ALLOCA_N(int,$2);
+        for(i=0;i<$2;i++) {
+          ((int *)$1)[i] = NUM2INT(rb_ary_entry(vinput3,i));
+        }
+        break;
+      case H_REAL:
+        $1 = (char *)ALLOCA_N(double,$2);
+        for(i=0;i<$2;i++) {
+          ((float *)$1)[i] = NUM2DBL(rb_ary_entry(vinput3,i));
+        }
+        break;
+      case H_DBLE:
+        $1 = (char *)ALLOCA_N(double,$2);
+        for(i=0;i<$2;i++) {
+          ((double *)$1)[i] = NUM2DBL(rb_ary_entry(vinput3,i));
+        }
+        break;
+      case H_BYTE:
+        $1 = RSTRING(rb_ary_entry(vinput3,0))->ptr;
+        $2 = RSTRING(rb_ary_entry(vinput3,0))->len;
+        break;
+      default:
+        rb_raise(rb_eArgError,
+            "invalid or unsupported type for uv variable (%d)", $3);
+    }
+  }
+}
+
+// Typemap for getvr
+%typemap(in) (char * name) {
+  $1 = StringValuePtr($input);
+}
+
+%typemap(in, numinputs=0) (void ** value, int * n, char * type) (void * value, int n, char type) {
+  value = NULL;
+  $1 = &value;
+  $2 = &n;
+  $3 = &type;
+}
+
+%typemap(argout) (void ** value, int * n, char * type) {
+  int i;
+  $result = Qnil;
+  if(n$argnum == 1 || type$argnum == 'a') {
+    switch(type$argnum) {
+      case 'a': $result = rb_tainted_str_new((char *)value$argnum, n$argnum);
+                break;
+      case 'i': $result = INT2NUM(*(int *)value$argnum);
+                break;
+      case 'r': $result = rb_float_new((double)*(float *)value$argnum);
+                break;
+      case 'd': $result = rb_float_new(*(double *)value$argnum);
+                break;
+      case ' ': // Variable not present
+      case 'j': // Unsuported
+                // Return NULL, but don't raise exception
+                break;
+      default: // TODO Raise exception
+                break;
+    }
+  } else if(n$argnum > 1) {
+    VALUE * elems = ALLOCA_N(VALUE,n$argnum);
+    switch(type$argnum) {
+      case 'i':
+        for(i = 0; i < n$argnum; i++) {
+          elems[i] = INT2NUM(((int *)value$argnum)[i]);
+        }
+        $result = rb_ary_new4(n$argnum,elems);
+        break;
+      case 'r':
+        for(i = 0; i < n$argnum; i++) {
+          elems[i] = rb_float_new((double)(((float *)value$argnum)[i]));
+        }
+        $result = rb_ary_new4(n$argnum,elems);
+        break;
+      case 'd':
+        for(i = 0; i < n$argnum; i++) {
+          elems[i] = rb_float_new(((double *)value$argnum)[i]);
+        }
+        $result = rb_ary_new4(n$argnum,elems);
+        break;
+      case ' ': // Variable not present
+      case 'j': // Unsuported
+                // Return NULL, but don't raise exception
+                break;
+      default: // TODO Raise exception
+                break;
+    }
+  }
+  // Free buffer allocated by getvr
+  free(value$argnum);
+}
+
+// Typemaps for probvr
+%typemap(in, numinputs=0) (char *type, int *length, int *updated) (char type, int length, int updated) {
+  $1 = &type;
+  $2 = &length;
+  $3 = &updated;
+}
+
+%typemap(argout) (char *type, int *length, int *updated) {
+  if($1[0] == ' ') {
+    $result = Qnil;
+  } else {
+    $result = SWIG_AppendOutput($result, rb_str_new($1,1));
+    $result = SWIG_AppendOutput($result, INT2NUM(*$2));
+    $result = SWIG_AppendOutput($result, *$3 ? Qtrue : Qfalse);
+  }
+}
+
+// Make updated() a predicate method
+%predicate updated();
+
+// Typemaps for flagwr "flags" parameter
+%typemap(in) (int * flags) {
+  // If NArray
+  if(NA_IsNArray($input)) {
+    Check_NArrayType($input,NA_LINT);
+    $1 = NA_PTR_TYPE($input,$1_type);
+  } else {
+    int i;
+    int nflag;
+    Check_Type($input, T_ARRAY);
+    nflag = RARRAY($input)->len;
+    $1 = ALLOCA_N(int,nflag);
+    VALUE * ptr = RARRAY($input)->ptr;
+    for(i=0; i < nflag; i++) {
+      $1[i] = FIX2INT(ptr[i]);
+    }
+  }
+}
+
+// Typemaps for hreadln
+%typemap(in, numinputs=0) (char *linein, size_t length, int *iostat) (int iostat) {
+  $2 = 100;
+  $1 = ALLOCA_N(char,$2);
+  $3 = &iostat;
+}
+
+%typemap(argout) (char *linein, size_t length, int *iostat) {
+  if(*$3 == 0) {
+    $result = rb_str_new2($1);
+  } else if(*$3 != -1) {
+    SWIG_exception(SWIG_IOError, "error reading item");
+  } else {
+    // EOF
+    $result = Qnil;
+  }
+}
+
+// Typemaps for hwriteln
+%typemap(in) (char *linein, size_t length) {
+  $1 = StringValue($input)->ptr;
+  $2 = StringValue($input)->len;
+}
+
+// vim: set expandtab ts=2 sw=2 smarttab syntax=c cindent:
+#endif // SWIGRUBY

data/ext/miriad_wrap.c

@@ -0,0 +1,4210 @@
+/* ----------------------------------------------------------------------------
+ * This file was automatically generated by SWIG (http://www.swig.org).
+ * Version 1.3.35
+ * 
+ * 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 SWIGRUBY
+/* -----------------------------------------------------------------------------
+ *  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
+
+/* Deal with Microsoft's attempt at deprecating methods in the standard C++ library */
+#if !defined(SWIG_NO_SCL_SECURE_NO_DEPRECATE) && defined(_MSC_VER) && !defined(_SCL_SECURE_NO_DEPRECATE)
+# define _SCL_SECURE_NO_DEPRECATE
+#endif
+
+
+/* -----------------------------------------------------------------------------
+ *  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
+
+/* Deal with Microsoft's attempt at deprecating methods in the standard C++ library */
+#if !defined(SWIG_NO_SCL_SECURE_NO_DEPRECATE) && defined(_MSC_VER) && !defined(_SCL_SECURE_NO_DEPRECATE)
+# define _SCL_SECURE_NO_DEPRECATE
+#endif
+
+
+/* -----------------------------------------------------------------------------
+ * swigrun.swg
+ *
+ * This file contains generic 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 "4"
+
+/* define SWIG_TYPE_TABLE_NAME as "SWIG_TYPE_TABLE" */
+#ifdef SWIG_TYPE_TABLE
+# define SWIG_QUOTE_STRING(x) #x
+# define SWIG_EXPAND_AND_QUOTE_STRING(x) SWIG_QUOTE_STRING(x)
+# define SWIG_TYPE_TABLE_NAME SWIG_EXPAND_AND_QUOTE_STRING(SWIG_TYPE_TABLE)
+#else
+# define SWIG_TYPE_TABLE_NAME
+#endif
+
+/*
+  You can use the SWIGRUNTIME and SWIGRUNTIMEINLINE macros for
+  creating a static or dynamic library from the swig runtime code.
+  In 99.9% of the cases, swig just needs to declare them as 'static'.
+  
+  But only do this if 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
+#define SWIG_CAST_NEW_MEMORY       0x2
+
+/* Flags for new pointer objects */
+#define SWIG_POINTER_OWN           0x1
+
+
+/* 
+   Flags/methods for returning states.
+   
+   The swig conversion methods, as ConvertPtr, return 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 *, int *);
+typedef struct swig_type_info *(*swig_dycast_func)(void **);
+
+/* Structure to store information on one type */
+typedef struct swig_type_info {
+  const char             *name;			/* mangled name of this type */
+  const char             *str;			/* human readable name of this type */
+  swig_dycast_func        dcast;		/* dynamic cast function down a hierarchy */
+  struct swig_cast_info  *cast;			/* linked list of types that can cast into this type */
+  void                   *clientdata;		/* language specific type data */
+  int                    owndata;		/* flag if the structure owns the clientdata */
+} swig_type_info;
+
+/* Structure to store a type and conversion function used for casting */
+typedef struct swig_cast_info {
+  swig_type_info         *type;			/* pointer to type that is equivalent to this type */
+  swig_converter_func     converter;		/* function to cast the void pointers */
+  struct swig_cast_info  *next;			/* pointer to next cast in linked list */
+  struct swig_cast_info  *prev;			/* pointer to the previous cast */
+} swig_cast_info;
+
+/* Structure used to store module information
+ * Each module generates one structure like this, and the runtime collects
+ * all of these structures and stores them in a circularly linked list.*/
+typedef struct swig_module_info {
+  swig_type_info         **types;		/* Array of pointers to swig_type_info structures that are in this module */
+  size_t                 size;		        /* Number of types in this module */
+  struct swig_module_info *next;		/* Pointer to next element in circularly linked list */
+  swig_type_info         **type_initial;	/* Array of initially generated type structures */
+  swig_cast_info         **cast_initial;	/* Array of initially generated casting structures */
+  void                    *clientdata;		/* Language specific module data */
+} swig_module_info;
+
+/* 
+  Compare two type names skipping the space characters, therefore
+  "char*" == "char *" and "Class<int>" == "Class<int >", etc.
+
+  Return 0 when the two name types are equivalent, as in
+  strncmp, but skipping ' '.
+*/
+SWIGRUNTIME int
+SWIG_TypeNameComp(const char *f1, const char *l1,
+		  const char *f2, const char *l2) {
+  for (;(f1 != l1) && (f2 != l2); ++f1, ++f2) {
+    while ((*f1 == ' ') && (f1 != l1)) ++f1;
+    while ((*f2 == ' ') && (f2 != l2)) ++f2;
+    if (*f1 != *f2) return (*f1 > *f2) ? 1 : -1;
+  }
+  return (int)((l1 - f1) - (l2 - f2));
+}
+
+/*
+  Check type equivalence in a name list like <name1>|<name2>|...
+  Return 0 if 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, int *newmemory) {
+  return ((!ty) || (!ty->converter)) ? ptr : (*ty->converter)(ptr, newmemory);
+}
+
+/* 
+   Dynamic pointer casting. Down an inheritance hierarchy
+*/
+SWIGRUNTIME swig_type_info *
+SWIG_TypeDynamicCast(swig_type_info *ty, void **ptr) {
+  swig_type_info *lastty = ty;
+  if (!ty || !ty->dcast) return ty;
+  while (ty && (ty->dcast)) {
+    ty = (*ty->dcast)(ptr);
+    if (ty) lastty = ty;
+  }
+  return lastty;
+}
+
+/*
+  Return the name associated with this type
+*/
+SWIGRUNTIMEINLINE const char *
+SWIG_TypeName(const swig_type_info *ty) {
+  return ty->name;
+}
+
+/*
+  Return the pretty name associated with this type,
+  that is an unmangled type name in a form presentable to the user.
+*/
+SWIGRUNTIME const char *
+SWIG_TypePrettyName(const swig_type_info *type) {
+  /* The "str" field contains the equivalent pretty names of the
+     type, separated by vertical-bar characters.  We choose
+     to print the last name, as it is often (?) the most
+     specific. */
+  if (!type) return NULL;
+  if (type->str != NULL) {
+    const char *last_name = type->str;
+    const char *s;
+    for (s = type->str; *s; s++)
+      if (*s == '|') last_name = s+1;
+    return last_name;
+  }
+  else
+    return type->name;
+}
+
+/* 
+   Set the clientdata field for a type
+*/
+SWIGRUNTIME void
+SWIG_TypeClientData(swig_type_info *ti, void *clientdata) {
+  swig_cast_info *cast = ti->cast;
+  /* if (ti->clientdata == clientdata) return; */
+  ti->clientdata = clientdata;
+  
+  while (cast) {
+    if (!cast->converter) {
+      swig_type_info *tc = cast->type;
+      if (!tc->clientdata) {
+	SWIG_TypeClientData(tc, clientdata);
+      }
+    }    
+    cast = cast->next;
+  }
+}
+SWIGRUNTIME void
+SWIG_TypeNewClientData(swig_type_info *ti, void *clientdata) {
+  SWIG_TypeClientData(ti, clientdata);
+  ti->owndata = 1;
+}
+  
+/*
+  Search for a swig_type_info structure only by mangled name
+  Search is a O(log #types)
+  
+  We start searching at module start, and finish searching when start == end.  
+  Note: if start == end at the beginning of the function, we go all the way around
+  the circular list.
+*/
+SWIGRUNTIME swig_type_info *
+SWIG_MangledTypeQueryModule(swig_module_info *start, 
+                            swig_module_info *end, 
+		            const char *name) {
+  swig_module_info *iter = start;
+  do {
+    if (iter->size) {
+      register size_t l = 0;
+      register size_t r = iter->size - 1;
+      do {
+	/* since l+r >= 0, we can (>> 1) instead (/ 2) */
+	register size_t i = (l + r) >> 1; 
+	const char *iname = iter->types[i]->name;
+	if (iname) {
+	  register int compare = strcmp(name, iname);
+	  if (compare == 0) {	    
+	    return iter->types[i];
+	  } else if (compare < 0) {
+	    if (i) {
+	      r = i - 1;
+	    } else {
+	      break;
+	    }
+	  } else if (compare > 0) {
+	    l = i + 1;
+	  }
+	} else {
+	  break; /* should never happen */
+	}
+      } while (l <= r);
+    }
+    iter = iter->next;
+  } while (iter != end);
+  return 0;
+}
+
+/*
+  Search for a swig_type_info structure for either a mangled name or a human readable name.
+  It first searches the mangled names of the types, which is a O(log #types)
+  If a type is not found it then searches the human readable names, which is O(#types).
+  
+  We start searching at module start, and finish searching when start == end.  
+  Note: if start == end at the beginning of the function, we go all the way around
+  the circular list.
+*/
+SWIGRUNTIME swig_type_info *
+SWIG_TypeQueryModule(swig_module_info *start, 
+                     swig_module_info *end, 
+		     const char *name) {
+  /* STEP 1: Search the name field using binary search */
+  swig_type_info *ret = SWIG_MangledTypeQueryModule(start, end, name);
+  if (ret) {
+    return ret;
+  } else {
+    /* STEP 2: If the type hasn't been found, do a complete search
+       of the str field (the human readable name) */
+    swig_module_info *iter = start;
+    do {
+      register size_t i = 0;
+      for (; i < iter->size; ++i) {
+	if (iter->types[i]->str && (SWIG_TypeEquiv(iter->types[i]->str, name)))
+	  return iter->types[i];
+      }
+      iter = iter->next;
+    } while (iter != end);
+  }
+  
+  /* neither found a match */
+  return 0;
+}
+
+/* 
+   Pack binary data into a string
+*/
+SWIGRUNTIME char *
+SWIG_PackData(char *c, void *ptr, size_t sz) {
+  static const char hex[17] = "0123456789abcdef";
+  register const unsigned char *u = (unsigned char *) ptr;
+  register const unsigned char *eu =  u + sz;
+  for (; u != eu; ++u) {
+    register unsigned char uu = *u;
+    *(c++) = hex[(uu & 0xf0) >> 4];
+    *(c++) = hex[uu & 0xf];
+  }
+  return c;
+}
+
+/* 
+   Unpack binary data from a string
+*/
+SWIGRUNTIME const char *
+SWIG_UnpackData(const char *c, void *ptr, size_t sz) {
+  register unsigned char *u = (unsigned char *) ptr;
+  register const unsigned char *eu = u + sz;
+  for (; u != eu; ++u) {
+    register char d = *(c++);
+    register unsigned char uu;
+    if ((d >= '0') && (d <= '9'))
+      uu = ((d - '0') << 4);
+    else if ((d >= 'a') && (d <= 'f'))
+      uu = ((d - ('a'-10)) << 4);
+    else 
+      return (char *) 0;
+    d = *(c++);
+    if ((d >= '0') && (d <= '9'))
+      uu |= (d - '0');
+    else if ((d >= 'a') && (d <= 'f'))
+      uu |= (d - ('a'-10));
+    else 
+      return (char *) 0;
+    *u = uu;
+  }
+  return c;
+}
+
+/* 
+   Pack 'void *' into a string buffer.
+*/
+SWIGRUNTIME char *
+SWIG_PackVoidPtr(char *buff, void *ptr, const char *name, size_t bsz) {
+  char *r = buff;
+  if ((2*sizeof(void *) + 2) > bsz) return 0;
+  *(r++) = '_';
+  r = SWIG_PackData(r,&ptr,sizeof(void *));
+  if (strlen(name) + 1 > (bsz - (r - buff))) return 0;
+  strcpy(r,name);
+  return buff;
+}
+
+SWIGRUNTIME const char *
+SWIG_UnpackVoidPtr(const char *c, void **ptr, const char *name) {
+  if (*c != '_') {
+    if (strcmp(c,"NULL") == 0) {
+      *ptr = (void *) 0;
+      return name;
+    } else {
+      return 0;
+    }
+  }
+  return SWIG_UnpackData(++c,ptr,sizeof(void *));
+}
+
+SWIGRUNTIME char *
+SWIG_PackDataName(char *buff, void *ptr, size_t sz, const char *name, size_t bsz) {
+  char *r = buff;
+  size_t lname = (name ? strlen(name) : 0);
+  if ((2*sz + 2 + lname) > bsz) return 0;
+  *(r++) = '_';
+  r = SWIG_PackData(r,ptr,sz);
+  if (lname) {
+    strncpy(r,name,lname+1);
+  } else {
+    *r = 0;
+  }
+  return buff;
+}
+
+SWIGRUNTIME const char *
+SWIG_UnpackDataName(const char *c, void *ptr, size_t sz, const char *name) {
+  if (*c != '_') {
+    if (strcmp(c,"NULL") == 0) {
+      memset(ptr,0,sz);
+      return name;
+    } else {
+      return 0;
+    }
+  }
+  return SWIG_UnpackData(++c,ptr,sz);
+}
+
+#ifdef __cplusplus
+}
+#endif
+
+/*  Errors in SWIG */
+#define  SWIG_UnknownError    	   -1 
+#define  SWIG_IOError        	   -2 
+#define  SWIG_RuntimeError   	   -3 
+#define  SWIG_IndexError     	   -4 
+#define  SWIG_TypeError      	   -5 
+#define  SWIG_DivisionByZero 	   -6 
+#define  SWIG_OverflowError  	   -7 
+#define  SWIG_SyntaxError    	   -8 
+#define  SWIG_ValueError     	   -9 
+#define  SWIG_SystemError    	   -10
+#define  SWIG_AttributeError 	   -11
+#define  SWIG_MemoryError    	   -12 
+#define  SWIG_NullReferenceError   -13
+
+
+
+#include <ruby.h>
+
+/* Remove global macros defined in Ruby's win32.h */
+#ifdef write
+# undef write
+#endif
+#ifdef read
+# undef read
+#endif
+
+
+/* Ruby 1.7 defines NUM2LL(), LL2NUM() and ULL2NUM() macros */
+#ifndef NUM2LL
+#define NUM2LL(x) NUM2LONG((x))
+#endif
+#ifndef LL2NUM
+#define LL2NUM(x) INT2NUM((long) (x))
+#endif
+#ifndef ULL2NUM
+#define ULL2NUM(x) UINT2NUM((unsigned long) (x))
+#endif
+
+/* Ruby 1.7 doesn't (yet) define NUM2ULL() */
+#ifndef NUM2ULL
+#ifdef HAVE_LONG_LONG
+#define NUM2ULL(x) rb_num2ull((x))
+#else
+#define NUM2ULL(x) NUM2ULONG(x)
+#endif
+#endif
+
+/* RSTRING_LEN, etc are new in Ruby 1.9, but ->ptr and ->len no longer work */
+/* Define these for older versions so we can just write code the new way */
+#ifndef RSTRING_LEN
+# define RSTRING_LEN(x) RSTRING(x)->len
+#endif
+#ifndef RSTRING_PTR
+# define RSTRING_PTR(x) RSTRING(x)->ptr
+#endif
+#ifndef RSTRING_END
+# define RSTRING_END(x) (RSTRING_PTR(x) + RSTRING_LEN(x))
+#endif
+#ifndef RARRAY_LEN
+# define RARRAY_LEN(x) RARRAY(x)->len
+#endif
+#ifndef RARRAY_PTR
+# define RARRAY_PTR(x) RARRAY(x)->ptr
+#endif
+#ifndef RFLOAT_VALUE
+# define RFLOAT_VALUE(x) RFLOAT(x)->value
+#endif
+#ifndef DOUBLE2NUM
+# define DOUBLE2NUM(x) rb_float_new(x)
+#endif
+#ifndef RHASH_TBL
+# define RHASH_TBL(x) (RHASH(x)->tbl)
+#endif
+#ifndef RHASH_ITER_LEV
+# define RHASH_ITER_LEV(x) (RHASH(x)->iter_lev)
+#endif
+#ifndef RHASH_IFNONE
+# define RHASH_IFNONE(x) (RHASH(x)->ifnone)
+#endif
+#ifndef RHASH_SIZE
+# define RHASH_SIZE(x) (RHASH(x)->tbl->num_entries)
+#endif
+#ifndef RHASH_EMPTY_P
+# define RHASH_EMPTY_P(x) (RHASH_SIZE(x) == 0)
+#endif
+#ifndef RSTRUCT_LEN
+# define RSTRUCT_LEN(x) RSTRUCT(x)->len
+#endif
+#ifndef RSTRUCT_PTR
+# define RSTRUCT_PTR(x) RSTRUCT(x)->ptr
+#endif
+
+
+
+/*
+ * Need to be very careful about how these macros are defined, especially
+ * when compiling C++ code or C code with an ANSI C compiler.
+ *
+ * VALUEFUNC(f) is a macro used to typecast a C function that implements
+ * a Ruby method so that it can be passed as an argument to API functions
+ * like rb_define_method() and rb_define_singleton_method().
+ *
+ * VOIDFUNC(f) is a macro used to typecast a C function that implements
+ * either the "mark" or "free" stuff for a Ruby Data object, so that it
+ * can be passed as an argument to API functions like Data_Wrap_Struct()
+ * and Data_Make_Struct().
+ */
+ 
+#ifdef __cplusplus
+#  ifndef RUBY_METHOD_FUNC /* These definitions should work for Ruby 1.4.6 */
+#    define PROTECTFUNC(f) ((VALUE (*)()) f)
+#    define VALUEFUNC(f) ((VALUE (*)()) f)
+#    define VOIDFUNC(f)  ((void (*)()) f)
+#  else
+#    ifndef ANYARGS /* These definitions should work for Ruby 1.6 */
+#      define PROTECTFUNC(f) ((VALUE (*)()) f)
+#      define VALUEFUNC(f) ((VALUE (*)()) f)
+#      define VOIDFUNC(f)  ((RUBY_DATA_FUNC) f)
+#    else /* These definitions should work for Ruby 1.7+ */
+#      define PROTECTFUNC(f) ((VALUE (*)(VALUE)) f)
+#      define VALUEFUNC(f) ((VALUE (*)(ANYARGS)) f)
+#      define VOIDFUNC(f)  ((RUBY_DATA_FUNC) f)
+#    endif
+#  endif
+#else
+#  define VALUEFUNC(f) (f)
+#  define VOIDFUNC(f) (f)
+#endif
+
+/* Don't use for expressions have side effect */
+#ifndef RB_STRING_VALUE
+#define RB_STRING_VALUE(s) (TYPE(s) == T_STRING ? (s) : (*(volatile VALUE *)&(s) = rb_str_to_str(s)))
+#endif
+#ifndef StringValue
+#define StringValue(s) RB_STRING_VALUE(s)
+#endif
+#ifndef StringValuePtr
+#define StringValuePtr(s) RSTRING_PTR(RB_STRING_VALUE(s))
+#endif
+#ifndef StringValueLen
+#define StringValueLen(s) RSTRING_LEN(RB_STRING_VALUE(s))
+#endif
+#ifndef SafeStringValue
+#define SafeStringValue(v) do {\
+    StringValue(v);\
+    rb_check_safe_str(v);\
+} while (0)
+#endif
+
+#ifndef HAVE_RB_DEFINE_ALLOC_FUNC
+#define rb_define_alloc_func(klass, func) rb_define_singleton_method((klass), "new", VALUEFUNC((func)), -1)
+#define rb_undef_alloc_func(klass) rb_undef_method(CLASS_OF((klass)), "new")
+#endif
+
+static VALUE _mSWIG = Qnil;
+
+/* -----------------------------------------------------------------------------
+ * error manipulation
+ * ----------------------------------------------------------------------------- */
+
+
+/* Define some additional error types */
+#define SWIG_ObjectPreviouslyDeletedError  -100
+
+
+/* Define custom exceptions for errors that do not map to existing Ruby
+   exceptions.  Note this only works for C++ since a global cannot be
+   initialized by a funtion in C.  For C, fallback to rb_eRuntimeError.*/
+
+SWIGINTERN VALUE 
+getNullReferenceError(void) {
+  static int init = 0;
+  static VALUE rb_eNullReferenceError ;
+  if (!init) {
+    init = 1;
+    rb_eNullReferenceError = rb_define_class("NullReferenceError", rb_eRuntimeError);
+  }
+  return rb_eNullReferenceError;
+} 
+
+SWIGINTERN VALUE 
+getObjectPreviouslyDeletedError(void) {
+  static int init = 0;
+  static VALUE rb_eObjectPreviouslyDeleted ;
+  if (!init) {
+    init = 1;
+    rb_eObjectPreviouslyDeleted = rb_define_class("ObjectPreviouslyDeleted", rb_eRuntimeError);
+  }
+  return rb_eObjectPreviouslyDeleted;
+} 
+
+
+SWIGINTERN VALUE
+SWIG_Ruby_ErrorType(int SWIG_code) {
+  VALUE type;
+  switch (SWIG_code) {
+  case SWIG_MemoryError:
+    type = rb_eNoMemError;
+    break;
+  case SWIG_IOError:
+    type = rb_eIOError;
+    break;
+  case SWIG_RuntimeError:
+    type = rb_eRuntimeError;
+    break;
+  case SWIG_IndexError:
+    type = rb_eIndexError;
+    break;
+  case SWIG_TypeError:
+    type = rb_eTypeError;
+    break;
+  case SWIG_DivisionByZero:
+    type = rb_eZeroDivError;
+    break;
+  case SWIG_OverflowError:
+    type = rb_eRangeError;
+    break;
+  case SWIG_SyntaxError:
+    type = rb_eSyntaxError;
+    break;
+  case SWIG_ValueError:
+    type = rb_eArgError;
+    break;
+  case SWIG_SystemError:
+    type = rb_eFatal;
+    break;
+  case SWIG_AttributeError:
+    type = rb_eRuntimeError;
+    break;
+  case SWIG_NullReferenceError:
+    type = getNullReferenceError();
+    break;
+  case SWIG_ObjectPreviouslyDeletedError:
+    type = getObjectPreviouslyDeletedError();
+    break;
+  case SWIG_UnknownError:
+    type = rb_eRuntimeError;
+    break;
+  default:
+    type = rb_eRuntimeError;
+  }
+  return type;
+}
+
+
+/* This function is called when a user inputs a wrong argument to
+   a method.
+ */
+SWIGINTERN 
+const char* Ruby_Format_TypeError( const char* msg,
+				   const char* type, 
+				   const char* name, 
+				   const int argn,
+				   VALUE input )
+{
+  char buf[128];
+  VALUE str;
+  VALUE asStr;
+  if ( msg && *msg )
+    {
+      str = rb_str_new2(msg);
+    }
+  else
+    {
+      str = rb_str_new(NULL, 0);
+    }
+
+  str = rb_str_cat2( str, "Expected argument " );
+  sprintf( buf, "%d of type ", argn-1 );
+  str = rb_str_cat2( str, buf );
+  str = rb_str_cat2( str, type );
+  str = rb_str_cat2( str, ", but got " );
+  str = rb_str_cat2( str, rb_obj_classname(input) );
+  str = rb_str_cat2( str, " " );
+  asStr = rb_inspect(input);
+  if ( RSTRING_LEN(asStr) > 30 )
+    {
+      str = rb_str_cat( str, StringValuePtr(asStr), 30 );
+      str = rb_str_cat2( str, "..." );
+    }
+  else
+    {
+      str = rb_str_append( str, asStr );
+    }
+
+  if ( name )
+    {
+      str = rb_str_cat2( str, "\n\tin SWIG method '" );
+      str = rb_str_cat2( str, name );
+      str = rb_str_cat2( str, "'" );
+    }
+
+  return StringValuePtr( str );
+}
+
+/* This function is called when an overloaded method fails */
+SWIGINTERN 
+void Ruby_Format_OverloadedError(
+				 const int argc,
+				 const int maxargs,
+				 const char* method, 
+				 const char* prototypes 
+				 )
+{
+  const char* msg = "Wrong # of arguments";
+  if ( argc <= maxargs ) msg = "Wrong arguments";
+  rb_raise(rb_eArgError,"%s for overloaded method '%s'.\n"  
+	   "Possible C/C++ prototypes are:\n%s",
+	   msg, method, prototypes);
+}
+
+/* -----------------------------------------------------------------------------
+ * 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.
+ *
+ * rubytracking.swg
+ *
+ * This file contains support for tracking mappings from 
+ * Ruby objects to C++ objects.  This functionality is needed
+ * to implement mark functions for Ruby's mark and sweep
+ * garbage collector.
+ * ----------------------------------------------------------------------------- */
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/* Ruby 1.8 actually assumes the first case. */
+#if SIZEOF_VOIDP == SIZEOF_LONG
+#  define SWIG2NUM(v) LONG2NUM((unsigned long)v)
+#  define NUM2SWIG(x) (unsigned long)NUM2LONG(x)
+#elif SIZEOF_VOIDP == SIZEOF_LONG_LONG
+#  define SWIG2NUM(v) LL2NUM((unsigned long long)v)
+#  define NUM2SWIG(x) (unsigned long long)NUM2LL(x)
+#else
+#  error sizeof(void*) is not the same as long or long long
+#endif
+
+
+/* Global Ruby hash table to store Trackings from C/C++
+   structs to Ruby Objects. 
+*/
+static VALUE swig_ruby_trackings = Qnil;
+
+/* Global variable that stores a reference to the ruby
+   hash table delete function. */
+static ID swig_ruby_hash_delete;
+
+/* Setup a Ruby hash table to store Trackings */
+SWIGRUNTIME void SWIG_RubyInitializeTrackings(void) {
+  /* Create a ruby hash table to store Trackings from C++ 
+     objects to Ruby objects. */
+
+  /* Try to see if some other .so has already created a 
+     tracking hash table, which we keep hidden in an instance var
+     in the SWIG module.
+     This is done to allow multiple DSOs to share the same
+     tracking table.
+  */
+  ID trackings_id = rb_intern( "@__trackings__" );
+  VALUE verbose = rb_gv_get("VERBOSE");
+  rb_gv_set("VERBOSE", Qfalse);
+  swig_ruby_trackings = rb_ivar_get( _mSWIG, trackings_id );
+  rb_gv_set("VERBOSE", verbose);
+
+  /* No, it hasn't.  Create one ourselves */ 
+  if ( swig_ruby_trackings == Qnil )
+    {
+      swig_ruby_trackings = rb_hash_new();
+      rb_ivar_set( _mSWIG, trackings_id, swig_ruby_trackings );
+    }
+
+  /* Now store a reference to the hash table delete function
+     so that we only have to look it up once.*/
+  swig_ruby_hash_delete = rb_intern("delete");
+}
+
+/* Get a Ruby number to reference a pointer */
+SWIGRUNTIME VALUE SWIG_RubyPtrToReference(void* ptr) {
+  /* We cast the pointer to an unsigned long
+     and then store a reference to it using
+     a Ruby number object. */
+
+  /* Convert the pointer to a Ruby number */
+  return SWIG2NUM(ptr);
+}
+
+/* Get a Ruby number to reference an object */
+SWIGRUNTIME VALUE SWIG_RubyObjectToReference(VALUE object) {
+  /* We cast the object to an unsigned long
+     and then store a reference to it using
+     a Ruby number object. */
+
+  /* Convert the Object to a Ruby number */
+  return SWIG2NUM(object);
+}
+
+/* Get a Ruby object from a previously stored reference */
+SWIGRUNTIME VALUE SWIG_RubyReferenceToObject(VALUE reference) {
+  /* The provided Ruby number object is a reference
+     to the Ruby object we want.*/
+
+  /* Convert the Ruby number to a Ruby object */
+  return NUM2SWIG(reference);
+}
+
+/* Add a Tracking from a C/C++ struct to a Ruby object */
+SWIGRUNTIME void SWIG_RubyAddTracking(void* ptr, VALUE object) {
+  /* In a Ruby hash table we store the pointer and
+     the associated Ruby object.  The trick here is
+     that we cannot store the Ruby object directly - if
+     we do then it cannot be garbage collected.  So
+     instead we typecast it as a unsigned long and
+     convert it to a Ruby number object.*/
+
+  /* Get a reference to the pointer as a Ruby number */
+  VALUE key = SWIG_RubyPtrToReference(ptr);
+
+  /* Get a reference to the Ruby object as a Ruby number */
+  VALUE value = SWIG_RubyObjectToReference(object);
+
+  /* Store the mapping to the global hash table. */
+  rb_hash_aset(swig_ruby_trackings, key, value);
+}
+
+/* Get the Ruby object that owns the specified C/C++ struct */
+SWIGRUNTIME VALUE SWIG_RubyInstanceFor(void* ptr) {
+  /* Get a reference to the pointer as a Ruby number */
+  VALUE key = SWIG_RubyPtrToReference(ptr);
+
+  /* Now lookup the value stored in the global hash table */
+  VALUE value = rb_hash_aref(swig_ruby_trackings, key);
+	
+  if (value == Qnil) {
+    /* No object exists - return nil. */
+    return Qnil;
+  }
+  else {
+    /* Convert this value to Ruby object */
+    return SWIG_RubyReferenceToObject(value);
+  }
+}
+
+/* Remove a Tracking from a C/C++ struct to a Ruby object.  It
+   is very important to remove objects once they are destroyed
+   since the same memory address may be reused later to create
+   a new object. */
+SWIGRUNTIME void SWIG_RubyRemoveTracking(void* ptr) {
+  /* Get a reference to the pointer as a Ruby number */
+  VALUE key = SWIG_RubyPtrToReference(ptr);
+
+  /* Delete the object from the hash table by calling Ruby's
+     do this we need to call the Hash.delete method.*/
+  rb_funcall(swig_ruby_trackings, swig_ruby_hash_delete, 1, key);
+}
+
+/* This is a helper method that unlinks a Ruby object from its
+   underlying C++ object.  This is needed if the lifetime of the
+   Ruby object is longer than the C++ object */
+SWIGRUNTIME void SWIG_RubyUnlinkObjects(void* ptr) {
+  VALUE object = SWIG_RubyInstanceFor(ptr);
+
+  if (object != Qnil) {
+    DATA_PTR(object) = 0;
+  }
+}
+
+
+#ifdef __cplusplus
+}
+#endif
+
+/* -----------------------------------------------------------------------------
+ * Ruby API portion that goes into the runtime
+ * ----------------------------------------------------------------------------- */
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+SWIGINTERN VALUE
+SWIG_Ruby_AppendOutput(VALUE target, VALUE o) {
+  if (NIL_P(target)) {
+    target = o;
+  } else {
+    if (TYPE(target) != T_ARRAY) {
+      VALUE o2 = target;
+      target = rb_ary_new();
+      rb_ary_push(target, o2);
+    }
+    rb_ary_push(target, o);
+  }
+  return target;
+}
+
+/* For ruby1.8.4 and earlier. */
+#ifndef RUBY_INIT_STACK
+   RUBY_EXTERN void Init_stack(VALUE* addr);
+#  define RUBY_INIT_STACK \
+   VALUE variable_in_this_stack_frame; \
+   Init_stack(&variable_in_this_stack_frame);
+#endif
+
+
+#ifdef __cplusplus
+}
+#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.
+ *
+ * rubyrun.swg
+ *
+ * This file contains the runtime support for Ruby modules
+ * and includes code for managing global variables and pointer
+ * type checking.
+ * ----------------------------------------------------------------------------- */
+
+/* For backward compatibility only */
+#define SWIG_POINTER_EXCEPTION  0
+
+/* for raw pointers */
+#define SWIG_ConvertPtr(obj, pptr, type, flags)         SWIG_Ruby_ConvertPtrAndOwn(obj, pptr, type, flags, 0)
+#define SWIG_ConvertPtrAndOwn(obj,pptr,type,flags,own)  SWIG_Ruby_ConvertPtrAndOwn(obj, pptr, type, flags, own)
+#define SWIG_NewPointerObj(ptr, type, flags)            SWIG_Ruby_NewPointerObj(ptr, type, flags)
+#define SWIG_AcquirePtr(ptr, own)                       SWIG_Ruby_AcquirePtr(ptr, own)
+#define swig_owntype                                    ruby_owntype
+
+/* for raw packed data */
+#define SWIG_ConvertPacked(obj, ptr, sz, ty)            SWIG_Ruby_ConvertPacked(obj, ptr, sz, ty, flags)
+#define SWIG_NewPackedObj(ptr, sz, type)                SWIG_Ruby_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_ConvertPtr(obj, pptr, type, 0)
+#define SWIG_NewFunctionPtrObj(ptr, type)               SWIG_NewPointerObj(ptr, type, 0)
+
+/* for C++ member pointers, ie, member methods */
+#define SWIG_ConvertMember(obj, ptr, sz, ty)            SWIG_Ruby_ConvertPacked(obj, ptr, sz, ty)
+#define SWIG_NewMemberObj(ptr, sz, type)                SWIG_Ruby_NewPackedObj(ptr, sz, type)
+
+
+/* Runtime API */
+
+#define SWIG_GetModule(clientdata)                      SWIG_Ruby_GetModule()	
+#define SWIG_SetModule(clientdata, pointer) 		SWIG_Ruby_SetModule(pointer)
+
+
+/* Error manipulation */
+
+#define SWIG_ErrorType(code)                            SWIG_Ruby_ErrorType(code)               
+#define SWIG_Error(code, msg)            		rb_raise(SWIG_Ruby_ErrorType(code), msg)
+#define SWIG_fail                        		goto fail				 
+
+
+/* Ruby-specific SWIG API */
+
+#define SWIG_InitRuntime()                              SWIG_Ruby_InitRuntime()              
+#define SWIG_define_class(ty)                        	SWIG_Ruby_define_class(ty)
+#define SWIG_NewClassInstance(value, ty)             	SWIG_Ruby_NewClassInstance(value, ty)
+#define SWIG_MangleStr(value)                        	SWIG_Ruby_MangleStr(value)		  
+#define SWIG_CheckConvert(value, ty)                 	SWIG_Ruby_CheckConvert(value, ty)	  
+
+#include "assert.h"
+
+/* -----------------------------------------------------------------------------
+ * pointers/data manipulation
+ * ----------------------------------------------------------------------------- */
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+typedef struct {
+  VALUE klass;
+  VALUE mImpl;
+  void  (*mark)(void *);
+  void  (*destroy)(void *);
+  int trackObjects;
+} swig_class;
+
+
+/* Global pointer used to keep some internal SWIG stuff */
+static VALUE _cSWIG_Pointer = Qnil;
+static VALUE swig_runtime_data_type_pointer = Qnil;
+
+/* Global IDs used to keep some internal SWIG stuff */
+static ID swig_arity_id = 0;
+static ID swig_call_id  = 0;
+
+/*
+  If your swig extension is to be run within an embedded ruby and has
+  director callbacks, you should set -DRUBY_EMBEDDED during compilation.  
+  This will reset ruby's stack frame on each entry point from the main 
+  program the first time a virtual director function is invoked (in a 
+  non-recursive way).
+  If this is not done, you run the risk of Ruby trashing the stack.
+*/
+
+#ifdef RUBY_EMBEDDED
+
+#  define SWIG_INIT_STACK                            \
+      if ( !swig_virtual_calls ) { RUBY_INIT_STACK } \
+      ++swig_virtual_calls;
+#  define SWIG_RELEASE_STACK --swig_virtual_calls;
+#  define Ruby_DirectorTypeMismatchException(x) \
+          rb_raise( rb_eTypeError, x ); return c_result;
+
+      static unsigned int swig_virtual_calls = 0;
+
+#else  /* normal non-embedded extension */
+
+#  define SWIG_INIT_STACK
+#  define SWIG_RELEASE_STACK
+#  define Ruby_DirectorTypeMismatchException(x) \
+          throw Swig::DirectorTypeMismatchException( x );
+
+#endif  /* RUBY_EMBEDDED */
+
+
+SWIGRUNTIME VALUE 
+getExceptionClass(void) {
+  static int init = 0;
+  static VALUE rubyExceptionClass ;
+  if (!init) {
+    init = 1;
+    rubyExceptionClass = rb_const_get(_mSWIG, rb_intern("Exception"));
+  }
+  return rubyExceptionClass;
+} 
+
+/* This code checks to see if the Ruby object being raised as part
+   of an exception inherits from the Ruby class Exception.  If so,
+   the object is simply returned.  If not, then a new Ruby exception
+   object is created and that will be returned to Ruby.*/
+SWIGRUNTIME VALUE
+SWIG_Ruby_ExceptionType(swig_type_info *desc, VALUE obj) {
+  VALUE exceptionClass = getExceptionClass();
+  if (rb_obj_is_kind_of(obj, exceptionClass)) {
+    return obj;
+  }  else {
+    return rb_exc_new3(rb_eRuntimeError, rb_obj_as_string(obj));
+  }
+}
+
+/* Initialize Ruby runtime support */
+SWIGRUNTIME void
+SWIG_Ruby_InitRuntime(void)
+{
+  if (_mSWIG == Qnil) {
+    _mSWIG = rb_define_module("SWIG");
+    swig_call_id  = rb_intern("call");
+    swig_arity_id = rb_intern("arity");
+  }
+}
+
+/* Define Ruby class for C type */
+SWIGRUNTIME void
+SWIG_Ruby_define_class(swig_type_info *type)
+{
+  VALUE klass;
+  char *klass_name = (char *) malloc(4 + strlen(type->name) + 1);
+  sprintf(klass_name, "TYPE%s", type->name);
+  if (NIL_P(_cSWIG_Pointer)) {
+    _cSWIG_Pointer = rb_define_class_under(_mSWIG, "Pointer", rb_cObject);
+    rb_undef_method(CLASS_OF(_cSWIG_Pointer), "new");
+  }
+  klass = rb_define_class_under(_mSWIG, klass_name, _cSWIG_Pointer);
+  free((void *) klass_name);
+}
+
+/* Create a new pointer object */
+SWIGRUNTIME VALUE
+SWIG_Ruby_NewPointerObj(void *ptr, swig_type_info *type, int flags)
+{
+  int own =  flags & SWIG_POINTER_OWN; 
+  int track;
+  char *klass_name;
+  swig_class *sklass;
+  VALUE klass;
+  VALUE obj;
+  
+  if (!ptr)
+    return Qnil;
+  
+  if (type->clientdata) {
+    sklass = (swig_class *) type->clientdata;
+		
+    /* Are we tracking this class and have we already returned this Ruby object? */
+    track = sklass->trackObjects;
+    if (track) {
+      obj = SWIG_RubyInstanceFor(ptr);
+      
+      /* Check the object's type and make sure it has the correct type.
+        It might not in cases where methods do things like 
+        downcast methods. */
+      if (obj != Qnil) {
+        VALUE value = rb_iv_get(obj, "@__swigtype__");
+        char* type_name = RSTRING_PTR(value);
+				
+        if (strcmp(type->name, type_name) == 0) {
+          return obj;
+        }
+      }
+    }
+
+    /* Create a new Ruby object */
+    obj = Data_Wrap_Struct(sklass->klass, VOIDFUNC(sklass->mark), 
+			   ( own ? VOIDFUNC(sklass->destroy) : 
+			     (track ? VOIDFUNC(SWIG_RubyRemoveTracking) : 0 )
+			     ), ptr);
+
+    /* If tracking is on for this class then track this object. */
+    if (track) {
+      SWIG_RubyAddTracking(ptr, obj);
+    }
+  } else {
+    klass_name = (char *) malloc(4 + strlen(type->name) + 1);
+    sprintf(klass_name, "TYPE%s", type->name);
+    klass = rb_const_get(_mSWIG, rb_intern(klass_name));
+    free((void *) klass_name);
+    obj = Data_Wrap_Struct(klass, 0, 0, ptr);
+  }
+  rb_iv_set(obj, "@__swigtype__", rb_str_new2(type->name));
+  
+  return obj;
+}
+
+/* Create a new class instance (always owned) */
+SWIGRUNTIME VALUE
+SWIG_Ruby_NewClassInstance(VALUE klass, swig_type_info *type)
+{
+  VALUE obj;
+  swig_class *sklass = (swig_class *) type->clientdata;
+  obj = Data_Wrap_Struct(klass, VOIDFUNC(sklass->mark), VOIDFUNC(sklass->destroy), 0);
+  rb_iv_set(obj, "@__swigtype__", rb_str_new2(type->name));
+  return obj;
+}
+
+/* Get type mangle from class name */
+SWIGRUNTIMEINLINE char *
+SWIG_Ruby_MangleStr(VALUE obj)
+{
+  VALUE stype = rb_iv_get(obj, "@__swigtype__");
+  return StringValuePtr(stype);
+}
+
+/* Acquire a pointer value */
+typedef void (*ruby_owntype)(void*);
+
+SWIGRUNTIME ruby_owntype
+SWIG_Ruby_AcquirePtr(VALUE obj, ruby_owntype own) {
+  if (obj) {
+    ruby_owntype oldown = RDATA(obj)->dfree;
+    RDATA(obj)->dfree = own;
+    return oldown;
+  } else {
+    return 0;
+  }
+}
+
+/* Convert a pointer value */
+SWIGRUNTIME int
+SWIG_Ruby_ConvertPtrAndOwn(VALUE obj, void **ptr, swig_type_info *ty, int flags, ruby_owntype *own)
+{
+  char *c;
+  swig_cast_info *tc;
+  void *vptr = 0;
+
+  /* Grab the pointer */
+  if (NIL_P(obj)) {
+    *ptr = 0;
+    return SWIG_OK;
+  } else {
+    if (TYPE(obj) != T_DATA) {
+      return SWIG_ERROR;
+    }
+    Data_Get_Struct(obj, void, vptr);
+  }
+  
+  if (own) *own = RDATA(obj)->dfree;
+    
+  /* Check to see if the input object is giving up ownership
+     of the underlying C struct or C++ object.  If so then we
+     need to reset the destructor since the Ruby object no 
+     longer owns the underlying C++ object.*/ 
+  if (flags & SWIG_POINTER_DISOWN) {
+    /* Is tracking on for this class? */
+    int track = 0;
+    if (ty && ty->clientdata) {
+      swig_class *sklass = (swig_class *) ty->clientdata;
+      track = sklass->trackObjects;
+    }
+		
+    if (track) {
+      /* We are tracking objects for this class.  Thus we change the destructor
+       * to SWIG_RubyRemoveTracking.  This allows us to
+       * remove the mapping from the C++ to Ruby object
+       * when the Ruby object is garbage collected.  If we don't
+       * do this, then it is possible we will return a reference 
+       * to a Ruby object that no longer exists thereby crashing Ruby. */
+      RDATA(obj)->dfree = SWIG_RubyRemoveTracking;
+    } else {    
+      RDATA(obj)->dfree = 0;
+    }
+  }
+
+  /* Do type-checking if type info was provided */
+  if (ty) {
+    if (ty->clientdata) {
+      if (rb_obj_is_kind_of(obj, ((swig_class *) (ty->clientdata))->klass)) {
+        if (vptr == 0) {
+          /* The object has already been deleted */
+          return SWIG_ObjectPreviouslyDeletedError;
+        }
+        *ptr = vptr;
+        return SWIG_OK;
+      }
+    }
+    if ((c = SWIG_MangleStr(obj)) == NULL) {
+      return SWIG_ERROR;
+    }
+    tc = SWIG_TypeCheck(c, ty);
+    if (!tc) {
+      return SWIG_ERROR;
+    } else {
+      int newmemory = 0;
+      *ptr = SWIG_TypeCast(tc, vptr, &newmemory);
+      assert(!newmemory); /* newmemory handling not yet implemented */
+    }
+  } else {
+    *ptr = vptr;
+  }
+  
+  return SWIG_OK;
+}
+
+/* Check convert */
+SWIGRUNTIMEINLINE int
+SWIG_Ruby_CheckConvert(VALUE obj, swig_type_info *ty)
+{
+  char *c = SWIG_MangleStr(obj);
+  if (!c) return 0;
+  return SWIG_TypeCheck(c,ty) != 0;
+}
+
+SWIGRUNTIME VALUE
+SWIG_Ruby_NewPackedObj(void *ptr, int sz, swig_type_info *type) {
+  char result[1024];
+  char *r = result;
+  if ((2*sz + 1 + strlen(type->name)) > 1000) return 0;
+  *(r++) = '_';
+  r = SWIG_PackData(r, ptr, sz);
+  strcpy(r, type->name);
+  return rb_str_new2(result);
+}
+
+/* Convert a packed value value */
+SWIGRUNTIME int
+SWIG_Ruby_ConvertPacked(VALUE obj, void *ptr, int sz, swig_type_info *ty) {
+  swig_cast_info *tc;
+  const char  *c;
+
+  if (TYPE(obj) != T_STRING) goto type_error;
+  c = StringValuePtr(obj);
+  /* Pointer values must start with leading underscore */
+  if (*c != '_') goto type_error;
+  c++;
+  c = SWIG_UnpackData(c, ptr, sz);
+  if (ty) {
+    tc = SWIG_TypeCheck(c, ty);
+    if (!tc) goto type_error;
+  }
+  return SWIG_OK;
+
+ type_error:
+  return SWIG_ERROR;
+}
+
+SWIGRUNTIME swig_module_info *
+SWIG_Ruby_GetModule(void)
+{
+  VALUE pointer;
+  swig_module_info *ret = 0;
+  VALUE verbose = rb_gv_get("VERBOSE");
+
+ /* temporarily disable warnings, since the pointer check causes warnings with 'ruby -w' */
+  rb_gv_set("VERBOSE", Qfalse);
+  
+  /* first check if pointer already created */
+  pointer = rb_gv_get("$swig_runtime_data_type_pointer" SWIG_RUNTIME_VERSION SWIG_TYPE_TABLE_NAME);
+  if (pointer != Qnil) {
+    Data_Get_Struct(pointer, swig_module_info, ret);
+  }
+
+  /* reinstate warnings */
+  rb_gv_set("VERBOSE", verbose);
+  return ret;
+}
+
+SWIGRUNTIME void 
+SWIG_Ruby_SetModule(swig_module_info *pointer)
+{
+  /* register a new class */
+  VALUE cl = rb_define_class("swig_runtime_data", rb_cObject);
+  /* create and store the structure pointer to a global variable */
+  swig_runtime_data_type_pointer = Data_Wrap_Struct(cl, 0, 0, pointer);
+  rb_define_readonly_variable("$swig_runtime_data_type_pointer" SWIG_RUNTIME_VERSION SWIG_TYPE_TABLE_NAME, &swig_runtime_data_type_pointer);
+}
+
+/* This function can be used to check whether a proc or method or similarly
+   callable function has been passed.  Usually used in a %typecheck, like:
+
+   %typecheck(c_callback_t, precedence=SWIG_TYPECHECK_POINTER) {
+        $result = SWIG_Ruby_isCallable( $input );
+   }
+ */
+SWIGINTERN
+int SWIG_Ruby_isCallable( VALUE proc )
+{
+  if ( rb_respond_to( proc, swig_call_id ) == Qtrue )
+    return 1;
+  return 0;
+}
+
+/* This function can be used to check the arity (number of arguments)
+   a proc or method can take.  Usually used in a %typecheck.
+   Valid arities will be that equal to minimal or those < 0
+   which indicate a variable number of parameters at the end.
+ */
+SWIGINTERN
+int SWIG_Ruby_arity( VALUE proc, int minimal )
+{
+  if ( rb_respond_to( proc, swig_arity_id ) == Qtrue )
+    {
+      VALUE num = rb_funcall( proc, swig_arity_id, 0 );
+      int arity = NUM2INT(num);
+      if ( arity < 0 && (arity+1) < -minimal ) return 1;
+      if ( arity == minimal ) return 1;
+      return 1;
+    }
+  return 0;
+}
+
+
+#ifdef __cplusplus
+}
+#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 
+
+
+
+  #define SWIG_exception(code, msg) do { SWIG_Error(code, msg);; } while(0) 
+
+
+/* -------- TYPES TABLE (BEGIN) -------- */
+
+#define SWIGTYPE_p_char swig_types[0]
+#define SWIGTYPE_p_double swig_types[1]
+#define SWIGTYPE_p_float swig_types[2]
+#define SWIGTYPE_p_int swig_types[3]
+#define SWIGTYPE_p_p_void swig_types[4]
+#define SWIGTYPE_p_uvio swig_types[5]
+static swig_type_info *swig_types[7];
+static swig_module_info swig_module = {swig_types, 6, 0, 0, 0, 0};
+#define SWIG_TypeQuery(name) SWIG_TypeQueryModule(&swig_module, &swig_module, name)
+#define SWIG_MangledTypeQuery(name) SWIG_MangledTypeQueryModule(&swig_module, &swig_module, name)
+
+/* -------- TYPES TABLE (END) -------- */
+
+#define SWIG_init    Init_miriad
+#define SWIG_name    "Miriad"
+
+static VALUE mMiriad;
+
+#define SWIG_RUBY_THREAD_BEGIN_BLOCK
+#define SWIG_RUBY_THREAD_END_BLOCK
+
+
+#define SWIGVERSION 0x010335 
+#define SWIG_VERSION SWIGVERSION
+
+
+#define SWIG_as_voidptr(a) (void *)((const void *)(a)) 
+#define SWIG_as_voidptrptr(a) ((void)SWIG_as_voidptr(*a),(void**)(a)) 
+
+
+#include "miriad.h"
+#define MAX_STRLEN (255)
+
+typedef struct {
+  int fd;
+} uvio;
+
+
+VALUE mirlib_eMirlibError;
+
+
+#include "narray.h"
+extern const char * na_typestring[];
+
+// Raises TypeError is v is not an NArray
+#define Check_NArray(v) \
+  if(!NA_IsNArray(v)) { \
+    rb_raise(rb_eTypeError,"requires NArray, got %s", \
+        rb_class2name(CLASS_OF(v))); \
+  }
+
+#define Check_NArrayType(v,tc) \
+  Check_NArray(v) \
+  if(tc >= NA_NTYPES) { \
+    rb_raise(rb_eArgError,"invalid type code check requested (%d)", tc); \
+  } \
+  if(NA_TYPE(v) >= NA_NTYPES) { \
+    rb_raise(rb_eArgError,"invalid type code found in NArray object (%d)", NA_TYPE(v)); \
+  } \
+  if(NA_TYPE(v) != tc) { \
+    rb_raise(rb_eTypeError,"requires type code %s (not %s)", \
+        na_typestring[tc], \
+        na_typestring[NA_TYPE(v)]); \
+  }
+
+#define Check_NArrayType2(v,tc1,tc2) \
+  Check_NArray(v) \
+  if(tc1 >= NA_NTYPES) { \
+    rb_raise(rb_eArgError,"invalid type code check requested (%d)", tc1); \
+  } \
+  if(tc2 >= NA_NTYPES) { \
+    rb_raise(rb_eArgError,"invalid type code check requested (%d)", tc2); \
+  } \
+  if(NA_TYPE(v) >= NA_NTYPES) { \
+    rb_raise(rb_eArgError,"invalid type code found in NArray object (%d)", NA_TYPE(v)); \
+  } \
+  if(NA_TYPE(v) != tc1 && NA_TYPE(v) != tc2) { \
+    rb_raise(rb_eTypeError,"requires type code %s or %s (not %s)", \
+        na_typestring[tc1], \
+        na_typestring[tc2], \
+        na_typestring[NA_TYPE(v)]); \
+  }
+
+
+SWIGINTERN swig_type_info*
+SWIG_pchar_descriptor(void)
+{
+  static int init = 0;
+  static swig_type_info* info = 0;
+  if (!init) {
+    info = SWIG_TypeQuery("_p_char");
+    init = 1;
+  }
+  return info;
+}
+
+
+SWIGINTERN int
+SWIG_AsCharPtrAndSize(VALUE obj, char** cptr, size_t* psize, int *alloc)
+{
+  if (TYPE(obj) == T_STRING) {
+    #if defined(StringValuePtr)
+    char *cstr = StringValuePtr(obj); 
+    #else
+    char *cstr = STR2CSTR(obj);
+    #endif
+    size_t size = RSTRING_LEN(obj) + 1;
+    if (cptr)  {
+      if (alloc) {
+	if (*alloc == SWIG_NEWOBJ) {
+	  *cptr = (char *)memcpy((char *)malloc((size)*sizeof(char)), cstr, sizeof(char)*(size));
+	} else {
+	  *cptr = cstr;
+	  *alloc = SWIG_OLDOBJ;
+	}
+      }
+    }
+    if (psize) *psize = size;
+    return SWIG_OK;
+  } else {
+    swig_type_info* pchar_descriptor = SWIG_pchar_descriptor();
+    if (pchar_descriptor) {
+      void* vptr = 0;
+      if (SWIG_ConvertPtr(obj, &vptr, pchar_descriptor, 0) == SWIG_OK) {
+	if (cptr) *cptr = (char *)vptr;
+	if (psize) *psize = vptr ? (strlen((char*)vptr) + 1) : 0;
+	if (alloc) *alloc = SWIG_OLDOBJ;
+	return SWIG_OK;
+      }
+    }
+  }  
+  return SWIG_TypeError;
+}
+
+
+
+
+SWIGINTERN uvio *new_uvio(char *name,char *status){
+      char * his_status = "append";
+      uvio * self;
+      if(name == NULL) {
+        SWIG_exception(SWIG_NullReferenceError,"invalid name");
+      }
+      if(status == NULL) {
+        SWIG_exception(SWIG_NullReferenceError,"invalid status");
+      }
+      switch(status[0]) {
+        case 'o':
+        case 'r': status = "old";
+                  his_status = "read";
+                  break;
+        case 'n':
+        case 'w': status = "new";
+                  break;
+        case 'a': status = "append";
+                  break;
+        default: SWIG_exception(SWIG_ValueError,"invalid status");
+                  break;
+      }
+      self = malloc(sizeof(uvio));
+      uvopen_c(&(self->fd), name, status);
+      // TODO Error check
+      hisopen_c(self->fd,his_status);
+      uvset_c(self->fd, "preamble", "uvw/time/baseline", 0, 0.0, 0.0, 0.0);
+      uvset_c(self->fd, "coord", "nanosec", 0, 0.0, 0.0, 0.0);
+      if(status[0] == 'o') {
+        // To read initial values of uv vars
+        uvnext_c(self->fd);
+        uvrewind_c(self->fd);
+      }
+      return self;
+    }
+SWIGINTERN void uvio_close(uvio *self){
+      hisclose_c(self->fd);
+      uvflush_c(self->fd);
+      uvclose_c(self->fd);
+      self->fd = -1;
+    }
+SWIGINTERN void uvio_flush(uvio *self){
+      uvflush_c(self->fd);
+    }
+SWIGINTERN void uvio_uvnext(uvio *self){
+      uvnext_c(self->fd);
+    }
+SWIGINTERN void uvio_rewind(uvio *self){
+      uvrewind_c(self->fd);
+    }
+SWIGINTERN void uvio_probvr(uvio *self,char *var,char *type,int *length,int *updated){
+      uvprobvr_c(self->fd, var, type, length, updated);
+    }
+
+#include <limits.h>
+#if !defined(SWIG_NO_LLONG_MAX)
+# if !defined(LLONG_MAX) && defined(__GNUC__) && defined (__LONG_LONG_MAX__)
+#   define LLONG_MAX __LONG_LONG_MAX__
+#   define LLONG_MIN (-LLONG_MAX - 1LL)
+#   define ULLONG_MAX (LLONG_MAX * 2ULL + 1ULL)
+# endif
+#endif
+
+
+SWIGINTERN VALUE
+SWIG_ruby_failed(void)
+{
+  return Qnil;
+} 
+
+
+/*@SWIG:/Users/davidm/local/share/swig/1.3.35/ruby/rubyprimtypes.swg,23,%ruby_aux_method@*/
+SWIGINTERN VALUE SWIG_AUX_NUM2LONG(VALUE *args)
+{
+  VALUE obj = args[0];
+  VALUE type = TYPE(obj);
+  long *res = (long *)(args[1]);
+  *res = type == T_FIXNUM ? NUM2LONG(obj) : rb_big2long(obj);
+  return obj;
+}
+/*@SWIG@*/
+
+SWIGINTERN int
+SWIG_AsVal_long (VALUE obj, long* val)
+{
+  VALUE type = TYPE(obj);
+  if ((type == T_FIXNUM) || (type == T_BIGNUM)) {
+    long v;
+    VALUE a[2];
+    a[0] = obj;
+    a[1] = (VALUE)(&v);
+    if (rb_rescue(RUBY_METHOD_FUNC(SWIG_AUX_NUM2LONG), (VALUE)a, RUBY_METHOD_FUNC(SWIG_ruby_failed), 0) != Qnil) {
+      if (val) *val = v;
+      return SWIG_OK;
+    }
+  }
+  return SWIG_TypeError;
+}
+
+
+SWIGINTERN int
+SWIG_AsVal_int (VALUE 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 = (int)(v);
+    }
+  }  
+  return res;
+}
+
+SWIGINTERN void uvio_putvr(uvio *self,char *var,char *data,int n,int type){
+      uvputvr_c(self->fd, type, var, data, n);
+    }
+SWIGINTERN void uvio_scan(uvio *self,char *var){
+      uvscan_c(self->fd, var);
+    }
+SWIGINTERN void uvio_write(uvio *self,double *preamble,float *data,int *flags,int n){
+      uvwrite_c(self->fd, preamble, data, flags, n);
+    }
+SWIGINTERN void uvio_wwrite(uvio *self,float *data,int *flags,int n){
+      uvwwrite_c(self->fd, data, flags, n);
+    }
+
+/*@SWIG:/Users/davidm/local/share/swig/1.3.35/ruby/rubyprimtypes.swg,23,%ruby_aux_method@*/
+SWIGINTERN VALUE SWIG_AUX_NUM2DBL(VALUE *args)
+{
+  VALUE obj = args[0];
+  VALUE type = TYPE(obj);
+  double *res = (double *)(args[1]);
+  *res = (type == T_FLOAT ? NUM2DBL(obj) : (type == T_FIXNUM ? (double) FIX2INT(obj) : rb_big2dbl(obj)));
+  return obj;
+}
+/*@SWIG@*/
+
+SWIGINTERN int
+SWIG_AsVal_double (VALUE obj, double *val)
+{
+  VALUE type = TYPE(obj);
+  if ((type == T_FLOAT) || (type == T_FIXNUM) || (type == T_BIGNUM)) {
+    double v;
+    VALUE a[2];
+    a[0] = obj;
+    a[1] = (VALUE)(&v);
+    if (rb_rescue(RUBY_METHOD_FUNC(SWIG_AUX_NUM2DBL), (VALUE)a, RUBY_METHOD_FUNC(SWIG_ruby_failed), 0) != Qnil) {
+      if (val) *val = v;
+      return SWIG_OK;
+    }
+  }
+  return SWIG_TypeError;
+}
+
+SWIGINTERN void uvio_set(uvio *self,char *object,char *type,int n,double p1,double p2,double p3){
+      uvset_c(self->fd, object, type, n, p1, p2, p3);
+    }
+SWIGINTERN void uvio_uvread(uvio *self,double *preamble,float *data,int *flags,int n,int *nread){
+      uvread_c(self->fd, preamble, data, flags, n, nread);
+    }
+SWIGINTERN void uvio_uvwread(uvio *self,float *data,int *flags,int n,int *nread){
+      uvwread_c(self->fd, data, flags, n, nread);
+    }
+SWIGINTERN void uvio_getvr(uvio *self,char *name,void **value,int *n,char *type){
+      int updated = 0;
+      *n = 0;
+      *type = ' ';
+      uvprobvr_c(self->fd,name,type,n,&updated);
+      if(*n > 0) {
+        switch(*type) {
+          case 'a': *value = malloc(sizeof(char)*((*n)+1));
+                    uvgetvr_c(self->fd,H_BYTE,name,(char *)(*value),((*n)+1));
+                    break;
+          case 'i': *value = malloc(sizeof(int)*(*n));
+                    uvgetvr_c(self->fd,H_INT,name,(char *)(*value),*n);
+                    break;
+          case 'r': *value = malloc(sizeof(float)*(*n));
+                    uvgetvr_c(self->fd,H_REAL,name,(char *)(*value),*n);
+                    break;
+          case 'd': *value = malloc(sizeof(double)*(*n));
+                    uvgetvr_c(self->fd,H_DBLE,name,(char *)(*value),*n);
+                    break;
+          case ' ': // Variable not present
+          case 'j': // Unsuported
+                    // Return NULL, but don't raise exception
+                    break;
+          default: // TODO Raise exception
+                    break;
+        }
+      }
+    }
+SWIGINTERN int uvio_updated(uvio *self){
+      return uvupdate_c(self->fd);
+    }
+SWIGINTERN void uvio_track(uvio *self,char *name,char *switches){
+      uvtrack_c(self->fd, name, switches);
+    }
+SWIGINTERN void uvio_sela(uvio *self,char *object,int datasel,char *string){
+      uvsela_c(self->fd, object, string, datasel);
+    }
+SWIGINTERN void uvio_select(uvio *self,char *object,int datasel,double p1,double p2){
+      uvselect_c(self->fd, object, p1, p2, datasel);
+    }
+SWIGINTERN void uvio_flagwr(uvio *self,int *flags){
+      uvflgwr_c(self->fd, flags);
+    }
+SWIGINTERN void uvio_wflagwr(uvio *self,int *flags){
+      uvwflgwr_c(self->fd, flags);
+    }
+SWIGINTERN int uvio_haccess(uvio *self,char *keyword,char *status){
+    int ihandle;
+    int iostat;
+
+    if(keyword == NULL) {
+      SWIG_exception(SWIG_NullReferenceError,"invalid item name");
+    }
+    if(status == NULL) {
+      SWIG_exception(SWIG_NullReferenceError,"invalid status");
+    }
+    switch(status[0]) {
+      case 'r': status = "read";
+                break;
+      case 'w': status = "write";
+                break;
+      case 'a': status = "append";
+                break;
+      case 's': status = "scratch";
+                break;
+      default: SWIG_exception(SWIG_ValueError,"invalid status");
+                break;
+    }
+
+    haccess_c(self->fd,&ihandle,keyword,status,&iostat);
+
+    if(iostat != 0) {
+      SWIG_exception(SWIG_IOError, "error opening item");
+    }
+    return ihandle;
+  }
+
+  #define SWIG_From_long   LONG2NUM 
+
+
+SWIGINTERNINLINE VALUE
+SWIG_From_int  (int value)
+{    
+  return SWIG_From_long  (value);
+}
+
+SWIGINTERN void uvio_hdaccess(uvio *self,int ihandle){
+    int iostat;
+    hdaccess_c(ihandle,&iostat);
+    if(iostat != 0 && iostat != -1) {
+      SWIG_exception(SWIG_IOError, "error closing item");
+    }
+  }
+
+/*@SWIG:/Users/davidm/local/share/swig/1.3.35/ruby/rubyprimtypes.swg,23,%ruby_aux_method@*/
+SWIGINTERN VALUE SWIG_AUX_NUM2ULONG(VALUE *args)
+{
+  VALUE obj = args[0];
+  VALUE type = TYPE(obj);
+  unsigned long *res = (unsigned long *)(args[1]);
+  *res = type == T_FIXNUM ? NUM2ULONG(obj) : rb_big2ulong(obj);
+  return obj;
+}
+/*@SWIG@*/
+
+SWIGINTERN int
+SWIG_AsVal_unsigned_SS_long (VALUE obj, unsigned long *val) 
+{
+  VALUE type = TYPE(obj);
+  if ((type == T_FIXNUM) || (type == T_BIGNUM)) {
+    unsigned long v;
+    VALUE a[2];
+    a[0] = obj;
+    a[1] = (VALUE)(&v);
+    if (rb_rescue(RUBY_METHOD_FUNC(SWIG_AUX_NUM2ULONG), (VALUE)a, RUBY_METHOD_FUNC(SWIG_ruby_failed), 0) != Qnil) {
+      if (val) *val = v;
+      return SWIG_OK;
+    }
+  }
+  return SWIG_TypeError;
+}
+
+
+SWIGINTERNINLINE int
+SWIG_AsVal_size_t (VALUE obj, size_t *val)
+{
+  unsigned long v;
+  int res = SWIG_AsVal_unsigned_SS_long (obj, val ? &v : 0);
+  if (SWIG_IsOK(res) && val) *val = (size_t)(v);
+  return res;
+}
+
+SWIGINTERN void uvio_hreadln(uvio *self,int ihandle,char *linein,size_t length,int *iostat){
+    if(linein == NULL) {
+      SWIG_exception(
+          SWIG_NullReferenceError, "no buffer to receive line from item");
+    }
+    if(length < 1) {
+      SWIG_exception(
+          SWIG_ValueError, "invalid buffer length to receive line from item");
+    }
+
+    hreada_c(ihandle, linein, length, iostat);
+    linein[length-1] = '\0';
+
+    if(*iostat != 0 && *iostat != -1) {
+      SWIG_exception(SWIG_IOError, "error reading item");
+    }
+  }
+SWIGINTERN void uvio_hwriteln(uvio *self,int ihandle,char *lineout,size_t length){
+    int iostat;
+    if(lineout == NULL) {
+      SWIG_exception(
+          SWIG_NullReferenceError, "no line to write to item");
+    }
+    if(length < 1) {
+      SWIG_exception(
+          SWIG_ValueError, "invalid line length to write to item");
+    }
+
+    hwritea_c(ihandle, lineout, length, &iostat);
+
+    if(iostat != 0 && iostat != -1) {
+      SWIG_exception(SWIG_IOError, "error writing item");
+    }
+  }
+SWIGINTERN void uvio_hiswrite(uvio *self,char *text){
+      hiswrite_c(self->fd, text);
+    }
+SWIGINTERN void uvio_wrhda(uvio *self,char *keyword,char *value){
+      wrhda_c (self->fd, keyword, value);
+    }
+swig_class cUvio;
+
+#ifdef HAVE_RB_DEFINE_ALLOC_FUNC
+SWIGINTERN VALUE
+_wrap_Uvio_allocate(VALUE self) {
+#else
+  SWIGINTERN VALUE
+  _wrap_Uvio_allocate(int argc, VALUE *argv, VALUE self) {
+#endif
+    
+    
+    VALUE vresult = SWIG_NewClassInstance(self, SWIGTYPE_p_uvio);
+#ifndef HAVE_RB_DEFINE_ALLOC_FUNC
+    rb_obj_call_init(vresult, argc, argv);
+#endif
+    return vresult;
+  }
+  
+
+SWIGINTERN VALUE
+_wrap_new_Uvio(int argc, VALUE *argv, VALUE self) {
+  char *arg1 = (char *) 0 ;
+  char *arg2 = (char *) 0 ;
+  uvio *result = 0 ;
+  int res2 ;
+  char *buf2 = 0 ;
+  int alloc2 = 0 ;
+  
+  if ((argc < 2) || (argc > 2)) {
+    rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)",argc); SWIG_fail;
+  }
+  {
+    arg1 = StringValuePtr(argv[0]);
+  }
+  res2 = SWIG_AsCharPtrAndSize(argv[1], &buf2, NULL, &alloc2);
+  if (!SWIG_IsOK(res2)) {
+    SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "char *","uvio", 2, argv[1] ));
+  }
+  arg2 = (char *)(buf2);
+  result = (uvio *)new_uvio(arg1,arg2);DATA_PTR(self) = result;
+  
+  if (alloc2 == SWIG_NEWOBJ) free((char*)buf2);
+  return self;
+fail:
+  if (alloc2 == SWIG_NEWOBJ) free((char*)buf2);
+  return Qnil;
+}
+
+
+SWIGINTERN void delete_uvio(uvio *self){
+      if(self->fd != -1) {
+        hisclose_c(self->fd);
+        uvflush_c(self->fd);
+        uvclose_c(self->fd);
+        self->fd = -1;
+      }
+      free(self);
+    }
+SWIGINTERN void
+free_uvio(uvio *arg1) {
+    delete_uvio(arg1);
+}
+
+SWIGINTERN VALUE
+_wrap_Uvio_close(int argc, VALUE *argv, VALUE self) {
+  uvio *arg1 = (uvio *) 0 ;
+  void *argp1 = 0 ;
+  int res1 = 0 ;
+  
+  if ((argc < 0) || (argc > 0)) {
+    rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail;
+  }
+  res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_uvio, 0 |  0 );
+  if (!SWIG_IsOK(res1)) {
+    SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "uvio *","close", 1, self )); 
+  }
+  arg1 = (uvio *)(argp1);
+  uvio_close(arg1);
+  return Qnil;
+fail:
+  return Qnil;
+}
+
+
+SWIGINTERN VALUE
+_wrap_Uvio_flush(int argc, VALUE *argv, VALUE self) {
+  uvio *arg1 = (uvio *) 0 ;
+  void *argp1 = 0 ;
+  int res1 = 0 ;
+  
+  if ((argc < 0) || (argc > 0)) {
+    rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail;
+  }
+  res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_uvio, 0 |  0 );
+  if (!SWIG_IsOK(res1)) {
+    SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "uvio *","flush", 1, self )); 
+  }
+  arg1 = (uvio *)(argp1);
+  uvio_flush(arg1);
+  return Qnil;
+fail:
+  return Qnil;
+}
+
+
+SWIGINTERN VALUE
+_wrap_Uvio_uvnext(int argc, VALUE *argv, VALUE self) {
+  uvio *arg1 = (uvio *) 0 ;
+  void *argp1 = 0 ;
+  int res1 = 0 ;
+  
+  if ((argc < 0) || (argc > 0)) {
+    rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail;
+  }
+  res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_uvio, 0 |  0 );
+  if (!SWIG_IsOK(res1)) {
+    SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "uvio *","uvnext", 1, self )); 
+  }
+  arg1 = (uvio *)(argp1);
+  uvio_uvnext(arg1);
+  return Qnil;
+fail:
+  return Qnil;
+}
+
+
+SWIGINTERN VALUE
+_wrap_Uvio_rewind(int argc, VALUE *argv, VALUE self) {
+  uvio *arg1 = (uvio *) 0 ;
+  void *argp1 = 0 ;
+  int res1 = 0 ;
+  
+  if ((argc < 0) || (argc > 0)) {
+    rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail;
+  }
+  res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_uvio, 0 |  0 );
+  if (!SWIG_IsOK(res1)) {
+    SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "uvio *","rewind", 1, self )); 
+  }
+  arg1 = (uvio *)(argp1);
+  uvio_rewind(arg1);
+  return Qnil;
+fail:
+  return Qnil;
+}
+
+
+SWIGINTERN VALUE
+_wrap_Uvio_probvr(int argc, VALUE *argv, VALUE self) {
+  uvio *arg1 = (uvio *) 0 ;
+  char *arg2 = (char *) 0 ;
+  char *arg3 = (char *) 0 ;
+  int *arg4 = (int *) 0 ;
+  int *arg5 = (int *) 0 ;
+  void *argp1 = 0 ;
+  int res1 = 0 ;
+  int res2 ;
+  char *buf2 = 0 ;
+  int alloc2 = 0 ;
+  char type3 ;
+  int length3 ;
+  int updated3 ;
+  VALUE vresult = Qnil;
+  
+  {
+    arg3 = &type3;
+    arg4 = &length3;
+    arg5 = &updated3;
+  }
+  if ((argc < 1) || (argc > 1)) {
+    rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
+  }
+  res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_uvio, 0 |  0 );
+  if (!SWIG_IsOK(res1)) {
+    SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "uvio *","probvr", 1, self )); 
+  }
+  arg1 = (uvio *)(argp1);
+  res2 = SWIG_AsCharPtrAndSize(argv[0], &buf2, NULL, &alloc2);
+  if (!SWIG_IsOK(res2)) {
+    SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "char *","probvr", 2, argv[0] ));
+  }
+  arg2 = (char *)(buf2);
+  uvio_probvr(arg1,arg2,arg3,arg4,arg5);
+  {
+    if(arg3[0] == ' ') {
+      vresult = Qnil;
+    } else {
+      vresult = SWIG_Ruby_AppendOutput(vresult, rb_str_new(arg3,1));
+      vresult = SWIG_Ruby_AppendOutput(vresult, INT2NUM(*arg4));
+      vresult = SWIG_Ruby_AppendOutput(vresult, *arg5 ? Qtrue : Qfalse);
+    }
+  }
+  if (alloc2 == SWIG_NEWOBJ) free((char*)buf2);
+  return vresult;
+fail:
+  if (alloc2 == SWIG_NEWOBJ) free((char*)buf2);
+  return Qnil;
+}
+
+
+SWIGINTERN VALUE
+_wrap_Uvio_putvr(int argc, VALUE *argv, VALUE self) {
+  uvio *arg1 = (uvio *) 0 ;
+  char *arg2 = (char *) 0 ;
+  char *arg3 = (char *) 0 ;
+  int arg4 ;
+  int arg5 = (int) -1 ;
+  void *argp1 = 0 ;
+  int res1 = 0 ;
+  int res2 ;
+  char *buf2 = 0 ;
+  int alloc2 = 0 ;
+  VALUE vinput3 ;
+  int datatype3 ;
+  
+  if ((argc < 2) || (argc > 3)) {
+    rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)",argc); SWIG_fail;
+  }
+  res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_uvio, 0 |  0 );
+  if (!SWIG_IsOK(res1)) {
+    SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "uvio *","putvr", 1, self )); 
+  }
+  arg1 = (uvio *)(argp1);
+  res2 = SWIG_AsCharPtrAndSize(argv[0], &buf2, NULL, &alloc2);
+  if (!SWIG_IsOK(res2)) {
+    SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "char *","putvr", 2, argv[0] ));
+  }
+  arg2 = (char *)(buf2);
+  {
+    // If NArray
+    if(NA_IsNArray(argv[1])) {
+      int type_code = NA_TYPE(argv[1]);
+      switch(type_code) {
+      case NA_SINT:
+        case NA_LINT: datatype3 = H_INT; break;
+        case NA_SFLOAT: datatype3 = H_REAL; break;
+        case NA_DFLOAT: datatype3 = H_DBLE; break;
+      default:
+        rb_raise(rb_eTypeError, "unsupported type code '%s'",
+          na_typestring[type_code]);
+      }
+      arg3 = NA_PTR_TYPE(argv[1],char *);
+      arg4 = NA_TOTAL(argv[1]);
+      
+      // Else, treat as Ruby type
+    } else {
+      VALUE elem0 = argv[1];
+      if(TYPE(argv[1]) == T_ARRAY) {
+        arg4 = RARRAY(argv[1])->len; 
+        elem0 = rb_ary_entry(argv[1],0);
+      } else {
+        // Convert into one element array
+        arg4 = 1;
+        argv[1] = rb_ary_new3(1,argv[1]);
+      }
+      // Autodetect Miriad type from Ruby type
+      // (Convenient, but not always a good idea)
+      switch(TYPE(elem0)) {
+      case T_FIXNUM:
+        case T_BIGNUM: datatype3 = H_INT; break;
+        case T_FLOAT: datatype3 = H_DBLE; break;
+        case T_STRING: datatype3 = H_BYTE; break;
+      default:
+        rb_raise(rb_eArgError,
+          "invalid or unsupported type for uv variable (%d)", TYPE(elem0));
+      }
+    }
+    vinput3 = argv[1];
+  }
+  if (argc > 2) {
+    {
+      arg5 = NUM2INT(argv[2]);
+      switch(arg5) {
+        case 'a': arg5 = H_BYTE; break;
+        case 'i': arg5 = H_INT; break;
+        case 'd': arg5 = H_DBLE; break;
+        case 'r': arg5 = H_REAL; break;
+      }
+    }
+  }
+  {
+    int i;
+    if(arg5 == -1) {
+      // Autodetect from Ruby type
+      arg5 = datatype3;
+    }
+    // NArray input will have already set pointer
+    if(TYPE(vinput3) == T_ARRAY) {
+      switch(arg5) {
+      case H_INT:
+        arg3 = (char *)ALLOCA_N(int,arg4);
+        for(i=0;i<arg4;i++) {
+          ((int *)arg3)[i] = NUM2INT(rb_ary_entry(vinput3,i));
+        }
+        break;
+      case H_REAL:
+        arg3 = (char *)ALLOCA_N(double,arg4);
+        for(i=0;i<arg4;i++) {
+          ((float *)arg3)[i] = NUM2DBL(rb_ary_entry(vinput3,i));
+        }
+        break;
+      case H_DBLE:
+        arg3 = (char *)ALLOCA_N(double,arg4);
+        for(i=0;i<arg4;i++) {
+          ((double *)arg3)[i] = NUM2DBL(rb_ary_entry(vinput3,i));
+        }
+        break;
+      case H_BYTE:
+        arg3 = RSTRING(rb_ary_entry(vinput3,0))->ptr;
+        arg4 = RSTRING(rb_ary_entry(vinput3,0))->len;
+        break;
+      default:
+        rb_raise(rb_eArgError,
+          "invalid or unsupported type for uv variable (%d)", arg5);
+      }
+    }
+  }
+  uvio_putvr(arg1,arg2,arg3,arg4,arg5);
+  if (alloc2 == SWIG_NEWOBJ) free((char*)buf2);
+  return Qnil;
+fail:
+  if (alloc2 == SWIG_NEWOBJ) free((char*)buf2);
+  return Qnil;
+}
+
+
+SWIGINTERN VALUE
+_wrap_Uvio_scan(int argc, VALUE *argv, VALUE self) {
+  uvio *arg1 = (uvio *) 0 ;
+  char *arg2 = (char *) 0 ;
+  void *argp1 = 0 ;
+  int res1 = 0 ;
+  int res2 ;
+  char *buf2 = 0 ;
+  int alloc2 = 0 ;
+  
+  if ((argc < 1) || (argc > 1)) {
+    rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
+  }
+  res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_uvio, 0 |  0 );
+  if (!SWIG_IsOK(res1)) {
+    SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "uvio *","scan", 1, self )); 
+  }
+  arg1 = (uvio *)(argp1);
+  res2 = SWIG_AsCharPtrAndSize(argv[0], &buf2, NULL, &alloc2);
+  if (!SWIG_IsOK(res2)) {
+    SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "char *","scan", 2, argv[0] ));
+  }
+  arg2 = (char *)(buf2);
+  uvio_scan(arg1,arg2);
+  if (alloc2 == SWIG_NEWOBJ) free((char*)buf2);
+  return Qnil;
+fail:
+  if (alloc2 == SWIG_NEWOBJ) free((char*)buf2);
+  return Qnil;
+}
+
+
+SWIGINTERN VALUE
+_wrap_Uvio_write(int argc, VALUE *argv, VALUE self) {
+  uvio *arg1 = (uvio *) 0 ;
+  double *arg2 = (double *) 0 ;
+  float *arg3 = (float *) 0 ;
+  int *arg4 = (int *) 0 ;
+  int arg5 ;
+  void *argp1 = 0 ;
+  int res1 = 0 ;
+  int ndata3 ;
+  int nflag4 ;
+  VALUE vresult = Qnil;
+  
+  if ((argc < 3) || (argc > 3)) {
+    rb_raise(rb_eArgError, "wrong # of arguments(%d for 3)",argc); SWIG_fail;
+  }
+  res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_uvio, 0 |  0 );
+  if (!SWIG_IsOK(res1)) {
+    SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "uvio *","write", 1, self )); 
+  }
+  arg1 = (uvio *)(argp1);
+  {
+    // If FIXNUM allocate NA_DFLOAT array that many
+    // This only makes sense for reads (or writing zeros)
+    if(TYPE(argv[0]) == T_FIXNUM) {
+      int rank = 1;
+      int shape = FIX2INT(argv[0]);
+      VALUE naclass = rb_const_get(rb_cObject,rb_intern("NArray"));
+      argv[0] = na_make_object(NA_DFLOAT,rank,&shape,naclass);
+    }
+    // If NArray
+    if(NA_IsNArray(argv[0])) {
+      Check_NArrayType(argv[0],NA_DFLOAT);
+      arg2 = NA_PTR_TYPE(argv[0],double *);
+    } else {
+      int i;
+      Check_Type(argv[0], T_ARRAY);
+      // Get the length of the array
+      // TODO Bounds checking somehow?
+      int n = RARRAY(argv[0])->len; 
+      arg2 = ALLOCA_N(double, n);
+      // Get the first element in array
+      VALUE *ptr = RARRAY(argv[0])->ptr; 
+      for (i=0; i < n; i++) {
+        // Convert Ruby Object to double
+        arg2[i] = NUM2DBL(ptr[i]); 
+      }
+    }
+  }
+  {
+    int i;
+    // If FIXNUM or BIGNUM, allocate NA_SCOMPLEX array that many
+    // This only makes sense for reads (or writing zeros)
+    if(TYPE(argv[1]) == T_FIXNUM || TYPE(argv[1]) == T_BIGNUM) {
+      ndata3 = NUM2INT(argv[1]);
+      int rank = 1;
+      int shape = ndata3;
+      VALUE naclass = rb_const_get(rb_cObject,rb_intern("NArray"));
+      argv[1] = na_make_object(NA_SCOMPLEX,rank,&shape,naclass);
+    }
+    // If NArray
+    if(NA_IsNArray(argv[1])) {
+      Check_NArrayType2(argv[1],NA_SFLOAT,NA_SCOMPLEX);
+      arg3 = NA_PTR_TYPE(argv[1],float *);
+      ndata3 = NA_TOTAL(argv[1]);
+      if(NA_TYPE(argv[1]) == NA_SFLOAT) {
+        ndata3 /= 2;
+      }
+    } else {
+      Check_Type(argv[1], T_ARRAY);
+      // Allocate C array on stack
+      ndata3 = RARRAY(argv[1])->len;
+      arg3 = ALLOCA_N(float,ndata3);
+      VALUE * ptr = RARRAY(argv[1])->ptr;
+      // TODO Use write in #if to avoid copying on read?
+      for(i=0; i < ndata3; i++) {
+        arg3[i] = NUM2DBL(ptr[i]);
+      }
+      ndata3 /= 2;
+    }
+  }
+  {
+    int i;
+    // If FIXNUM or BIGNUM, allocate NA_LINT array that many
+    // This only makes sense for reads (or writing zeros)
+    if(TYPE(argv[2]) == T_FIXNUM || TYPE(argv[2]) == T_BIGNUM) {
+      nflag4 = NUM2INT(argv[2]);
+      int rank = 1;
+      int shape = nflag4;
+      VALUE naclass = rb_const_get(rb_cObject,rb_intern("NArray"));
+      argv[2] = na_make_object(NA_LINT,rank,&shape,naclass);
+    }
+    // If NArray
+    if(NA_IsNArray(argv[2])) {
+      Check_NArrayType(argv[2],NA_LINT);
+      arg4 = NA_PTR_TYPE(argv[2],int *);
+      nflag4 = NA_TOTAL(argv[2]);
+    } else {
+      Check_Type(argv[2], T_ARRAY);
+      nflag4 = RARRAY(argv[2])->len;
+      arg4 = ALLOCA_N(int,nflag4);
+      VALUE * ptr = RARRAY(argv[2])->ptr;
+      for(i=0; i < nflag4; i++) {
+        arg4[i] = FIX2INT(ptr[i]);
+      }
+    }
+    
+    arg5 = nflag4;
+  }
+  {
+    if(ndata3 != nflag4) {
+      rb_raise(rb_eArgError,
+        "lengths of complex data (%d) and flags (%d) do not match", ndata3, nflag4);
+    }
+  }
+  uvio_write(arg1,arg2,arg3,arg4,arg5);
+  vresult = rb_ary_new();
+  {
+    // If NArray, data are already in place
+    if(TYPE(argv[0]) == T_ARRAY) {
+      int i;
+      // Get the length of the array
+      // TODO Bounds checking somehow?
+      int n = RARRAY(argv[0])->len; 
+      // Get the first element in array
+      VALUE *ptr = RARRAY(argv[0])->ptr; 
+      for (i=0; i < n; i++) {
+        // Store or convert doubles to Ruby Objects
+        if(TYPE(ptr[i]) == T_FLOAT) {
+          // TODO Is this legit?
+          RFLOAT(ptr[i])->value = arg2[i];
+        } else {
+          ptr[i] = rb_float_new(arg2[i]);
+        }
+      }
+    }
+    vresult = SWIG_Ruby_AppendOutput(vresult, argv[0]);
+  }
+  {
+    int ndata;
+    int i;
+    // If NArray, data are already in place
+    if(TYPE(argv[1]) == T_ARRAY) {
+      ndata = RARRAY(argv[1])->len;
+      VALUE * ptr = RARRAY(argv[1])->ptr;
+      for(i=0; i < ndata; i++) {
+        // Store or convert doubles to Ruby Objects
+        if(TYPE(ptr[i]) == T_FLOAT) {
+          // TODO Is this legit?
+          RFLOAT(ptr[i])->value = arg3[i];
+        } else {
+          ptr[i] = rb_float_new(arg3[i]);
+        }
+      }
+    }
+    vresult = SWIG_Ruby_AppendOutput(vresult, argv[1]);
+  }
+  {
+    int nflag;
+    int i;
+    // If NArray, data are already in place
+    if(TYPE(argv[2]) == T_ARRAY) {
+      nflag = RARRAY(argv[2])->len;
+      VALUE * ptr = RARRAY(argv[2])->ptr;
+      for(i=0; i < nflag; i++) {
+        ptr[i] = INT2FIX(arg4[i]);
+      }
+    }
+    vresult = SWIG_Ruby_AppendOutput(vresult, argv[2]);
+  }
+  return vresult;
+fail:
+  return Qnil;
+}
+
+
+SWIGINTERN VALUE
+_wrap_Uvio_wwrite(int argc, VALUE *argv, VALUE self) {
+  uvio *arg1 = (uvio *) 0 ;
+  float *arg2 = (float *) 0 ;
+  int *arg3 = (int *) 0 ;
+  int arg4 ;
+  void *argp1 = 0 ;
+  int res1 = 0 ;
+  int ndata2 ;
+  int nflag3 ;
+  VALUE vresult = Qnil;
+  
+  if ((argc < 2) || (argc > 2)) {
+    rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)",argc); SWIG_fail;
+  }
+  res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_uvio, 0 |  0 );
+  if (!SWIG_IsOK(res1)) {
+    SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "uvio *","wwrite", 1, self )); 
+  }
+  arg1 = (uvio *)(argp1);
+  {
+    int i;
+    // If FIXNUM or BIGNUM, allocate NA_SCOMPLEX array that many
+    // This only makes sense for reads (or writing zeros)
+    if(TYPE(argv[0]) == T_FIXNUM || TYPE(argv[0]) == T_BIGNUM) {
+      ndata2 = NUM2INT(argv[0]);
+      int rank = 1;
+      int shape = ndata2;
+      VALUE naclass = rb_const_get(rb_cObject,rb_intern("NArray"));
+      argv[0] = na_make_object(NA_SCOMPLEX,rank,&shape,naclass);
+    }
+    // If NArray
+    if(NA_IsNArray(argv[0])) {
+      Check_NArrayType2(argv[0],NA_SFLOAT,NA_SCOMPLEX);
+      arg2 = NA_PTR_TYPE(argv[0],float *);
+      ndata2 = NA_TOTAL(argv[0]);
+      if(NA_TYPE(argv[0]) == NA_SFLOAT) {
+        ndata2 /= 2;
+      }
+    } else {
+      Check_Type(argv[0], T_ARRAY);
+      // Allocate C array on stack
+      ndata2 = RARRAY(argv[0])->len;
+      arg2 = ALLOCA_N(float,ndata2);
+      VALUE * ptr = RARRAY(argv[0])->ptr;
+      // TODO Use wwrite in #if to avoid copying on read?
+      for(i=0; i < ndata2; i++) {
+        arg2[i] = NUM2DBL(ptr[i]);
+      }
+      ndata2 /= 2;
+    }
+  }
+  {
+    int i;
+    // If FIXNUM or BIGNUM, allocate NA_LINT array that many
+    // This only makes sense for reads (or writing zeros)
+    if(TYPE(argv[1]) == T_FIXNUM || TYPE(argv[1]) == T_BIGNUM) {
+      nflag3 = NUM2INT(argv[1]);
+      int rank = 1;
+      int shape = nflag3;
+      VALUE naclass = rb_const_get(rb_cObject,rb_intern("NArray"));
+      argv[1] = na_make_object(NA_LINT,rank,&shape,naclass);
+    }
+    // If NArray
+    if(NA_IsNArray(argv[1])) {
+      Check_NArrayType(argv[1],NA_LINT);
+      arg3 = NA_PTR_TYPE(argv[1],int *);
+      nflag3 = NA_TOTAL(argv[1]);
+    } else {
+      Check_Type(argv[1], T_ARRAY);
+      nflag3 = RARRAY(argv[1])->len;
+      arg3 = ALLOCA_N(int,nflag3);
+      VALUE * ptr = RARRAY(argv[1])->ptr;
+      for(i=0; i < nflag3; i++) {
+        arg3[i] = FIX2INT(ptr[i]);
+      }
+    }
+    
+    arg4 = nflag3;
+  }
+  uvio_wwrite(arg1,arg2,arg3,arg4);
+  vresult = rb_ary_new();
+  {
+    int ndata;
+    int i;
+    // If NArray, data are already in place
+    if(TYPE(argv[0]) == T_ARRAY) {
+      ndata = RARRAY(argv[0])->len;
+      VALUE * ptr = RARRAY(argv[0])->ptr;
+      for(i=0; i < ndata; i++) {
+        // Store or convert doubles to Ruby Objects
+        if(TYPE(ptr[i]) == T_FLOAT) {
+          // TODO Is this legit?
+          RFLOAT(ptr[i])->value = arg2[i];
+        } else {
+          ptr[i] = rb_float_new(arg2[i]);
+        }
+      }
+    }
+    vresult = SWIG_Ruby_AppendOutput(vresult, argv[0]);
+  }
+  {
+    int nflag;
+    int i;
+    // If NArray, data are already in place
+    if(TYPE(argv[1]) == T_ARRAY) {
+      nflag = RARRAY(argv[1])->len;
+      VALUE * ptr = RARRAY(argv[1])->ptr;
+      for(i=0; i < nflag; i++) {
+        ptr[i] = INT2FIX(arg3[i]);
+      }
+    }
+    vresult = SWIG_Ruby_AppendOutput(vresult, argv[1]);
+  }
+  return vresult;
+fail:
+  return Qnil;
+}
+
+
+SWIGINTERN VALUE
+_wrap_Uvio_set(int argc, VALUE *argv, VALUE self) {
+  uvio *arg1 = (uvio *) 0 ;
+  char *arg2 = (char *) 0 ;
+  char *arg3 = (char *) 0 ;
+  int arg4 = (int) 0 ;
+  double arg5 = (double) 0.0 ;
+  double arg6 = (double) 0.0 ;
+  double arg7 = (double) 0.0 ;
+  void *argp1 = 0 ;
+  int res1 = 0 ;
+  int res2 ;
+  char *buf2 = 0 ;
+  int alloc2 = 0 ;
+  int res3 ;
+  char *buf3 = 0 ;
+  int alloc3 = 0 ;
+  int val4 ;
+  int ecode4 = 0 ;
+  double val5 ;
+  int ecode5 = 0 ;
+  double val6 ;
+  int ecode6 = 0 ;
+  double val7 ;
+  int ecode7 = 0 ;
+  
+  if ((argc < 2) || (argc > 6)) {
+    rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)",argc); SWIG_fail;
+  }
+  res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_uvio, 0 |  0 );
+  if (!SWIG_IsOK(res1)) {
+    SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "uvio *","set", 1, self )); 
+  }
+  arg1 = (uvio *)(argp1);
+  res2 = SWIG_AsCharPtrAndSize(argv[0], &buf2, NULL, &alloc2);
+  if (!SWIG_IsOK(res2)) {
+    SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "char *","set", 2, argv[0] ));
+  }
+  arg2 = (char *)(buf2);
+  res3 = SWIG_AsCharPtrAndSize(argv[1], &buf3, NULL, &alloc3);
+  if (!SWIG_IsOK(res3)) {
+    SWIG_exception_fail(SWIG_ArgError(res3), Ruby_Format_TypeError( "", "char *","set", 3, argv[1] ));
+  }
+  arg3 = (char *)(buf3);
+  if (argc > 2) {
+    ecode4 = SWIG_AsVal_int(argv[2], &val4);
+    if (!SWIG_IsOK(ecode4)) {
+      SWIG_exception_fail(SWIG_ArgError(ecode4), Ruby_Format_TypeError( "", "int","set", 4, argv[2] ));
+    } 
+    arg4 = (int)(val4);
+  }
+  if (argc > 3) {
+    ecode5 = SWIG_AsVal_double(argv[3], &val5);
+    if (!SWIG_IsOK(ecode5)) {
+      SWIG_exception_fail(SWIG_ArgError(ecode5), Ruby_Format_TypeError( "", "double","set", 5, argv[3] ));
+    } 
+    arg5 = (double)(val5);
+  }
+  if (argc > 4) {
+    ecode6 = SWIG_AsVal_double(argv[4], &val6);
+    if (!SWIG_IsOK(ecode6)) {
+      SWIG_exception_fail(SWIG_ArgError(ecode6), Ruby_Format_TypeError( "", "double","set", 6, argv[4] ));
+    } 
+    arg6 = (double)(val6);
+  }
+  if (argc > 5) {
+    ecode7 = SWIG_AsVal_double(argv[5], &val7);
+    if (!SWIG_IsOK(ecode7)) {
+      SWIG_exception_fail(SWIG_ArgError(ecode7), Ruby_Format_TypeError( "", "double","set", 7, argv[5] ));
+    } 
+    arg7 = (double)(val7);
+  }
+  uvio_set(arg1,arg2,arg3,arg4,arg5,arg6,arg7);
+  if (alloc2 == SWIG_NEWOBJ) free((char*)buf2);
+  if (alloc3 == SWIG_NEWOBJ) free((char*)buf3);
+  return Qnil;
+fail:
+  if (alloc2 == SWIG_NEWOBJ) free((char*)buf2);
+  if (alloc3 == SWIG_NEWOBJ) free((char*)buf3);
+  return Qnil;
+}
+
+
+SWIGINTERN VALUE
+_wrap_Uvio_uvread(int argc, VALUE *argv, VALUE self) {
+  uvio *arg1 = (uvio *) 0 ;
+  double *arg2 = (double *) 0 ;
+  float *arg3 = (float *) 0 ;
+  int *arg4 = (int *) 0 ;
+  int arg5 ;
+  int *arg6 = (int *) 0 ;
+  void *argp1 = 0 ;
+  int res1 = 0 ;
+  int ndata3 ;
+  int nflag4 ;
+  int temp6 ;
+  VALUE vresult = Qnil;
+  
+  {
+    arg6 = &temp6;
+  }
+  if ((argc < 3) || (argc > 3)) {
+    rb_raise(rb_eArgError, "wrong # of arguments(%d for 3)",argc); SWIG_fail;
+  }
+  res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_uvio, 0 |  0 );
+  if (!SWIG_IsOK(res1)) {
+    SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "uvio *","uvread", 1, self )); 
+  }
+  arg1 = (uvio *)(argp1);
+  {
+    // If FIXNUM allocate NA_DFLOAT array that many
+    // This only makes sense for reads (or writing zeros)
+    if(TYPE(argv[0]) == T_FIXNUM) {
+      int rank = 1;
+      int shape = FIX2INT(argv[0]);
+      VALUE naclass = rb_const_get(rb_cObject,rb_intern("NArray"));
+      argv[0] = na_make_object(NA_DFLOAT,rank,&shape,naclass);
+    }
+    // If NArray
+    if(NA_IsNArray(argv[0])) {
+      Check_NArrayType(argv[0],NA_DFLOAT);
+      arg2 = NA_PTR_TYPE(argv[0],double *);
+    } else {
+      int i;
+      Check_Type(argv[0], T_ARRAY);
+      // Get the length of the array
+      // TODO Bounds checking somehow?
+      int n = RARRAY(argv[0])->len; 
+      arg2 = ALLOCA_N(double, n);
+      // Get the first element in array
+      VALUE *ptr = RARRAY(argv[0])->ptr; 
+      for (i=0; i < n; i++) {
+        // Convert Ruby Object to double
+        arg2[i] = NUM2DBL(ptr[i]); 
+      }
+    }
+  }
+  {
+    int i;
+    // If FIXNUM or BIGNUM, allocate NA_SCOMPLEX array that many
+    // This only makes sense for reads (or writing zeros)
+    if(TYPE(argv[1]) == T_FIXNUM || TYPE(argv[1]) == T_BIGNUM) {
+      ndata3 = NUM2INT(argv[1]);
+      int rank = 1;
+      int shape = ndata3;
+      VALUE naclass = rb_const_get(rb_cObject,rb_intern("NArray"));
+      argv[1] = na_make_object(NA_SCOMPLEX,rank,&shape,naclass);
+    }
+    // If NArray
+    if(NA_IsNArray(argv[1])) {
+      Check_NArrayType2(argv[1],NA_SFLOAT,NA_SCOMPLEX);
+      arg3 = NA_PTR_TYPE(argv[1],float *);
+      ndata3 = NA_TOTAL(argv[1]);
+      if(NA_TYPE(argv[1]) == NA_SFLOAT) {
+        ndata3 /= 2;
+      }
+    } else {
+      Check_Type(argv[1], T_ARRAY);
+      // Allocate C array on stack
+      ndata3 = RARRAY(argv[1])->len;
+      arg3 = ALLOCA_N(float,ndata3);
+      VALUE * ptr = RARRAY(argv[1])->ptr;
+      // TODO Use uvread in #if to avoid copying on read?
+      for(i=0; i < ndata3; i++) {
+        arg3[i] = NUM2DBL(ptr[i]);
+      }
+      ndata3 /= 2;
+    }
+  }
+  {
+    int i;
+    // If FIXNUM or BIGNUM, allocate NA_LINT array that many
+    // This only makes sense for reads (or writing zeros)
+    if(TYPE(argv[2]) == T_FIXNUM || TYPE(argv[2]) == T_BIGNUM) {
+      nflag4 = NUM2INT(argv[2]);
+      int rank = 1;
+      int shape = nflag4;
+      VALUE naclass = rb_const_get(rb_cObject,rb_intern("NArray"));
+      argv[2] = na_make_object(NA_LINT,rank,&shape,naclass);
+    }
+    // If NArray
+    if(NA_IsNArray(argv[2])) {
+      Check_NArrayType(argv[2],NA_LINT);
+      arg4 = NA_PTR_TYPE(argv[2],int *);
+      nflag4 = NA_TOTAL(argv[2]);
+    } else {
+      Check_Type(argv[2], T_ARRAY);
+      nflag4 = RARRAY(argv[2])->len;
+      arg4 = ALLOCA_N(int,nflag4);
+      VALUE * ptr = RARRAY(argv[2])->ptr;
+      for(i=0; i < nflag4; i++) {
+        arg4[i] = FIX2INT(ptr[i]);
+      }
+    }
+    
+    arg5 = nflag4;
+  }
+  {
+    if(ndata3 != nflag4) {
+      rb_raise(rb_eArgError,
+        "lengths of complex data (%d) and flags (%d) do not match", ndata3, nflag4);
+    }
+  }
+  uvio_uvread(arg1,arg2,arg3,arg4,arg5,arg6);
+  vresult = rb_ary_new();
+  {
+    // If NArray, data are already in place
+    if(TYPE(argv[0]) == T_ARRAY) {
+      int i;
+      // Get the length of the array
+      // TODO Bounds checking somehow?
+      int n = RARRAY(argv[0])->len; 
+      // Get the first element in array
+      VALUE *ptr = RARRAY(argv[0])->ptr; 
+      for (i=0; i < n; i++) {
+        // Store or convert doubles to Ruby Objects
+        if(TYPE(ptr[i]) == T_FLOAT) {
+          // TODO Is this legit?
+          RFLOAT(ptr[i])->value = arg2[i];
+        } else {
+          ptr[i] = rb_float_new(arg2[i]);
+        }
+      }
+    }
+    vresult = SWIG_Ruby_AppendOutput(vresult, argv[0]);
+  }
+  {
+    int ndata;
+    int i;
+    // If NArray, data are already in place
+    if(TYPE(argv[1]) == T_ARRAY) {
+      ndata = RARRAY(argv[1])->len;
+      VALUE * ptr = RARRAY(argv[1])->ptr;
+      for(i=0; i < ndata; i++) {
+        // Store or convert doubles to Ruby Objects
+        if(TYPE(ptr[i]) == T_FLOAT) {
+          // TODO Is this legit?
+          RFLOAT(ptr[i])->value = arg3[i];
+        } else {
+          ptr[i] = rb_float_new(arg3[i]);
+        }
+      }
+    }
+    vresult = SWIG_Ruby_AppendOutput(vresult, argv[1]);
+  }
+  {
+    int nflag;
+    int i;
+    // If NArray, data are already in place
+    if(TYPE(argv[2]) == T_ARRAY) {
+      nflag = RARRAY(argv[2])->len;
+      VALUE * ptr = RARRAY(argv[2])->ptr;
+      for(i=0; i < nflag; i++) {
+        ptr[i] = INT2FIX(arg4[i]);
+      }
+    }
+    vresult = SWIG_Ruby_AppendOutput(vresult, argv[2]);
+  }
+  {
+    rb_ary_unshift(vresult,INT2NUM(*arg6));
+  }
+  return vresult;
+fail:
+  return Qnil;
+}
+
+
+SWIGINTERN VALUE
+_wrap_Uvio_uvwread(int argc, VALUE *argv, VALUE self) {
+  uvio *arg1 = (uvio *) 0 ;
+  float *arg2 = (float *) 0 ;
+  int *arg3 = (int *) 0 ;
+  int arg4 ;
+  int *arg5 = (int *) 0 ;
+  void *argp1 = 0 ;
+  int res1 = 0 ;
+  int ndata2 ;
+  int nflag3 ;
+  int temp5 ;
+  VALUE vresult = Qnil;
+  
+  {
+    arg5 = &temp5;
+  }
+  if ((argc < 2) || (argc > 2)) {
+    rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)",argc); SWIG_fail;
+  }
+  res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_uvio, 0 |  0 );
+  if (!SWIG_IsOK(res1)) {
+    SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "uvio *","uvwread", 1, self )); 
+  }
+  arg1 = (uvio *)(argp1);
+  {
+    int i;
+    // If FIXNUM or BIGNUM, allocate NA_SCOMPLEX array that many
+    // This only makes sense for reads (or writing zeros)
+    if(TYPE(argv[0]) == T_FIXNUM || TYPE(argv[0]) == T_BIGNUM) {
+      ndata2 = NUM2INT(argv[0]);
+      int rank = 1;
+      int shape = ndata2;
+      VALUE naclass = rb_const_get(rb_cObject,rb_intern("NArray"));
+      argv[0] = na_make_object(NA_SCOMPLEX,rank,&shape,naclass);
+    }
+    // If NArray
+    if(NA_IsNArray(argv[0])) {
+      Check_NArrayType2(argv[0],NA_SFLOAT,NA_SCOMPLEX);
+      arg2 = NA_PTR_TYPE(argv[0],float *);
+      ndata2 = NA_TOTAL(argv[0]);
+      if(NA_TYPE(argv[0]) == NA_SFLOAT) {
+        ndata2 /= 2;
+      }
+    } else {
+      Check_Type(argv[0], T_ARRAY);
+      // Allocate C array on stack
+      ndata2 = RARRAY(argv[0])->len;
+      arg2 = ALLOCA_N(float,ndata2);
+      VALUE * ptr = RARRAY(argv[0])->ptr;
+      // TODO Use uvwread in #if to avoid copying on read?
+      for(i=0; i < ndata2; i++) {
+        arg2[i] = NUM2DBL(ptr[i]);
+      }
+      ndata2 /= 2;
+    }
+  }
+  {
+    int i;
+    // If FIXNUM or BIGNUM, allocate NA_LINT array that many
+    // This only makes sense for reads (or writing zeros)
+    if(TYPE(argv[1]) == T_FIXNUM || TYPE(argv[1]) == T_BIGNUM) {
+      nflag3 = NUM2INT(argv[1]);
+      int rank = 1;
+      int shape = nflag3;
+      VALUE naclass = rb_const_get(rb_cObject,rb_intern("NArray"));
+      argv[1] = na_make_object(NA_LINT,rank,&shape,naclass);
+    }
+    // If NArray
+    if(NA_IsNArray(argv[1])) {
+      Check_NArrayType(argv[1],NA_LINT);
+      arg3 = NA_PTR_TYPE(argv[1],int *);
+      nflag3 = NA_TOTAL(argv[1]);
+    } else {
+      Check_Type(argv[1], T_ARRAY);
+      nflag3 = RARRAY(argv[1])->len;
+      arg3 = ALLOCA_N(int,nflag3);
+      VALUE * ptr = RARRAY(argv[1])->ptr;
+      for(i=0; i < nflag3; i++) {
+        arg3[i] = FIX2INT(ptr[i]);
+      }
+    }
+    
+    arg4 = nflag3;
+  }
+  uvio_uvwread(arg1,arg2,arg3,arg4,arg5);
+  vresult = rb_ary_new();
+  {
+    int ndata;
+    int i;
+    // If NArray, data are already in place
+    if(TYPE(argv[0]) == T_ARRAY) {
+      ndata = RARRAY(argv[0])->len;
+      VALUE * ptr = RARRAY(argv[0])->ptr;
+      for(i=0; i < ndata; i++) {
+        // Store or convert doubles to Ruby Objects
+        if(TYPE(ptr[i]) == T_FLOAT) {
+          // TODO Is this legit?
+          RFLOAT(ptr[i])->value = arg2[i];
+        } else {
+          ptr[i] = rb_float_new(arg2[i]);
+        }
+      }
+    }
+    vresult = SWIG_Ruby_AppendOutput(vresult, argv[0]);
+  }
+  {
+    int nflag;
+    int i;
+    // If NArray, data are already in place
+    if(TYPE(argv[1]) == T_ARRAY) {
+      nflag = RARRAY(argv[1])->len;
+      VALUE * ptr = RARRAY(argv[1])->ptr;
+      for(i=0; i < nflag; i++) {
+        ptr[i] = INT2FIX(arg3[i]);
+      }
+    }
+    vresult = SWIG_Ruby_AppendOutput(vresult, argv[1]);
+  }
+  {
+    rb_ary_unshift(vresult,INT2NUM(*arg5));
+  }
+  return vresult;
+fail:
+  return Qnil;
+}
+
+
+SWIGINTERN VALUE
+_wrap_Uvio_getvr(int argc, VALUE *argv, VALUE self) {
+  uvio *arg1 = (uvio *) 0 ;
+  char *arg2 = (char *) 0 ;
+  void **arg3 = (void **) 0 ;
+  int *arg4 = (int *) 0 ;
+  char *arg5 = (char *) 0 ;
+  void *argp1 = 0 ;
+  int res1 = 0 ;
+  void *value3 ;
+  int n3 ;
+  char type3 ;
+  VALUE vresult = Qnil;
+  
+  {
+    value3 = NULL;
+    arg3 = &value3;
+    arg4 = &n3;
+    arg5 = &type3;
+  }
+  if ((argc < 1) || (argc > 1)) {
+    rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
+  }
+  res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_uvio, 0 |  0 );
+  if (!SWIG_IsOK(res1)) {
+    SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "uvio *","getvr", 1, self )); 
+  }
+  arg1 = (uvio *)(argp1);
+  {
+    arg2 = StringValuePtr(argv[0]);
+  }
+  uvio_getvr(arg1,arg2,arg3,arg4,arg5);
+  {
+    int i;
+    vresult = Qnil;
+    if(n3 == 1 || type3 == 'a') {
+      switch(type3) {
+        case 'a': vresult = rb_tainted_str_new((char *)value3, n3);
+        break;
+        case 'i': vresult = INT2NUM(*(int *)value3);
+        break;
+        case 'r': vresult = rb_float_new((double)*(float *)value3);
+        break;
+        case 'd': vresult = rb_float_new(*(double *)value3);
+        break;
+        case ' ': // Variable not present
+        case 'j': // Unsuported
+        // Return NULL, but don't raise exception
+        break;
+        default: // TODO Raise exception
+        break;
+      }
+    } else if(n3 > 1) {
+      VALUE * elems = ALLOCA_N(VALUE,n3);
+      switch(type3) {
+      case 'i':
+        for(i = 0; i < n3; i++) {
+          elems[i] = INT2NUM(((int *)value3)[i]);
+        }
+        vresult = rb_ary_new4(n3,elems);
+        break;
+      case 'r':
+        for(i = 0; i < n3; i++) {
+          elems[i] = rb_float_new((double)(((float *)value3)[i]));
+        }
+        vresult = rb_ary_new4(n3,elems);
+        break;
+      case 'd':
+        for(i = 0; i < n3; i++) {
+          elems[i] = rb_float_new(((double *)value3)[i]);
+        }
+        vresult = rb_ary_new4(n3,elems);
+        break;
+        case ' ': // Variable not present
+        case 'j': // Unsuported
+        // Return NULL, but don't raise exception
+        break;
+        default: // TODO Raise exception
+        break;
+      }
+    }
+    // Free buffer allocated by getvr
+    free(value3);
+  }
+  return vresult;
+fail:
+  return Qnil;
+}
+
+
+SWIGINTERN VALUE
+_wrap_Uvio_updatedq___(int argc, VALUE *argv, VALUE self) {
+  uvio *arg1 = (uvio *) 0 ;
+  int result;
+  void *argp1 = 0 ;
+  int res1 = 0 ;
+  VALUE vresult = Qnil;
+  
+  if ((argc < 0) || (argc > 0)) {
+    rb_raise(rb_eArgError, "wrong # of arguments(%d for 0)",argc); SWIG_fail;
+  }
+  res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_uvio, 0 |  0 );
+  if (!SWIG_IsOK(res1)) {
+    SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "uvio *","updated", 1, self )); 
+  }
+  arg1 = (uvio *)(argp1);
+  result = (int)uvio_updated(arg1);
+  vresult = (result ? Qtrue : Qfalse);
+  return vresult;
+fail:
+  return Qnil;
+}
+
+
+SWIGINTERN VALUE
+_wrap_Uvio_track(int argc, VALUE *argv, VALUE self) {
+  uvio *arg1 = (uvio *) 0 ;
+  char *arg2 = (char *) 0 ;
+  char *arg3 = (char *) 0 ;
+  void *argp1 = 0 ;
+  int res1 = 0 ;
+  int res3 ;
+  char *buf3 = 0 ;
+  int alloc3 = 0 ;
+  
+  if ((argc < 2) || (argc > 2)) {
+    rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)",argc); SWIG_fail;
+  }
+  res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_uvio, 0 |  0 );
+  if (!SWIG_IsOK(res1)) {
+    SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "uvio *","track", 1, self )); 
+  }
+  arg1 = (uvio *)(argp1);
+  {
+    arg2 = StringValuePtr(argv[0]);
+  }
+  res3 = SWIG_AsCharPtrAndSize(argv[1], &buf3, NULL, &alloc3);
+  if (!SWIG_IsOK(res3)) {
+    SWIG_exception_fail(SWIG_ArgError(res3), Ruby_Format_TypeError( "", "char *","track", 3, argv[1] ));
+  }
+  arg3 = (char *)(buf3);
+  uvio_track(arg1,arg2,arg3);
+  if (alloc3 == SWIG_NEWOBJ) free((char*)buf3);
+  return Qnil;
+fail:
+  if (alloc3 == SWIG_NEWOBJ) free((char*)buf3);
+  return Qnil;
+}
+
+
+SWIGINTERN VALUE
+_wrap_Uvio_sela(int argc, VALUE *argv, VALUE self) {
+  uvio *arg1 = (uvio *) 0 ;
+  char *arg2 = (char *) 0 ;
+  int arg3 ;
+  char *arg4 = (char *) 0 ;
+  void *argp1 = 0 ;
+  int res1 = 0 ;
+  int res2 ;
+  char *buf2 = 0 ;
+  int alloc2 = 0 ;
+  int val3 ;
+  int ecode3 = 0 ;
+  int res4 ;
+  char *buf4 = 0 ;
+  int alloc4 = 0 ;
+  
+  if ((argc < 3) || (argc > 3)) {
+    rb_raise(rb_eArgError, "wrong # of arguments(%d for 3)",argc); SWIG_fail;
+  }
+  res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_uvio, 0 |  0 );
+  if (!SWIG_IsOK(res1)) {
+    SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "uvio *","sela", 1, self )); 
+  }
+  arg1 = (uvio *)(argp1);
+  res2 = SWIG_AsCharPtrAndSize(argv[0], &buf2, NULL, &alloc2);
+  if (!SWIG_IsOK(res2)) {
+    SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "char *","sela", 2, argv[0] ));
+  }
+  arg2 = (char *)(buf2);
+  ecode3 = SWIG_AsVal_int(argv[1], &val3);
+  if (!SWIG_IsOK(ecode3)) {
+    SWIG_exception_fail(SWIG_ArgError(ecode3), Ruby_Format_TypeError( "", "int","sela", 3, argv[1] ));
+  } 
+  arg3 = (int)(val3);
+  res4 = SWIG_AsCharPtrAndSize(argv[2], &buf4, NULL, &alloc4);
+  if (!SWIG_IsOK(res4)) {
+    SWIG_exception_fail(SWIG_ArgError(res4), Ruby_Format_TypeError( "", "char *","sela", 4, argv[2] ));
+  }
+  arg4 = (char *)(buf4);
+  uvio_sela(arg1,arg2,arg3,arg4);
+  if (alloc2 == SWIG_NEWOBJ) free((char*)buf2);
+  if (alloc4 == SWIG_NEWOBJ) free((char*)buf4);
+  return Qnil;
+fail:
+  if (alloc2 == SWIG_NEWOBJ) free((char*)buf2);
+  if (alloc4 == SWIG_NEWOBJ) free((char*)buf4);
+  return Qnil;
+}
+
+
+
+/*
+  Document-method: Miriad::Uvio.select
+
+  call-seq:
+    select(object, datasel, p1=0.0, p2=0.0)
+
+Iterate thru each element in the Uvio and select those that match a condition.  A block must be provided.
+*/
+SWIGINTERN VALUE
+_wrap_Uvio_select(int argc, VALUE *argv, VALUE self) {
+  uvio *arg1 = (uvio *) 0 ;
+  char *arg2 = (char *) 0 ;
+  int arg3 ;
+  double arg4 = (double) 0.0 ;
+  double arg5 = (double) 0.0 ;
+  void *argp1 = 0 ;
+  int res1 = 0 ;
+  int res2 ;
+  char *buf2 = 0 ;
+  int alloc2 = 0 ;
+  int val3 ;
+  int ecode3 = 0 ;
+  double val4 ;
+  int ecode4 = 0 ;
+  double val5 ;
+  int ecode5 = 0 ;
+  
+  if ((argc < 2) || (argc > 4)) {
+    rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)",argc); SWIG_fail;
+  }
+  res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_uvio, 0 |  0 );
+  if (!SWIG_IsOK(res1)) {
+    SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "uvio *","select", 1, self )); 
+  }
+  arg1 = (uvio *)(argp1);
+  res2 = SWIG_AsCharPtrAndSize(argv[0], &buf2, NULL, &alloc2);
+  if (!SWIG_IsOK(res2)) {
+    SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "char *","select", 2, argv[0] ));
+  }
+  arg2 = (char *)(buf2);
+  ecode3 = SWIG_AsVal_int(argv[1], &val3);
+  if (!SWIG_IsOK(ecode3)) {
+    SWIG_exception_fail(SWIG_ArgError(ecode3), Ruby_Format_TypeError( "", "int","select", 3, argv[1] ));
+  } 
+  arg3 = (int)(val3);
+  if (argc > 2) {
+    ecode4 = SWIG_AsVal_double(argv[2], &val4);
+    if (!SWIG_IsOK(ecode4)) {
+      SWIG_exception_fail(SWIG_ArgError(ecode4), Ruby_Format_TypeError( "", "double","select", 4, argv[2] ));
+    } 
+    arg4 = (double)(val4);
+  }
+  if (argc > 3) {
+    ecode5 = SWIG_AsVal_double(argv[3], &val5);
+    if (!SWIG_IsOK(ecode5)) {
+      SWIG_exception_fail(SWIG_ArgError(ecode5), Ruby_Format_TypeError( "", "double","select", 5, argv[3] ));
+    } 
+    arg5 = (double)(val5);
+  }
+  uvio_select(arg1,arg2,arg3,arg4,arg5);
+  if (alloc2 == SWIG_NEWOBJ) free((char*)buf2);
+  return Qnil;
+fail:
+  if (alloc2 == SWIG_NEWOBJ) free((char*)buf2);
+  return Qnil;
+}
+
+
+SWIGINTERN VALUE
+_wrap_Uvio_flagwr(int argc, VALUE *argv, VALUE self) {
+  uvio *arg1 = (uvio *) 0 ;
+  int *arg2 = (int *) 0 ;
+  void *argp1 = 0 ;
+  int res1 = 0 ;
+  
+  if ((argc < 1) || (argc > 1)) {
+    rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
+  }
+  res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_uvio, 0 |  0 );
+  if (!SWIG_IsOK(res1)) {
+    SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "uvio *","flagwr", 1, self )); 
+  }
+  arg1 = (uvio *)(argp1);
+  {
+    // If NArray
+    if(NA_IsNArray(argv[0])) {
+      Check_NArrayType(argv[0],NA_LINT);
+      arg2 = NA_PTR_TYPE(argv[0],int *);
+    } else {
+      int i;
+      int nflag;
+      Check_Type(argv[0], T_ARRAY);
+      nflag = RARRAY(argv[0])->len;
+      arg2 = ALLOCA_N(int,nflag);
+      VALUE * ptr = RARRAY(argv[0])->ptr;
+      for(i=0; i < nflag; i++) {
+        arg2[i] = FIX2INT(ptr[i]);
+      }
+    }
+  }
+  uvio_flagwr(arg1,arg2);
+  return Qnil;
+fail:
+  return Qnil;
+}
+
+
+SWIGINTERN VALUE
+_wrap_Uvio_wflagwr(int argc, VALUE *argv, VALUE self) {
+  uvio *arg1 = (uvio *) 0 ;
+  int *arg2 = (int *) 0 ;
+  void *argp1 = 0 ;
+  int res1 = 0 ;
+  
+  if ((argc < 1) || (argc > 1)) {
+    rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
+  }
+  res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_uvio, 0 |  0 );
+  if (!SWIG_IsOK(res1)) {
+    SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "uvio *","wflagwr", 1, self )); 
+  }
+  arg1 = (uvio *)(argp1);
+  {
+    // If NArray
+    if(NA_IsNArray(argv[0])) {
+      Check_NArrayType(argv[0],NA_LINT);
+      arg2 = NA_PTR_TYPE(argv[0],int *);
+    } else {
+      int i;
+      int nflag;
+      Check_Type(argv[0], T_ARRAY);
+      nflag = RARRAY(argv[0])->len;
+      arg2 = ALLOCA_N(int,nflag);
+      VALUE * ptr = RARRAY(argv[0])->ptr;
+      for(i=0; i < nflag; i++) {
+        arg2[i] = FIX2INT(ptr[i]);
+      }
+    }
+  }
+  uvio_wflagwr(arg1,arg2);
+  return Qnil;
+fail:
+  return Qnil;
+}
+
+
+SWIGINTERN VALUE
+_wrap_Uvio_haccess(int argc, VALUE *argv, VALUE self) {
+  uvio *arg1 = (uvio *) 0 ;
+  char *arg2 = (char *) 0 ;
+  char *arg3 = (char *) 0 ;
+  int result;
+  void *argp1 = 0 ;
+  int res1 = 0 ;
+  int res2 ;
+  char *buf2 = 0 ;
+  int alloc2 = 0 ;
+  int res3 ;
+  char *buf3 = 0 ;
+  int alloc3 = 0 ;
+  VALUE vresult = Qnil;
+  
+  if ((argc < 2) || (argc > 2)) {
+    rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)",argc); SWIG_fail;
+  }
+  res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_uvio, 0 |  0 );
+  if (!SWIG_IsOK(res1)) {
+    SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "uvio *","haccess", 1, self )); 
+  }
+  arg1 = (uvio *)(argp1);
+  res2 = SWIG_AsCharPtrAndSize(argv[0], &buf2, NULL, &alloc2);
+  if (!SWIG_IsOK(res2)) {
+    SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "char *","haccess", 2, argv[0] ));
+  }
+  arg2 = (char *)(buf2);
+  res3 = SWIG_AsCharPtrAndSize(argv[1], &buf3, NULL, &alloc3);
+  if (!SWIG_IsOK(res3)) {
+    SWIG_exception_fail(SWIG_ArgError(res3), Ruby_Format_TypeError( "", "char *","haccess", 3, argv[1] ));
+  }
+  arg3 = (char *)(buf3);
+  result = (int)uvio_haccess(arg1,arg2,arg3);
+  vresult = SWIG_From_int((int)(result));
+  if (alloc2 == SWIG_NEWOBJ) free((char*)buf2);
+  if (alloc3 == SWIG_NEWOBJ) free((char*)buf3);
+  return vresult;
+fail:
+  if (alloc2 == SWIG_NEWOBJ) free((char*)buf2);
+  if (alloc3 == SWIG_NEWOBJ) free((char*)buf3);
+  return Qnil;
+}
+
+
+SWIGINTERN VALUE
+_wrap_Uvio_hdaccess(int argc, VALUE *argv, VALUE self) {
+  uvio *arg1 = (uvio *) 0 ;
+  int arg2 ;
+  void *argp1 = 0 ;
+  int res1 = 0 ;
+  int val2 ;
+  int ecode2 = 0 ;
+  
+  if ((argc < 1) || (argc > 1)) {
+    rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
+  }
+  res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_uvio, 0 |  0 );
+  if (!SWIG_IsOK(res1)) {
+    SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "uvio *","hdaccess", 1, self )); 
+  }
+  arg1 = (uvio *)(argp1);
+  ecode2 = SWIG_AsVal_int(argv[0], &val2);
+  if (!SWIG_IsOK(ecode2)) {
+    SWIG_exception_fail(SWIG_ArgError(ecode2), Ruby_Format_TypeError( "", "int","hdaccess", 2, argv[0] ));
+  } 
+  arg2 = (int)(val2);
+  uvio_hdaccess(arg1,arg2);
+  return Qnil;
+fail:
+  return Qnil;
+}
+
+
+SWIGINTERN VALUE
+_wrap_Uvio_hreadln(int argc, VALUE *argv, VALUE self) {
+  uvio *arg1 = (uvio *) 0 ;
+  int arg2 ;
+  char *arg3 = (char *) 0 ;
+  size_t arg4 ;
+  int *arg5 = (int *) 0 ;
+  void *argp1 = 0 ;
+  int res1 = 0 ;
+  int val2 ;
+  int ecode2 = 0 ;
+  int iostat3 ;
+  VALUE vresult = Qnil;
+  
+  {
+    arg4 = 100;
+    arg3 = ALLOCA_N(char,arg4);
+    arg5 = &iostat3;
+  }
+  if ((argc < 1) || (argc > 1)) {
+    rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
+  }
+  res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_uvio, 0 |  0 );
+  if (!SWIG_IsOK(res1)) {
+    SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "uvio *","hreadln", 1, self )); 
+  }
+  arg1 = (uvio *)(argp1);
+  ecode2 = SWIG_AsVal_int(argv[0], &val2);
+  if (!SWIG_IsOK(ecode2)) {
+    SWIG_exception_fail(SWIG_ArgError(ecode2), Ruby_Format_TypeError( "", "int","hreadln", 2, argv[0] ));
+  } 
+  arg2 = (int)(val2);
+  uvio_hreadln(arg1,arg2,arg3,arg4,arg5);
+  {
+    if(*arg5 == 0) {
+      vresult = rb_str_new2(arg3);
+    } else if(*arg5 != -1) {
+      SWIG_exception(SWIG_IOError, "error reading item");
+    } else {
+      // EOF
+      vresult = Qnil;
+    }
+  }
+  return vresult;
+fail:
+  return Qnil;
+}
+
+
+SWIGINTERN VALUE
+_wrap_Uvio_hwriteln(int argc, VALUE *argv, VALUE self) {
+  uvio *arg1 = (uvio *) 0 ;
+  int arg2 ;
+  char *arg3 = (char *) 0 ;
+  size_t arg4 ;
+  void *argp1 = 0 ;
+  int res1 = 0 ;
+  int val2 ;
+  int ecode2 = 0 ;
+  int res3 ;
+  char *buf3 = 0 ;
+  int alloc3 = 0 ;
+  size_t val4 ;
+  int ecode4 = 0 ;
+  
+  if ((argc < 3) || (argc > 3)) {
+    rb_raise(rb_eArgError, "wrong # of arguments(%d for 3)",argc); SWIG_fail;
+  }
+  res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_uvio, 0 |  0 );
+  if (!SWIG_IsOK(res1)) {
+    SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "uvio *","hwriteln", 1, self )); 
+  }
+  arg1 = (uvio *)(argp1);
+  ecode2 = SWIG_AsVal_int(argv[0], &val2);
+  if (!SWIG_IsOK(ecode2)) {
+    SWIG_exception_fail(SWIG_ArgError(ecode2), Ruby_Format_TypeError( "", "int","hwriteln", 2, argv[0] ));
+  } 
+  arg2 = (int)(val2);
+  res3 = SWIG_AsCharPtrAndSize(argv[1], &buf3, NULL, &alloc3);
+  if (!SWIG_IsOK(res3)) {
+    SWIG_exception_fail(SWIG_ArgError(res3), Ruby_Format_TypeError( "", "char *","hwriteln", 3, argv[1] ));
+  }
+  arg3 = (char *)(buf3);
+  ecode4 = SWIG_AsVal_size_t(argv[2], &val4);
+  if (!SWIG_IsOK(ecode4)) {
+    SWIG_exception_fail(SWIG_ArgError(ecode4), Ruby_Format_TypeError( "", "size_t","hwriteln", 4, argv[2] ));
+  } 
+  arg4 = (size_t)(val4);
+  uvio_hwriteln(arg1,arg2,arg3,arg4);
+  if (alloc3 == SWIG_NEWOBJ) free((char*)buf3);
+  return Qnil;
+fail:
+  if (alloc3 == SWIG_NEWOBJ) free((char*)buf3);
+  return Qnil;
+}
+
+
+SWIGINTERN VALUE
+_wrap_Uvio_hiswrite(int argc, VALUE *argv, VALUE self) {
+  uvio *arg1 = (uvio *) 0 ;
+  char *arg2 = (char *) 0 ;
+  void *argp1 = 0 ;
+  int res1 = 0 ;
+  int res2 ;
+  char *buf2 = 0 ;
+  int alloc2 = 0 ;
+  
+  if ((argc < 1) || (argc > 1)) {
+    rb_raise(rb_eArgError, "wrong # of arguments(%d for 1)",argc); SWIG_fail;
+  }
+  res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_uvio, 0 |  0 );
+  if (!SWIG_IsOK(res1)) {
+    SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "uvio *","hiswrite", 1, self )); 
+  }
+  arg1 = (uvio *)(argp1);
+  res2 = SWIG_AsCharPtrAndSize(argv[0], &buf2, NULL, &alloc2);
+  if (!SWIG_IsOK(res2)) {
+    SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "char *","hiswrite", 2, argv[0] ));
+  }
+  arg2 = (char *)(buf2);
+  uvio_hiswrite(arg1,arg2);
+  if (alloc2 == SWIG_NEWOBJ) free((char*)buf2);
+  return Qnil;
+fail:
+  if (alloc2 == SWIG_NEWOBJ) free((char*)buf2);
+  return Qnil;
+}
+
+
+SWIGINTERN VALUE
+_wrap_Uvio_wrhda(int argc, VALUE *argv, VALUE self) {
+  uvio *arg1 = (uvio *) 0 ;
+  char *arg2 = (char *) 0 ;
+  char *arg3 = (char *) 0 ;
+  void *argp1 = 0 ;
+  int res1 = 0 ;
+  int res2 ;
+  char *buf2 = 0 ;
+  int alloc2 = 0 ;
+  int res3 ;
+  char *buf3 = 0 ;
+  int alloc3 = 0 ;
+  
+  if ((argc < 2) || (argc > 2)) {
+    rb_raise(rb_eArgError, "wrong # of arguments(%d for 2)",argc); SWIG_fail;
+  }
+  res1 = SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_uvio, 0 |  0 );
+  if (!SWIG_IsOK(res1)) {
+    SWIG_exception_fail(SWIG_ArgError(res1), Ruby_Format_TypeError( "", "uvio *","wrhda", 1, self )); 
+  }
+  arg1 = (uvio *)(argp1);
+  res2 = SWIG_AsCharPtrAndSize(argv[0], &buf2, NULL, &alloc2);
+  if (!SWIG_IsOK(res2)) {
+    SWIG_exception_fail(SWIG_ArgError(res2), Ruby_Format_TypeError( "", "char *","wrhda", 2, argv[0] ));
+  }
+  arg2 = (char *)(buf2);
+  res3 = SWIG_AsCharPtrAndSize(argv[1], &buf3, NULL, &alloc3);
+  if (!SWIG_IsOK(res3)) {
+    SWIG_exception_fail(SWIG_ArgError(res3), Ruby_Format_TypeError( "", "char *","wrhda", 3, argv[1] ));
+  }
+  arg3 = (char *)(buf3);
+  uvio_wrhda(arg1,arg2,arg3);
+  if (alloc2 == SWIG_NEWOBJ) free((char*)buf2);
+  if (alloc3 == SWIG_NEWOBJ) free((char*)buf3);
+  return Qnil;
+fail:
+  if (alloc2 == SWIG_NEWOBJ) free((char*)buf2);
+  if (alloc3 == SWIG_NEWOBJ) free((char*)buf3);
+  return Qnil;
+}
+
+
+
+/* -------- 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_double = {"_p_double", "double *", 0, 0, (void*)0, 0};
+static swig_type_info _swigt__p_float = {"_p_float", "float *", 0, 0, (void*)0, 0};
+static swig_type_info _swigt__p_int = {"_p_int", "int *", 0, 0, (void*)0, 0};
+static swig_type_info _swigt__p_p_void = {"_p_p_void", "void **", 0, 0, (void*)0, 0};
+static swig_type_info _swigt__p_uvio = {"_p_uvio", "uvio *", 0, 0, (void*)0, 0};
+
+static swig_type_info *swig_type_initial[] = {
+  &_swigt__p_char,
+  &_swigt__p_double,
+  &_swigt__p_float,
+  &_swigt__p_int,
+  &_swigt__p_p_void,
+  &_swigt__p_uvio,
+};
+
+static swig_cast_info _swigc__p_char[] = {  {&_swigt__p_char, 0, 0, 0},{0, 0, 0, 0}};
+static swig_cast_info _swigc__p_double[] = {  {&_swigt__p_double, 0, 0, 0},{0, 0, 0, 0}};
+static swig_cast_info _swigc__p_float[] = {  {&_swigt__p_float, 0, 0, 0},{0, 0, 0, 0}};
+static swig_cast_info _swigc__p_int[] = {  {&_swigt__p_int, 0, 0, 0},{0, 0, 0, 0}};
+static swig_cast_info _swigc__p_p_void[] = {  {&_swigt__p_p_void, 0, 0, 0},{0, 0, 0, 0}};
+static swig_cast_info _swigc__p_uvio[] = {  {&_swigt__p_uvio, 0, 0, 0},{0, 0, 0, 0}};
+
+static swig_cast_info *swig_cast_initial[] = {
+  _swigc__p_char,
+  _swigc__p_double,
+  _swigc__p_float,
+  _swigc__p_int,
+  _swigc__p_p_void,
+  _swigc__p_uvio,
+};
+
+
+/* -------- TYPE CONVERSION AND EQUIVALENCE RULES (END) -------- */
+
+/* -----------------------------------------------------------------------------
+ * Type initialization:
+ * This problem is tough by the requirement that no dynamic 
+ * memory is used. Also, since swig_type_info structures store pointers to 
+ * swig_cast_info structures and swig_cast_info structures store pointers back
+ * to swig_type_info structures, we need some lookup code at initialization. 
+ * The idea is that swig generates all the structures that are needed. 
+ * The runtime then collects these partially filled structures. 
+ * The SWIG_InitializeModule function takes these initial arrays out of 
+ * swig_module, and does all the lookup, filling in the swig_module.types
+ * array with the correct data and linking the correct swig_cast_info
+ * structures together.
+ *
+ * The generated swig_type_info structures are assigned staticly to an initial 
+ * array. We just loop through that array, and handle each type individually.
+ * First we lookup if this type has been already loaded, and if so, use the
+ * loaded structure instead of the generated one. Then we have to fill in the
+ * cast linked list. The cast data is initially stored in something like a
+ * two-dimensional array. Each row corresponds to a type (there are the same
+ * number of rows as there are in the swig_type_initial array). Each entry in
+ * a column is one of the swig_cast_info structures for that type.
+ * The cast_initial array is actually an array of arrays, because each row has
+ * a variable number of columns. So to actually build the cast linked list,
+ * we find the array of casts associated with the type, and loop through it 
+ * adding the casts to the list. The one last trick we need to do is making
+ * sure the type pointer in the swig_cast_info struct is correct.
+ *
+ * First off, we lookup the cast->type name to see if it is already loaded. 
+ * There are three cases to handle:
+ *  1) If the cast->type has already been loaded AND the type we are adding
+ *     casting info to has not been loaded (it is in this module), THEN we
+ *     replace the cast->type pointer with the type pointer that has already
+ *     been loaded.
+ *  2) If BOTH types (the one we are adding casting info to, and the 
+ *     cast->type) are loaded, THEN the cast info has already been loaded by
+ *     the previous module so we just ignore it.
+ *  3) Finally, if cast->type has not already been loaded, then we add that
+ *     swig_cast_info to the linked list (because the cast->type) pointer will
+ *     be correct.
+ * ----------------------------------------------------------------------------- */
+
+#ifdef __cplusplus
+extern "C" {
+#if 0
+} /* c-mode */
+#endif
+#endif
+
+#if 0
+#define SWIGRUNTIME_DEBUG
+#endif
+
+
+SWIGRUNTIME void
+SWIG_InitializeModule(void *clientdata) {
+  size_t i;
+  swig_module_info *module_head, *iter;
+  int found, init;
+
+  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;
+    init = 1;
+  } else {
+    init = 0;
+  }
+
+  /* Try and load any already created modules */
+  module_head = SWIG_GetModule(clientdata);
+  if (!module_head) {
+    /* This is the first module loaded for this interpreter */
+    /* so set the swig module into the interpreter */
+    SWIG_SetModule(clientdata, &swig_module);
+    module_head = &swig_module;
+  } else {
+    /* the interpreter has loaded a SWIG module, but has it loaded this one? */
+    found=0;
+    iter=module_head;
+    do {
+      if (iter==&swig_module) {
+        found=1;
+        break;
+      }
+      iter=iter->next;
+    } while (iter!= module_head);
+
+    /* if the is found in the list, then all is done and we may leave */
+    if (found) return;
+    /* otherwise we must add out module into the list */
+    swig_module.next = module_head->next;
+    module_head->next = &swig_module;
+  }
+
+  /* When multiple interpeters are used, a module could have already been initialized in
+     a different interpreter, but not yet have a pointer in this interpreter.
+     In this case, we do not want to continue adding types... everything should be
+     set up already */
+  if (init == 0) return;
+
+  /* Now work on filling in swig_module.types */
+#ifdef SWIGRUNTIME_DEBUG
+  printf("SWIG_InitializeModule: size %d\n", swig_module.size);
+#endif
+  for (i = 0; i < swig_module.size; ++i) {
+    swig_type_info *type = 0;
+    swig_type_info *ret;
+    swig_cast_info *cast;
+  
+#ifdef SWIGRUNTIME_DEBUG
+    printf("SWIG_InitializeModule: type %d %s\n", i, swig_module.type_initial[i]->name);
+#endif
+
+    /* if there is another module already loaded */
+    if (swig_module.next != &swig_module) {
+      type = SWIG_MangledTypeQueryModule(swig_module.next, &swig_module, swig_module.type_initial[i]->name);
+    }
+    if (type) {
+      /* Overwrite clientdata field */
+#ifdef SWIGRUNTIME_DEBUG
+      printf("SWIG_InitializeModule: found type %s\n", type->name);
+#endif
+      if (swig_module.type_initial[i]->clientdata) {
+	type->clientdata = swig_module.type_initial[i]->clientdata;
+#ifdef SWIGRUNTIME_DEBUG
+      printf("SWIG_InitializeModule: found and overwrite type %s \n", type->name);
+#endif
+      }
+    } else {
+      type = swig_module.type_initial[i];
+    }
+
+    /* Insert casting types */
+    cast = swig_module.cast_initial[i];
+    while (cast->type) {
+    
+      /* Don't need to add information already in the list */
+      ret = 0;
+#ifdef SWIGRUNTIME_DEBUG
+      printf("SWIG_InitializeModule: look cast %s\n", cast->type->name);
+#endif
+      if (swig_module.next != &swig_module) {
+        ret = SWIG_MangledTypeQueryModule(swig_module.next, &swig_module, cast->type->name);
+#ifdef SWIGRUNTIME_DEBUG
+	if (ret) printf("SWIG_InitializeModule: found cast %s\n", ret->name);
+#endif
+      }
+      if (ret) {
+	if (type == swig_module.type_initial[i]) {
+#ifdef SWIGRUNTIME_DEBUG
+	  printf("SWIG_InitializeModule: skip old type %s\n", ret->name);
+#endif
+	  cast->type = ret;
+	  ret = 0;
+	} else {
+	  /* Check for casting already in the list */
+	  swig_cast_info *ocast = SWIG_TypeCheck(ret->name, type);
+#ifdef SWIGRUNTIME_DEBUG
+	  if (ocast) printf("SWIG_InitializeModule: skip old cast %s\n", ret->name);
+#endif
+	  if (!ocast) ret = 0;
+	}
+      }
+
+      if (!ret) {
+#ifdef SWIGRUNTIME_DEBUG
+	printf("SWIG_InitializeModule: adding cast %s\n", cast->type->name);
+#endif
+        if (type->cast) {
+          type->cast->prev = cast;
+          cast->next = type->cast;
+        }
+        type->cast = cast;
+      }
+      cast++;
+    }
+    /* Set entry in modules->types array equal to the type */
+    swig_module.types[i] = type;
+  }
+  swig_module.types[i] = 0;
+
+#ifdef SWIGRUNTIME_DEBUG
+  printf("**** SWIG_InitializeModule: Cast List ******\n");
+  for (i = 0; i < swig_module.size; ++i) {
+    int j = 0;
+    swig_cast_info *cast = swig_module.cast_initial[i];
+    printf("SWIG_InitializeModule: type %d %s\n", i, swig_module.type_initial[i]->name);
+    while (cast->type) {
+      printf("SWIG_InitializeModule: cast type %s\n", cast->type->name);
+      cast++;
+      ++j;
+    }
+  printf("---- Total casts: %d\n",j);
+  }
+  printf("**** SWIG_InitializeModule: Cast List ******\n");
+#endif
+}
+
+/* This function will propagate the clientdata field of type to
+* any new swig_type_info structures that have been added into the list
+* of equivalent types.  It is like calling
+* SWIG_TypeClientData(type, clientdata) a second time.
+*/
+SWIGRUNTIME void
+SWIG_PropagateClientData(void) {
+  size_t i;
+  swig_cast_info *equiv;
+  static int init_run = 0;
+
+  if (init_run) return;
+  init_run = 1;
+
+  for (i = 0; i < swig_module.size; i++) {
+    if (swig_module.types[i]->clientdata) {
+      equiv = swig_module.types[i]->cast;
+      while (equiv) {
+        if (!equiv->converter) {
+          if (equiv->type && !equiv->type->clientdata)
+            SWIG_TypeClientData(equiv->type, swig_module.types[i]->clientdata);
+        }
+        equiv = equiv->next;
+      }
+    }
+  }
+}
+
+#ifdef __cplusplus
+#if 0
+{ /* c-mode */
+#endif
+}
+#endif
+
+/*
+
+*/
+#ifdef __cplusplus
+extern "C"
+#endif
+SWIGEXPORT void Init_miriad(void) {
+  size_t i;
+  
+  SWIG_InitRuntime();
+  mMiriad = rb_define_module("Miriad");
+  
+  SWIG_InitializeModule(0);
+  for (i = 0; i < swig_module.size; i++) {
+    SWIG_define_class(swig_module.types[i]);
+  }
+  
+  SWIG_RubyInitializeTrackings();
+  
+  buglabel_c("mirlib");
+  
+  
+  mirlib_eMirlibError = rb_define_class("MirlibError", rb_eStandardError);
+  
+  
+  rb_require("narray");
+  
+  
+  cUvio.klass = rb_define_class_under(mMiriad, "Uvio", rb_cObject);
+  SWIG_TypeClientData(SWIGTYPE_p_uvio, (void *) &cUvio);
+  rb_define_alloc_func(cUvio.klass, _wrap_Uvio_allocate);
+  rb_define_method(cUvio.klass, "initialize", _wrap_new_Uvio, -1);
+  rb_define_method(cUvio.klass, "close", _wrap_Uvio_close, -1);
+  rb_define_method(cUvio.klass, "flush", _wrap_Uvio_flush, -1);
+  rb_define_method(cUvio.klass, "uvnext", _wrap_Uvio_uvnext, -1);
+  rb_define_method(cUvio.klass, "rewind", _wrap_Uvio_rewind, -1);
+  rb_define_method(cUvio.klass, "probvr", _wrap_Uvio_probvr, -1);
+  rb_define_method(cUvio.klass, "putvr", _wrap_Uvio_putvr, -1);
+  rb_define_method(cUvio.klass, "scan", _wrap_Uvio_scan, -1);
+  rb_define_method(cUvio.klass, "write", _wrap_Uvio_write, -1);
+  rb_define_method(cUvio.klass, "wwrite", _wrap_Uvio_wwrite, -1);
+  rb_define_method(cUvio.klass, "set", _wrap_Uvio_set, -1);
+  rb_define_method(cUvio.klass, "uvread", _wrap_Uvio_uvread, -1);
+  rb_define_method(cUvio.klass, "uvwread", _wrap_Uvio_uvwread, -1);
+  rb_define_method(cUvio.klass, "getvr", _wrap_Uvio_getvr, -1);
+  rb_define_method(cUvio.klass, "updated?", _wrap_Uvio_updatedq___, -1);
+  rb_define_method(cUvio.klass, "track", _wrap_Uvio_track, -1);
+  rb_define_method(cUvio.klass, "sela", _wrap_Uvio_sela, -1);
+  rb_define_method(cUvio.klass, "select", _wrap_Uvio_select, -1);
+  rb_define_method(cUvio.klass, "flagwr", _wrap_Uvio_flagwr, -1);
+  rb_define_method(cUvio.klass, "wflagwr", _wrap_Uvio_wflagwr, -1);
+  rb_define_method(cUvio.klass, "haccess", _wrap_Uvio_haccess, -1);
+  rb_define_method(cUvio.klass, "hdaccess", _wrap_Uvio_hdaccess, -1);
+  rb_define_method(cUvio.klass, "hreadln", _wrap_Uvio_hreadln, -1);
+  rb_define_method(cUvio.klass, "hwriteln", _wrap_Uvio_hwriteln, -1);
+  rb_define_method(cUvio.klass, "hiswrite", _wrap_Uvio_hiswrite, -1);
+  rb_define_method(cUvio.klass, "wrhda", _wrap_Uvio_wrhda, -1);
+  cUvio.mark = 0;
+  cUvio.destroy = (void (*)(void *)) free_uvio;
+  cUvio.trackObjects = 0;
+}
+