carray 1.1.4 → 1.1.5

data/mt19937ar.c

@@ -0,0 +1,182 @@
+/*
+  The names of routines in original mt19937ar.c are all prefixed with "ca_"
+  to avoid collision with ruby's runtime library.
+*/
+
+#include "mt19937ar.h"
+
+/*
+   A C-program for MT19937, with initialization improved 2002/1/26.
+   Coded by Takuji Nishimura and Makoto Matsumoto.
+
+   Before using, initialize the state by using init_genrand(seed)
+   or init_by_array(init_key, key_length).
+
+   Copyright (C) 1997 - 2002, Makoto Matsumoto and Takuji Nishimura,
+   All rights reserved.
+   Copyright (C) 2005, Mutsuo Saito,
+   All rights reserved.
+
+   Redistribution and use in source and binary forms, with or without
+   modification, are permitted provided that the following conditions
+   are met:
+
+     1. Redistributions of source code must retain the above copyright
+        notice, this list of conditions and the following disclaimer.
+
+     2. Redistributions in binary form must reproduce the above copyright
+        notice, this list of conditions and the following disclaimer in the
+        documentation and/or other materials provided with the distribution.
+
+     3. The names of its contributors may not be used to endorse or promote
+        products derived from this software without specific prior written
+        permission.
+
+   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+   A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR
+   CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
+   EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+   PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+   PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
+   LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
+   NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+   SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+
+   Any feedback is very welcome.
+   http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/emt.html
+   email: m-mat @ math.sci.hiroshima-u.ac.jp (remove space)
+*/
+
+#include <stdio.h>
+#include "mt19937ar.h"
+
+/* Period parameters */
+#define N 624
+#define M 397
+#define MATRIX_A 0x9908b0dfUL   /* constant vector a */
+#define UPPER_MASK 0x80000000UL /* most significant w-r bits */
+#define LOWER_MASK 0x7fffffffUL /* least significant r bits */
+
+static unsigned long mt[N]; /* the array for the state vector  */
+static int mti=N+1; /* mti==N+1 means mt[N] is not initialized */
+
+/* initializes mt[N] with a seed */
+void init_genrand(unsigned long s)
+{
+    mt[0]= s & 0xffffffffUL;
+    for (mti=1; mti<N; mti++) {
+        mt[mti] =
+            (1812433253UL * (mt[mti-1] ^ (mt[mti-1] >> 30)) + mti);
+        /* See Knuth TAOCP Vol2. 3rd Ed. P.106 for multiplier. */
+        /* In the previous versions, MSBs of the seed affect   */
+        /* only MSBs of the array mt[].                        */
+        /* 2002/01/09 modified by Makoto Matsumoto             */
+        mt[mti] &= 0xffffffffUL;
+        /* for >32 bit machines */
+    }
+}
+
+/* initialize by an array with array-length */
+/* init_key is the array for initializing keys */
+/* key_length is its length */
+/* slight change for C++, 2004/2/26 */
+void init_by_array(unsigned long init_key[], int key_length)
+{
+    int i, j, k;
+    init_genrand(19650218UL);
+    i=1; j=0;
+    k = (N>key_length ? N : key_length);
+    for (; k; k--) {
+        mt[i] = (mt[i] ^ ((mt[i-1] ^ (mt[i-1] >> 30)) * 1664525UL))
+          + init_key[j] + j; /* non linear */
+        mt[i] &= 0xffffffffUL; /* for WORDSIZE > 32 machines */
+        i++; j++;
+        if (i>=N) { mt[0] = mt[N-1]; i=1; }
+        if (j>=key_length) j=0;
+    }
+    for (k=N-1; k; k--) {
+        mt[i] = (mt[i] ^ ((mt[i-1] ^ (mt[i-1] >> 30)) * 1566083941UL))
+          - i; /* non linear */
+        mt[i] &= 0xffffffffUL; /* for WORDSIZE > 32 machines */
+        i++;
+        if (i>=N) { mt[0] = mt[N-1]; i=1; }
+    }
+
+    mt[0] = 0x80000000UL; /* MSB is 1; assuring non-zero initial array */
+}
+
+/* generates a random number on [0,0xffffffff]-interval */
+unsigned long genrand_int32(void)
+{
+    unsigned long y;
+    static unsigned long mag01[2]={0x0UL, MATRIX_A};
+    /* mag01[x] = x * MATRIX_A  for x=0,1 */
+
+    if (mti >= N) { /* generate N words at one time */
+        int kk;
+
+        if (mti == N+1)   /* if init_genrand() has not been called, */
+            init_genrand(5489UL); /* a default initial seed is used */
+
+        for (kk=0;kk<N-M;kk++) {
+            y = (mt[kk]&UPPER_MASK)|(mt[kk+1]&LOWER_MASK);
+            mt[kk] = mt[kk+M] ^ (y >> 1) ^ mag01[y & 0x1UL];
+        }
+        for (;kk<N-1;kk++) {
+            y = (mt[kk]&UPPER_MASK)|(mt[kk+1]&LOWER_MASK);
+            mt[kk] = mt[kk+(M-N)] ^ (y >> 1) ^ mag01[y & 0x1UL];
+        }
+        y = (mt[N-1]&UPPER_MASK)|(mt[0]&LOWER_MASK);
+        mt[N-1] = mt[M-1] ^ (y >> 1) ^ mag01[y & 0x1UL];
+
+        mti = 0;
+    }
+
+    y = mt[mti++];
+
+    /* Tempering */
+    y ^= (y >> 11);
+    y ^= (y << 7) & 0x9d2c5680UL;
+    y ^= (y << 15) & 0xefc60000UL;
+    y ^= (y >> 18);
+
+    return y;
+}
+
+/* generates a random number on [0,0x7fffffff]-interval */
+long genrand_int31(void)
+{
+    return (long)(genrand_int32()>>1);
+}
+
+/* generates a random number on [0,1]-real-interval */
+double genrand_real1(void)
+{
+    return genrand_int32()*(1.0/4294967295.0);
+    /* divided by 2^32-1 */
+}
+
+/* generates a random number on [0,1)-real-interval */
+double genrand_real2(void)
+{
+    return genrand_int32()*(1.0/4294967296.0);
+    /* divided by 2^32 */
+}
+
+/* generates a random number on (0,1)-real-interval */
+double genrand_real3(void)
+{
+    return (((double)genrand_int32()) + 0.5)*(1.0/4294967296.0);
+    /* divided by 2^32 */
+}
+
+/* generates a random number on [0,1) with 53-bit resolution*/
+double genrand_res53(void)
+{
+    unsigned long a=genrand_int32()>>5, b=genrand_int32()>>6;
+    return(a*67108864.0+b)*(1.0/9007199254740992.0);
+}
+/* These real versions are due to Isaku Wada, 2002/01/09 added */

