numo-narray-alt 0.9.11 → 0.9.13

data/ext/numo/narray/src/t_dcomplex.c

@@ -38,6 +38,34 @@ static ID id_to_a;
 VALUE cT;
 extern VALUE cRT;
 
+#include "mh/coerce_cast.h"
+#include "mh/to_a.h"
+#include "mh/fill.h"
+#include "mh/format.h"
+#include "mh/format_to_a.h"
+#include "mh/inspect.h"
+#include "mh/op/add.h"
+#include "mh/op/sub.h"
+#include "mh/op/mul.h"
+#include "mh/op/div.h"
+#include "mh/pow.h"
+#include "mh/minus.h"
+#include "mh/reciprocal.h"
+#include "mh/sign.h"
+#include "mh/square.h"
+#include "mh/comp/eq.h"
+#include "mh/comp/ne.h"
+#include "mh/comp/nearly_eq.h"
+#include "mh/round/floor.h"
+#include "mh/round/round.h"
+#include "mh/round/ceil.h"
+#include "mh/round/trunc.h"
+#include "mh/round/rint.h"
+#include "mh/isnan.h"
+#include "mh/isinf.h"
+#include "mh/isposinf.h"
+#include "mh/isneginf.h"
+#include "mh/isfinite.h"
 #include "mh/sum.h"
 #include "mh/prod.h"
 #include "mh/mean.h"
@@ -51,6 +79,7 @@ extern VALUE cRT;
 #include "mh/logseq.h"
 #include "mh/eye.h"
 #include "mh/rand.h"
+#include "mh/rand_norm.h"
 #include "mh/math/sqrt.h"
 #include "mh/math/cbrt.h"
 #include "mh/math/log.h"
@@ -73,6 +102,34 @@ extern VALUE cRT;
 #include "mh/math/atanh.h"
 #include "mh/math/sinc.h"
 
+DEF_NARRAY_COERCE_CAST_METHOD_FUNC(dcomplex)
+DEF_NARRAY_TO_A_METHOD_FUNC(dcomplex)
+DEF_NARRAY_FILL_METHOD_FUNC(dcomplex)
+DEF_NARRAY_FORMAT_METHOD_FUNC(dcomplex)
+DEF_NARRAY_FORMAT_TO_A_METHOD_FUNC(dcomplex)
+DEF_NARRAY_INSPECT_METHOD_FUNC(dcomplex)
+DEF_NARRAY_ADD_METHOD_FUNC(dcomplex, numo_cDComplex)
+DEF_NARRAY_SUB_METHOD_FUNC(dcomplex, numo_cDComplex)
+DEF_NARRAY_MUL_METHOD_FUNC(dcomplex, numo_cDComplex)
+DEF_NARRAY_FLT_DIV_METHOD_FUNC(dcomplex, numo_cDComplex)
+DEF_NARRAY_POW_METHOD_FUNC(dcomplex, numo_cDComplex)
+DEF_NARRAY_MINUS_METHOD_FUNC(dcomplex, numo_cDComplex)
+DEF_NARRAY_RECIPROCAL_METHOD_FUNC(dcomplex, numo_cDComplex)
+DEF_NARRAY_SIGN_METHOD_FUNC(dcomplex, numo_cDComplex)
+DEF_NARRAY_SQUARE_METHOD_FUNC(dcomplex, numo_cDComplex)
+DEF_NARRAY_EQ_METHOD_FUNC(dcomplex, numo_cDComplex)
+DEF_NARRAY_NE_METHOD_FUNC(dcomplex, numo_cDComplex)
+DEF_NARRAY_NEARLY_EQ_METHOD_FUNC(dcomplex, numo_cDComplex)
+DEF_NARRAY_FLT_FLOOR_METHOD_FUNC(dcomplex, numo_cDComplex)
+DEF_NARRAY_FLT_ROUND_METHOD_FUNC(dcomplex, numo_cDComplex)
+DEF_NARRAY_FLT_CEIL_METHOD_FUNC(dcomplex, numo_cDComplex)
+DEF_NARRAY_FLT_TRUNC_METHOD_FUNC(dcomplex, numo_cDComplex)
+DEF_NARRAY_FLT_RINT_METHOD_FUNC(dcomplex, numo_cDComplex)
+DEF_NARRAY_FLT_ISNAN_METHOD_FUNC(dcomplex, numo_cDComplex)
+DEF_NARRAY_FLT_ISINF_METHOD_FUNC(dcomplex, numo_cDComplex)
+DEF_NARRAY_FLT_ISPOSINF_METHOD_FUNC(dcomplex, numo_cDComplex)
+DEF_NARRAY_FLT_ISNEGINF_METHOD_FUNC(dcomplex, numo_cDComplex)
+DEF_NARRAY_FLT_ISFINITE_METHOD_FUNC(dcomplex, numo_cDComplex)
 DEF_NARRAY_FLT_SUM_METHOD_FUNC(dcomplex, numo_cDComplex)
 DEF_NARRAY_FLT_PROD_METHOD_FUNC(dcomplex, numo_cDComplex)
 DEF_NARRAY_FLT_MEAN_METHOD_FUNC(dcomplex, numo_cDComplex, dcomplex, numo_cDComplex)
@@ -85,7 +142,8 @@ DEF_NARRAY_FLT_MULSUM_METHOD_FUNC(dcomplex, numo_cDComplex)
 DEF_NARRAY_FLT_SEQ_METHOD_FUNC(dcomplex)
 DEF_NARRAY_FLT_LOGSEQ_METHOD_FUNC(dcomplex)
 DEF_NARRAY_EYE_METHOD_FUNC(dcomplex)
-DEF_NARRAY_FLT_RAND_METHOD_FUNC(dcomplex)
+DEF_NARRAY_CMP_RAND_METHOD_FUNC(dcomplex)
+DEF_NARRAY_CMP_RAND_NORM_METHOD_FUNC(dcomplex, double)
 DEF_NARRAY_FLT_SQRT_METHOD_FUNC(dcomplex, numo_cDComplex)
 DEF_NARRAY_FLT_CBRT_METHOD_FUNC(dcomplex, numo_cDComplex)
 DEF_NARRAY_FLT_LOG_METHOD_FUNC(dcomplex, numo_cDComplex)
@@ -1391,204 +1449,6 @@ static VALUE dcomplex_aset(int argc, VALUE* argv, VALUE self) {
   return argv[argc];
 }
 
