carray 1.4.0 → 1.5.5

data/GPL

@@ -1,340 +0,0 @@
-                    GNU GENERAL PUBLIC LICENSE
-                       Version 2, June 1991
-
- Copyright (C) 1989, 1991 Free Software Foundation, Inc.
-                       59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
- Everyone is permitted to copy and distribute verbatim copies
- of this license document, but changing it is not allowed.
-
-                            Preamble
-
-  The licenses for most software are designed to take away your
-freedom to share and change it.  By contrast, the GNU General Public
-License is intended to guarantee your freedom to share and change free
-software--to make sure the software is free for all its users.  This
-General Public License applies to most of the Free Software
-Foundation's software and to any other program whose authors commit to
-using it.  (Some other Free Software Foundation software is covered by
-the GNU Library General Public License instead.)  You can apply it to
-your programs, too.
-
-  When we speak of free software, we are referring to freedom, not
-price.  Our General Public Licenses are designed to make sure that you
-have the freedom to distribute copies of free software (and charge for
-this service if you wish), that you receive source code or can get it
-if you want it, that you can change the software or use pieces of it
-in new free programs; and that you know you can do these things.
-
-  To protect your rights, we need to make restrictions that forbid
-anyone to deny you these rights or to ask you to surrender the rights.
-These restrictions translate to certain responsibilities for you if you
-distribute copies of the software, or if you modify it.
-
-  For example, if you distribute copies of such a program, whether
-gratis or for a fee, you must give the recipients all the rights that
-you have.  You must make sure that they, too, receive or can get the
-source code.  And you must show them these terms so they know their
-rights.
-
-  We protect your rights with two steps: (1) copyright the software, and
-(2) offer you this license which gives you legal permission to copy,
-distribute and/or modify the software.
-
-  Also, for each author's protection and ours, we want to make certain
-that everyone understands that there is no warranty for this free
-software.  If the software is modified by someone else and passed on, we
-want its recipients to know that what they have is not the original, so
-that any problems introduced by others will not reflect on the original
-authors' reputations.
-
-  Finally, any free program is threatened constantly by software
-patents.  We wish to avoid the danger that redistributors of a free
-program will individually obtain patent licenses, in effect making the
-program proprietary.  To prevent this, we have made it clear that any
-patent must be licensed for everyone's free use or not licensed at all.
-
-  The precise terms and conditions for copying, distribution and
-modification follow.
-
-                    GNU GENERAL PUBLIC LICENSE
-   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
-
-  0. This License applies to any program or other work which contains
-a notice placed by the copyright holder saying it may be distributed
-under the terms of this General Public License.  The "Program", below,
-refers to any such program or work, and a "work based on the Program"
-means either the Program or any derivative work under copyright law:
-that is to say, a work containing the Program or a portion of it,
-either verbatim or with modifications and/or translated into another
-language.  (Hereinafter, translation is included without limitation in
-the term "modification".)  Each licensee is addressed as "you".
-
-Activities other than copying, distribution and modification are not
-covered by this License; they are outside its scope.  The act of
-running the Program is not restricted, and the output from the Program
-is covered only if its contents constitute a work based on the
-Program (independent of having been made by running the Program).
-Whether that is true depends on what the Program does.
-
-  1. You may copy and distribute verbatim copies of the Program's
-source code as you receive it, in any medium, provided that you
-conspicuously and appropriately publish on each copy an appropriate
-copyright notice and disclaimer of warranty; keep intact all the
-notices that refer to this License and to the absence of any warranty;
-and give any other recipients of the Program a copy of this License
-along with the Program.
-
-You may charge a fee for the physical act of transferring a copy, and
-you may at your option offer warranty protection in exchange for a fee.
-
-  2. You may modify your copy or copies of the Program or any portion
-of it, thus forming a work based on the Program, and copy and
-distribute such modifications or work under the terms of Section 1
-above, provided that you also meet all of these conditions:
-
-    a) You must cause the modified files to carry prominent notices
-    stating that you changed the files and the date of any change.
-
-    b) You must cause any work that you distribute or publish, that in
-    whole or in part contains or is derived from the Program or any
-    part thereof, to be licensed as a whole at no charge to all third
-    parties under the terms of this License.
-
-    c) If the modified program normally reads commands interactively
-    when run, you must cause it, when started running for such
-    interactive use in the most ordinary way, to print or display an
-    announcement including an appropriate copyright notice and a
-    notice that there is no warranty (or else, saying that you provide
-    a warranty) and that users may redistribute the program under
-    these conditions, and telling the user how to view a copy of this
-    License.  (Exception: if the Program itself is interactive but
-    does not normally print such an announcement, your work based on
-    the Program is not required to print an announcement.)
-
-These requirements apply to the modified work as a whole.  If
-identifiable sections of that work are not derived from the Program,
-and can be reasonably considered independent and separate works in
-themselves, then this License, and its terms, do not apply to those
-sections when you distribute them as separate works.  But when you
-distribute the same sections as part of a whole which is a work based
-on the Program, the distribution of the whole must be on the terms of
-this License, whose permissions for other licensees extend to the
-entire whole, and thus to each and every part regardless of who wrote it.
-
-Thus, it is not the intent of this section to claim rights or contest
-your rights to work written entirely by you; rather, the intent is to
-exercise the right to control the distribution of derivative or
-collective works based on the Program.
-
-In addition, mere aggregation of another work not based on the Program
-with the Program (or with a work based on the Program) on a volume of
-a storage or distribution medium does not bring the other work under
-the scope of this License.
-
-  3. You may copy and distribute the Program (or a work based on it,
-under Section 2) in object code or executable form under the terms of
-Sections 1 and 2 above provided that you also do one of the following:
-
-    a) Accompany it with the complete corresponding machine-readable
-    source code, which must be distributed under the terms of Sections
-    1 and 2 above on a medium customarily used for software interchange; or,
-
-    b) Accompany it with a written offer, valid for at least three
-    years, to give any third party, for a charge no more than your
-    cost of physically performing source distribution, a complete
-    machine-readable copy of the corresponding source code, to be
-    distributed under the terms of Sections 1 and 2 above on a medium
-    customarily used for software interchange; or,
-
-    c) Accompany it with the information you received as to the offer
-    to distribute corresponding source code.  (This alternative is
-    allowed only for noncommercial distribution and only if you
-    received the program in object code or executable form with such
-    an offer, in accord with Subsection b above.)
-
-The source code for a work means the preferred form of the work for
-making modifications to it.  For an executable work, complete source
-code means all the source code for all modules it contains, plus any
-associated interface definition files, plus the scripts used to
-control compilation and installation of the executable.  However, as a
-special exception, the source code distributed need not include
-anything that is normally distributed (in either source or binary
-form) with the major components (compiler, kernel, and so on) of the
-operating system on which the executable runs, unless that component
-itself accompanies the executable.
-
-If distribution of executable or object code is made by offering
-access to copy from a designated place, then offering equivalent
-access to copy the source code from the same place counts as
-distribution of the source code, even though third parties are not
-compelled to copy the source along with the object code.
-
-  4. You may not copy, modify, sublicense, or distribute the Program
-except as expressly provided under this License.  Any attempt
-otherwise to copy, modify, sublicense or distribute the Program is
-void, and will automatically terminate your rights under this License.
-However, parties who have received copies, or rights, from you under
-this License will not have their licenses terminated so long as such
-parties remain in full compliance.
-
-  5. You are not required to accept this License, since you have not
-signed it.  However, nothing else grants you permission to modify or
-distribute the Program or its derivative works.  These actions are
-prohibited by law if you do not accept this License.  Therefore, by
-modifying or distributing the Program (or any work based on the
-Program), you indicate your acceptance of this License to do so, and
-all its terms and conditions for copying, distributing or modifying
-the Program or works based on it.
-
-  6. Each time you redistribute the Program (or any work based on the
-Program), the recipient automatically receives a license from the
-original licensor to copy, distribute or modify the Program subject to
-these terms and conditions.  You may not impose any further
-restrictions on the recipients' exercise of the rights granted herein.
-You are not responsible for enforcing compliance by third parties to
-this License.
-
-  7. If, as a consequence of a court judgment or allegation of patent
-infringement or for any other reason (not limited to patent issues),
-conditions are imposed on you (whether by court order, agreement or
-otherwise) that contradict the conditions of this License, they do not
-excuse you from the conditions of this License.  If you cannot
-distribute so as to satisfy simultaneously your obligations under this
-License and any other pertinent obligations, then as a consequence you
-may not distribute the Program at all.  For example, if a patent
-license would not permit royalty-free redistribution of the Program by
-all those who receive copies directly or indirectly through you, then
-the only way you could satisfy both it and this License would be to
-refrain entirely from distribution of the Program.
-
-If any portion of this section is held invalid or unenforceable under
-any particular circumstance, the balance of the section is intended to
-apply and the section as a whole is intended to apply in other
-circumstances.
-
-It is not the purpose of this section to induce you to infringe any
-patents or other property right claims or to contest validity of any
-such claims; this section has the sole purpose of protecting the
-integrity of the free software distribution system, which is
-implemented by public license practices.  Many people have made
-generous contributions to the wide range of software distributed
-through that system in reliance on consistent application of that
-system; it is up to the author/donor to decide if he or she is willing
-to distribute software through any other system and a licensee cannot
-impose that choice.
-
-This section is intended to make thoroughly clear what is believed to
-be a consequence of the rest of this License.
-
-  8. If the distribution and/or use of the Program is restricted in
-certain countries either by patents or by copyrighted interfaces, the
-original copyright holder who places the Program under this License
-may add an explicit geographical distribution limitation excluding
-those countries, so that distribution is permitted only in or among
-countries not thus excluded.  In such case, this License incorporates
-the limitation as if written in the body of this License.
-
-  9. The Free Software Foundation may publish revised and/or new versions
-of the General Public License from time to time.  Such new versions will
-be similar in spirit to the present version, but may differ in detail to
-address new problems or concerns.
-
-Each version is given a distinguishing version number.  If the Program
-specifies a version number of this License which applies to it and "any
-later version", you have the option of following the terms and conditions
-either of that version or of any later version published by the Free
-Software Foundation.  If the Program does not specify a version number of
-this License, you may choose any version ever published by the Free Software
-Foundation.
-
-  10. If you wish to incorporate parts of the Program into other free
-programs whose distribution conditions are different, write to the author
-to ask for permission.  For software which is copyrighted by the Free
-Software Foundation, write to the Free Software Foundation; we sometimes
-make exceptions for this.  Our decision will be guided by the two goals
-of preserving the free status of all derivatives of our free software and
-of promoting the sharing and reuse of software generally.
-
-                            NO WARRANTY
-
-  11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
-FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW.  EXCEPT WHEN
-OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
-PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
-OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
-MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.  THE ENTIRE RISK AS
-TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU.  SHOULD THE
-PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
-REPAIR OR CORRECTION.
-
-  12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
-WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
-REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
-INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
-OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
-TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
-YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
-PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
-POSSIBILITY OF SUCH DAMAGES.
-
-                     END OF TERMS AND CONDITIONS
-
-            How to Apply These Terms to Your New Programs
-
-  If you develop a new program, and you want it to be of the greatest
-possible use to the public, the best way to achieve this is to make it
-free software which everyone can redistribute and change under these terms.
-
-  To do so, attach the following notices to the program.  It is safest
-to attach them to the start of each source file to most effectively
-convey the exclusion of warranty; and each file should have at least
-the "copyright" line and a pointer to where the full notice is found.
-
-    <one line to give the program's name and a brief idea of what it does.>
-    Copyright (C) <year>  <name of author>
-
-    This program is free software; you can redistribute it and/or modify
-    it under the terms of the GNU General Public License as published by
-    the Free Software Foundation; either version 2 of the License, or
-    (at your option) any later version.
-
-    This program is distributed in the hope that it will be useful,
-    but WITHOUT ANY WARRANTY; without even the implied warranty of
-    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-    GNU General Public License for more details.
-
-    You should have received a copy of the GNU General Public License
-    along with this program; if not, write to the Free Software
-    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-
-
-Also add information on how to contact you by electronic and paper mail.
-
-If the program is interactive, make it output a short notice like this
-when it starts in an interactive mode:
-
-    Gnomovision version 69, Copyright (C) year name of author
-    Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
-    This is free software, and you are welcome to redistribute it
-    under certain conditions; type `show c' for details.
-
-The hypothetical commands `show w' and `show c' should show the appropriate
-parts of the General Public License.  Of course, the commands you use may
-be called something other than `show w' and `show c'; they could even be
-mouse-clicks or menu items--whatever suits your program.
-
-You should also get your employer (if you work as a programmer) or your
-school, if any, to sign a "copyright disclaimer" for the program, if
-necessary.  Here is a sample; alter the names:
-
-  Yoyodyne, Inc., hereby disclaims all copyright interest in the program
-  `Gnomovision' (which makes passes at compilers) written by James Hacker.
-
-  <signature of Ty Coon>, 1 April 1989
-  Ty Coon, President of Vice
-
-This General Public License does not permit incorporating your program into
-proprietary programs.  If your program is a subroutine library, you may
-consider it more useful to permit linking proprietary applications with the
-library.  If this is what you want to do, use the GNU Library General
-Public License instead of this License.

data/LEGAL

@@ -1,50 +0,0 @@
-LEGAL NOTICE INFORMATION
-========================
-
-All the files in this distribution are covered under 
-the Ruby Licence except some files under public-domain mentioned below.
-
-mt19937ar.c, 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 O
-R
-   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)

data/TODO

@@ -1,5 +0,0 @@
-- CArray#section should treat mask (-> currently CArray#bin uses inherit_mask)
-- CArray#differentiate should treat mask 
-* CArray#search should permit a CArray argument (use lfind ?)
-* append API ca_get_range(vrange, size, *first, *last)
-* ca_cast_self_or_other should treat NArray directly

data/carray_random.c

@@ -1,531 +0,0 @@
-/* ---------------------------------------------------------------------------
-
-  carray_random.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
-
-  This file is partially based on the codes in the following two files:
-
-    * random.c in Ruby distribution ( ruby-1.8.6 )
-       Copyright (C) 1993-2003 Yukihiro Matsumoto
-
-    * na_random.c in Ruby/NArray distribution ( narray-0.5.9 )
-       (C) Copyright 2003 by Masahiro TANAKA
-
----------------------------------------------------------------------------- */
-
-#include "carray.h"
-#include <math.h>
-#include "mt19937ar.h"
-
-static int first = 1;
-
-static VALUE
-rb_ca_s_srand(int argc, VALUE *argv, VALUE self)
-{
-  volatile VALUE seeds;
-  unsigned long *init_key;
-  int key_length;
-  int i;
-
-  if ( argc == 0 ) {
-    volatile VALUE limit = ULONG2NUM(0xffffffff), val;
-    seeds = rb_ary_new2(4);
-    for (i=0; i<4; i++) {
-      val = rb_funcall(rb_mKernel, rb_intern("rand"), 1, limit);
-      rb_ary_store(seeds, i, val);
-    }
-  }
-  else {
-    seeds = rb_ary_new4(argc, argv);
-  }
-
-  key_length = RARRAY_LEN(seeds);
-  init_key = malloc_with_check(sizeof(unsigned long)*key_length);
-
-  for (i=0; i<key_length; i++) {
-    init_key[i] = NUM2ULONG(rb_ary_entry(seeds, i));
-  }
-
-  init_by_array(init_key, key_length);
-
-  free(init_key);
-
-  first = 0;
-
-  return Qnil;
-}
-
-/* -------------------------------------------------------------------- */
-
-static int
-bit_width (uint32_t max)
-{
-  static uint32_t bits[32] = {
-    1, 2, 4, 8, 16, 32, 64, 128, 256,
-    512, 1024, 2048, 4096, 8192, 16384, 32768, 65536,
-    131072, 262144, 524288, 1048576, 2097152, 4194304,
-    8388608, 16777216, 33554432, 67108864, 134217728,
-    268435456, 536870912, 1073741824, 2147483648UL
-  };
-  int i;
-  if ( max == 0 ) {
-    return 0;
-  }
-  for (i=0; i<32; i++) {
-    if ( max <= bits[i] ) {
-      return i+1;
-    }
-  }
-  return 32;
-}
-
-static void
-ca_monop_random_boolean8_t (ca_size_t n, char *ptr1, int i1, uint32_t max)
-{
-  boolean8_t *q1 = (boolean8_t *) ptr1, *p1;
-  uint32_t val;
-  ca_size_t k;
-
-  if ( max > 1 ) {
-    rb_raise(rb_eArgError, "given maximum number is out of range");
-  }
-
-  #ifdef _OPENMP
-  #pragma omp parallel for private(p1)
-  #endif
-  for (k=0; k<n; k++) {
-    p1 = q1 + k*i1;
-    val = (uint32_t) genrand_int32();
-    val >>= 31;
-    *(int8_t*)p1 = (int8_t) val;
-  }
-}
-
-static void
-ca_monop_random_int8_t (ca_size_t n, char *ptr1, int i1, uint32_t max)
-{
-  int8_t *q1 = (int8_t *) ptr1, *p1;
-  uint32_t val;
-  int shift;
-  ca_size_t k;
-
-  if ( max > 0x80 ) {
-    rb_raise(rb_eArgError, "given maximum number is out of range");
-  }
-
-  shift = 32 - bit_width(max);
-
-  #ifdef _OPENMP
-  #pragma omp parallel for private(p1)
-  #endif
-  for (k=0; k<n; k++) {
-    p1 = q1 + k*i1;
-    do {
-      val = (uint32_t) genrand_int32();
-      val >>= shift;
-    } while ( val >= max );
-    *(int8_t*)p1 = (int8_t) val;
-  }
-}
-
-static void
-ca_monop_random_uint8_t (ca_size_t n, char *ptr1, int i1, uint32_t max)
-{
-  uint8_t *q1 = (uint8_t *) ptr1, *p1;
-  uint32_t val;
-  int shift;
-  ca_size_t k;
-
-  if ( max > 0x100 ) {
-    rb_raise(rb_eArgError, "given maximum number is out of range");
-  }
-
-  shift = 32 - bit_width(max);
-
-  #ifdef _OPENMP
-  #pragma omp parallel for private(p1)
-  #endif
-  for (k=0; k<n; k++) {
-    p1 = q1 + k*i1;
-    do {
-      val = (uint32_t) genrand_int32();
-      val >>= shift;
-    } while ( val >= max );
-    *(uint8_t*)p1 = (uint8_t) val;
-  }
-}
-
-static void
-ca_monop_random_int16_t (ca_size_t n, char *ptr1, int i1, uint32_t max)
-{
-  int16_t *q1 = (int16_t *) ptr1, *p1;
-  uint32_t val;
-  int shift;
-  ca_size_t k;
-
-  if ( max > 0x8000 ) {
-    rb_raise(rb_eArgError, "given maximum number is out of range");
-  }
-
-  shift = 32 - bit_width(max);
-
-  #ifdef _OPENMP
-  #pragma omp parallel for private(p1)
-  #endif
-  for (k=0; k<n; k++) {
-    p1 = q1 + k*i1;
-    do {
-      val = (uint32_t) genrand_int32();
-      val >>= shift;
-    } while ( val >= max );
-    *(int16_t*)p1 = (int16_t) val;
-  }
-}
-
-static void
-ca_monop_random_uint16_t (ca_size_t n, char *ptr1, int i1, uint32_t max)
-{
-  uint16_t *q1 = (uint16_t *) ptr1, *p1;
-  uint32_t val;
-  int shift;
-  ca_size_t k;
-
-  if ( max > 0x10000 ) {
-    rb_raise(rb_eArgError, "given maximum number is out of range");
-  }
-
-  shift = 32 - bit_width(max);
-
-  #ifdef _OPENMP
-  #pragma omp parallel for private(p1)
-  #endif
-  for (k=0; k<n; k++) {
-    p1 = q1 + k*i1;
-    do {
-      val = (uint32_t) genrand_int32();
-      val >>= shift;
-    } while ( val >= max );
-    *(uint16_t*)p1 = (uint16_t) val;
-  }
-}
-
-
-static void
-ca_monop_random_int32_t (ca_size_t n, char *ptr1, int i1, uint32_t max)
-{
-  int32_t *q1 = (int32_t *) ptr1, *p1;
-  uint32_t val;
-  int shift;
-  ca_size_t k;
-
-  if ( max > 0x80000000 ) {
-    rb_raise(rb_eArgError, "given maximum number is out of range");
-  }
-
-  shift = 32 - bit_width(max);
-
-  #ifdef _OPENMP
-  #pragma omp parallel for private(p1)
-  #endif
-  for (k=0; k<n; k++) {
-    p1 = q1 + k*i1;
-    do {
-      val = (uint32_t) genrand_int32();
-      val >>= shift;
-    } while ( val >= max );
-    *(int32_t*)p1 = (int32_t) val;
-  }
-}
-
-static void
-ca_monop_random_uint32_t (ca_size_t n, char *ptr1, int i1, double max)
-{
-  uint32_t *q1 = (uint32_t *) ptr1, *p1;
-  uint32_t val;
-  int shift;
-  ca_size_t k;
-
-  if ( max > 4294967296.0 ) { /* 0x100000000 */
-    rb_raise(rb_eArgError, "given maximum number is out of range");
-  }
-
-  if ( max > 4294967295.0 ) { /* 0xffffffff */
-    shift = 0;
-  }
-  else {
-    shift = 32 - bit_width((uint32_t) max);
-  }
-
-  #ifdef _OPENMP
-  #pragma omp parallel for private(p1)
-  #endif
-  for (k=0; k<n; k++) {
-    p1 = q1 + k*i1;
-    do {
-      val = (uint32_t) genrand_int32();
-      val >>= shift;
-    } while ( val >= max );
-    *(uint32_t*)p1 = (uint32_t) val;
-  }
-}
-
-static void
-ca_monop_random_float32_t(ca_size_t n, char *ptr1, int i1, double rmax)
-{
-  float32_t *q1 = (float32_t *) ptr1, *p1;
-  ca_size_t k;
-  #ifdef _OPENMP
-  #pragma omp parallel for private(p1)
-  #endif
-  for (k=0; k<n; k++) {
-    p1 = q1 + k*i1;
-    *(float32_t*)p1 = genrand_real2() * rmax;
-  }
-}
-
-static void
-ca_monop_random_float64_t(ca_size_t n, char *ptr1, int i1, double rmax)
-{
-  float64_t *q1 = (float64_t *) ptr1, *p1;
-  ca_size_t k;
-  #ifdef _OPENMP
-  #pragma omp parallel for private(p1)
-  #endif
-  for (k=0; k<n; k++) {
-    p1 = q1 + k*i1;
-    *(float64_t*)p1 = genrand_res53() * rmax;
-  }
-}
-
-#ifdef HAVE_COMPLEX_H
-
-static void
-ca_monop_random_cmplx64_t(ca_size_t n, char *ptr1, int i1, double rmax, double imax)
-{
-  cmplx64_t *q1 = (cmplx64_t *) ptr1, *p1;
-  ca_size_t k;
-  #ifdef _OPENMP
-  #pragma omp parallel for private(p1)
-  #endif
-  for (k=0; k<n; k++) {
-    p1 = q1 + k*i1;
-    *(cmplx64_t*)p1 = genrand_real2() * rmax + I * (genrand_real2() * rmax);
-  }
-}
-
-static void
-ca_monop_random_cmplx128_t(ca_size_t n, char *ptr1, int i1, double rmax, double imax)
-{
-  cmplx128_t *q1 = (cmplx128_t *) ptr1, *p1;
-  ca_size_t k;
-  #ifdef _OPENMP
-  #pragma omp parallel for private(p1)
-  #endif
-  for (k=0; k<n; k++) {
-    p1 = q1 + k*i1;
-    *(cmplx128_t*)p1 = genrand_res53() * rmax + I * (genrand_res53() * rmax);
-  }
-}
-
-#endif
-
-typedef void (*ca_random_func_t)();
-
-ca_random_func_t
-ca_monop_random[CA_NTYPE] = {
-  ca_monop_not_implement,
-  ca_monop_random_boolean8_t,
-  ca_monop_random_int8_t,
-  ca_monop_random_uint8_t,
-  ca_monop_random_int16_t,
-  ca_monop_random_uint16_t,
-  ca_monop_random_int32_t,
-  ca_monop_random_uint32_t,
-  ca_monop_not_implement, /* ca_monop_random_int64_t, */
-  ca_monop_not_implement, /* ca_monop_random_uint64_t, */
-  ca_monop_random_float32_t,
-  ca_monop_random_float64_t,
-  ca_monop_not_implement, /* ca_monop_random_float128_t, */
-#ifdef HAVE_COMPLEX_H
-  ca_monop_random_cmplx64_t,
-  ca_monop_random_cmplx128_t,
-  ca_monop_not_implement, /* ca_monop_random_cmplx256_t, */
-#else
-  ca_monop_not_implement,
-  ca_monop_not_implement,
-  ca_monop_not_implement,
-#endif
-  ca_monop_not_implement,
-};
-
-/* rdoc:
-  class CArray
-    def random! (max=1.0)
-    end
-  end
-*/
-
-static VALUE
-rb_ca_random (int argc, VALUE *argv, VALUE self)
-{
-  VALUE  rrmax, rimax = Qnil;
-  CArray *ca;
-  double rmax, imax = 1;
-
-  rb_ca_modify(self);
-
-  Data_Get_Struct(self, CArray, ca);
-
-  if ( ca_is_object_type(ca) ) {
-    CArray *dmy;
-    VALUE  *p;
-    ca_size_t i;
-
-    rb_scan_args(argc, argv, "01", &rrmax);
-    if ( NIL_P(rrmax) ) {
-      rrmax = rb_float_new(1.0);
-    }
-
-    ca_clear_mask(ca);
-
-    ca_attach(ca);
-
-    if ( rb_obj_is_kind_of(rrmax, rb_cInteger) ) {
-      int32_t *q;
-      rmax = (double)NUM2INT(rrmax);
-      dmy = carray_new(CA_INT32, ca->rank, ca->dim, ca->bytes, NULL);
-      (*ca_monop_random[dmy->data_type])(dmy->elements,
-                                      dmy->ptr, 1, (uint32_t)rmax);
-      p = (VALUE *)ca->ptr;
-      q = (int32_t *)dmy->ptr;
-      for (i=0; i<ca->elements; i++) {
-        *p = INT2NUM(*q);
-        p++; q++;
-      }
-    }
-    else if ( rb_obj_is_kind_of(rrmax, rb_cFloat) ) {
-      float64_t *q;
-      rmax = NUM2DBL(rrmax);
-      dmy = carray_new(CA_FLOAT64, ca->rank, ca->dim, ca->bytes, NULL);
-      (*ca_monop_random[dmy->data_type])(dmy->elements,
-                                      dmy->ptr, 1, rmax);
-      p = (VALUE *)ca->ptr;
-      q = (float64_t *)dmy->ptr;
-      for (i=0; i<ca->elements; i++) {
-        *p = rb_float_new(*q);
-        p++; q++;
-      }
-    }
-    else {
-      rb_raise(rb_eArgError,
-               "maximum number should be an integer or a float number");
-    }
-
-    ca_sync(ca);
-    ca_detach(ca);
-
-    ca_free(dmy);
-
-    return self;
-  }
-
-  rb_scan_args(argc, argv, "02", &rrmax, &rimax);
-
-  if ( first ) {
-    rb_ca_s_srand(0, NULL, rb_cCArray);
-  }
-
-  rmax = ( NIL_P(rrmax) ) ? 1.0 : NUM2DBL(rrmax);
-  imax = ( NIL_P(rimax) ) ? rmax : NUM2DBL(rimax);
-
-  if ( isinf(rmax) || isnan(rmax) || isinf(imax) || isnan(imax) ) {
-    rb_raise(rb_eArgError,
-             "maximum number should be finite");
-  }
-
-  if ( rmax < 0 || imax < 0 ) {
-    rb_raise(rb_eArgError,
-             "maximum number should be positive");
-  }
-
-  ca_clear_mask(ca);
-  ca_attach(ca);
-
-  switch ( ca->data_type ) {
-  case CA_CMPLX64:
-  case CA_CMPLX128:
-    if ( rmax < 0 || imax < 0 ) {
-      rb_raise(rb_eArgError,
-               "maximum number should be positive");
-    }
-    (*ca_monop_random[ca->data_type])(ca->elements,
-                                      ca->ptr, 1, rmax, imax);
-    break;
-  case CA_UINT32:
-  case CA_FLOAT32:
-  case CA_FLOAT64:
-    if ( rmax < 0 ) {
-      rb_raise(rb_eArgError,
-               "maximum number should be positive");
-    }
-    (*ca_monop_random[ca->data_type])(ca->elements,
-                                      ca->ptr, 1, rmax);
-    break;
-  default:
-    if ( rmax < 1 ) {
-      rb_raise(rb_eArgError,
-               "maximum number should be positive");
-    }
-    (*ca_monop_random[ca->data_type])(ca->elements,
-                                      ca->ptr, 1, (uint32_t)rmax);
-  }
-
-  ca_sync(ca);
-  ca_detach(ca);
-
-  return self;
-}
-
-void
-ca_check_rand_init ()
-{
-  if ( first ) {
-    rb_ca_s_srand(0, NULL, rb_cCArray);
-  }
-}
-
-int32_t
-ca_rand (double rmax)
-{
-  uint32_t val;
-  int shift;
-
-  ca_check_rand_init();
-
-  if ( rmax < 0 || rmax > 0x7fffffff ) {
-    rb_raise(rb_eArgError,
-             "given maximum number is out of range");
-  }
-
-  shift = 32 - bit_width((uint32_t)rmax);
-
-  do {
-    val = (uint32_t) genrand_int32();
-    val >>= shift;
-  } while ( val >= (uint32_t) rmax );
-
-  return (int32_t) val;
-}
-
-void
-Init_carray_random()
-{
-  rb_define_singleton_method(rb_cCArray,"srand", rb_ca_s_srand,-1);
-  rb_define_method(rb_cCArray, "random!", rb_ca_random, -1);
-}
-