data/mt19937ar.h

@@ -0,0 +1,86 @@
+/*
+  The names of routines in original mt19937ar.c are all prefixed with "ca_"
+  to avoid collision with ruby's runtime library.
+*/
+
+#define init_genrand  ca_init_genrand
+#define init_by_array ca_init_by_array
+#define genrand_int32 ca_genrand_int32
+#define genrand_int31 ca_genrand_int31
+#define genrand_real1 ca_genrand_real1
+#define genrand_real2 ca_genrand_real2
+#define genrand_real3 ca_genrand_real3
+#define genrand_res53 ca_genrand_res53
+
+/*
+   A C-program for MT19937, with initialization improved 2002/1/26.
+   Coded by Takuji Nishimura and Makoto Matsumoto.
+
+   Before using, initialize the state by using init_genrand(seed)
+   or init_by_array(init_key, key_length).
+
+   Copyright (C) 1997 - 2002, Makoto Matsumoto and Takuji Nishimura,
+   All rights reserved.
+   Copyright (C) 2005, Mutsuo Saito
+   All rights reserved.
+
+   Redistribution and use in source and binary forms, with or without
+   modification, are permitted provided that the following conditions
+   are met:
+
+     1. Redistributions of source code must retain the above copyright
+        notice, this list of conditions and the following disclaimer.
+
+     2. Redistributions in binary form must reproduce the above copyright
+        notice, this list of conditions and the following disclaimer in the
+        documentation and/or other materials provided with the distribution.
+
+     3. The names of its contributors may not be used to endorse or promote
+        products derived from this software without specific prior written
+        permission.
+
+   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+   A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR
+   CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
+   EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+   PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+   PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
+   LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
+   NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+   SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+
+   Any feedback is very welcome.
+   http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/emt.html
+   email: m-mat @ math.sci.hiroshima-u.ac.jp (remove space)
+*/
+
+/* initializes mt[N] with a seed */
+void init_genrand(unsigned long s);
+
+/* initialize by an array with array-length */
+/* init_key is the array for initializing keys */
+/* key_length is its length */
+/* slight change for C++, 2004/2/26 */
+void init_by_array(unsigned long init_key[], int key_length);
+
+/* generates a random number on [0,0xffffffff]-interval */
+unsigned long genrand_int32(void);
+
+/* generates a random number on [0,0x7fffffff]-interval */
+long genrand_int31(void);
+
+/* These real versions are due to Isaku Wada, 2002/01/09 added */
+/* generates a random number on [0,1]-real-interval */
+double genrand_real1(void);
+
+/* generates a random number on [0,1)-real-interval */
+double genrand_real2(void);
+
+/* generates a random number on (0,1)-real-interval */
+double genrand_real3(void);
+
+/* generates a random number on [0,1) with 53-bit resolution*/
+double genrand_res53(void);