-/*
-  return NArray with cast to the type of self.
-  @overload coerce_cast(type)
-    @return [nil]
-*/
-static VALUE dcomplex_coerce_cast(VALUE self, VALUE type) {
-  return Qnil;
-}
-
-static void iter_dcomplex_to_a(na_loop_t* const lp) {
-  size_t i, s1;
-  char* p1;
-  size_t* idx1;
-  dtype x;
-  volatile VALUE a, y;
-
-  INIT_COUNTER(lp, i);
-  INIT_PTR_IDX(lp, 0, p1, s1, idx1);
-  a = rb_ary_new2(i);
-  rb_ary_push(lp->args[1].value, a);
-  if (idx1) {
-    for (; i--;) {
-      GET_DATA_INDEX(p1, idx1, dtype, x);
-      y = m_data_to_num(x);
-      rb_ary_push(a, y);
-    }
-  } else {
-    for (; i--;) {
-      GET_DATA_STRIDE(p1, s1, dtype, x);
-      y = m_data_to_num(x);
-      rb_ary_push(a, y);
-    }
-  }
-}
-
-/*
-  Convert self to Array.
-  @overload to_a
-    @return [Array]
-*/
-static VALUE dcomplex_to_a(VALUE self) {
-  ndfunc_arg_in_t ain[3] = { { Qnil, 0 }, { sym_loop_opt }, { sym_option } };
-  ndfunc_arg_out_t aout[1] = { { rb_cArray, 0 } }; // dummy?
-  ndfunc_t ndf = { iter_dcomplex_to_a, FULL_LOOP_NIP, 3, 1, ain, aout };
-  return na_ndloop_cast_narray_to_rarray(&ndf, self, Qnil);
-}
-
-static void iter_dcomplex_fill(na_loop_t* const lp) {
-  size_t i;
-  char* p1;
-  ssize_t s1;
-  size_t* idx1;
-  VALUE x = lp->option;
-  dtype y;
-  INIT_COUNTER(lp, i);
-  INIT_PTR_IDX(lp, 0, p1, s1, idx1);
-  y = m_num_to_data(x);
-  if (idx1) {
-    for (; i--;) {
-      SET_DATA_INDEX(p1, idx1, dtype, y);
-    }
-  } else {
-    for (; i--;) {
-      SET_DATA_STRIDE(p1, s1, dtype, y);
-    }
-  }
-}
-
-/*
-  Fill elements with other.
-  @overload fill other
-    @param [Numeric] other
-    @return [Numo::DComplex] self.
-*/
-static VALUE dcomplex_fill(VALUE self, VALUE val) {
-  ndfunc_arg_in_t ain[2] = { { OVERWRITE, 0 }, { sym_option } };
-  ndfunc_t ndf = { iter_dcomplex_fill, FULL_LOOP, 2, 0, ain, 0 };
-
-  na_ndloop(&ndf, 2, self, val);
-  return self;
-}
-
-static VALUE format_dcomplex(VALUE fmt, dtype* x) {
-  // fix-me
-  char s[48];
-  int n;
-
-  if (NIL_P(fmt)) {
-    n = m_sprintf(s, *x);
-    return rb_str_new(s, n);
-  }
-  return rb_funcall(fmt, '%', 1, m_data_to_num(*x));
-}
-
-static void iter_dcomplex_format(na_loop_t* const lp) {
-  size_t i;
-  char *p1, *p2;
-  ssize_t s1, s2;
-  size_t* idx1;
-  dtype* x;
-  VALUE y;
-  VALUE fmt = lp->option;
-  INIT_COUNTER(lp, i);
-  INIT_PTR_IDX(lp, 0, p1, s1, idx1);
-  INIT_PTR(lp, 1, p2, s2);
-  if (idx1) {
-    for (; i--;) {
-      x = (dtype*)(p1 + *idx1);
-      idx1++;
-      y = format_dcomplex(fmt, x);
-      SET_DATA_STRIDE(p2, s2, VALUE, y);
-    }
-  } else {
-    for (; i--;) {
-      x = (dtype*)p1;
-      p1 += s1;
-      y = format_dcomplex(fmt, x);
-      SET_DATA_STRIDE(p2, s2, VALUE, y);
-    }
-  }
-}
-
-/*
-  Format elements into strings.
-  @overload format format
-    @param [String] format
-    @return [Numo::RObject] array of formatted strings.
-*/
-static VALUE dcomplex_format(int argc, VALUE* argv, VALUE self) {
-  VALUE fmt = Qnil;
-
-  ndfunc_arg_in_t ain[2] = { { Qnil, 0 }, { sym_option } };
-  ndfunc_arg_out_t aout[1] = { { numo_cRObject, 0 } };
-  ndfunc_t ndf = { iter_dcomplex_format, FULL_LOOP_NIP, 2, 1, ain, aout };
-
-  rb_scan_args(argc, argv, "01", &fmt);
-  return na_ndloop(&ndf, 2, self, fmt);
-}
-
-static void iter_dcomplex_format_to_a(na_loop_t* const lp) {
-  size_t i;
-  char* p1;
-  ssize_t s1;
-  size_t* idx1;
-  dtype* x;
-  VALUE y;
-  volatile VALUE a;
-  VALUE fmt = lp->option;
-  INIT_COUNTER(lp, i);
-  INIT_PTR_IDX(lp, 0, p1, s1, idx1);
-  a = rb_ary_new2(i);
-  rb_ary_push(lp->args[1].value, a);
-  if (idx1) {
-    for (; i--;) {
-      x = (dtype*)(p1 + *idx1);
-      idx1++;
-      y = format_dcomplex(fmt, x);
-      rb_ary_push(a, y);
-    }
-  } else {
-    for (; i--;) {
-      x = (dtype*)p1;
-      p1 += s1;
-      y = format_dcomplex(fmt, x);
-      rb_ary_push(a, y);
-    }
-  }
-}
-
-/*
-  Format elements into strings.
-  @overload format_to_a format
-    @param [String] format
-    @return [Array] array of formatted strings.
-*/
-static VALUE dcomplex_format_to_a(int argc, VALUE* argv, VALUE self) {
-  VALUE fmt = Qnil;
-  ndfunc_arg_in_t ain[3] = { { Qnil, 0 }, { sym_loop_opt }, { sym_option } };
-  ndfunc_arg_out_t aout[1] = { { rb_cArray, 0 } }; // dummy?
-  ndfunc_t ndf = { iter_dcomplex_format_to_a, FULL_LOOP_NIP, 3, 1, ain, aout };
-
-  rb_scan_args(argc, argv, "01", &fmt);
-  return na_ndloop_cast_narray_to_rarray(&ndf, self, fmt);
-}
-
-static VALUE iter_dcomplex_inspect(char* ptr, size_t pos, VALUE fmt) {
-  return format_dcomplex(fmt, (dtype*)(ptr + pos));
-}
-
-/*
-  Returns a string containing a human-readable representation of NArray.
-  @overload inspect
-    @return [String]
-*/
-static VALUE dcomplex_inspect(VALUE ary) {
-  return na_ndloop_inspect(ary, iter_dcomplex_inspect, Qnil);
-}
-
 static void iter_dcomplex_each(na_loop_t* const lp) {
   size_t i, s1;
   char* p1;
@@ -1915,1212 +1775,157 @@ static VALUE dcomplex_abs(VALUE self) {
   return na_ndloop(&ndf, 1, self);
 }
 
-#define check_intdivzero(y)                                                                    \
-  {}
-
-static void iter_dcomplex_add(na_loop_t* const lp) {
-  size_t i = 0;
-  size_t n;
-  char *p1, *p2, *p3;
-  ssize_t s1, s2, s3;
+static void iter_dcomplex_conj(na_loop_t* const lp) {
+  size_t i, n;
+  char *p1, *p2;
+  ssize_t s1, s2;
+  size_t *idx1, *idx2;
+  dtype x;
 
   INIT_COUNTER(lp, n);
-  INIT_PTR(lp, 0, p1, s1);
-  INIT_PTR(lp, 1, p2, s2);
-  INIT_PTR(lp, 2, p3, s3);
-
-  //
-  if (is_aligned(p1, sizeof(dtype)) && is_aligned(p2, sizeof(dtype)) &&
-      is_aligned(p3, sizeof(dtype))) {
+  INIT_PTR_IDX(lp, 0, p1, s1, idx1);
+  INIT_PTR_IDX(lp, 1, p2, s2, idx2);
 
-    if (s1 == sizeof(dtype) && s2 == sizeof(dtype) && s3 == sizeof(dtype)) {
-      if (p1 == p3) { // inplace case
-        for (; i < n; i++) {
-          check_intdivzero(((dtype*)p2)[i]);
-          ((dtype*)p1)[i] = m_add(((dtype*)p1)[i], ((dtype*)p2)[i]);
-        }
-      } else {
-        for (; i < n; i++) {
-          check_intdivzero(((dtype*)p2)[i]);
-          ((dtype*)p3)[i] = m_add(((dtype*)p1)[i], ((dtype*)p2)[i]);
-        }
+  if (idx1) {
+    if (idx2) {
+      for (i = 0; i < n; i++) {
+        GET_DATA_INDEX(p1, idx1, dtype, x);
+        x = m_conj(x);
+        SET_DATA_INDEX(p2, idx2, dtype, x);
+      }
+    } else {
+      for (i = 0; i < n; i++) {
+        GET_DATA_INDEX(p1, idx1, dtype, x);
+        x = m_conj(x);
+        SET_DATA_STRIDE(p2, s2, dtype, x);
       }
-      return;
     }
-
-    if (is_aligned_step(s1, sizeof(dtype)) && is_aligned_step(s2, sizeof(dtype)) &&
-        is_aligned_step(s3, sizeof(dtype))) {
+  } else {
+    if (idx2) {
+      for (i = 0; i < n; i++) {
+        GET_DATA_STRIDE(p1, s1, dtype, x);
+        x = m_conj(x);
+        SET_DATA_INDEX(p2, idx2, dtype, x);
+      }
+    } else {
       //
-
-      if (s2 == 0) { // Broadcasting from scalar value.
-        check_intdivzero(*(dtype*)p2);
-        if (s1 == sizeof(dtype) && s3 == sizeof(dtype)) {
-          if (p1 == p3) { // inplace case
-            for (; i < n; i++) {
-              ((dtype*)p1)[i] = m_add(((dtype*)p1)[i], *(dtype*)p2);
-            }
-          } else {
-            for (; i < n; i++) {
-              ((dtype*)p3)[i] = m_add(((dtype*)p1)[i], *(dtype*)p2);
-            }
-          }
-        } else {
+      if (is_aligned(p1, sizeof(dtype)) && is_aligned(p2, sizeof(dtype))) {
+        if (s1 == sizeof(dtype) && s2 == sizeof(dtype)) {
           for (i = 0; i < n; i++) {
-            *(dtype*)p3 = m_add(*(dtype*)p1, *(dtype*)p2);
-            p1 += s1;
-            p3 += s3;
+            ((dtype*)p2)[i] = m_conj(((dtype*)p1)[i]);
           }
+          return;
         }
-      } else {
-        if (p1 == p3) { // inplace case
-          for (i = 0; i < n; i++) {
-            check_intdivzero(*(dtype*)p2);
-            *(dtype*)p1 = m_add(*(dtype*)p1, *(dtype*)p2);
-            p1 += s1;
-            p2 += s2;
-          }
-        } else {
+        if (is_aligned_step(s1, sizeof(dtype)) && is_aligned_step(s2, sizeof(dtype))) {
+          //
           for (i = 0; i < n; i++) {
-            check_intdivzero(*(dtype*)p2);
-            *(dtype*)p3 = m_add(*(dtype*)p1, *(dtype*)p2);
+            *(dtype*)p2 = m_conj(*(dtype*)p1);
             p1 += s1;
             p2 += s2;
-            p3 += s3;
           }
+          return;
+          //
         }
       }
-
-      return;
+      for (i = 0; i < n; i++) {
+        GET_DATA_STRIDE(p1, s1, dtype, x);
+        x = m_conj(x);
+        SET_DATA_STRIDE(p2, s2, dtype, x);
+      }
       //
     }
   }
-  for (i = 0; i < n; i++) {
-    dtype x, y, z;
-    GET_DATA_STRIDE(p1, s1, dtype, x);
-    GET_DATA_STRIDE(p2, s2, dtype, y);
-    check_intdivzero(y);
-    z = m_add(x, y);
-    SET_DATA_STRIDE(p3, s3, dtype, z);
-  }
-  //
-}
-#undef check_intdivzero
-
-static VALUE dcomplex_add_self(VALUE self, VALUE other) {
-  ndfunc_arg_in_t ain[2] = { { cT, 0 }, { cT, 0 } };
-  ndfunc_arg_out_t aout[1] = { { cT, 0 } };
-  ndfunc_t ndf = { iter_dcomplex_add, STRIDE_LOOP, 2, 1, ain, aout };
-
-  return na_ndloop(&ndf, 2, self, other);
 }
 
 /*
-  Binary add.
-  @overload + other
-    @param [Numo::NArray,Numeric] other
-    @return [Numo::NArray] self + other
+  Unary conj.
+  @overload conj
+    @return [Numo::DComplex] conj of self.
 */
-static VALUE dcomplex_add(VALUE self, VALUE other) {
-
-  VALUE klass, v;
+static VALUE dcomplex_conj(VALUE self) {
+  ndfunc_arg_in_t ain[1] = { { cT, 0 } };
+  ndfunc_arg_out_t aout[1] = { { cT, 0 } };
+  ndfunc_t ndf = { iter_dcomplex_conj, FULL_LOOP, 1, 1, ain, aout };
 
-  klass = na_upcast(rb_obj_class(self), rb_obj_class(other));
-  if (klass == cT) {
-    return dcomplex_add_self(self, other);
-  } else {
-    v = rb_funcall(klass, id_cast, 1, self);
-    return rb_funcall(v, '+', 1, other);
-  }
+  return na_ndloop(&ndf, 1, self);
 }
 
-#define check_intdivzero(y)                                                                    \
-  {}
-
-static void iter_dcomplex_sub(na_loop_t* const lp) {
-  size_t i = 0;
-  size_t n;
-  char *p1, *p2, *p3;
-  ssize_t s1, s2, s3;
+static void iter_dcomplex_im(na_loop_t* const lp) {
+  size_t i, n;
+  char *p1, *p2;
+  ssize_t s1, s2;
+  size_t *idx1, *idx2;
+  dtype x;
 
   INIT_COUNTER(lp, n);
-  INIT_PTR(lp, 0, p1, s1);
-  INIT_PTR(lp, 1, p2, s2);
-  INIT_PTR(lp, 2, p3, s3);
-
-  //
-  if (is_aligned(p1, sizeof(dtype)) && is_aligned(p2, sizeof(dtype)) &&
-      is_aligned(p3, sizeof(dtype))) {
+  INIT_PTR_IDX(lp, 0, p1, s1, idx1);
+  INIT_PTR_IDX(lp, 1, p2, s2, idx2);
 
-    if (s1 == sizeof(dtype) && s2 == sizeof(dtype) && s3 == sizeof(dtype)) {
-      if (p1 == p3) { // inplace case
-        for (; i < n; i++) {
-          check_intdivzero(((dtype*)p2)[i]);
-          ((dtype*)p1)[i] = m_sub(((dtype*)p1)[i], ((dtype*)p2)[i]);
-        }
-      } else {
-        for (; i < n; i++) {
-          check_intdivzero(((dtype*)p2)[i]);
-          ((dtype*)p3)[i] = m_sub(((dtype*)p1)[i], ((dtype*)p2)[i]);
-        }
-      }
-      return;
-    }
-
-    if (is_aligned_step(s1, sizeof(dtype)) && is_aligned_step(s2, sizeof(dtype)) &&
-        is_aligned_step(s3, sizeof(dtype))) {
-      //
-
-      if (s2 == 0) { // Broadcasting from scalar value.
-        check_intdivzero(*(dtype*)p2);
-        if (s1 == sizeof(dtype) && s3 == sizeof(dtype)) {
-          if (p1 == p3) { // inplace case
-            for (; i < n; i++) {
-              ((dtype*)p1)[i] = m_sub(((dtype*)p1)[i], *(dtype*)p2);
-            }
-          } else {
-            for (; i < n; i++) {
-              ((dtype*)p3)[i] = m_sub(((dtype*)p1)[i], *(dtype*)p2);
-            }
-          }
-        } else {
-          for (i = 0; i < n; i++) {
-            *(dtype*)p3 = m_sub(*(dtype*)p1, *(dtype*)p2);
-            p1 += s1;
-            p3 += s3;
-          }
-        }
-      } else {
-        if (p1 == p3) { // inplace case
-          for (i = 0; i < n; i++) {
-            check_intdivzero(*(dtype*)p2);
-            *(dtype*)p1 = m_sub(*(dtype*)p1, *(dtype*)p2);
-            p1 += s1;
-            p2 += s2;
-          }
-        } else {
-          for (i = 0; i < n; i++) {
-            check_intdivzero(*(dtype*)p2);
-            *(dtype*)p3 = m_sub(*(dtype*)p1, *(dtype*)p2);
-            p1 += s1;
-            p2 += s2;
-            p3 += s3;
-          }
-        }
-      }
-
-      return;
-      //
-    }
-  }
-  for (i = 0; i < n; i++) {
-    dtype x, y, z;
-    GET_DATA_STRIDE(p1, s1, dtype, x);
-    GET_DATA_STRIDE(p2, s2, dtype, y);
-    check_intdivzero(y);
-    z = m_sub(x, y);
-    SET_DATA_STRIDE(p3, s3, dtype, z);
-  }
-  //
-}
-#undef check_intdivzero
-
-static VALUE dcomplex_sub_self(VALUE self, VALUE other) {
-  ndfunc_arg_in_t ain[2] = { { cT, 0 }, { cT, 0 } };
-  ndfunc_arg_out_t aout[1] = { { cT, 0 } };
-  ndfunc_t ndf = { iter_dcomplex_sub, STRIDE_LOOP, 2, 1, ain, aout };
-
-  return na_ndloop(&ndf, 2, self, other);
-}
-
-/*
-  Binary sub.
-  @overload - other
-    @param [Numo::NArray,Numeric] other
-    @return [Numo::NArray] self - other
-*/
-static VALUE dcomplex_sub(VALUE self, VALUE other) {
-
-  VALUE klass, v;
-
-  klass = na_upcast(rb_obj_class(self), rb_obj_class(other));
-  if (klass == cT) {
-    return dcomplex_sub_self(self, other);
-  } else {
-    v = rb_funcall(klass, id_cast, 1, self);
-    return rb_funcall(v, '-', 1, other);
-  }
-}
-
-#define check_intdivzero(y)                                                                    \
-  {}
-
-static void iter_dcomplex_mul(na_loop_t* const lp) {
-  size_t i = 0;
-  size_t n;
-  char *p1, *p2, *p3;
-  ssize_t s1, s2, s3;
-
-  INIT_COUNTER(lp, n);
-  INIT_PTR(lp, 0, p1, s1);
-  INIT_PTR(lp, 1, p2, s2);
-  INIT_PTR(lp, 2, p3, s3);
-
-  //
-  if (is_aligned(p1, sizeof(dtype)) && is_aligned(p2, sizeof(dtype)) &&
-      is_aligned(p3, sizeof(dtype))) {
-
-    if (s1 == sizeof(dtype) && s2 == sizeof(dtype) && s3 == sizeof(dtype)) {
-      if (p1 == p3) { // inplace case
-        for (; i < n; i++) {
-          check_intdivzero(((dtype*)p2)[i]);
-          ((dtype*)p1)[i] = m_mul(((dtype*)p1)[i], ((dtype*)p2)[i]);
-        }
-      } else {
-        for (; i < n; i++) {
-          check_intdivzero(((dtype*)p2)[i]);
-          ((dtype*)p3)[i] = m_mul(((dtype*)p1)[i], ((dtype*)p2)[i]);
-        }
-      }
-      return;
-    }
-
-    if (is_aligned_step(s1, sizeof(dtype)) && is_aligned_step(s2, sizeof(dtype)) &&
-        is_aligned_step(s3, sizeof(dtype))) {
-      //
-
-      if (s2 == 0) { // Broadcasting from scalar value.
-        check_intdivzero(*(dtype*)p2);
-        if (s1 == sizeof(dtype) && s3 == sizeof(dtype)) {
-          if (p1 == p3) { // inplace case
-            for (; i < n; i++) {
-              ((dtype*)p1)[i] = m_mul(((dtype*)p1)[i], *(dtype*)p2);
-            }
-          } else {
-            for (; i < n; i++) {
-              ((dtype*)p3)[i] = m_mul(((dtype*)p1)[i], *(dtype*)p2);
-            }
-          }
-        } else {
-          for (i = 0; i < n; i++) {
-            *(dtype*)p3 = m_mul(*(dtype*)p1, *(dtype*)p2);
-            p1 += s1;
-            p3 += s3;
-          }
-        }
-      } else {
-        if (p1 == p3) { // inplace case
-          for (i = 0; i < n; i++) {
-            check_intdivzero(*(dtype*)p2);
-            *(dtype*)p1 = m_mul(*(dtype*)p1, *(dtype*)p2);
-            p1 += s1;
-            p2 += s2;
-          }
-        } else {
-          for (i = 0; i < n; i++) {
-            check_intdivzero(*(dtype*)p2);
-            *(dtype*)p3 = m_mul(*(dtype*)p1, *(dtype*)p2);
-            p1 += s1;
-            p2 += s2;
-            p3 += s3;
-          }
-        }
-      }
-
-      return;
-      //
-    }
-  }
-  for (i = 0; i < n; i++) {
-    dtype x, y, z;
-    GET_DATA_STRIDE(p1, s1, dtype, x);
-    GET_DATA_STRIDE(p2, s2, dtype, y);
-    check_intdivzero(y);
-    z = m_mul(x, y);
-    SET_DATA_STRIDE(p3, s3, dtype, z);
-  }
-  //
-}
-#undef check_intdivzero
-
-static VALUE dcomplex_mul_self(VALUE self, VALUE other) {
-  ndfunc_arg_in_t ain[2] = { { cT, 0 }, { cT, 0 } };
-  ndfunc_arg_out_t aout[1] = { { cT, 0 } };
-  ndfunc_t ndf = { iter_dcomplex_mul, STRIDE_LOOP, 2, 1, ain, aout };
-
-  return na_ndloop(&ndf, 2, self, other);
-}
-
-/*
-  Binary mul.
-  @overload * other
-    @param [Numo::NArray,Numeric] other
-    @return [Numo::NArray] self * other
-*/
-static VALUE dcomplex_mul(VALUE self, VALUE other) {
-
-  VALUE klass, v;
-
-  klass = na_upcast(rb_obj_class(self), rb_obj_class(other));
-  if (klass == cT) {
-    return dcomplex_mul_self(self, other);
-  } else {
-    v = rb_funcall(klass, id_cast, 1, self);
-    return rb_funcall(v, '*', 1, other);
-  }
-}
-
-#define check_intdivzero(y)                                                                    \
-  {}
-
-static void iter_dcomplex_div(na_loop_t* const lp) {
-  size_t i = 0;
-  size_t n;
-  char *p1, *p2, *p3;
-  ssize_t s1, s2, s3;
-
-  INIT_COUNTER(lp, n);
-  INIT_PTR(lp, 0, p1, s1);
-  INIT_PTR(lp, 1, p2, s2);
-  INIT_PTR(lp, 2, p3, s3);
-
-  //
-  if (is_aligned(p1, sizeof(dtype)) && is_aligned(p2, sizeof(dtype)) &&
-      is_aligned(p3, sizeof(dtype))) {
-
-    if (s1 == sizeof(dtype) && s2 == sizeof(dtype) && s3 == sizeof(dtype)) {
-      if (p1 == p3) { // inplace case
-        for (; i < n; i++) {
-          check_intdivzero(((dtype*)p2)[i]);
-          ((dtype*)p1)[i] = m_div(((dtype*)p1)[i], ((dtype*)p2)[i]);
-        }
-      } else {
-        for (; i < n; i++) {
-          check_intdivzero(((dtype*)p2)[i]);
-          ((dtype*)p3)[i] = m_div(((dtype*)p1)[i], ((dtype*)p2)[i]);
-        }
-      }
-      return;
-    }
-
-    if (is_aligned_step(s1, sizeof(dtype)) && is_aligned_step(s2, sizeof(dtype)) &&
-        is_aligned_step(s3, sizeof(dtype))) {
-      //
-
-      if (s2 == 0) { // Broadcasting from scalar value.
-        check_intdivzero(*(dtype*)p2);
-        if (s1 == sizeof(dtype) && s3 == sizeof(dtype)) {
-          if (p1 == p3) { // inplace case
-            for (; i < n; i++) {
-              ((dtype*)p1)[i] = m_div(((dtype*)p1)[i], *(dtype*)p2);
-            }
-          } else {
-            for (; i < n; i++) {
-              ((dtype*)p3)[i] = m_div(((dtype*)p1)[i], *(dtype*)p2);
-            }
-          }
-        } else {
-          for (i = 0; i < n; i++) {
-            *(dtype*)p3 = m_div(*(dtype*)p1, *(dtype*)p2);
-            p1 += s1;
-            p3 += s3;
-          }
-        }
-      } else {
-        if (p1 == p3) { // inplace case
-          for (i = 0; i < n; i++) {
-            check_intdivzero(*(dtype*)p2);
-            *(dtype*)p1 = m_div(*(dtype*)p1, *(dtype*)p2);
-            p1 += s1;
-            p2 += s2;
-          }
-        } else {
-          for (i = 0; i < n; i++) {
-            check_intdivzero(*(dtype*)p2);
-            *(dtype*)p3 = m_div(*(dtype*)p1, *(dtype*)p2);
-            p1 += s1;
-            p2 += s2;
-            p3 += s3;
-          }
-        }
-      }
-
-      return;
-      //
-    }
-  }
-  for (i = 0; i < n; i++) {
-    dtype x, y, z;
-    GET_DATA_STRIDE(p1, s1, dtype, x);
-    GET_DATA_STRIDE(p2, s2, dtype, y);
-    check_intdivzero(y);
-    z = m_div(x, y);
-    SET_DATA_STRIDE(p3, s3, dtype, z);
-  }
-  //
-}
-#undef check_intdivzero
-
-static VALUE dcomplex_div_self(VALUE self, VALUE other) {
-  ndfunc_arg_in_t ain[2] = { { cT, 0 }, { cT, 0 } };
-  ndfunc_arg_out_t aout[1] = { { cT, 0 } };
-  ndfunc_t ndf = { iter_dcomplex_div, STRIDE_LOOP, 2, 1, ain, aout };
-
-  return na_ndloop(&ndf, 2, self, other);
-}
-
-/*
-  Binary div.
-  @overload / other
-    @param [Numo::NArray,Numeric] other
-    @return [Numo::NArray] self / other
-*/
-static VALUE dcomplex_div(VALUE self, VALUE other) {
-
-  VALUE klass, v;
-
-  klass = na_upcast(rb_obj_class(self), rb_obj_class(other));
-  if (klass == cT) {
-    return dcomplex_div_self(self, other);
-  } else {
-    v = rb_funcall(klass, id_cast, 1, self);
-    return rb_funcall(v, '/', 1, other);
-  }
-}
-
-static void iter_dcomplex_pow(na_loop_t* const lp) {
-  size_t i;
-  char *p1, *p2, *p3;
-  ssize_t s1, s2, s3;
-  dtype x, y;
-  INIT_COUNTER(lp, i);
-  INIT_PTR(lp, 0, p1, s1);
-  INIT_PTR(lp, 1, p2, s2);
-  INIT_PTR(lp, 2, p3, s3);
-  for (; i--;) {
-    GET_DATA_STRIDE(p1, s1, dtype, x);
-    GET_DATA_STRIDE(p2, s2, dtype, y);
-    x = m_pow(x, y);
-    SET_DATA_STRIDE(p3, s3, dtype, x);
-  }
-}
-
-static void iter_dcomplex_pow_int32(na_loop_t* const lp) {
-  size_t i;
-  char *p1, *p2, *p3;
-  ssize_t s1, s2, s3;
-  dtype x;
-  int32_t y;
-  INIT_COUNTER(lp, i);
-  INIT_PTR(lp, 0, p1, s1);
-  INIT_PTR(lp, 1, p2, s2);
-  INIT_PTR(lp, 2, p3, s3);
-  for (; i--;) {
-    GET_DATA_STRIDE(p1, s1, dtype, x);
-    GET_DATA_STRIDE(p2, s2, int32_t, y);
-    x = m_pow_int(x, y);
-    SET_DATA_STRIDE(p3, s3, dtype, x);
-  }
-}
-
-static VALUE dcomplex_pow_self(VALUE self, VALUE other) {
-  ndfunc_arg_in_t ain[2] = { { cT, 0 }, { cT, 0 } };
-  ndfunc_arg_in_t ain_i[2] = { { cT, 0 }, { numo_cInt32, 0 } };
-  ndfunc_arg_out_t aout[1] = { { cT, 0 } };
-  ndfunc_t ndf = { iter_dcomplex_pow, STRIDE_LOOP, 2, 1, ain, aout };
-  ndfunc_t ndf_i = { iter_dcomplex_pow_int32, STRIDE_LOOP, 2, 1, ain_i, aout };
-
-  // fixme : use na.integer?
-  if (FIXNUM_P(other) || rb_obj_is_kind_of(other, numo_cInt32)) {
-    return na_ndloop(&ndf_i, 2, self, other);
-  } else {
-    return na_ndloop(&ndf, 2, self, other);
-  }
-}
-
-/*
-  Binary power.
-  @overload ** other
-    @param [Numo::NArray,Numeric] other
-    @return [Numo::NArray] self to the other-th power.
-*/
-static VALUE dcomplex_pow(VALUE self, VALUE other) {
-
-  VALUE klass, v;
-  klass = na_upcast(rb_obj_class(self), rb_obj_class(other));
-  if (klass == cT) {
-    return dcomplex_pow_self(self, other);
-  } else {
-    v = rb_funcall(klass, id_cast, 1, self);
-    return rb_funcall(v, id_pow, 1, other);
-  }
-}
-
-static void iter_dcomplex_minus(na_loop_t* const lp) {
-  size_t i, n;
-  char *p1, *p2;
-  ssize_t s1, s2;
-  size_t *idx1, *idx2;
-  dtype x;
-
-  INIT_COUNTER(lp, n);
-  INIT_PTR_IDX(lp, 0, p1, s1, idx1);
-  INIT_PTR_IDX(lp, 1, p2, s2, idx2);
-
-  if (idx1) {
-    if (idx2) {
-      for (i = 0; i < n; i++) {
-        GET_DATA_INDEX(p1, idx1, dtype, x);
-        x = m_minus(x);
-        SET_DATA_INDEX(p2, idx2, dtype, x);
-      }
-    } else {
-      for (i = 0; i < n; i++) {
-        GET_DATA_INDEX(p1, idx1, dtype, x);
-        x = m_minus(x);
-        SET_DATA_STRIDE(p2, s2, dtype, x);
-      }
-    }
-  } else {
-    if (idx2) {
-      for (i = 0; i < n; i++) {
-        GET_DATA_STRIDE(p1, s1, dtype, x);
-        x = m_minus(x);
-        SET_DATA_INDEX(p2, idx2, dtype, x);
-      }
-    } else {
-      //
-      if (is_aligned(p1, sizeof(dtype)) && is_aligned(p2, sizeof(dtype))) {
-        if (s1 == sizeof(dtype) && s2 == sizeof(dtype)) {
-          for (i = 0; i < n; i++) {
-            ((dtype*)p2)[i] = m_minus(((dtype*)p1)[i]);
-          }
-          return;
-        }
-        if (is_aligned_step(s1, sizeof(dtype)) && is_aligned_step(s2, sizeof(dtype))) {
-          //
-          for (i = 0; i < n; i++) {
-            *(dtype*)p2 = m_minus(*(dtype*)p1);
-            p1 += s1;
-            p2 += s2;
-          }
-          return;
-          //
-        }
-      }
-      for (i = 0; i < n; i++) {
-        GET_DATA_STRIDE(p1, s1, dtype, x);
-        x = m_minus(x);
-        SET_DATA_STRIDE(p2, s2, dtype, x);
-      }
-      //
-    }
-  }
-}
-
-/*
-  Unary minus.
-  @overload -@
-    @return [Numo::DComplex] minus of self.
-*/
-static VALUE dcomplex_minus(VALUE self) {
-  ndfunc_arg_in_t ain[1] = { { cT, 0 } };
-  ndfunc_arg_out_t aout[1] = { { cT, 0 } };
-  ndfunc_t ndf = { iter_dcomplex_minus, FULL_LOOP, 1, 1, ain, aout };
-
-  return na_ndloop(&ndf, 1, self);
-}
-
-static void iter_dcomplex_reciprocal(na_loop_t* const lp) {
-  size_t i, n;
-  char *p1, *p2;
-  ssize_t s1, s2;
-  size_t *idx1, *idx2;
-  dtype x;
-
-  INIT_COUNTER(lp, n);
-  INIT_PTR_IDX(lp, 0, p1, s1, idx1);
-  INIT_PTR_IDX(lp, 1, p2, s2, idx2);
-
-  if (idx1) {
-    if (idx2) {
-      for (i = 0; i < n; i++) {
-        GET_DATA_INDEX(p1, idx1, dtype, x);
-        x = m_reciprocal(x);
-        SET_DATA_INDEX(p2, idx2, dtype, x);
-      }
-    } else {
-      for (i = 0; i < n; i++) {
-        GET_DATA_INDEX(p1, idx1, dtype, x);
-        x = m_reciprocal(x);
-        SET_DATA_STRIDE(p2, s2, dtype, x);
-      }
-    }
-  } else {
-    if (idx2) {
-      for (i = 0; i < n; i++) {
-        GET_DATA_STRIDE(p1, s1, dtype, x);
-        x = m_reciprocal(x);
-        SET_DATA_INDEX(p2, idx2, dtype, x);
-      }
-    } else {
-      //
-      if (is_aligned(p1, sizeof(dtype)) && is_aligned(p2, sizeof(dtype))) {
-        if (s1 == sizeof(dtype) && s2 == sizeof(dtype)) {
-          for (i = 0; i < n; i++) {
-            ((dtype*)p2)[i] = m_reciprocal(((dtype*)p1)[i]);
-          }
-          return;
-        }
-        if (is_aligned_step(s1, sizeof(dtype)) && is_aligned_step(s2, sizeof(dtype))) {
-          //
-          for (i = 0; i < n; i++) {
-            *(dtype*)p2 = m_reciprocal(*(dtype*)p1);
-            p1 += s1;
-            p2 += s2;
-          }
-          return;
-          //
-        }
-      }
-      for (i = 0; i < n; i++) {
-        GET_DATA_STRIDE(p1, s1, dtype, x);
-        x = m_reciprocal(x);
-        SET_DATA_STRIDE(p2, s2, dtype, x);
-      }
-      //
-    }
-  }
-}
-
-/*
-  Unary reciprocal.
-  @overload reciprocal
-    @return [Numo::DComplex] reciprocal of self.
-*/
-static VALUE dcomplex_reciprocal(VALUE self) {
-  ndfunc_arg_in_t ain[1] = { { cT, 0 } };
-  ndfunc_arg_out_t aout[1] = { { cT, 0 } };
-  ndfunc_t ndf = { iter_dcomplex_reciprocal, FULL_LOOP, 1, 1, ain, aout };
-
-  return na_ndloop(&ndf, 1, self);
-}
-
-static void iter_dcomplex_sign(na_loop_t* const lp) {
-  size_t i, n;
-  char *p1, *p2;
-  ssize_t s1, s2;
-  size_t *idx1, *idx2;
-  dtype x;
-
-  INIT_COUNTER(lp, n);
-  INIT_PTR_IDX(lp, 0, p1, s1, idx1);
-  INIT_PTR_IDX(lp, 1, p2, s2, idx2);
-
-  if (idx1) {
-    if (idx2) {
-      for (i = 0; i < n; i++) {
-        GET_DATA_INDEX(p1, idx1, dtype, x);
-        x = m_sign(x);
-        SET_DATA_INDEX(p2, idx2, dtype, x);
-      }
-    } else {
-      for (i = 0; i < n; i++) {
-        GET_DATA_INDEX(p1, idx1, dtype, x);
-        x = m_sign(x);
-        SET_DATA_STRIDE(p2, s2, dtype, x);
-      }
-    }
-  } else {
-    if (idx2) {
-      for (i = 0; i < n; i++) {
-        GET_DATA_STRIDE(p1, s1, dtype, x);
-        x = m_sign(x);
-        SET_DATA_INDEX(p2, idx2, dtype, x);
-      }
-    } else {
-      //
-      if (is_aligned(p1, sizeof(dtype)) && is_aligned(p2, sizeof(dtype))) {
-        if (s1 == sizeof(dtype) && s2 == sizeof(dtype)) {
-          for (i = 0; i < n; i++) {
-            ((dtype*)p2)[i] = m_sign(((dtype*)p1)[i]);
-          }
-          return;
-        }
-        if (is_aligned_step(s1, sizeof(dtype)) && is_aligned_step(s2, sizeof(dtype))) {
-          //
-          for (i = 0; i < n; i++) {
-            *(dtype*)p2 = m_sign(*(dtype*)p1);
-            p1 += s1;
-            p2 += s2;
-          }
-          return;
-          //
-        }
-      }
-      for (i = 0; i < n; i++) {
-        GET_DATA_STRIDE(p1, s1, dtype, x);
-        x = m_sign(x);
-        SET_DATA_STRIDE(p2, s2, dtype, x);
-      }
-      //
-    }
-  }
-}
-
-/*
-  Unary sign.
-  @overload sign
-    @return [Numo::DComplex] sign of self.
-*/
-static VALUE dcomplex_sign(VALUE self) {
-  ndfunc_arg_in_t ain[1] = { { cT, 0 } };
-  ndfunc_arg_out_t aout[1] = { { cT, 0 } };
-  ndfunc_t ndf = { iter_dcomplex_sign, FULL_LOOP, 1, 1, ain, aout };
-
-  return na_ndloop(&ndf, 1, self);
-}
-
-static void iter_dcomplex_square(na_loop_t* const lp) {
-  size_t i, n;
-  char *p1, *p2;
-  ssize_t s1, s2;
-  size_t *idx1, *idx2;
-  dtype x;
-
-  INIT_COUNTER(lp, n);
-  INIT_PTR_IDX(lp, 0, p1, s1, idx1);
-  INIT_PTR_IDX(lp, 1, p2, s2, idx2);
-
-  if (idx1) {
-    if (idx2) {
-      for (i = 0; i < n; i++) {
-        GET_DATA_INDEX(p1, idx1, dtype, x);
-        x = m_square(x);
-        SET_DATA_INDEX(p2, idx2, dtype, x);
-      }
-    } else {
-      for (i = 0; i < n; i++) {
-        GET_DATA_INDEX(p1, idx1, dtype, x);
-        x = m_square(x);
-        SET_DATA_STRIDE(p2, s2, dtype, x);
-      }
-    }
-  } else {
-    if (idx2) {
-      for (i = 0; i < n; i++) {
-        GET_DATA_STRIDE(p1, s1, dtype, x);
-        x = m_square(x);
-        SET_DATA_INDEX(p2, idx2, dtype, x);
-      }
-    } else {
-      //
-      if (is_aligned(p1, sizeof(dtype)) && is_aligned(p2, sizeof(dtype))) {
-        if (s1 == sizeof(dtype) && s2 == sizeof(dtype)) {
-          for (i = 0; i < n; i++) {
-            ((dtype*)p2)[i] = m_square(((dtype*)p1)[i]);
-          }
-          return;
-        }
-        if (is_aligned_step(s1, sizeof(dtype)) && is_aligned_step(s2, sizeof(dtype))) {
-          //
-          for (i = 0; i < n; i++) {
-            *(dtype*)p2 = m_square(*(dtype*)p1);
-            p1 += s1;
-            p2 += s2;
-          }
-          return;
-          //
-        }
-      }
-      for (i = 0; i < n; i++) {
-        GET_DATA_STRIDE(p1, s1, dtype, x);
-        x = m_square(x);
-        SET_DATA_STRIDE(p2, s2, dtype, x);
-      }
-      //
-    }
-  }
-}
-
-/*
-  Unary square.
-  @overload square
-    @return [Numo::DComplex] square of self.
-*/
-static VALUE dcomplex_square(VALUE self) {
-  ndfunc_arg_in_t ain[1] = { { cT, 0 } };
-  ndfunc_arg_out_t aout[1] = { { cT, 0 } };
-  ndfunc_t ndf = { iter_dcomplex_square, FULL_LOOP, 1, 1, ain, aout };
-
-  return na_ndloop(&ndf, 1, self);
-}
-
-static void iter_dcomplex_conj(na_loop_t* const lp) {
-  size_t i, n;
-  char *p1, *p2;
-  ssize_t s1, s2;
-  size_t *idx1, *idx2;
-  dtype x;
-
-  INIT_COUNTER(lp, n);
-  INIT_PTR_IDX(lp, 0, p1, s1, idx1);
-  INIT_PTR_IDX(lp, 1, p2, s2, idx2);
-
-  if (idx1) {
-    if (idx2) {
-      for (i = 0; i < n; i++) {
-        GET_DATA_INDEX(p1, idx1, dtype, x);
-        x = m_conj(x);
-        SET_DATA_INDEX(p2, idx2, dtype, x);
-      }
-    } else {
-      for (i = 0; i < n; i++) {
-        GET_DATA_INDEX(p1, idx1, dtype, x);
-        x = m_conj(x);
-        SET_DATA_STRIDE(p2, s2, dtype, x);
-      }
-    }
-  } else {
-    if (idx2) {
-      for (i = 0; i < n; i++) {
-        GET_DATA_STRIDE(p1, s1, dtype, x);
-        x = m_conj(x);
-        SET_DATA_INDEX(p2, idx2, dtype, x);
-      }
-    } else {
-      //
-      if (is_aligned(p1, sizeof(dtype)) && is_aligned(p2, sizeof(dtype))) {
-        if (s1 == sizeof(dtype) && s2 == sizeof(dtype)) {
-          for (i = 0; i < n; i++) {
-            ((dtype*)p2)[i] = m_conj(((dtype*)p1)[i]);
-          }
-          return;
-        }
-        if (is_aligned_step(s1, sizeof(dtype)) && is_aligned_step(s2, sizeof(dtype))) {
-          //
-          for (i = 0; i < n; i++) {
-            *(dtype*)p2 = m_conj(*(dtype*)p1);
-            p1 += s1;
-            p2 += s2;
-          }
-          return;
-          //
-        }
-      }
-      for (i = 0; i < n; i++) {
-        GET_DATA_STRIDE(p1, s1, dtype, x);
-        x = m_conj(x);
-        SET_DATA_STRIDE(p2, s2, dtype, x);
-      }
-      //
-    }
-  }
-}
-
-/*
-  Unary conj.
-  @overload conj
-    @return [Numo::DComplex] conj of self.
-*/
-static VALUE dcomplex_conj(VALUE self) {
-  ndfunc_arg_in_t ain[1] = { { cT, 0 } };
-  ndfunc_arg_out_t aout[1] = { { cT, 0 } };
-  ndfunc_t ndf = { iter_dcomplex_conj, FULL_LOOP, 1, 1, ain, aout };
-
-  return na_ndloop(&ndf, 1, self);
-}
-
-static void iter_dcomplex_im(na_loop_t* const lp) {
-  size_t i, n;
-  char *p1, *p2;
-  ssize_t s1, s2;
-  size_t *idx1, *idx2;
-  dtype x;
-
-  INIT_COUNTER(lp, n);
-  INIT_PTR_IDX(lp, 0, p1, s1, idx1);
-  INIT_PTR_IDX(lp, 1, p2, s2, idx2);
-
-  if (idx1) {
-    if (idx2) {
-      for (i = 0; i < n; i++) {
-        GET_DATA_INDEX(p1, idx1, dtype, x);
-        x = m_im(x);
-        SET_DATA_INDEX(p2, idx2, dtype, x);
-      }
-    } else {
-      for (i = 0; i < n; i++) {
-        GET_DATA_INDEX(p1, idx1, dtype, x);
-        x = m_im(x);
-        SET_DATA_STRIDE(p2, s2, dtype, x);
-      }
-    }
-  } else {
-    if (idx2) {
-      for (i = 0; i < n; i++) {
-        GET_DATA_STRIDE(p1, s1, dtype, x);
-        x = m_im(x);
-        SET_DATA_INDEX(p2, idx2, dtype, x);
-      }
-    } else {
-      //
-      if (is_aligned(p1, sizeof(dtype)) && is_aligned(p2, sizeof(dtype))) {
-        if (s1 == sizeof(dtype) && s2 == sizeof(dtype)) {
-          for (i = 0; i < n; i++) {
-            ((dtype*)p2)[i] = m_im(((dtype*)p1)[i]);
-          }
-          return;
-        }
-        if (is_aligned_step(s1, sizeof(dtype)) && is_aligned_step(s2, sizeof(dtype))) {
-          //
-          for (i = 0; i < n; i++) {
-            *(dtype*)p2 = m_im(*(dtype*)p1);
-            p1 += s1;
-            p2 += s2;
-          }
-          return;
-          //
-        }
-      }
-      for (i = 0; i < n; i++) {
-        GET_DATA_STRIDE(p1, s1, dtype, x);
-        x = m_im(x);
-        SET_DATA_STRIDE(p2, s2, dtype, x);
-      }
-      //
-    }
-  }
-}
-
-/*
-  Unary im.
-  @overload im
-    @return [Numo::DComplex] im of self.
-*/
-static VALUE dcomplex_im(VALUE self) {
-  ndfunc_arg_in_t ain[1] = { { cT, 0 } };
-  ndfunc_arg_out_t aout[1] = { { cT, 0 } };
-  ndfunc_t ndf = { iter_dcomplex_im, FULL_LOOP, 1, 1, ain, aout };
-
-  return na_ndloop(&ndf, 1, self);
-}
-
-static void iter_dcomplex_real(na_loop_t* const lp) {
-  size_t i;
-  char *p1, *p2;
-  ssize_t s1, s2;
-  size_t *idx1, *idx2;
-  dtype x;
-  rtype y;
-  INIT_COUNTER(lp, i);
-  INIT_PTR_IDX(lp, 0, p1, s1, idx1);
-  INIT_PTR_IDX(lp, 1, p2, s2, idx2);
-  if (idx1) {
-    if (idx2) {
-      for (; i--;) {
-        GET_DATA_INDEX(p1, idx1, dtype, x);
-        y = m_real(x);
-        SET_DATA_INDEX(p2, idx2, rtype, y);
-      }
-    } else {
-      for (; i--;) {
-        GET_DATA_INDEX(p1, idx1, dtype, x);
-        y = m_real(x);
-        SET_DATA_STRIDE(p2, s2, rtype, y);
-      }
-    }
-  } else {
-    if (idx2) {
-      for (; i--;) {
-        GET_DATA_STRIDE(p1, s1, dtype, x);
-        y = m_real(x);
-        SET_DATA_INDEX(p2, idx2, rtype, y);
-      }
-    } else {
-      for (; i--;) {
-        GET_DATA_STRIDE(p1, s1, dtype, x);
-        y = m_real(x);
-        SET_DATA_STRIDE(p2, s2, rtype, y);
-      }
-    }
-  }
-}
-
-/*
-  real of self.
-  @overload real
-    @return [Numo::DFloat] real of self.
-*/
-static VALUE dcomplex_real(VALUE self) {
-  ndfunc_arg_in_t ain[1] = { { cT, 0 } };
-  ndfunc_arg_out_t aout[1] = { { cRT, 0 } };
-  ndfunc_t ndf = { iter_dcomplex_real, FULL_LOOP, 1, 1, ain, aout };
-
-  return na_ndloop(&ndf, 1, self);
-}
-
-static void iter_dcomplex_imag(na_loop_t* const lp) {
-  size_t i;
-  char *p1, *p2;
-  ssize_t s1, s2;
-  size_t *idx1, *idx2;
-  dtype x;
-  rtype y;
-  INIT_COUNTER(lp, i);
-  INIT_PTR_IDX(lp, 0, p1, s1, idx1);
-  INIT_PTR_IDX(lp, 1, p2, s2, idx2);
-  if (idx1) {
-    if (idx2) {
-      for (; i--;) {
-        GET_DATA_INDEX(p1, idx1, dtype, x);
-        y = m_imag(x);
-        SET_DATA_INDEX(p2, idx2, rtype, y);
-      }
-    } else {
-      for (; i--;) {
-        GET_DATA_INDEX(p1, idx1, dtype, x);
-        y = m_imag(x);
-        SET_DATA_STRIDE(p2, s2, rtype, y);
-      }
-    }
-  } else {
-    if (idx2) {
-      for (; i--;) {
-        GET_DATA_STRIDE(p1, s1, dtype, x);
-        y = m_imag(x);
-        SET_DATA_INDEX(p2, idx2, rtype, y);
-      }
-    } else {
-      for (; i--;) {
-        GET_DATA_STRIDE(p1, s1, dtype, x);
-        y = m_imag(x);
-        SET_DATA_STRIDE(p2, s2, rtype, y);
-      }
-    }
-  }
-}
-
-/*
-  imag of self.
-  @overload imag
-    @return [Numo::DFloat] imag of self.
-*/
-static VALUE dcomplex_imag(VALUE self) {
-  ndfunc_arg_in_t ain[1] = { { cT, 0 } };
-  ndfunc_arg_out_t aout[1] = { { cRT, 0 } };
-  ndfunc_t ndf = { iter_dcomplex_imag, FULL_LOOP, 1, 1, ain, aout };
-
-  return na_ndloop(&ndf, 1, self);
-}
-
-static void iter_dcomplex_arg(na_loop_t* const lp) {
-  size_t i;
-  char *p1, *p2;
-  ssize_t s1, s2;
-  size_t *idx1, *idx2;
-  dtype x;
-  rtype y;
-  INIT_COUNTER(lp, i);
-  INIT_PTR_IDX(lp, 0, p1, s1, idx1);
-  INIT_PTR_IDX(lp, 1, p2, s2, idx2);
   if (idx1) {
     if (idx2) {
-      for (; i--;) {
+      for (i = 0; i < n; i++) {
         GET_DATA_INDEX(p1, idx1, dtype, x);
-        y = m_arg(x);
-        SET_DATA_INDEX(p2, idx2, rtype, y);
+        x = m_im(x);
+        SET_DATA_INDEX(p2, idx2, dtype, x);
       }
     } else {
-      for (; i--;) {
+      for (i = 0; i < n; i++) {
         GET_DATA_INDEX(p1, idx1, dtype, x);
-        y = m_arg(x);
-        SET_DATA_STRIDE(p2, s2, rtype, y);
+        x = m_im(x);
+        SET_DATA_STRIDE(p2, s2, dtype, x);
       }
     }
   } else {
     if (idx2) {
-      for (; i--;) {
+      for (i = 0; i < n; i++) {
         GET_DATA_STRIDE(p1, s1, dtype, x);
-        y = m_arg(x);
-        SET_DATA_INDEX(p2, idx2, rtype, y);
+        x = m_im(x);
+        SET_DATA_INDEX(p2, idx2, dtype, x);
       }
     } else {
-      for (; i--;) {
+      //
+      if (is_aligned(p1, sizeof(dtype)) && is_aligned(p2, sizeof(dtype))) {
+        if (s1 == sizeof(dtype) && s2 == sizeof(dtype)) {
+          for (i = 0; i < n; i++) {
+            ((dtype*)p2)[i] = m_im(((dtype*)p1)[i]);
+          }
+          return;
+        }
+        if (is_aligned_step(s1, sizeof(dtype)) && is_aligned_step(s2, sizeof(dtype))) {
+          //
+          for (i = 0; i < n; i++) {
+            *(dtype*)p2 = m_im(*(dtype*)p1);
+            p1 += s1;
+            p2 += s2;
+          }
+          return;
+          //
+        }
+      }
+      for (i = 0; i < n; i++) {
         GET_DATA_STRIDE(p1, s1, dtype, x);
-        y = m_arg(x);
-        SET_DATA_STRIDE(p2, s2, rtype, y);
+        x = m_im(x);
+        SET_DATA_STRIDE(p2, s2, dtype, x);
       }
+      //
     }
   }
 }
 
 /*
-  arg of self.
-  @overload arg
-    @return [Numo::DFloat] arg of self.
+  Unary im.
+  @overload im
+    @return [Numo::DComplex] im of self.
 */
-static VALUE dcomplex_arg(VALUE self) {
+static VALUE dcomplex_im(VALUE self) {
   ndfunc_arg_in_t ain[1] = { { cT, 0 } };
-  ndfunc_arg_out_t aout[1] = { { cRT, 0 } };
-  ndfunc_t ndf = { iter_dcomplex_arg, FULL_LOOP, 1, 1, ain, aout };
+  ndfunc_arg_out_t aout[1] = { { cT, 0 } };
+  ndfunc_t ndf = { iter_dcomplex_im, FULL_LOOP, 1, 1, ain, aout };
 
   return na_ndloop(&ndf, 1, self);
 }
 
-static void iter_dcomplex_set_imag(na_loop_t* const lp) {
-  size_t i;
-  char *p1, *p2;
-  ssize_t s1, s2;
-  size_t *idx1, *idx2;
-  dtype x;
-  rtype y;
-  INIT_COUNTER(lp, i);
-  INIT_PTR_IDX(lp, 0, p1, s1, idx1);
-  INIT_PTR_IDX(lp, 1, p2, s2, idx2);
-  if (idx1) {
-    if (idx2) {
-      for (; i--;) {
-        GET_DATA(p1 + *idx1, dtype, x);
-        GET_DATA_INDEX(p2, idx2, rtype, y);
-        x = m_set_imag(x, y);
-        SET_DATA_INDEX(p1, idx1, dtype, x);
-      }
-    } else {
-      for (; i--;) {
-        GET_DATA(p1 + *idx1, dtype, x);
-        GET_DATA_STRIDE(p2, s2, rtype, y);
-        x = m_set_imag(x, y);
-        SET_DATA_INDEX(p1, idx1, dtype, x);
-      }
-    }
-  } else {
-    if (idx2) {
-      for (; i--;) {
-        GET_DATA(p1, dtype, x);
-        GET_DATA_INDEX(p2, idx2, rtype, y);
-        x = m_set_imag(x, y);
-        SET_DATA_STRIDE(p1, s1, dtype, x);
-      }
-    } else {
-      for (; i--;) {
-        GET_DATA(p1, dtype, x);
-        GET_DATA_STRIDE(p2, s2, rtype, y);
-        x = m_set_imag(x, y);
-        SET_DATA_STRIDE(p1, s1, dtype, x);
-      }
-    }
-  }
-}
-
-static VALUE dcomplex_set_imag(VALUE self, VALUE a1) {
-  ndfunc_arg_in_t ain[2] = { { OVERWRITE, 0 }, { cRT, 0 } };
-  ndfunc_t ndf = { iter_dcomplex_set_imag, FULL_LOOP, 2, 0, ain, 0 };
-
-  na_ndloop(&ndf, 2, self, a1);
-  return a1;
-}
-
-static void iter_dcomplex_set_real(na_loop_t* const lp) {
+static void iter_dcomplex_real(na_loop_t* const lp) {
   size_t i;
   char *p1, *p2;
   ssize_t s1, s2;
@@ -3133,560 +1938,259 @@ static void iter_dcomplex_set_real(na_loop_t* const lp) {
   if (idx1) {
     if (idx2) {
       for (; i--;) {
-        GET_DATA(p1 + *idx1, dtype, x);
-        GET_DATA_INDEX(p2, idx2, rtype, y);
-        x = m_set_real(x, y);
-        SET_DATA_INDEX(p1, idx1, dtype, x);
-      }
-    } else {
-      for (; i--;) {
-        GET_DATA(p1 + *idx1, dtype, x);
-        GET_DATA_STRIDE(p2, s2, rtype, y);
-        x = m_set_real(x, y);
-        SET_DATA_INDEX(p1, idx1, dtype, x);
-      }
-    }
-  } else {
-    if (idx2) {
-      for (; i--;) {
-        GET_DATA(p1, dtype, x);
-        GET_DATA_INDEX(p2, idx2, rtype, y);
-        x = m_set_real(x, y);
-        SET_DATA_STRIDE(p1, s1, dtype, x);
-      }
-    } else {
-      for (; i--;) {
-        GET_DATA(p1, dtype, x);
-        GET_DATA_STRIDE(p2, s2, rtype, y);
-        x = m_set_real(x, y);
-        SET_DATA_STRIDE(p1, s1, dtype, x);
-      }
-    }
-  }
-}
-
-static VALUE dcomplex_set_real(VALUE self, VALUE a1) {
-  ndfunc_arg_in_t ain[2] = { { OVERWRITE, 0 }, { cRT, 0 } };
-  ndfunc_t ndf = { iter_dcomplex_set_real, FULL_LOOP, 2, 0, ain, 0 };
-
-  na_ndloop(&ndf, 2, self, a1);
-  return a1;
-}
-
-static void iter_dcomplex_eq(na_loop_t* const lp) {
-  size_t i;
-  char *p1, *p2;
-  BIT_DIGIT* a3;
-  size_t p3;
-  ssize_t s1, s2, s3;
-  dtype x, y;
-  BIT_DIGIT b;
-  INIT_COUNTER(lp, i);
-  INIT_PTR(lp, 0, p1, s1);
-  INIT_PTR(lp, 1, p2, s2);
-  INIT_PTR_BIT(lp, 2, a3, p3, s3);
-  for (; i--;) {
-    GET_DATA_STRIDE(p1, s1, dtype, x);
-    GET_DATA_STRIDE(p2, s2, dtype, y);
-    b = (m_eq(x, y)) ? 1 : 0;
-    STORE_BIT(a3, p3, b);
-    p3 += s3;
-  }
-}
-
-static VALUE dcomplex_eq_self(VALUE self, VALUE other) {
-  ndfunc_arg_in_t ain[2] = { { cT, 0 }, { cT, 0 } };
-  ndfunc_arg_out_t aout[1] = { { numo_cBit, 0 } };
-  ndfunc_t ndf = { iter_dcomplex_eq, STRIDE_LOOP, 2, 1, ain, aout };
-
-  return na_ndloop(&ndf, 2, self, other);
-}
-
-/*
-  Comparison eq other.
-  @overload eq other
-    @param [Numo::NArray,Numeric] other
-    @return [Numo::Bit] result of self eq other.
-*/
-static VALUE dcomplex_eq(VALUE self, VALUE other) {
-
-  VALUE klass, v;
-  klass = na_upcast(rb_obj_class(self), rb_obj_class(other));
-  if (klass == cT) {
-    return dcomplex_eq_self(self, other);
-  } else {
-    v = rb_funcall(klass, id_cast, 1, self);
-    return rb_funcall(v, id_eq, 1, other);
-  }
-}
-
-static void iter_dcomplex_ne(na_loop_t* const lp) {
-  size_t i;
-  char *p1, *p2;
-  BIT_DIGIT* a3;
-  size_t p3;
-  ssize_t s1, s2, s3;
-  dtype x, y;
-  BIT_DIGIT b;
-  INIT_COUNTER(lp, i);
-  INIT_PTR(lp, 0, p1, s1);
-  INIT_PTR(lp, 1, p2, s2);
-  INIT_PTR_BIT(lp, 2, a3, p3, s3);
-  for (; i--;) {
-    GET_DATA_STRIDE(p1, s1, dtype, x);
-    GET_DATA_STRIDE(p2, s2, dtype, y);
-    b = (m_ne(x, y)) ? 1 : 0;
-    STORE_BIT(a3, p3, b);
-    p3 += s3;
-  }
-}
-
-static VALUE dcomplex_ne_self(VALUE self, VALUE other) {
-  ndfunc_arg_in_t ain[2] = { { cT, 0 }, { cT, 0 } };
-  ndfunc_arg_out_t aout[1] = { { numo_cBit, 0 } };
-  ndfunc_t ndf = { iter_dcomplex_ne, STRIDE_LOOP, 2, 1, ain, aout };
-
-  return na_ndloop(&ndf, 2, self, other);
-}
-
-/*
-  Comparison ne other.
-  @overload ne other
-    @param [Numo::NArray,Numeric] other
-    @return [Numo::Bit] result of self ne other.
-*/
-static VALUE dcomplex_ne(VALUE self, VALUE other) {
-
-  VALUE klass, v;
-  klass = na_upcast(rb_obj_class(self), rb_obj_class(other));
-  if (klass == cT) {
-    return dcomplex_ne_self(self, other);
-  } else {
-    v = rb_funcall(klass, id_cast, 1, self);
-    return rb_funcall(v, id_ne, 1, other);
-  }
-}
-
-static void iter_dcomplex_nearly_eq(na_loop_t* const lp) {
-  size_t i;
-  char *p1, *p2;
-  BIT_DIGIT* a3;
-  size_t p3;
-  ssize_t s1, s2, s3;
-  dtype x, y;
-  BIT_DIGIT b;
-  INIT_COUNTER(lp, i);
-  INIT_PTR(lp, 0, p1, s1);
-  INIT_PTR(lp, 1, p2, s2);
-  INIT_PTR_BIT(lp, 2, a3, p3, s3);
-  for (; i--;) {
-    GET_DATA_STRIDE(p1, s1, dtype, x);
-    GET_DATA_STRIDE(p2, s2, dtype, y);
-    b = (m_nearly_eq(x, y)) ? 1 : 0;
-    STORE_BIT(a3, p3, b);
-    p3 += s3;
-  }
-}
-
-static VALUE dcomplex_nearly_eq_self(VALUE self, VALUE other) {
-  ndfunc_arg_in_t ain[2] = { { cT, 0 }, { cT, 0 } };
-  ndfunc_arg_out_t aout[1] = { { numo_cBit, 0 } };
-  ndfunc_t ndf = { iter_dcomplex_nearly_eq, STRIDE_LOOP, 2, 1, ain, aout };
-
-  return na_ndloop(&ndf, 2, self, other);
-}
-
-/*
-  Comparison nearly_eq other.
-  @overload nearly_eq other
-    @param [Numo::NArray,Numeric] other
-    @return [Numo::Bit] result of self nearly_eq other.
-*/
-static VALUE dcomplex_nearly_eq(VALUE self, VALUE other) {
-
-  VALUE klass, v;
-  klass = na_upcast(rb_obj_class(self), rb_obj_class(other));
-  if (klass == cT) {
-    return dcomplex_nearly_eq_self(self, other);
-  } else {
-    v = rb_funcall(klass, id_cast, 1, self);
-    return rb_funcall(v, id_nearly_eq, 1, other);
-  }
-}
-
-static void iter_dcomplex_floor(na_loop_t* const lp) {
-  size_t i, n;
-  char *p1, *p2;
-  ssize_t s1, s2;
-  size_t *idx1, *idx2;
-  dtype x;
-
-  INIT_COUNTER(lp, n);
-  INIT_PTR_IDX(lp, 0, p1, s1, idx1);
-  INIT_PTR_IDX(lp, 1, p2, s2, idx2);
-
-  if (idx1) {
-    if (idx2) {
-      for (i = 0; i < n; i++) {
         GET_DATA_INDEX(p1, idx1, dtype, x);
-        x = m_floor(x);
-        SET_DATA_INDEX(p2, idx2, dtype, x);
+        y = m_real(x);
+        SET_DATA_INDEX(p2, idx2, rtype, y);
       }
     } else {
-      for (i = 0; i < n; i++) {
+      for (; i--;) {
         GET_DATA_INDEX(p1, idx1, dtype, x);
-        x = m_floor(x);
-        SET_DATA_STRIDE(p2, s2, dtype, x);
+        y = m_real(x);
+        SET_DATA_STRIDE(p2, s2, rtype, y);
       }
     }
   } else {
     if (idx2) {
-      for (i = 0; i < n; i++) {
+      for (; i--;) {
         GET_DATA_STRIDE(p1, s1, dtype, x);
-        x = m_floor(x);
-        SET_DATA_INDEX(p2, idx2, dtype, x);
+        y = m_real(x);
+        SET_DATA_INDEX(p2, idx2, rtype, y);
       }
     } else {
-      //
-      if (is_aligned(p1, sizeof(dtype)) && is_aligned(p2, sizeof(dtype))) {
-        if (s1 == sizeof(dtype) && s2 == sizeof(dtype)) {
-          for (i = 0; i < n; i++) {
-            ((dtype*)p2)[i] = m_floor(((dtype*)p1)[i]);
-          }
-          return;
-        }
-        if (is_aligned_step(s1, sizeof(dtype)) && is_aligned_step(s2, sizeof(dtype))) {
-          //
-          for (i = 0; i < n; i++) {
-            *(dtype*)p2 = m_floor(*(dtype*)p1);
-            p1 += s1;
-            p2 += s2;
-          }
-          return;
-          //
-        }
-      }
-      for (i = 0; i < n; i++) {
+      for (; i--;) {
         GET_DATA_STRIDE(p1, s1, dtype, x);
-        x = m_floor(x);
-        SET_DATA_STRIDE(p2, s2, dtype, x);
+        y = m_real(x);
+        SET_DATA_STRIDE(p2, s2, rtype, y);
       }
-      //
     }
   }
 }
 
 /*
-  Unary floor.
-  @overload floor
-    @return [Numo::DComplex] floor of self.
+  real of self.
+  @overload real
+    @return [Numo::DFloat] real of self.
 */
-static VALUE dcomplex_floor(VALUE self) {
+static VALUE dcomplex_real(VALUE self) {
   ndfunc_arg_in_t ain[1] = { { cT, 0 } };
-  ndfunc_arg_out_t aout[1] = { { cT, 0 } };
-  ndfunc_t ndf = { iter_dcomplex_floor, FULL_LOOP, 1, 1, ain, aout };
+  ndfunc_arg_out_t aout[1] = { { cRT, 0 } };
+  ndfunc_t ndf = { iter_dcomplex_real, FULL_LOOP, 1, 1, ain, aout };
 
   return na_ndloop(&ndf, 1, self);
 }
 
-static void iter_dcomplex_round(na_loop_t* const lp) {
-  size_t i, n;
+static void iter_dcomplex_imag(na_loop_t* const lp) {
+  size_t i;
   char *p1, *p2;
   ssize_t s1, s2;
   size_t *idx1, *idx2;
   dtype x;
-
-  INIT_COUNTER(lp, n);
+  rtype y;
+  INIT_COUNTER(lp, i);
   INIT_PTR_IDX(lp, 0, p1, s1, idx1);
   INIT_PTR_IDX(lp, 1, p2, s2, idx2);
-
   if (idx1) {
     if (idx2) {
-      for (i = 0; i < n; i++) {
+      for (; i--;) {
         GET_DATA_INDEX(p1, idx1, dtype, x);
-        x = m_round(x);
-        SET_DATA_INDEX(p2, idx2, dtype, x);
+        y = m_imag(x);
+        SET_DATA_INDEX(p2, idx2, rtype, y);
       }
     } else {
-      for (i = 0; i < n; i++) {
+      for (; i--;) {
         GET_DATA_INDEX(p1, idx1, dtype, x);
-        x = m_round(x);
-        SET_DATA_STRIDE(p2, s2, dtype, x);
+        y = m_imag(x);
+        SET_DATA_STRIDE(p2, s2, rtype, y);
       }
     }
   } else {
     if (idx2) {
-      for (i = 0; i < n; i++) {
+      for (; i--;) {
         GET_DATA_STRIDE(p1, s1, dtype, x);
-        x = m_round(x);
-        SET_DATA_INDEX(p2, idx2, dtype, x);
+        y = m_imag(x);
+        SET_DATA_INDEX(p2, idx2, rtype, y);
       }
     } else {
-      //
-      if (is_aligned(p1, sizeof(dtype)) && is_aligned(p2, sizeof(dtype))) {
-        if (s1 == sizeof(dtype) && s2 == sizeof(dtype)) {
-          for (i = 0; i < n; i++) {
-            ((dtype*)p2)[i] = m_round(((dtype*)p1)[i]);
-          }
-          return;
-        }
-        if (is_aligned_step(s1, sizeof(dtype)) && is_aligned_step(s2, sizeof(dtype))) {
-          //
-          for (i = 0; i < n; i++) {
-            *(dtype*)p2 = m_round(*(dtype*)p1);
-            p1 += s1;
-            p2 += s2;
-          }
-          return;
-          //
-        }
-      }
-      for (i = 0; i < n; i++) {
+      for (; i--;) {
         GET_DATA_STRIDE(p1, s1, dtype, x);
-        x = m_round(x);
-        SET_DATA_STRIDE(p2, s2, dtype, x);
+        y = m_imag(x);
+        SET_DATA_STRIDE(p2, s2, rtype, y);
       }
-      //
     }
   }
 }
 
 /*
-  Unary round.
-  @overload round
-    @return [Numo::DComplex] round of self.
+  imag of self.
+  @overload imag
+    @return [Numo::DFloat] imag of self.
 */
-static VALUE dcomplex_round(VALUE self) {
+static VALUE dcomplex_imag(VALUE self) {
   ndfunc_arg_in_t ain[1] = { { cT, 0 } };
-  ndfunc_arg_out_t aout[1] = { { cT, 0 } };
-  ndfunc_t ndf = { iter_dcomplex_round, FULL_LOOP, 1, 1, ain, aout };
+  ndfunc_arg_out_t aout[1] = { { cRT, 0 } };
+  ndfunc_t ndf = { iter_dcomplex_imag, FULL_LOOP, 1, 1, ain, aout };
 
   return na_ndloop(&ndf, 1, self);
 }
 
-static void iter_dcomplex_ceil(na_loop_t* const lp) {
-  size_t i, n;
+static void iter_dcomplex_arg(na_loop_t* const lp) {
+  size_t i;
   char *p1, *p2;
   ssize_t s1, s2;
   size_t *idx1, *idx2;
   dtype x;
-
-  INIT_COUNTER(lp, n);
+  rtype y;
+  INIT_COUNTER(lp, i);
   INIT_PTR_IDX(lp, 0, p1, s1, idx1);
   INIT_PTR_IDX(lp, 1, p2, s2, idx2);
-
   if (idx1) {
     if (idx2) {
-      for (i = 0; i < n; i++) {
+      for (; i--;) {
         GET_DATA_INDEX(p1, idx1, dtype, x);
-        x = m_ceil(x);
-        SET_DATA_INDEX(p2, idx2, dtype, x);
+        y = m_arg(x);
+        SET_DATA_INDEX(p2, idx2, rtype, y);
       }
     } else {
-      for (i = 0; i < n; i++) {
+      for (; i--;) {
         GET_DATA_INDEX(p1, idx1, dtype, x);
-        x = m_ceil(x);
-        SET_DATA_STRIDE(p2, s2, dtype, x);
+        y = m_arg(x);
+        SET_DATA_STRIDE(p2, s2, rtype, y);
       }
     }
   } else {
     if (idx2) {
-      for (i = 0; i < n; i++) {
+      for (; i--;) {
         GET_DATA_STRIDE(p1, s1, dtype, x);
-        x = m_ceil(x);
-        SET_DATA_INDEX(p2, idx2, dtype, x);
+        y = m_arg(x);
+        SET_DATA_INDEX(p2, idx2, rtype, y);
       }
     } else {
-      //
-      if (is_aligned(p1, sizeof(dtype)) && is_aligned(p2, sizeof(dtype))) {
-        if (s1 == sizeof(dtype) && s2 == sizeof(dtype)) {
-          for (i = 0; i < n; i++) {
-            ((dtype*)p2)[i] = m_ceil(((dtype*)p1)[i]);
-          }
-          return;
-        }
-        if (is_aligned_step(s1, sizeof(dtype)) && is_aligned_step(s2, sizeof(dtype))) {
-          //
-          for (i = 0; i < n; i++) {
-            *(dtype*)p2 = m_ceil(*(dtype*)p1);
-            p1 += s1;
-            p2 += s2;
-          }
-          return;
-          //
-        }
-      }
-      for (i = 0; i < n; i++) {
+      for (; i--;) {
         GET_DATA_STRIDE(p1, s1, dtype, x);
-        x = m_ceil(x);
-        SET_DATA_STRIDE(p2, s2, dtype, x);
+        y = m_arg(x);
+        SET_DATA_STRIDE(p2, s2, rtype, y);
       }
-      //
     }
   }
 }
 
 /*
-  Unary ceil.
-  @overload ceil
-    @return [Numo::DComplex] ceil of self.
+  arg of self.
+  @overload arg
+    @return [Numo::DFloat] arg of self.
 */
-static VALUE dcomplex_ceil(VALUE self) {
+static VALUE dcomplex_arg(VALUE self) {
   ndfunc_arg_in_t ain[1] = { { cT, 0 } };
-  ndfunc_arg_out_t aout[1] = { { cT, 0 } };
-  ndfunc_t ndf = { iter_dcomplex_ceil, FULL_LOOP, 1, 1, ain, aout };
+  ndfunc_arg_out_t aout[1] = { { cRT, 0 } };
+  ndfunc_t ndf = { iter_dcomplex_arg, FULL_LOOP, 1, 1, ain, aout };
 
   return na_ndloop(&ndf, 1, self);
 }
 
-static void iter_dcomplex_trunc(na_loop_t* const lp) {
-  size_t i, n;
+static void iter_dcomplex_set_imag(na_loop_t* const lp) {
+  size_t i;
   char *p1, *p2;
   ssize_t s1, s2;
   size_t *idx1, *idx2;
   dtype x;
-
-  INIT_COUNTER(lp, n);
+  rtype y;
+  INIT_COUNTER(lp, i);
   INIT_PTR_IDX(lp, 0, p1, s1, idx1);
   INIT_PTR_IDX(lp, 1, p2, s2, idx2);
-
   if (idx1) {
     if (idx2) {
-      for (i = 0; i < n; i++) {
-        GET_DATA_INDEX(p1, idx1, dtype, x);
-        x = m_trunc(x);
-        SET_DATA_INDEX(p2, idx2, dtype, x);
+      for (; i--;) {
+        GET_DATA(p1 + *idx1, dtype, x);
+        GET_DATA_INDEX(p2, idx2, rtype, y);
+        x = m_set_imag(x, y);
+        SET_DATA_INDEX(p1, idx1, dtype, x);
       }
     } else {
-      for (i = 0; i < n; i++) {
-        GET_DATA_INDEX(p1, idx1, dtype, x);
-        x = m_trunc(x);
-        SET_DATA_STRIDE(p2, s2, dtype, x);
+      for (; i--;) {
+        GET_DATA(p1 + *idx1, dtype, x);
+        GET_DATA_STRIDE(p2, s2, rtype, y);
+        x = m_set_imag(x, y);
+        SET_DATA_INDEX(p1, idx1, dtype, x);
       }
     }
   } else {
     if (idx2) {
-      for (i = 0; i < n; i++) {
-        GET_DATA_STRIDE(p1, s1, dtype, x);
-        x = m_trunc(x);
-        SET_DATA_INDEX(p2, idx2, dtype, x);
+      for (; i--;) {
+        GET_DATA(p1, dtype, x);
+        GET_DATA_INDEX(p2, idx2, rtype, y);
+        x = m_set_imag(x, y);
+        SET_DATA_STRIDE(p1, s1, dtype, x);
       }
     } else {
-      //
-      if (is_aligned(p1, sizeof(dtype)) && is_aligned(p2, sizeof(dtype))) {
-        if (s1 == sizeof(dtype) && s2 == sizeof(dtype)) {
-          for (i = 0; i < n; i++) {
-            ((dtype*)p2)[i] = m_trunc(((dtype*)p1)[i]);
-          }
-          return;
-        }
-        if (is_aligned_step(s1, sizeof(dtype)) && is_aligned_step(s2, sizeof(dtype))) {
-          //
-          for (i = 0; i < n; i++) {
-            *(dtype*)p2 = m_trunc(*(dtype*)p1);
-            p1 += s1;
-            p2 += s2;
-          }
-          return;
-          //
-        }
-      }
-      for (i = 0; i < n; i++) {
-        GET_DATA_STRIDE(p1, s1, dtype, x);
-        x = m_trunc(x);
-        SET_DATA_STRIDE(p2, s2, dtype, x);
+      for (; i--;) {
+        GET_DATA(p1, dtype, x);
+        GET_DATA_STRIDE(p2, s2, rtype, y);
+        x = m_set_imag(x, y);
+        SET_DATA_STRIDE(p1, s1, dtype, x);
       }
-      //
     }
   }
 }
 
-/*
-  Unary trunc.
-  @overload trunc
-    @return [Numo::DComplex] trunc of self.
-*/
-static VALUE dcomplex_trunc(VALUE self) {
-  ndfunc_arg_in_t ain[1] = { { cT, 0 } };
-  ndfunc_arg_out_t aout[1] = { { cT, 0 } };
-  ndfunc_t ndf = { iter_dcomplex_trunc, FULL_LOOP, 1, 1, ain, aout };
+static VALUE dcomplex_set_imag(VALUE self, VALUE a1) {
+  ndfunc_arg_in_t ain[2] = { { OVERWRITE, 0 }, { cRT, 0 } };
+  ndfunc_t ndf = { iter_dcomplex_set_imag, FULL_LOOP, 2, 0, ain, 0 };
 
-  return na_ndloop(&ndf, 1, self);
+  na_ndloop(&ndf, 2, self, a1);
+  return a1;
 }
 
-static void iter_dcomplex_rint(na_loop_t* const lp) {
-  size_t i, n;
+static void iter_dcomplex_set_real(na_loop_t* const lp) {
+  size_t i;
   char *p1, *p2;
   ssize_t s1, s2;
   size_t *idx1, *idx2;
   dtype x;
-
-  INIT_COUNTER(lp, n);
+  rtype y;
+  INIT_COUNTER(lp, i);
   INIT_PTR_IDX(lp, 0, p1, s1, idx1);
   INIT_PTR_IDX(lp, 1, p2, s2, idx2);
-
   if (idx1) {
     if (idx2) {
-      for (i = 0; i < n; i++) {
-        GET_DATA_INDEX(p1, idx1, dtype, x);
-        x = m_rint(x);
-        SET_DATA_INDEX(p2, idx2, dtype, x);
+      for (; i--;) {
+        GET_DATA(p1 + *idx1, dtype, x);
+        GET_DATA_INDEX(p2, idx2, rtype, y);
+        x = m_set_real(x, y);
+        SET_DATA_INDEX(p1, idx1, dtype, x);
       }
     } else {
-      for (i = 0; i < n; i++) {
-        GET_DATA_INDEX(p1, idx1, dtype, x);
-        x = m_rint(x);
-        SET_DATA_STRIDE(p2, s2, dtype, x);
+      for (; i--;) {
+        GET_DATA(p1 + *idx1, dtype, x);
+        GET_DATA_STRIDE(p2, s2, rtype, y);
+        x = m_set_real(x, y);
+        SET_DATA_INDEX(p1, idx1, dtype, x);
       }
     }
   } else {
     if (idx2) {
-      for (i = 0; i < n; i++) {
-        GET_DATA_STRIDE(p1, s1, dtype, x);
-        x = m_rint(x);
-        SET_DATA_INDEX(p2, idx2, dtype, x);
-      }
-    } else {
-      //
-      if (is_aligned(p1, sizeof(dtype)) && is_aligned(p2, sizeof(dtype))) {
-        if (s1 == sizeof(dtype) && s2 == sizeof(dtype)) {
-          for (i = 0; i < n; i++) {
-            ((dtype*)p2)[i] = m_rint(((dtype*)p1)[i]);
-          }
-          return;
-        }
-        if (is_aligned_step(s1, sizeof(dtype)) && is_aligned_step(s2, sizeof(dtype))) {
-          //
-          for (i = 0; i < n; i++) {
-            *(dtype*)p2 = m_rint(*(dtype*)p1);
-            p1 += s1;
-            p2 += s2;
-          }
-          return;
-          //
-        }
+      for (; i--;) {
+        GET_DATA(p1, dtype, x);
+        GET_DATA_INDEX(p2, idx2, rtype, y);
+        x = m_set_real(x, y);
+        SET_DATA_STRIDE(p1, s1, dtype, x);
       }
-      for (i = 0; i < n; i++) {
-        GET_DATA_STRIDE(p1, s1, dtype, x);
-        x = m_rint(x);
-        SET_DATA_STRIDE(p2, s2, dtype, x);
+    } else {
+      for (; i--;) {
+        GET_DATA(p1, dtype, x);
+        GET_DATA_STRIDE(p2, s2, rtype, y);
+        x = m_set_real(x, y);
+        SET_DATA_STRIDE(p1, s1, dtype, x);
       }
-      //
     }
   }
 }
 
-/*
-  Unary rint.
-  @overload rint
-    @return [Numo::DComplex] rint of self.
-*/
-static VALUE dcomplex_rint(VALUE self) {
-  ndfunc_arg_in_t ain[1] = { { cT, 0 } };
-  ndfunc_arg_out_t aout[1] = { { cT, 0 } };
-  ndfunc_t ndf = { iter_dcomplex_rint, FULL_LOOP, 1, 1, ain, aout };
+static VALUE dcomplex_set_real(VALUE self, VALUE a1) {
+  ndfunc_arg_in_t ain[2] = { { OVERWRITE, 0 }, { cRT, 0 } };
+  ndfunc_t ndf = { iter_dcomplex_set_real, FULL_LOOP, 2, 0, ain, 0 };
 
-  return na_ndloop(&ndf, 1, self);
+  na_ndloop(&ndf, 2, self, a1);
+  return a1;
 }
 
 #define check_intdivzero(y)                                                                    \
@@ -3807,216 +2311,6 @@ static VALUE dcomplex_copysign(VALUE self, VALUE other) {
   }
 }
 
-static void iter_dcomplex_isnan(na_loop_t* const lp) {
-  size_t i;
-  char* p1;
-  BIT_DIGIT* a2;
-  size_t p2;
-  ssize_t s1, s2;
-  size_t* idx1;
-  dtype x;
-  BIT_DIGIT b;
-  INIT_COUNTER(lp, i);
-  INIT_PTR_IDX(lp, 0, p1, s1, idx1);
-  INIT_PTR_BIT(lp, 1, a2, p2, s2);
-  if (idx1) {
-    for (; i--;) {
-      GET_DATA_INDEX(p1, idx1, dtype, x);
-      b = (m_isnan(x)) ? 1 : 0;
-      STORE_BIT(a2, p2, b);
-      p2 += s2;
-    }
-  } else {
-    for (; i--;) {
-      GET_DATA_STRIDE(p1, s1, dtype, x);
-      b = (m_isnan(x)) ? 1 : 0;
-      STORE_BIT(a2, p2, b);
-      p2 += s2;
-    }
-  }
-}
-
-/*
-  Condition of isnan.
-  @overload isnan
-    @return [Numo::Bit] Condition of isnan.
-*/
-static VALUE dcomplex_isnan(VALUE self) {
-  ndfunc_arg_in_t ain[1] = { { cT, 0 } };
-  ndfunc_arg_out_t aout[1] = { { numo_cBit, 0 } };
-  ndfunc_t ndf = { iter_dcomplex_isnan, FULL_LOOP, 1, 1, ain, aout };
-
-  return na_ndloop(&ndf, 1, self);
-}
-
-static void iter_dcomplex_isinf(na_loop_t* const lp) {
-  size_t i;
-  char* p1;
-  BIT_DIGIT* a2;
-  size_t p2;
-  ssize_t s1, s2;
-  size_t* idx1;
-  dtype x;
-  BIT_DIGIT b;
-  INIT_COUNTER(lp, i);
-  INIT_PTR_IDX(lp, 0, p1, s1, idx1);
-  INIT_PTR_BIT(lp, 1, a2, p2, s2);
-  if (idx1) {
-    for (; i--;) {
-      GET_DATA_INDEX(p1, idx1, dtype, x);
-      b = (m_isinf(x)) ? 1 : 0;
-      STORE_BIT(a2, p2, b);
-      p2 += s2;
-    }
-  } else {
-    for (; i--;) {
-      GET_DATA_STRIDE(p1, s1, dtype, x);
-      b = (m_isinf(x)) ? 1 : 0;
-      STORE_BIT(a2, p2, b);
-      p2 += s2;
-    }
-  }
-}
-
-/*
-  Condition of isinf.
-  @overload isinf
-    @return [Numo::Bit] Condition of isinf.
-*/
-static VALUE dcomplex_isinf(VALUE self) {
-  ndfunc_arg_in_t ain[1] = { { cT, 0 } };
-  ndfunc_arg_out_t aout[1] = { { numo_cBit, 0 } };
-  ndfunc_t ndf = { iter_dcomplex_isinf, FULL_LOOP, 1, 1, ain, aout };
-
-  return na_ndloop(&ndf, 1, self);
-}
-
-static void iter_dcomplex_isposinf(na_loop_t* const lp) {
-  size_t i;
-  char* p1;
-  BIT_DIGIT* a2;
-  size_t p2;
-  ssize_t s1, s2;
-  size_t* idx1;
-  dtype x;
-  BIT_DIGIT b;
-  INIT_COUNTER(lp, i);
-  INIT_PTR_IDX(lp, 0, p1, s1, idx1);
-  INIT_PTR_BIT(lp, 1, a2, p2, s2);
-  if (idx1) {
-    for (; i--;) {
-      GET_DATA_INDEX(p1, idx1, dtype, x);
-      b = (m_isposinf(x)) ? 1 : 0;
-      STORE_BIT(a2, p2, b);
-      p2 += s2;
-    }
-  } else {
-    for (; i--;) {
-      GET_DATA_STRIDE(p1, s1, dtype, x);
-      b = (m_isposinf(x)) ? 1 : 0;
-      STORE_BIT(a2, p2, b);
-      p2 += s2;
-    }
-  }
-}
-
-/*
-  Condition of isposinf.
-  @overload isposinf
-    @return [Numo::Bit] Condition of isposinf.
-*/
-static VALUE dcomplex_isposinf(VALUE self) {
-  ndfunc_arg_in_t ain[1] = { { cT, 0 } };
-  ndfunc_arg_out_t aout[1] = { { numo_cBit, 0 } };
-  ndfunc_t ndf = { iter_dcomplex_isposinf, FULL_LOOP, 1, 1, ain, aout };
-
-  return na_ndloop(&ndf, 1, self);
-}
-
-static void iter_dcomplex_isneginf(na_loop_t* const lp) {
-  size_t i;
-  char* p1;
-  BIT_DIGIT* a2;
-  size_t p2;
-  ssize_t s1, s2;
-  size_t* idx1;
-  dtype x;
-  BIT_DIGIT b;
-  INIT_COUNTER(lp, i);
-  INIT_PTR_IDX(lp, 0, p1, s1, idx1);
-  INIT_PTR_BIT(lp, 1, a2, p2, s2);
-  if (idx1) {
-    for (; i--;) {
-      GET_DATA_INDEX(p1, idx1, dtype, x);
-      b = (m_isneginf(x)) ? 1 : 0;
-      STORE_BIT(a2, p2, b);
-      p2 += s2;
-    }
-  } else {
-    for (; i--;) {
-      GET_DATA_STRIDE(p1, s1, dtype, x);
-      b = (m_isneginf(x)) ? 1 : 0;
-      STORE_BIT(a2, p2, b);
-      p2 += s2;
-    }
-  }
-}
-
-/*
-  Condition of isneginf.
-  @overload isneginf
-    @return [Numo::Bit] Condition of isneginf.
-*/
-static VALUE dcomplex_isneginf(VALUE self) {
-  ndfunc_arg_in_t ain[1] = { { cT, 0 } };
-  ndfunc_arg_out_t aout[1] = { { numo_cBit, 0 } };
-  ndfunc_t ndf = { iter_dcomplex_isneginf, FULL_LOOP, 1, 1, ain, aout };
-
-  return na_ndloop(&ndf, 1, self);
-}
-
-static void iter_dcomplex_isfinite(na_loop_t* const lp) {
-  size_t i;
-  char* p1;
-  BIT_DIGIT* a2;
-  size_t p2;
-  ssize_t s1, s2;
-  size_t* idx1;
-  dtype x;
-  BIT_DIGIT b;
-  INIT_COUNTER(lp, i);
-  INIT_PTR_IDX(lp, 0, p1, s1, idx1);
-  INIT_PTR_BIT(lp, 1, a2, p2, s2);
-  if (idx1) {
-    for (; i--;) {
-      GET_DATA_INDEX(p1, idx1, dtype, x);
-      b = (m_isfinite(x)) ? 1 : 0;
-      STORE_BIT(a2, p2, b);
-      p2 += s2;
-    }
-  } else {
-    for (; i--;) {
-      GET_DATA_STRIDE(p1, s1, dtype, x);
-      b = (m_isfinite(x)) ? 1 : 0;
-      STORE_BIT(a2, p2, b);
-      p2 += s2;
-    }
-  }
-}
-
-/*
-  Condition of isfinite.
-  @overload isfinite
-    @return [Numo::Bit] Condition of isfinite.
-*/
-static VALUE dcomplex_isfinite(VALUE self) {
-  ndfunc_arg_in_t ain[1] = { { cT, 0 } };
-  ndfunc_arg_out_t aout[1] = { { numo_cBit, 0 } };
-  ndfunc_t ndf = { iter_dcomplex_isfinite, FULL_LOOP, 1, 1, ain, aout };
-
-  return na_ndloop(&ndf, 1, self);
-}
-
 static void iter_dcomplex_kahan_sum(na_loop_t* const lp) {
   size_t n;
   char *p1, *p2;
@@ -4065,99 +2359,6 @@ static VALUE dcomplex_kahan_sum(int argc, VALUE* argv, VALUE self) {
   return dcomplex_extract(v);
 }
 
-typedef struct {
-  dtype mu;
-  rtype sigma;
-} randn_opt_t;
-
-static void iter_dcomplex_rand_norm(na_loop_t* const lp) {
-  size_t i;
-  char* p1;
-  ssize_t s1;
-  size_t* idx1;
-
-  dtype* a0;
-
-  dtype mu;
-  rtype sigma;
-  randn_opt_t* g;
-
-  INIT_COUNTER(lp, i);
-  INIT_PTR_IDX(lp, 0, p1, s1, idx1);
-  g = (randn_opt_t*)(lp->opt_ptr);
-  mu = g->mu;
-  sigma = g->sigma;
-
-  if (idx1) {
-
-    for (; i--;) {
-      a0 = (dtype*)(p1 + *idx1);
-      m_rand_norm(mu, sigma, a0);
-      idx1 += 1;
-    }
-
-  } else {
-
-    for (; i--;) {
-      a0 = (dtype*)(p1);
-      m_rand_norm(mu, sigma, a0);
-      p1 += s1;
-    }
-  }
-}
-
-/*
-  Generates random numbers from the normal distribution on self narray
-  using Box-Muller Transformation.
-  @overload rand_norm([mu,[sigma]])
-    @param [Numeric] mu  mean of normal distribution. (default=0)
-    @param [Numeric] sigma  standard deviation of normal distribution. (default=1)
-    @return [Numo::DComplex] self.
-  @example
-    Numo::DFloat.new(5,5).rand_norm
-    # => Numo::DFloat#shape=[5,5]
-    # [[-0.581255, -0.168354, 0.586895, -0.595142, -0.802802],
-    #  [-0.326106, 0.282922, 1.68427, 0.918499, -0.0485384],
-    #  [-0.464453, -0.992194, 0.413794, -0.60717, -0.699695],
-    #  [-1.64168, 0.48676, -0.875871, -1.43275, 0.812172],
-    #  [-0.209975, -0.103612, -0.878617, -1.42495, 1.0968]]
-
-    Numo::DFloat.new(5,5).rand_norm(10,0.1)
-    # => Numo::DFloat#shape=[5,5]
-    # [[9.9019, 9.90339, 10.0826, 9.98384, 9.72861],
-    #  [9.81507, 10.0272, 9.91445, 10.0568, 9.88923],
-    #  [10.0234, 9.97874, 9.96011, 9.9006, 9.99964],
-    #  [10.0186, 9.94598, 9.92236, 9.99811, 9.97003],
-    #  [9.79266, 9.95044, 9.95212, 9.93692, 10.2027]]
-
-    Numo::DComplex.new(3,3).rand_norm(5+5i)
-    # => Numo::DComplex#shape=[3,3]
-    # [[5.84303+4.40052i, 4.00984+6.08982i, 5.10979+5.13215i],
-    #  [4.26477+3.99655i, 4.90052+5.00763i, 4.46607+2.3444i],
-    #  [4.5528+7.11003i, 5.62117+6.69094i, 5.05443+5.35133i]]
-*/
-static VALUE dcomplex_rand_norm(int argc, VALUE* argv, VALUE self) {
-  int n;
-  randn_opt_t g;
-  VALUE v1 = Qnil, v2 = Qnil;
-  ndfunc_arg_in_t ain[1] = { { OVERWRITE, 0 } };
-  ndfunc_t ndf = { iter_dcomplex_rand_norm, FULL_LOOP, 1, 0, ain, 0 };
-
-  n = rb_scan_args(argc, argv, "02", &v1, &v2);
-  if (n == 0) {
-    g.mu = m_zero;
-  } else {
-    g.mu = m_num_to_data(v1);
-  }
-  if (n == 2) {
-    g.sigma = NUM2DBL(v2);
-  } else {
-    g.sigma = 1;
-  }
-  na_ndloop3(&ndf, &g, 1, self);
-  return self;
-}
-
 static void iter_dcomplex_poly(na_loop_t* const lp) {
   size_t i;
   dtype x, y, a;
@@ -4281,26 +2482,109 @@ void Init_numo_dcomplex(void) {
   rb_define_singleton_method(cT, "cast", dcomplex_s_cast, 1);
   rb_define_method(cT, "[]", dcomplex_aref, -1);
   rb_define_method(cT, "[]=", dcomplex_aset, -1);
+  /**
+   * return NArray with cast to the type of self.
+   * @overload coerce_cast(type)
+   *   @return [nil]
+   */
   rb_define_method(cT, "coerce_cast", dcomplex_coerce_cast, 1);
+  /**
+   * Convert self to Array.
+   * @overload to_a
+   *   @return [Array]
+   */
   rb_define_method(cT, "to_a", dcomplex_to_a, 0);
+  /**
+   * Fill elements with other.
+   * @overload fill other
+   *   @param [Numeric] other
+   *   @return [Numo::DComplex] self.
+   */
   rb_define_method(cT, "fill", dcomplex_fill, 1);
+  /**
+   * Format elements into strings.
+   * @overload format format
+   *   @param [String] format
+   *   @return [Numo::RObject] array of formatted strings.
+   */
   rb_define_method(cT, "format", dcomplex_format, -1);
+  /**
+   * Format elements into strings.
+   * @overload format_to_a format
+   *   @param [String] format
+   *   @return [Array] array of formatted strings.
+   */
   rb_define_method(cT, "format_to_a", dcomplex_format_to_a, -1);
+  /**
+   * Returns a string containing a human-readable representation of NArray.
+   * @overload inspect
+   *   @return [String]
+   */
   rb_define_method(cT, "inspect", dcomplex_inspect, 0);
   rb_define_method(cT, "each", dcomplex_each, 0);
   rb_define_method(cT, "map", dcomplex_map, 0);
   rb_define_method(cT, "each_with_index", dcomplex_each_with_index, 0);
   rb_define_method(cT, "map_with_index", dcomplex_map_with_index, 0);
   rb_define_method(cT, "abs", dcomplex_abs, 0);
+  /**
+   * Binary add.
+   * @overload + other
+   *   @param [Numo::NArray,Numeric] other
+   *   @return [Numo::NArray] self + other
+   */
   rb_define_method(cT, "+", dcomplex_add, 1);
+  /**
+   * Binary sub.
+   * @overload - other
+   *   @param [Numo::NArray,Numeric] other
+   *   @return [Numo::NArray] self - other
+   */
   rb_define_method(cT, "-", dcomplex_sub, 1);
+  /**
+   * Binary mul.
+   * @overload * other
+   *   @param [Numo::NArray,Numeric] other
+   *   @return [Numo::NArray] self * other
+   */
   rb_define_method(cT, "*", dcomplex_mul, 1);
+  /**
+   * Binary div.
+   * @overload / other
+   *   @param [Numo::NArray,Numeric] other
+   *   @return [Numo::NArray] self / other
+   */
   rb_define_method(cT, "/", dcomplex_div, 1);
+  /**
+   * Binary power.
+   * @overload ** other
+   *   @param [Numo::NArray,Numeric] other
+   *   @return [Numo::NArray] self to the other-th power.
+   */
   rb_define_method(cT, "**", dcomplex_pow, 1);
   rb_define_alias(cT, "pow", "**");
+  /**
+   * Unary minus.
+   * @overload -@
+   *   @return [Numo::DComplex] minus of self.
+   */
   rb_define_method(cT, "-@", dcomplex_minus, 0);
+  /**
+   * Unary reciprocal.
+   * @overload reciprocal
+   *   @return [Numo::DComplex] reciprocal of self.
+   */
   rb_define_method(cT, "reciprocal", dcomplex_reciprocal, 0);
+  /**
+   * Unary sign.
+   * @overload sign
+   *   @return [Numo::DComplex] sign of self.
+   */
   rb_define_method(cT, "sign", dcomplex_sign, 0);
+  /**
+   * Unary square.
+   * @overload square
+   *   @return [Numo::DComplex] square of self.
+   */
   rb_define_method(cT, "square", dcomplex_square, 0);
   rb_define_method(cT, "conj", dcomplex_conj, 0);
   rb_define_method(cT, "im", dcomplex_im, 0);
@@ -4313,20 +2597,88 @@ void Init_numo_dcomplex(void) {
   rb_define_alias(cT, "imag=", "set_imag");
   rb_define_alias(cT, "real=", "set_real");
   rb_define_alias(cT, "conjugate", "conj");
+  /**
+   * Comparison eq other.
+   * @overload eq other
+   *   @param [Numo::NArray,Numeric] other
+   *   @return [Numo::Bit] result of self eq other.
+   */
   rb_define_method(cT, "eq", dcomplex_eq, 1);
+  /**
+   * Comparison ne other.
+   * @overload ne other
+   *   @param [Numo::NArray,Numeric] other
+   *   @return [Numo::Bit] result of self ne other.
+   */
   rb_define_method(cT, "ne", dcomplex_ne, 1);
+  /**
+   * Comparison nearly_eq other.
+   * @overload nearly_eq other
+   *   @param [Numo::NArray,Numeric] other
+   *   @return [Numo::Bit] result of self nearly_eq other.
+   */
   rb_define_method(cT, "nearly_eq", dcomplex_nearly_eq, 1);
   rb_define_alias(cT, "close_to", "nearly_eq");
+  /**
+   * Unary floor.
+   * @overload floor
+   *   @return [Numo::DComplex] floor of self.
+   */
   rb_define_method(cT, "floor", dcomplex_floor, 0);
+  /**
+   * Unary round.
+   * @overload round
+   *   @return [Numo::DComplex] round of self.
+   */
   rb_define_method(cT, "round", dcomplex_round, 0);
+  /**
+   * Unary ceil.
+   * @overload ceil
+   *   @return [Numo::DComplex] ceil of self.
+   */
   rb_define_method(cT, "ceil", dcomplex_ceil, 0);
+  /**
+   * Unary trunc.
+   * @overload trunc
+   *   @return [Numo::DComplex] trunc of self.
+   */
   rb_define_method(cT, "trunc", dcomplex_trunc, 0);
+  /**
+   * Unary rint.
+   * @overload rint
+   *   @return [Numo::DComplex] rint of self.
+   */
   rb_define_method(cT, "rint", dcomplex_rint, 0);
   rb_define_method(cT, "copysign", dcomplex_copysign, 1);
+  /**
+   * Condition of isnan.
+   * @overload isnan
+   *   @return [Numo::Bit] Condition of isnan.
+   */
   rb_define_method(cT, "isnan", dcomplex_isnan, 0);
+  /**
+   * Condition of isinf.
+   * @overload isinf
+   *   @return [Numo::Bit] Condition of isinf.
+   */
   rb_define_method(cT, "isinf", dcomplex_isinf, 0);
+  /**
+   * Condition of isposinf.
+   * @overload isposinf
+   *   @return [Numo::Bit] Condition of isposinf.
+   */
   rb_define_method(cT, "isposinf", dcomplex_isposinf, 0);
+  /**
+   * Condition of isneginf.
+   * @overload isneginf
+   *   @return [Numo::Bit] Condition of isneginf.
+   */
   rb_define_method(cT, "isneginf", dcomplex_isneginf, 0);
+  /**
+   * Condition of isfinite.
+   * @overload isfinite
+   *   @return [Numo::Bit] Condition of isfinite.
+   */
   rb_define_method(cT, "isfinite", dcomplex_isfinite, 0);
   /**
    * sum of self.
@@ -4496,6 +2848,36 @@ void Init_numo_dcomplex(void) {
    *   # [4, 3, 3, 2, 4, 2]
    */
   rb_define_method(cT, "rand", dcomplex_rand, -1);
+  /**
+   * Generates random numbers from the normal distribution on self narray
+   * using Box-Muller Transformation.
+   * @overload rand_norm([mu,[sigma]])
+   *   @param [Numeric] mu  mean of normal distribution. (default=0)
+   *   @param [Numeric] sigma  standard deviation of normal distribution. (default=1)
+   *   @return [Numo::DComplex] self.
+   * @example
+   *   Numo::DFloat.new(5,5).rand_norm
+   *   # => Numo::DFloat#shape=[5,5]
+   *   # [[-0.581255, -0.168354, 0.586895, -0.595142, -0.802802],
+   *   #  [-0.326106, 0.282922, 1.68427, 0.918499, -0.0485384],
+   *   #  [-0.464453, -0.992194, 0.413794, -0.60717, -0.699695],
+   *   #  [-1.64168, 0.48676, -0.875871, -1.43275, 0.812172],
+   *   #  [-0.209975, -0.103612, -0.878617, -1.42495, 1.0968]]
+   *
+   *   Numo::DFloat.new(5,5).rand_norm(10,0.1)
+   *   # => Numo::DFloat#shape=[5,5]
+   *   # [[9.9019, 9.90339, 10.0826, 9.98384, 9.72861],
+   *   #  [9.81507, 10.0272, 9.91445, 10.0568, 9.88923],
+   *   #  [10.0234, 9.97874, 9.96011, 9.9006, 9.99964],
+   *   #  [10.0186, 9.94598, 9.92236, 9.99811, 9.97003],
+   *   #  [9.79266, 9.95044, 9.95212, 9.93692, 10.2027]]
+   *
+   *   Numo::DComplex.new(3,3).rand_norm(5+5i)
+   *   # => Numo::DComplex#shape=[3,3]
+   *   # [[5.84303+4.40052i, 4.00984+6.08982i, 5.10979+5.13215i],
+   *   #  [4.26477+3.99655i, 4.90052+5.00763i, 4.46607+2.3444i],
+   *   #  [4.5528+7.11003i, 5.62117+6.69094i, 5.05443+5.35133i]]
+   */
   rb_define_method(cT, "rand_norm", dcomplex_rand_norm, -1);
   rb_define_method(cT, "poly", dcomplex_poly, -2);
   rb_define_singleton_method(cT, "[]", dcomplex_s_cast, -2);