data/rdoc_main.rb

@@ -0,0 +1,27 @@
+#
+# Ruby/CArray
+#
+# 
+# CArray - 
+#
+# : classes
+#
+#   CArray
+#   
+#
+#
+#
+#
+#
+#
+#
+
+
+class Module # :nodoc:
+end
+
+class Class # :nodoc:
+end
+
+class Numeric # :nodoc:
+end

data/rdoc_math.rb

@@ -0,0 +1,5 @@
+#
+#
+#
+#
+#

data/rdoc_stat.rb

@@ -0,0 +1,31 @@
+class CArray
+
+  # Accumulates the all elements. The overflow is treated in 
+  # the C-language way.
+  #
+  #   a = CArray.int8(2) { [127,1] };
+  #   a.sum
+  #   => 128.0
+  #   a.accumulate
+  #   => -128
+  #
+  #   a = CArray.uint32(2) { [0xffffffff,1] };
+  #   a.sum
+  #   => 4294967296.0
+  #   a.accumulate
+  #   => 0
+  #
+  #   a = CArray.float(2) { [0xffffffff,1] };
+  #   a.sum
+  #   => 4294967297.0
+  #   a.accumulate
+  #   => 4294967296.0
+  #
+  #   a = CArray.object(2) { [0xffffffff,1] };
+  #   a.sum
+  #   => 4294967296
+  #   a.accumulate
+  #   => 4294967296
+  def accumulate (options={})
+  end
+end

data/ruby_carray.c

@@ -0,0 +1,242 @@
+/* ---------------------------------------------------------------------------
+
+  ruby_carray.c
+
+  This file is part of Ruby/CArray extension library.
+  You can redistribute it and/or modify it under the terms of
+  the Ruby Licence.
+
+  Copyright (C) 2005 Hiroki Motoyoshi
+
+---------------------------------------------------------------------------- */
+
+#include "carray.h"
+#include "version.h"
+
+VALUE rb_eCADataTypeError;
+VALUE rb_mCA;
+
+VALUE CA_NIL;
+
+void Init_ccomplex ();
+void Init_numeric_float_function ();
+
+void Init_carray_core ();
+void Init_carray_undef ();
+void Init_carray_class ();
+void Init_carray_test ();
+void Init_carray_attribute ();
+void Init_carray_loop ();
+void Init_carray_mask ();
+void Init_carray_access ();
+void Init_carray_element ();
+void Init_carray_iterator ();
+void Init_carray_operator ();
+void Init_carray_numeric ();
+void Init_carray_math ();
+void Init_carray_random ();
+void Init_carray_utils ();
+void Init_carray_order ();
+void Init_carray_sort_addr ();
+void Init_carray_stat ();
+void Init_carray_stat_proc ();
+void Init_carray_utils ();
+void Init_carray_generate ();
+void Init_carray_copy ();
+void Init_carray_conversion ();
+void Init_carray_cast ();
+
+void Init_ca_obj_array ();
+void Init_ca_obj_refer ();
+void Init_ca_obj_farray ();
+void Init_ca_obj_block ();
+void Init_ca_obj_select ();
+void Init_ca_obj_object ();
+void Init_ca_obj_grid ();
+void Init_ca_obj_window ();
+void Init_ca_obj_shift ();
+void Init_ca_obj_transpose ();
+void Init_ca_obj_mapping ();
+void Init_ca_obj_repeat ();
+void Init_ca_obj_unbound_repeat ();
+void Init_ca_obj_reduce ();
+void Init_ca_obj_field ();
+void Init_ca_obj_fake ();
+void Init_ca_obj_bitarray ();
+void Init_ca_obj_bitfield ();
+
+void Init_carray_iterator ();
+void Init_ca_iter_dimension ();
+void Init_ca_iter_block ();
+void Init_ca_iter_window ();
+
+void
+Init_carray_ext ()
+{
+
+  /* Classes and Modules */
+
+  /* -- CArray class -- */
+
+  rb_cCArray     = rb_define_class("CArray",    rb_cObject);
+  rb_cCAWrap     = rb_define_class("CAWrap",    rb_cCArray);
+  rb_cCScalar    = rb_define_class("CScalar",   rb_cCArray);
+  rb_cCAVirtual  = rb_define_class("CAVirtual", rb_cCArray);
+  rb_cCARefer    = rb_define_class("CARefer",   rb_cCAVirtual);
+  rb_cCABlock    = rb_define_class("CABlock",   rb_cCAVirtual);
+  rb_cCASelect   = rb_define_class("CASelect",  rb_cCAVirtual);
+  rb_cCAObject   = rb_define_class("CAObject",  rb_cCAVirtual);
+  rb_cCARepeat   = rb_define_class("CARepeat",  rb_cCAVirtual);
+  rb_cCAUnboundRepeat  = rb_define_class("CAUnboundRepeat",  rb_cCAVirtual);
+
+  /* -- Exception class -- */
+
+  rb_eCADataTypeError =
+    rb_define_class_under(rb_cCArray, "DataTypeError", rb_eStandardError);
+
+  /* rdoc:
+     class CArray::DataTypeError # :nodoc:
+     end
+  */
+
+  /* -- CA module -- */
+  /*   a namespace for misc utilities related with CArray */
+
+  rb_mCA = rb_define_module("CA");
+
+  /* CArray constants */
+
+  /* -- version -- */
+
+  /* rdoc: 
+    class CArray
+      VERSION = nil         # :nodoc:
+      VERSION_CODE = nil    # :nodoc:
+      VERSION_MAJOR = nil   # :nodoc:
+      VERSION_MINOR = nil   # :nodoc:
+      VERSION_TEENY = nil   # :nodoc:
+      VERSION_DATE = nil    # :nodoc:
+    end
+  */
+  
+  rb_define_const(rb_cCArray, "VERSION", rb_str_new2(CA_VERSION));
+  rb_define_const(rb_cCArray, "VERSION_CODE", INT2NUM(CA_VERSION_CODE));
+  rb_define_const(rb_cCArray, "VERSION_MAJOR", INT2NUM(CA_VERSION_MAJOR));
+  rb_define_const(rb_cCArray, "VERSION_MINOR", INT2NUM(CA_VERSION_MINOR));
+  rb_define_const(rb_cCArray, "VERSION_TEENY", INT2NUM(CA_VERSION_TEENY));
+  rb_define_const(rb_cCArray, "VERSION_DATE", rb_str_new2(CA_VERSION_DATE));
+
+  /* -- system -- */
+  rb_define_const(rb_cObject, "CA_RANK_MAX", INT2NUM(CA_RANK_MAX));
+  CA_NIL = rb_funcall(rb_cObject, rb_intern("new"), 0);
+  rb_define_const(rb_cObject, "CA_NIL", CA_NIL);
+
+#ifdef HAVE_COMPLEX_H
+  rb_define_const(rb_cCArray, "HAVE_COMPLEX", Qtrue);
+#else
+  rb_define_const(rb_cCArray, "HAVE_COMPLEX", Qfalse);
+#endif
+
+  /* -- data types -- */
+
+  rb_define_const(rb_cObject, "CA_FIXLEN",     INT2NUM(CA_FIXLEN));
+  rb_define_const(rb_cObject, "CA_BOOLEAN",     INT2NUM(CA_BOOLEAN));
+  rb_define_const(rb_cObject, "CA_INT8",     INT2NUM(CA_INT8));
+  rb_define_const(rb_cObject, "CA_UINT8",    INT2NUM(CA_UINT8));
+  rb_define_const(rb_cObject, "CA_INT16",    INT2NUM(CA_INT16));
+  rb_define_const(rb_cObject, "CA_UINT16",   INT2NUM(CA_UINT16));
+  rb_define_const(rb_cObject, "CA_INT32",    INT2NUM(CA_INT32));
+  rb_define_const(rb_cObject, "CA_UINT32",   INT2NUM(CA_UINT32));
+  rb_define_const(rb_cObject, "CA_INT64",    INT2NUM(CA_INT64));
+  rb_define_const(rb_cObject, "CA_UINT64",   INT2NUM(CA_UINT64));
+  rb_define_const(rb_cObject, "CA_FLOAT32",  INT2NUM(CA_FLOAT32));
+  rb_define_const(rb_cObject, "CA_FLOAT64",  INT2NUM(CA_FLOAT64));
+  rb_define_const(rb_cObject, "CA_FLOAT128", INT2NUM(CA_FLOAT128));
+  rb_define_const(rb_cObject, "CA_CMPLX64",  INT2NUM(CA_CMPLX64));
+  rb_define_const(rb_cObject, "CA_CMPLX128", INT2NUM(CA_CMPLX128));
+  rb_define_const(rb_cObject, "CA_CMPLX256", INT2NUM(CA_CMPLX256));
+  rb_define_const(rb_cObject, "CA_OBJECT",   INT2NUM(CA_OBJECT));
+
+  rb_define_const(rb_cObject, "CA_BYTE",        INT2NUM(CA_BYTE));
+  rb_define_const(rb_cObject, "CA_SHORT",       INT2NUM(CA_INT16));
+  rb_define_const(rb_cObject, "CA_INT",         INT2NUM(CA_INT32));
+  rb_define_const(rb_cObject, "CA_FLOAT",       INT2NUM(CA_FLOAT));
+  rb_define_const(rb_cObject, "CA_DOUBLE",      INT2NUM(CA_DOUBLE));
+  rb_define_const(rb_cObject, "CA_COMPLEX",     INT2NUM(CA_COMPLEX));
+  rb_define_const(rb_cObject, "CA_DCOMPLEX",    INT2NUM(CA_DCOMPLEX));
+
+  rb_define_const(rb_cObject, "CA_ALIGN_VOIDP",    INT2NUM(CA_ALIGN_VOIDP));
+  rb_define_const(rb_cObject, "CA_ALIGN_FIXLEN",   INT2NUM(CA_ALIGN_INT8));
+  rb_define_const(rb_cObject, "CA_ALIGN_BOOLEAN",  INT2NUM(CA_ALIGN_INT8));
+  rb_define_const(rb_cObject, "CA_ALIGN_INT8",     INT2NUM(CA_ALIGN_INT8));
+  rb_define_const(rb_cObject, "CA_ALIGN_INT16",    INT2NUM(CA_ALIGN_INT16));
+  rb_define_const(rb_cObject, "CA_ALIGN_INT32",    INT2NUM(CA_ALIGN_INT32));
+  rb_define_const(rb_cObject, "CA_ALIGN_INT64",    INT2NUM(CA_ALIGN_INT64));
+  rb_define_const(rb_cObject, "CA_ALIGN_FLOAT32",  INT2NUM(CA_ALIGN_FLOAT32));
+  rb_define_const(rb_cObject, "CA_ALIGN_FLOAT64",  INT2NUM(CA_ALIGN_FLOAT64));
+  rb_define_const(rb_cObject, "CA_ALIGN_FLOAT128", INT2NUM(CA_ALIGN_FLOAT128));
+  rb_define_const(rb_cObject, "CA_ALIGN_CMPLX64",  INT2NUM(CA_ALIGN_CMPLX64));
+  rb_define_const(rb_cObject, "CA_ALIGN_CMPLX128", INT2NUM(CA_ALIGN_CMPLX128));
+  rb_define_const(rb_cObject, "CA_ALIGN_CMPLX256", INT2NUM(CA_ALIGN_CMPLX256));
+  rb_define_const(rb_cObject, "CA_ALIGN_OBJECT",   INT2NUM(CA_ALIGN_OBJECT));
+
+  /* load modules in external files */
+
+  Init_carray_core(); /* Init_carray_core should be called first*/
+
+#ifdef HAVE_COMPLEX_H
+  Init_ccomplex();
+#endif
+
+  Init_numeric_float_function();
+
+  Init_carray_class();
+  Init_carray_test();
+  Init_carray_attribute();
+  Init_carray_undef();
+  Init_carray_mask();
+  Init_carray_loop();
+  Init_carray_access();
+  Init_carray_element();
+  Init_carray_operator();
+  Init_carray_math();      /* order of math, numeric should not be changed */
+  Init_carray_numeric();   /* order of math, numeric should not be changed */
+  Init_carray_random();
+  Init_carray_order();
+  Init_carray_sort_addr();  
+  Init_carray_stat();
+  Init_carray_stat_proc();
+
+  Init_carray_utils();
+
+  Init_carray_generate();
+  Init_carray_copy();
+  Init_carray_conversion();
+  Init_carray_cast();
+
+  Init_ca_obj_array();
+  Init_ca_obj_refer();
+  Init_ca_obj_farray();
+  Init_ca_obj_block();
+  Init_ca_obj_select();
+  Init_ca_obj_object();
+  Init_ca_obj_grid();
+  Init_ca_obj_window();
+  Init_ca_obj_shift();
+  Init_ca_obj_transpose();
+  Init_ca_obj_mapping();
+  Init_ca_obj_repeat();
+  Init_ca_obj_unbound_repeat();
+  Init_ca_obj_reduce();
+  Init_ca_obj_field();
+  Init_ca_obj_fake();
+  Init_ca_obj_bitarray();
+  Init_ca_obj_bitfield();
+
+  Init_carray_iterator();
+
+  Init_ca_iter_dimension();
+  Init_ca_iter_block();
+  Init_ca_iter_window();
+}
+