numo-narray-alt 0.9.10 → 0.9.12

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

@@ -38,10 +38,42 @@ 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/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"
 #include "mh/var.h"
 #include "mh/stddev.h"
 #include "mh/rms.h"
+#include "mh/cumsum.h"
+#include "mh/cumprod.h"
+#include "mh/mulsum.h"
+#include "mh/seq.h"
+#include "mh/logseq.h"
+#include "mh/eye.h"
+#include "mh/rand.h"
 #include "mh/math/sqrt.h"
 #include "mh/math/cbrt.h"
 #include "mh/math/log.h"
@@ -64,10 +96,42 @@ 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_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)
 DEF_NARRAY_FLT_VAR_METHOD_FUNC(dcomplex, numo_cDComplex, double, numo_cDFloat)
 DEF_NARRAY_FLT_STDDEV_METHOD_FUNC(dcomplex, numo_cDComplex, double, numo_cDFloat)
 DEF_NARRAY_FLT_RMS_METHOD_FUNC(dcomplex, numo_cDComplex, double, numo_cDFloat)
+DEF_NARRAY_FLT_CUMSUM_METHOD_FUNC(dcomplex, numo_cDComplex)
+DEF_NARRAY_FLT_CUMPROD_METHOD_FUNC(dcomplex, numo_cDComplex)
+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_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)
@@ -1373,204 +1437,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;
@@ -1897,568 +1763,246 @@ 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;
+static void iter_dcomplex_pow(na_loop_t* const lp) {
+  size_t i;
   char *p1, *p2, *p3;
   ssize_t s1, s2, s3;
-
-  INIT_COUNTER(lp, n);
+  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);
-
-  //
-  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_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]);
-        }
-      }
-      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_add(((dtype*)p1)[i], *(dtype*)p2);
-            }
-          } else {
-            for (; i < n; i++) {
-              ((dtype*)p3)[i] = m_add(((dtype*)p1)[i], *(dtype*)p2);
-            }
-          }
-        } else {
-          for (i = 0; i < n; i++) {
-            *(dtype*)p3 = m_add(*(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_add(*(dtype*)p1, *(dtype*)p2);
-            p1 += s1;
-            p2 += s2;
-          }
-        } else {
-          for (i = 0; i < n; i++) {
-            check_intdivzero(*(dtype*)p2);
-            *(dtype*)p3 = m_add(*(dtype*)p1, *(dtype*)p2);
-            p1 += s1;
-            p2 += s2;
-            p3 += s3;
-          }
-        }
-      }
-
-      return;
-      //
-    }
-  }
-  for (i = 0; i < n; i++) {
-    dtype x, y, z;
+  for (; i--;) {
     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);
+    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);
   }
-  //
 }
-#undef check_intdivzero
 
-static VALUE dcomplex_add_self(VALUE self, VALUE other) {
+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_add, STRIDE_LOOP, 2, 1, ain, aout };
+  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 };
 
-  return na_ndloop(&ndf, 2, self, other);
+  // 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 add.
-  @overload + other
+  Binary power.
+  @overload ** other
     @param [Numo::NArray,Numeric] other
-    @return [Numo::NArray] self + other
+    @return [Numo::NArray] self to the other-th power.
 */
-static VALUE dcomplex_add(VALUE self, VALUE other) {
+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_add_self(self, other);
+    return dcomplex_pow_self(self, other);
   } else {
     v = rb_funcall(klass, id_cast, 1, self);
-    return rb_funcall(v, '+', 1, other);
+    return rb_funcall(v, id_pow, 1, other);
   }
 }
 
-#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_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(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 (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);
+      }
     }
-
-    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_minus(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_sub(((dtype*)p1)[i], *(dtype*)p2);
-            }
-          } else {
-            for (; i < n; i++) {
-              ((dtype*)p3)[i] = m_sub(((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_sub(*(dtype*)p1, *(dtype*)p2);
-            p1 += s1;
-            p3 += s3;
+            ((dtype*)p2)[i] = m_minus(((dtype*)p1)[i]);
           }
+          return;
         }
-      } 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 {
+        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_sub(*(dtype*)p1, *(dtype*)p2);
+            *(dtype*)p2 = m_minus(*(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_minus(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_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
+  Unary minus.
+  @overload -@
+    @return [Numo::DComplex] minus of self.
 */
-static VALUE dcomplex_sub(VALUE self, VALUE other) {
-
-  VALUE klass, v;
+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 };
 
-  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);
-  }
+  return na_ndloop(&ndf, 1, self);
 }
 
-#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;
+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(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_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]);
-        }
+  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);
       }
-      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_reciprocal(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_mul(((dtype*)p1)[i], *(dtype*)p2);
-            }
-          } else {
-            for (; i < n; i++) {
-              ((dtype*)p3)[i] = m_mul(((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_mul(*(dtype*)p1, *(dtype*)p2);
-            p1 += s1;
-            p3 += s3;
+            ((dtype*)p2)[i] = m_reciprocal(((dtype*)p1)[i]);
           }
+          return;
         }
-      } 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 {
+        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_mul(*(dtype*)p1, *(dtype*)p2);
+            *(dtype*)p2 = m_reciprocal(*(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_reciprocal(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_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
+  Unary reciprocal.
+  @overload reciprocal
+    @return [Numo::DComplex] reciprocal of self.
 */
-static VALUE dcomplex_mul(VALUE self, VALUE other) {
-
-  VALUE klass, v;
+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 };
 
-  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);
-  }
+  return na_ndloop(&ndf, 1, self);
 }
 
-#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;
+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(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);
+  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);
+        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_minus(x);
+        x = m_sign(x);
         SET_DATA_STRIDE(p2, s2, dtype, x);
       }
     }
@@ -2466,7 +2010,7 @@ static void iter_dcomplex_minus(na_loop_t* const lp) {
     if (idx2) {
       for (i = 0; i < n; i++) {
         GET_DATA_STRIDE(p1, s1, dtype, x);
-        x = m_minus(x);
+        x = m_sign(x);
         SET_DATA_INDEX(p2, idx2, dtype, x);
       }
     } else {
@@ -2474,14 +2018,14 @@ static void iter_dcomplex_minus(na_loop_t* const lp) {
       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]);
+            ((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_minus(*(dtype*)p1);
+            *(dtype*)p2 = m_sign(*(dtype*)p1);
             p1 += s1;
             p2 += s2;
           }
@@ -2491,7 +2035,7 @@ static void iter_dcomplex_minus(na_loop_t* const lp) {
       }
       for (i = 0; i < n; i++) {
         GET_DATA_STRIDE(p1, s1, dtype, x);
-        x = m_minus(x);
+        x = m_sign(x);
         SET_DATA_STRIDE(p2, s2, dtype, x);
       }
       //
@@ -2500,19 +2044,19 @@ static void iter_dcomplex_minus(na_loop_t* const lp) {
 }
 
 /*
-  Unary minus.
-  @overload -@
-    @return [Numo::DComplex] minus of self.
+  Unary sign.
+  @overload sign
+    @return [Numo::DComplex] sign of self.
 */
-static VALUE dcomplex_minus(VALUE 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_minus, FULL_LOOP, 1, 1, ain, aout };
+  ndfunc_t ndf = { iter_dcomplex_sign, FULL_LOOP, 1, 1, ain, aout };
 
   return na_ndloop(&ndf, 1, self);
 }
 
-static void iter_dcomplex_reciprocal(na_loop_t* const lp) {
+static void iter_dcomplex_square(na_loop_t* const lp) {
   size_t i, n;
   char *p1, *p2;
   ssize_t s1, s2;
@@ -2527,13 +2071,13 @@ static void iter_dcomplex_reciprocal(na_loop_t* const lp) {
     if (idx2) {
       for (i = 0; i < n; i++) {
         GET_DATA_INDEX(p1, idx1, dtype, x);
-        x = m_reciprocal(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_reciprocal(x);
+        x = m_square(x);
         SET_DATA_STRIDE(p2, s2, dtype, x);
       }
     }
@@ -2541,7 +2085,7 @@ static void iter_dcomplex_reciprocal(na_loop_t* const lp) {
     if (idx2) {
       for (i = 0; i < n; i++) {
         GET_DATA_STRIDE(p1, s1, dtype, x);
-        x = m_reciprocal(x);
+        x = m_square(x);
         SET_DATA_INDEX(p2, idx2, dtype, x);
       }
     } else {
@@ -2549,14 +2093,14 @@ static void iter_dcomplex_reciprocal(na_loop_t* const lp) {
       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]);
+            ((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_reciprocal(*(dtype*)p1);
+            *(dtype*)p2 = m_square(*(dtype*)p1);
             p1 += s1;
             p2 += s2;
           }
@@ -2566,7 +2110,7 @@ static void iter_dcomplex_reciprocal(na_loop_t* const lp) {
       }
       for (i = 0; i < n; i++) {
         GET_DATA_STRIDE(p1, s1, dtype, x);
-        x = m_reciprocal(x);
+        x = m_square(x);
         SET_DATA_STRIDE(p2, s2, dtype, x);
       }
       //
@@ -2575,19 +2119,19 @@ static void iter_dcomplex_reciprocal(na_loop_t* const lp) {
 }
 
 /*
-  Unary reciprocal.
-  @overload reciprocal
-    @return [Numo::DComplex] reciprocal of self.
+  Unary square.
+  @overload square
+    @return [Numo::DComplex] square of self.
 */
-static VALUE dcomplex_reciprocal(VALUE 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_reciprocal, FULL_LOOP, 1, 1, ain, aout };
+  ndfunc_t ndf = { iter_dcomplex_square, FULL_LOOP, 1, 1, ain, aout };
 
   return na_ndloop(&ndf, 1, self);
 }
 
-static void iter_dcomplex_sign(na_loop_t* const lp) {
+static void iter_dcomplex_conj(na_loop_t* const lp) {
   size_t i, n;
   char *p1, *p2;
   ssize_t s1, s2;
@@ -2602,13 +2146,13 @@ static void iter_dcomplex_sign(na_loop_t* const lp) {
     if (idx2) {
       for (i = 0; i < n; i++) {
         GET_DATA_INDEX(p1, idx1, dtype, x);
-        x = m_sign(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_sign(x);
+        x = m_conj(x);
         SET_DATA_STRIDE(p2, s2, dtype, x);
       }
     }
@@ -2616,7 +2160,7 @@ static void iter_dcomplex_sign(na_loop_t* const lp) {
     if (idx2) {
       for (i = 0; i < n; i++) {
         GET_DATA_STRIDE(p1, s1, dtype, x);
-        x = m_sign(x);
+        x = m_conj(x);
         SET_DATA_INDEX(p2, idx2, dtype, x);
       }
     } else {
@@ -2624,14 +2168,14 @@ static void iter_dcomplex_sign(na_loop_t* const lp) {
       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]);
+            ((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_sign(*(dtype*)p1);
+            *(dtype*)p2 = m_conj(*(dtype*)p1);
             p1 += s1;
             p2 += s2;
           }
@@ -2641,7 +2185,7 @@ static void iter_dcomplex_sign(na_loop_t* const lp) {
       }
       for (i = 0; i < n; i++) {
         GET_DATA_STRIDE(p1, s1, dtype, x);
-        x = m_sign(x);
+        x = m_conj(x);
         SET_DATA_STRIDE(p2, s2, dtype, x);
       }
       //
@@ -2650,19 +2194,19 @@ static void iter_dcomplex_sign(na_loop_t* const lp) {
 }
 
 /*
-  Unary sign.
-  @overload sign
-    @return [Numo::DComplex] sign of self.
+  Unary conj.
+  @overload conj
+    @return [Numo::DComplex] conj of self.
 */
-static VALUE dcomplex_sign(VALUE 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_sign, FULL_LOOP, 1, 1, ain, aout };
+  ndfunc_t ndf = { iter_dcomplex_conj, FULL_LOOP, 1, 1, ain, aout };
 
   return na_ndloop(&ndf, 1, self);
 }
 
-static void iter_dcomplex_square(na_loop_t* const lp) {
+static void iter_dcomplex_im(na_loop_t* const lp) {
   size_t i, n;
   char *p1, *p2;
   ssize_t s1, s2;
@@ -2677,13 +2221,13 @@ static void iter_dcomplex_square(na_loop_t* const lp) {
     if (idx2) {
       for (i = 0; i < n; i++) {
         GET_DATA_INDEX(p1, idx1, dtype, x);
-        x = m_square(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_square(x);
+        x = m_im(x);
         SET_DATA_STRIDE(p2, s2, dtype, x);
       }
     }
@@ -2691,7 +2235,7 @@ static void iter_dcomplex_square(na_loop_t* const lp) {
     if (idx2) {
       for (i = 0; i < n; i++) {
         GET_DATA_STRIDE(p1, s1, dtype, x);
-        x = m_square(x);
+        x = m_im(x);
         SET_DATA_INDEX(p2, idx2, dtype, x);
       }
     } else {
@@ -2699,14 +2243,14 @@ static void iter_dcomplex_square(na_loop_t* const lp) {
       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]);
+            ((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_square(*(dtype*)p1);
+            *(dtype*)p2 = m_im(*(dtype*)p1);
             p1 += s1;
             p2 += s2;
           }
@@ -2716,7 +2260,7 @@ static void iter_dcomplex_square(na_loop_t* const lp) {
       }
       for (i = 0; i < n; i++) {
         GET_DATA_STRIDE(p1, s1, dtype, x);
-        x = m_square(x);
+        x = m_im(x);
         SET_DATA_STRIDE(p2, s2, dtype, x);
       }
       //
@@ -2725,181 +2269,31 @@ static void iter_dcomplex_square(na_loop_t* const lp) {
 }
 
 /*
-  Unary square.
-  @overload square
-    @return [Numo::DComplex] square of self.
+  Unary im.
+  @overload im
+    @return [Numo::DComplex] im of self.
 */
-static VALUE dcomplex_square(VALUE 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_square, FULL_LOOP, 1, 1, ain, aout };
+  ndfunc_t ndf = { iter_dcomplex_im, 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;
+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;
-
-  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_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--;) {
+      for (; i--;) {
         GET_DATA_INDEX(p1, idx1, dtype, x);
         y = m_real(x);
         SET_DATA_INDEX(p2, idx2, rtype, y);
@@ -3155,1563 +2549,170 @@ static VALUE dcomplex_set_real(VALUE self, VALUE 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);
-  }
-}
+#define check_intdivzero(y)                                                                    \
+  {}
 
-static void iter_dcomplex_ne(na_loop_t* const lp) {
-  size_t i;
-  char *p1, *p2;
-  BIT_DIGIT* a3;
-  size_t p3;
+static void iter_dcomplex_copysign(na_loop_t* const lp) {
+  size_t i = 0;
+  size_t n;
+  char *p1, *p2, *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_COUNTER(lp, n);
   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;
-  }
-}
+  INIT_PTR(lp, 2, 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 };
+  //
+  if (is_aligned(p1, sizeof(dtype)) && is_aligned(p2, sizeof(dtype)) &&
+      is_aligned(p3, sizeof(dtype))) {
 
-  return na_ndloop(&ndf, 2, self, other);
-}
+    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_copysign(((dtype*)p1)[i], ((dtype*)p2)[i]);
+        }
+      } else {
+        for (; i < n; i++) {
+          check_intdivzero(((dtype*)p2)[i]);
+          ((dtype*)p3)[i] = m_copysign(((dtype*)p1)[i], ((dtype*)p2)[i]);
+        }
+      }
+      return;
+    }
 
-/*
-  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) {
+    if (is_aligned_step(s1, sizeof(dtype)) && is_aligned_step(s2, sizeof(dtype)) &&
+        is_aligned_step(s3, sizeof(dtype))) {
+      //
 
-  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);
-      }
-    } else {
-      for (i = 0; i < n; i++) {
-        GET_DATA_INDEX(p1, idx1, dtype, x);
-        x = m_floor(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_floor(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_floor(((dtype*)p1)[i]);
+      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_copysign(((dtype*)p1)[i], *(dtype*)p2);
+            }
+          } else {
+            for (; i < n; i++) {
+              ((dtype*)p3)[i] = m_copysign(((dtype*)p1)[i], *(dtype*)p2);
+            }
           }
-          return;
-        }
-        if (is_aligned_step(s1, sizeof(dtype)) && is_aligned_step(s2, sizeof(dtype))) {
-          //
+        } else {
           for (i = 0; i < n; i++) {
-            *(dtype*)p2 = m_floor(*(dtype*)p1);
+            *(dtype*)p3 = m_copysign(*(dtype*)p1, *(dtype*)p2);
             p1 += s1;
-            p2 += s2;
-          }
-          return;
-          //
-        }
-      }
-      for (i = 0; i < n; i++) {
-        GET_DATA_STRIDE(p1, s1, dtype, x);
-        x = m_floor(x);
-        SET_DATA_STRIDE(p2, s2, dtype, x);
-      }
-      //
-    }
-  }
-}
-
-/*
-  Unary floor.
-  @overload floor
-    @return [Numo::DComplex] floor of self.
-*/
-static VALUE dcomplex_floor(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 };
-
-  return na_ndloop(&ndf, 1, self);
-}
-
-static void iter_dcomplex_round(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_round(x);
-        SET_DATA_INDEX(p2, idx2, dtype, x);
-      }
-    } else {
-      for (i = 0; i < n; i++) {
-        GET_DATA_INDEX(p1, idx1, dtype, x);
-        x = m_round(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_round(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_round(((dtype*)p1)[i]);
+            p3 += s3;
           }
-          return;
         }
-        if (is_aligned_step(s1, sizeof(dtype)) && is_aligned_step(s2, sizeof(dtype))) {
-          //
+      } else {
+        if (p1 == p3) { // inplace case
           for (i = 0; i < n; i++) {
-            *(dtype*)p2 = m_round(*(dtype*)p1);
+            check_intdivzero(*(dtype*)p2);
+            *(dtype*)p1 = m_copysign(*(dtype*)p1, *(dtype*)p2);
             p1 += s1;
             p2 += s2;
           }
-          return;
-          //
-        }
-      }
-      for (i = 0; i < n; i++) {
-        GET_DATA_STRIDE(p1, s1, dtype, x);
-        x = m_round(x);
-        SET_DATA_STRIDE(p2, s2, dtype, x);
-      }
-      //
-    }
-  }
-}
-
-/*
-  Unary round.
-  @overload round
-    @return [Numo::DComplex] round of self.
-*/
-static VALUE dcomplex_round(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 };
-
-  return na_ndloop(&ndf, 1, self);
-}
-
-static void iter_dcomplex_ceil(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_ceil(x);
-        SET_DATA_INDEX(p2, idx2, dtype, x);
-      }
-    } else {
-      for (i = 0; i < n; i++) {
-        GET_DATA_INDEX(p1, idx1, dtype, x);
-        x = m_ceil(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_ceil(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_ceil(((dtype*)p1)[i]);
-          }
-          return;
-        }
-        if (is_aligned_step(s1, sizeof(dtype)) && is_aligned_step(s2, sizeof(dtype))) {
-          //
+        } else {
           for (i = 0; i < n; i++) {
-            *(dtype*)p2 = m_ceil(*(dtype*)p1);
+            check_intdivzero(*(dtype*)p2);
+            *(dtype*)p3 = m_copysign(*(dtype*)p1, *(dtype*)p2);
             p1 += s1;
             p2 += s2;
+            p3 += s3;
           }
-          return;
-          //
         }
       }
-      for (i = 0; i < n; i++) {
-        GET_DATA_STRIDE(p1, s1, dtype, x);
-        x = m_ceil(x);
-        SET_DATA_STRIDE(p2, s2, dtype, x);
-      }
-      //
-    }
-  }
-}
-
-/*
-  Unary ceil.
-  @overload ceil
-    @return [Numo::DComplex] ceil of self.
-*/
-static VALUE dcomplex_ceil(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 };
-
-  return na_ndloop(&ndf, 1, self);
-}
-
-static void iter_dcomplex_trunc(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_trunc(x);
-        SET_DATA_INDEX(p2, idx2, 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);
-      }
-    }
-  } 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);
-      }
-    } 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);
-      }
-      //
-    }
-  }
-}
-
-/*
-  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 };
-
-  return na_ndloop(&ndf, 1, self);
-}
-
-static void iter_dcomplex_rint(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_rint(x);
-        SET_DATA_INDEX(p2, idx2, 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);
-      }
-    }
-  } 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 = 0; i < n; i++) {
-        GET_DATA_STRIDE(p1, s1, dtype, x);
-        x = m_rint(x);
-        SET_DATA_STRIDE(p2, s2, 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 };
-
-  return na_ndloop(&ndf, 1, self);
-}
-
-#define check_intdivzero(y)                                                                    \
-  {}
-
-static void iter_dcomplex_copysign(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_copysign(((dtype*)p1)[i], ((dtype*)p2)[i]);
-        }
-      } else {
-        for (; i < n; i++) {
-          check_intdivzero(((dtype*)p2)[i]);
-          ((dtype*)p3)[i] = m_copysign(((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_copysign(((dtype*)p1)[i], *(dtype*)p2);
-            }
-          } else {
-            for (; i < n; i++) {
-              ((dtype*)p3)[i] = m_copysign(((dtype*)p1)[i], *(dtype*)p2);
-            }
-          }
-        } else {
-          for (i = 0; i < n; i++) {
-            *(dtype*)p3 = m_copysign(*(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_copysign(*(dtype*)p1, *(dtype*)p2);
-            p1 += s1;
-            p2 += s2;
-          }
-        } else {
-          for (i = 0; i < n; i++) {
-            check_intdivzero(*(dtype*)p2);
-            *(dtype*)p3 = m_copysign(*(dtype*)p1, *(dtype*)p2);
-            p1 += s1;
-            p2 += s2;
-            p3 += s3;
-          }
-        }
-      }
-
-      return;
+      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_copysign(x, y);
-    SET_DATA_STRIDE(p3, s3, dtype, z);
-  }
-  //
-}
-#undef check_intdivzero
-
-static VALUE dcomplex_copysign_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_copysign, STRIDE_LOOP, 2, 1, ain, aout };
-
-  return na_ndloop(&ndf, 2, self, other);
-}
-
-/*
-  Binary copysign.
-  @overload copysign other
-    @param [Numo::NArray,Numeric] other
-    @return [Numo::NArray] self copysign other
-*/
-static VALUE dcomplex_copysign(VALUE self, VALUE other) {
-
-  VALUE klass, v;
-
-  klass = na_upcast(rb_obj_class(self), rb_obj_class(other));
-  if (klass == cT) {
-    return dcomplex_copysign_self(self, other);
-  } else {
-    v = rb_funcall(klass, id_cast, 1, self);
-    return rb_funcall(v, id_copysign, 1, 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_sum(na_loop_t* const lp) {
-  size_t n;
-  char *p1, *p2;
-  ssize_t s1;
-
-  INIT_COUNTER(lp, n);
-  INIT_PTR(lp, 0, p1, s1);
-  p2 = lp->args[1].ptr + lp->args[1].iter[0].pos;
-
-  *(dtype*)p2 = f_sum(n, p1, s1);
-}
-static void iter_dcomplex_sum_nan(na_loop_t* const lp) {
-  size_t n;
-  char *p1, *p2;
-  ssize_t s1;
-
-  INIT_COUNTER(lp, n);
-  INIT_PTR(lp, 0, p1, s1);
-  p2 = lp->args[1].ptr + lp->args[1].iter[0].pos;
-
-  *(dtype*)p2 = f_sum_nan(n, p1, s1);
-}
-
-/*
-  sum of self.
-  @overload sum(axis:nil, keepdims:false, nan:false)
-    @param [TrueClass] nan  If true, apply NaN-aware algorithm (avoid NaN for sum/mean etc, or,
-    return NaN for min/max etc).
-    @param [Numeric,Array,Range] axis  Performs sum along the axis.
-    @param [TrueClass] keepdims  If true, the reduced axes are left in the result array as
-    dimensions with size one.
-    @return [Numo::DComplex] returns result of sum.
-*/
-static VALUE dcomplex_sum(int argc, VALUE* argv, VALUE self) {
-  VALUE v, reduce;
-  ndfunc_arg_in_t ain[2] = { { cT, 0 }, { sym_reduce, 0 } };
-  ndfunc_arg_out_t aout[1] = { { cT, 0 } };
-  ndfunc_t ndf = { iter_dcomplex_sum, STRIDE_LOOP_NIP | NDF_FLAT_REDUCE, 2, 1, ain, aout };
-
-  reduce = na_reduce_dimension(argc, argv, 1, &self, &ndf, iter_dcomplex_sum_nan);
-
-  v = na_ndloop(&ndf, 2, self, reduce);
-
-  return dcomplex_extract(v);
-}
-
-static void iter_dcomplex_prod(na_loop_t* const lp) {
-  size_t n;
-  char *p1, *p2;
-  ssize_t s1;
-
-  INIT_COUNTER(lp, n);
-  INIT_PTR(lp, 0, p1, s1);
-  p2 = lp->args[1].ptr + lp->args[1].iter[0].pos;
-
-  *(dtype*)p2 = f_prod(n, p1, s1);
-}
-static void iter_dcomplex_prod_nan(na_loop_t* const lp) {
-  size_t n;
-  char *p1, *p2;
-  ssize_t s1;
-
-  INIT_COUNTER(lp, n);
-  INIT_PTR(lp, 0, p1, s1);
-  p2 = lp->args[1].ptr + lp->args[1].iter[0].pos;
-
-  *(dtype*)p2 = f_prod_nan(n, p1, s1);
-}
-
-/*
-  prod of self.
-  @overload prod(axis:nil, keepdims:false, nan:false)
-    @param [TrueClass] nan  If true, apply NaN-aware algorithm (avoid NaN for sum/mean etc, or,
-    return NaN for min/max etc).
-    @param [Numeric,Array,Range] axis  Performs prod along the axis.
-    @param [TrueClass] keepdims  If true, the reduced axes are left in the result array as
-    dimensions with size one.
-    @return [Numo::DComplex] returns result of prod.
-*/
-static VALUE dcomplex_prod(int argc, VALUE* argv, VALUE self) {
-  VALUE v, reduce;
-  ndfunc_arg_in_t ain[2] = { { cT, 0 }, { sym_reduce, 0 } };
-  ndfunc_arg_out_t aout[1] = { { cT, 0 } };
-  ndfunc_t ndf = { iter_dcomplex_prod, STRIDE_LOOP_NIP | NDF_FLAT_REDUCE, 2, 1, ain, aout };
-
-  reduce = na_reduce_dimension(argc, argv, 1, &self, &ndf, iter_dcomplex_prod_nan);
-
-  v = na_ndloop(&ndf, 2, self, reduce);
-
-  return dcomplex_extract(v);
-}
-
-static void iter_dcomplex_kahan_sum(na_loop_t* const lp) {
-  size_t n;
-  char *p1, *p2;
-  ssize_t s1;
-
-  INIT_COUNTER(lp, n);
-  INIT_PTR(lp, 0, p1, s1);
-  p2 = lp->args[1].ptr + lp->args[1].iter[0].pos;
-
-  *(dtype*)p2 = f_kahan_sum(n, p1, s1);
-}
-static void iter_dcomplex_kahan_sum_nan(na_loop_t* const lp) {
-  size_t n;
-  char *p1, *p2;
-  ssize_t s1;
-
-  INIT_COUNTER(lp, n);
-  INIT_PTR(lp, 0, p1, s1);
-  p2 = lp->args[1].ptr + lp->args[1].iter[0].pos;
-
-  *(dtype*)p2 = f_kahan_sum_nan(n, p1, s1);
-}
-
-/*
-  kahan_sum of self.
-  @overload kahan_sum(axis:nil, keepdims:false, nan:false)
-    @param [TrueClass] nan  If true, apply NaN-aware algorithm (avoid NaN for sum/mean etc, or,
-    return NaN for min/max etc).
-    @param [Numeric,Array,Range] axis  Performs kahan_sum along the axis.
-    @param [TrueClass] keepdims  If true, the reduced axes are left in the result array as
-    dimensions with size one.
-    @return [Numo::DComplex] returns result of kahan_sum.
-*/
-static VALUE dcomplex_kahan_sum(int argc, VALUE* argv, VALUE self) {
-  VALUE v, reduce;
-  ndfunc_arg_in_t ain[2] = { { cT, 0 }, { sym_reduce, 0 } };
-  ndfunc_arg_out_t aout[1] = { { cT, 0 } };
-  ndfunc_t ndf = {
-    iter_dcomplex_kahan_sum, STRIDE_LOOP_NIP | NDF_FLAT_REDUCE, 2, 1, ain, aout
-  };
-
-  reduce = na_reduce_dimension(argc, argv, 1, &self, &ndf, iter_dcomplex_kahan_sum_nan);
-
-  v = na_ndloop(&ndf, 2, self, reduce);
-
-  return dcomplex_extract(v);
-}
-
-static void iter_dcomplex_cumsum(na_loop_t* const lp) {
-  size_t i;
-  char *p1, *p2;
-  ssize_t s1, s2;
-  dtype x, y;
-
-  INIT_COUNTER(lp, i);
-  INIT_PTR(lp, 0, p1, s1);
-  INIT_PTR(lp, 1, p2, s2);
-
-  GET_DATA_STRIDE(p1, s1, dtype, x);
-  SET_DATA_STRIDE(p2, s2, dtype, x);
-  for (i--; i--;) {
-    GET_DATA_STRIDE(p1, s1, dtype, y);
-    m_cumsum(x, y);
-    SET_DATA_STRIDE(p2, s2, dtype, x);
-  }
-}
-static void iter_dcomplex_cumsum_nan(na_loop_t* const lp) {
-  size_t i;
-  char *p1, *p2;
-  ssize_t s1, s2;
-  dtype x, y;
-
-  INIT_COUNTER(lp, i);
-  INIT_PTR(lp, 0, p1, s1);
-  INIT_PTR(lp, 1, p2, s2);
-
-  GET_DATA_STRIDE(p1, s1, dtype, x);
-  SET_DATA_STRIDE(p2, s2, dtype, x);
-  for (i--; i--;) {
-    GET_DATA_STRIDE(p1, s1, dtype, y);
-    m_cumsum_nan(x, y);
-    SET_DATA_STRIDE(p2, s2, dtype, x);
-  }
-}
-
-/*
-  cumsum of self.
-  @overload cumsum(axis:nil, nan:false)
-    @param [Numeric,Array,Range] axis  Performs cumsum along the axis.
-    @param [TrueClass] nan  If true, apply NaN-aware algorithm (avoid NaN if exists).
-    @return [Numo::DComplex] cumsum of self.
-*/
-static VALUE dcomplex_cumsum(int argc, VALUE* argv, VALUE self) {
-  VALUE reduce;
-  ndfunc_arg_in_t ain[2] = { { cT, 0 }, { sym_reduce, 0 } };
-  ndfunc_arg_out_t aout[1] = { { cT, 0 } };
-  ndfunc_t ndf = {
-    iter_dcomplex_cumsum, STRIDE_LOOP | NDF_FLAT_REDUCE | NDF_CUM, 2, 1, ain, aout
-  };
-
-  reduce = na_reduce_dimension(argc, argv, 1, &self, &ndf, iter_dcomplex_cumsum_nan);
-
-  return na_ndloop(&ndf, 2, self, reduce);
-}
-
-static void iter_dcomplex_cumprod(na_loop_t* const lp) {
-  size_t i;
-  char *p1, *p2;
-  ssize_t s1, s2;
-  dtype x, y;
-
-  INIT_COUNTER(lp, i);
-  INIT_PTR(lp, 0, p1, s1);
-  INIT_PTR(lp, 1, p2, s2);
-
-  GET_DATA_STRIDE(p1, s1, dtype, x);
-  SET_DATA_STRIDE(p2, s2, dtype, x);
-  for (i--; i--;) {
-    GET_DATA_STRIDE(p1, s1, dtype, y);
-    m_cumprod(x, y);
-    SET_DATA_STRIDE(p2, s2, dtype, x);
-  }
-}
-static void iter_dcomplex_cumprod_nan(na_loop_t* const lp) {
-  size_t i;
-  char *p1, *p2;
-  ssize_t s1, s2;
-  dtype x, y;
-
-  INIT_COUNTER(lp, i);
-  INIT_PTR(lp, 0, p1, s1);
-  INIT_PTR(lp, 1, p2, s2);
-
-  GET_DATA_STRIDE(p1, s1, dtype, x);
-  SET_DATA_STRIDE(p2, s2, dtype, x);
-  for (i--; i--;) {
-    GET_DATA_STRIDE(p1, s1, dtype, y);
-    m_cumprod_nan(x, y);
-    SET_DATA_STRIDE(p2, s2, dtype, x);
-  }
-}
-
-/*
-  cumprod of self.
-  @overload cumprod(axis:nil, nan:false)
-    @param [Numeric,Array,Range] axis  Performs cumprod along the axis.
-    @param [TrueClass] nan  If true, apply NaN-aware algorithm (avoid NaN if exists).
-    @return [Numo::DComplex] cumprod of self.
-*/
-static VALUE dcomplex_cumprod(int argc, VALUE* argv, VALUE self) {
-  VALUE reduce;
-  ndfunc_arg_in_t ain[2] = { { cT, 0 }, { sym_reduce, 0 } };
-  ndfunc_arg_out_t aout[1] = { { cT, 0 } };
-  ndfunc_t ndf = {
-    iter_dcomplex_cumprod, STRIDE_LOOP | NDF_FLAT_REDUCE | NDF_CUM, 2, 1, ain, aout
-  };
-
-  reduce = na_reduce_dimension(argc, argv, 1, &self, &ndf, iter_dcomplex_cumprod_nan);
-
-  return na_ndloop(&ndf, 2, self, reduce);
-}
-
-//
-static void iter_dcomplex_mulsum(na_loop_t* const lp) {
-  size_t i, 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 (s3 == 0) {
-    dtype z;
-    // Reduce loop
-    GET_DATA(p3, dtype, z);
-    for (i = 0; i < n; i++) {
-      dtype x, y;
-      GET_DATA_STRIDE(p1, s1, dtype, x);
-      GET_DATA_STRIDE(p2, s2, dtype, y);
-      m_mulsum(x, y, z);
-    }
-    SET_DATA(p3, dtype, z);
-    return;
-  } else {
-    for (i = 0; i < n; i++) {
-      dtype x, y, z;
-      GET_DATA_STRIDE(p1, s1, dtype, x);
-      GET_DATA_STRIDE(p2, s2, dtype, y);
-      GET_DATA(p3, dtype, z);
-      m_mulsum(x, y, z);
-      SET_DATA_STRIDE(p3, s3, dtype, z);
-    }
-  }
-}
-//
-static void iter_dcomplex_mulsum_nan(na_loop_t* const lp) {
-  size_t i, 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 (s3 == 0) {
-    dtype z;
-    // Reduce loop
-    GET_DATA(p3, dtype, z);
-    for (i = 0; i < n; i++) {
-      dtype x, y;
-      GET_DATA_STRIDE(p1, s1, dtype, x);
-      GET_DATA_STRIDE(p2, s2, dtype, y);
-      m_mulsum_nan(x, y, z);
-    }
-    SET_DATA(p3, dtype, z);
-    return;
-  } else {
-    for (i = 0; i < n; i++) {
-      dtype x, y, z;
-      GET_DATA_STRIDE(p1, s1, dtype, x);
-      GET_DATA_STRIDE(p2, s2, dtype, y);
-      GET_DATA(p3, dtype, z);
-      m_mulsum_nan(x, y, z);
-      SET_DATA_STRIDE(p3, s3, dtype, z);
-    }
+    dtype x, y, z;
+    GET_DATA_STRIDE(p1, s1, dtype, x);
+    GET_DATA_STRIDE(p2, s2, dtype, y);
+    check_intdivzero(y);
+    z = m_copysign(x, y);
+    SET_DATA_STRIDE(p3, s3, dtype, z);
   }
+  //
 }
-//
+#undef check_intdivzero
 
-static VALUE dcomplex_mulsum_self(int argc, VALUE* argv, VALUE self) {
-  VALUE v, reduce;
-  VALUE naryv[2];
-  ndfunc_arg_in_t ain[4] = { { cT, 0 }, { cT, 0 }, { sym_reduce, 0 }, { sym_init, 0 } };
+static VALUE dcomplex_copysign_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_mulsum, STRIDE_LOOP_NIP, 4, 1, ain, aout };
-
-  if (argc < 1) {
-    rb_raise(rb_eArgError, "wrong number of arguments (%d for >=1)", argc);
-  }
-  // should fix below: [self.ndim,other.ndim].max or?
-  naryv[0] = self;
-  naryv[1] = argv[0];
-  //
-  reduce = na_reduce_dimension(argc - 1, argv + 1, 2, naryv, &ndf, iter_dcomplex_mulsum_nan);
-  //
+  ndfunc_t ndf = { iter_dcomplex_copysign, STRIDE_LOOP, 2, 1, ain, aout };
 
-  v = na_ndloop(&ndf, 4, self, argv[0], reduce, m_mulsum_init);
-  return dcomplex_extract(v);
+  return na_ndloop(&ndf, 2, self, other);
 }
 
 /*
-  Binary mulsum.
-
-  @overload mulsum(other, axis:nil, keepdims:false, nan:false)
+  Binary copysign.
+  @overload copysign other
     @param [Numo::NArray,Numeric] other
-    @param [Numeric,Array,Range] axis  Performs mulsum along the axis.
-    @param [TrueClass] keepdims (keyword) If true, the reduced axes are left in the result array
-    as dimensions with size one.
-    @param [TrueClass] nan (keyword) If true, apply NaN-aware algorithm (avoid NaN if exists).
-    @return [Numo::NArray] mulsum of self and other.
+    @return [Numo::NArray] self copysign other
 */
-static VALUE dcomplex_mulsum(int argc, VALUE* argv, VALUE self) {
-  //
+static VALUE dcomplex_copysign(VALUE self, VALUE other) {
+
   VALUE klass, v;
-  //
-  if (argc < 1) {
-    rb_raise(rb_eArgError, "wrong number of arguments (%d for >=1)", argc);
-  }
-  //
-  klass = na_upcast(rb_obj_class(self), rb_obj_class(argv[0]));
+
+  klass = na_upcast(rb_obj_class(self), rb_obj_class(other));
   if (klass == cT) {
-    return dcomplex_mulsum_self(argc, argv, self);
+    return dcomplex_copysign_self(self, other);
   } else {
     v = rb_funcall(klass, id_cast, 1, self);
-    //
-    return rb_funcallv_kw(v, rb_intern("mulsum"), argc, argv, RB_PASS_CALLED_KEYWORDS);
-    //
-  }
-  //
-}
-
-typedef dtype seq_data_t;
-
-typedef double seq_count_t;
-
-typedef struct {
-  seq_data_t beg;
-  seq_data_t step;
-  seq_count_t count;
-} seq_opt_t;
-
-static void iter_dcomplex_seq(na_loop_t* const lp) {
-  size_t i;
-  char* p1;
-  ssize_t s1;
-  size_t* idx1;
-  dtype x;
-  seq_data_t beg, step;
-  seq_count_t c;
-  seq_opt_t* g;
-
-  INIT_COUNTER(lp, i);
-  INIT_PTR_IDX(lp, 0, p1, s1, idx1);
-  g = (seq_opt_t*)(lp->opt_ptr);
-  beg = g->beg;
-  step = g->step;
-  c = g->count;
-  if (idx1) {
-    for (; i--;) {
-      x = f_seq(beg, step, c++);
-      *(dtype*)(p1 + *idx1) = x;
-      idx1++;
-    }
-  } else {
-    for (; i--;) {
-      x = f_seq(beg, step, c++);
-      *(dtype*)(p1) = x;
-      p1 += s1;
-    }
-  }
-  g->count = c;
-}
-
-/*
-  Set linear sequence of numbers to self. The sequence is obtained from
-     beg+i*step
-  where i is 1-dimensional index.
-  @overload seq([beg,[step]])
-    @param [Numeric] beg  beginning of sequence. (default=0)
-    @param [Numeric] step  step of sequence. (default=1)
-    @return [Numo::DComplex] self.
-  @example
-    Numo::DFloat.new(6).seq(1,-0.2)
-    # => Numo::DFloat#shape=[6]
-    # [1, 0.8, 0.6, 0.4, 0.2, 0]
-
-    Numo::DComplex.new(6).seq(1,-0.2+0.2i)
-    # => Numo::DComplex#shape=[6]
-    # [1+0i, 0.8+0.2i, 0.6+0.4i, 0.4+0.6i, 0.2+0.8i, 0+1i]
-*/
-static VALUE dcomplex_seq(int argc, VALUE* argv, VALUE self) {
-  seq_opt_t* g;
-  VALUE vbeg = Qnil, vstep = Qnil;
-  ndfunc_arg_in_t ain[1] = { { OVERWRITE, 0 } };
-  ndfunc_t ndf = { iter_dcomplex_seq, FULL_LOOP, 1, 0, ain, 0 };
-
-  g = ALLOCA_N(seq_opt_t, 1);
-  g->beg = m_zero;
-  g->step = m_one;
-  g->count = 0;
-  rb_scan_args(argc, argv, "02", &vbeg, &vstep);
-  if (vbeg != Qnil) {
-    g->beg = m_num_to_data(vbeg);
-  }
-  if (vstep != Qnil) {
-    g->step = m_num_to_data(vstep);
+    return rb_funcall(v, id_copysign, 1, other);
   }
-
-  na_ndloop3(&ndf, g, 1, self);
-  return self;
 }
 
-typedef struct {
-  seq_data_t beg;
-  seq_data_t step;
-  seq_data_t base;
-  seq_count_t count;
-} logseq_opt_t;
-
-static void iter_dcomplex_logseq(na_loop_t* const lp) {
-  size_t i;
-  char* p1;
+static void iter_dcomplex_kahan_sum(na_loop_t* const lp) {
+  size_t n;
+  char *p1, *p2;
   ssize_t s1;
-  size_t* idx1;
-  dtype x;
-  seq_data_t beg, step, base;
-  seq_count_t c;
-  logseq_opt_t* g;
-
-  INIT_COUNTER(lp, i);
-  INIT_PTR_IDX(lp, 0, p1, s1, idx1);
-  g = (logseq_opt_t*)(lp->opt_ptr);
-  beg = g->beg;
-  step = g->step;
-  base = g->base;
-  c = g->count;
-  if (idx1) {
-    for (; i--;) {
-      x = f_seq(beg, step, c++);
-      *(dtype*)(p1 + *idx1) = m_pow(base, x);
-      idx1++;
-    }
-  } else {
-    for (; i--;) {
-      x = f_seq(beg, step, c++);
-      *(dtype*)(p1) = m_pow(base, x);
-      p1 += s1;
-    }
-  }
-  g->count = c;
-}
-
-/*
-  Set logarithmic sequence of numbers to self. The sequence is obtained from
-     `base**(beg+i*step)`
-  where i is 1-dimensional index.
-  Applicable classes: DFloat, SFloat, DComplex, SCopmplex.
-
-  @overload logseq(beg,step,[base])
-    @param [Numeric] beg  The beginning of sequence.
-    @param [Numeric] step  The step of sequence.
-    @param [Numeric] base  The base of log space. (default=10)
-    @return [Numo::DComplex] self.
-
-  @example
-    Numo::DFloat.new(5).logseq(4,-1,2)
-    # => Numo::DFloat#shape=[5]
-    # [16, 8, 4, 2, 1]
-
-    Numo::DComplex.new(5).logseq(0,1i*Math::PI/3,Math::E)
-    # => Numo::DComplex#shape=[5]
-    # [1+7.26156e-310i, 0.5+0.866025i, -0.5+0.866025i, -1+1.22465e-16i, ...]
-*/
-static VALUE dcomplex_logseq(int argc, VALUE* argv, VALUE self) {
-  logseq_opt_t* g;
-  VALUE vbeg, vstep, vbase;
-  ndfunc_arg_in_t ain[1] = { { OVERWRITE, 0 } };
-  ndfunc_t ndf = { iter_dcomplex_logseq, FULL_LOOP, 1, 0, ain, 0 };
-
-  g = ALLOCA_N(logseq_opt_t, 1);
-  rb_scan_args(argc, argv, "21", &vbeg, &vstep, &vbase);
-  g->beg = m_num_to_data(vbeg);
-  g->step = m_num_to_data(vstep);
-  if (vbase == Qnil) {
-    g->base = m_from_real(10);
-  } else {
-    g->base = m_num_to_data(vbase);
-  }
-  na_ndloop3(&ndf, g, 1, self);
-  return self;
-}
-
-static void iter_dcomplex_eye(na_loop_t* const lp) {
-  size_t n0, n1;
-  size_t i0, i1;
-  ssize_t s0, s1;
-  char *p0, *p1;
-  char* g;
-  ssize_t kofs;
-  dtype data;
-
-  g = (char*)(lp->opt_ptr);
-  kofs = *(ssize_t*)g;
-  data = *(dtype*)(g + sizeof(ssize_t));
-
-  n0 = lp->args[0].shape[0];
-  n1 = lp->args[0].shape[1];
-  s0 = lp->args[0].iter[0].step;
-  s1 = lp->args[0].iter[1].step;
-  p0 = NDL_PTR(lp, 0);
-
-  for (i0 = 0; i0 < n0; i0++) {
-    p1 = p0;
-    for (i1 = 0; i1 < n1; i1++) {
-      *(dtype*)p1 = (i0 + kofs == i1) ? data : m_zero;
-      p1 += s1;
-    }
-    p0 += s0;
-  }
-}
-
-/*
-  Eye: Set a value to diagonal components, set 0 to non-diagonal components.
-  @overload eye([element,offset])
-    @param [Numeric] element  Diagonal element to be stored. Default is 1.
-    @param [Integer] offset Diagonal offset from the main diagonal.  The
-        default is 0. k>0 for diagonals above the main diagonal, and k<0
-        for diagonals below the main diagonal.
-    @return [Numo::DComplex] eye of self.
-*/
-static VALUE dcomplex_eye(int argc, VALUE* argv, VALUE self) {
-  ndfunc_arg_in_t ain[1] = { { OVERWRITE, 2 } };
-  ndfunc_t ndf = { iter_dcomplex_eye, NO_LOOP, 1, 0, ain, 0 };
-  ssize_t kofs;
-  dtype data;
-  char* g;
-  int nd;
-  narray_t* na;
-
-  // check arguments
-  if (argc > 2) {
-    rb_raise(rb_eArgError, "too many arguments (%d for 0..2)", argc);
-  } else if (argc == 2) {
-    data = m_num_to_data(argv[0]);
-    kofs = NUM2SSIZET(argv[1]);
-  } else if (argc == 1) {
-    data = m_num_to_data(argv[0]);
-    kofs = 0;
-  } else {
-    data = m_one;
-    kofs = 0;
-  }
-
-  GetNArray(self, na);
-  nd = na->ndim;
-  if (nd < 2) {
-    rb_raise(nary_eDimensionError, "less than 2-d array");
-  }
-
-  // Diagonal offset from the main diagonal.
-  if (kofs >= 0) {
-    if ((size_t)(kofs) >= na->shape[nd - 1]) {
-      rb_raise(
-        rb_eArgError,
-        "invalid diagonal offset(%" SZF "d) for "
-        "last dimension size(%" SZF "d)",
-        kofs, na->shape[nd - 1]
-      );
-    }
-  } else {
-    if ((size_t)(-kofs) >= na->shape[nd - 2]) {
-      rb_raise(
-        rb_eArgError,
-        "invalid diagonal offset(%" SZF "d) for "
-        "last-1 dimension size(%" SZF "d)",
-        kofs, na->shape[nd - 2]
-      );
-    }
-  }
 
-  g = ALLOCA_N(char, sizeof(ssize_t) + sizeof(dtype));
-  *(ssize_t*)g = kofs;
-  *(dtype*)(g + sizeof(ssize_t)) = data;
+  INIT_COUNTER(lp, n);
+  INIT_PTR(lp, 0, p1, s1);
+  p2 = lp->args[1].ptr + lp->args[1].iter[0].pos;
 
-  na_ndloop3(&ndf, g, 1, self);
-  return self;
+  *(dtype*)p2 = f_kahan_sum(n, p1, s1);
 }
-
-typedef struct {
-  dtype low;
-  dtype max;
-} rand_opt_t;
-
-static void iter_dcomplex_rand(na_loop_t* const lp) {
-  size_t i;
-  char* p1;
+static void iter_dcomplex_kahan_sum_nan(na_loop_t* const lp) {
+  size_t n;
+  char *p1, *p2;
   ssize_t s1;
-  size_t* idx1;
-  dtype x;
-  rand_opt_t* g;
-  dtype low;
-  dtype max;
 
-  INIT_COUNTER(lp, i);
-  INIT_PTR_IDX(lp, 0, p1, s1, idx1);
-  g = (rand_opt_t*)(lp->opt_ptr);
-  low = g->low;
-  max = g->max;
+  INIT_COUNTER(lp, n);
+  INIT_PTR(lp, 0, p1, s1);
+  p2 = lp->args[1].ptr + lp->args[1].iter[0].pos;
 
-  if (idx1) {
-    for (; i--;) {
-      x = m_add(m_rand(max), low);
-      SET_DATA_INDEX(p1, idx1, dtype, x);
-    }
-  } else {
-    for (; i--;) {
-      x = m_add(m_rand(max), low);
-      SET_DATA_STRIDE(p1, s1, dtype, x);
-    }
-  }
+  *(dtype*)p2 = f_kahan_sum_nan(n, p1, s1);
 }
 
 /*
-  Generate uniformly distributed random numbers on self narray.
-  @overload rand([[low],high])
-    @param [Numeric] low  lower inclusive boundary of random numbers. (default=0)
-    @param [Numeric] high  upper exclusive boundary of random numbers. (default=1 or 1+1i for
-    complex types)
-    @return [Numo::DComplex] self.
-  @example
-    Numo::DFloat.new(6).rand
-    # => Numo::DFloat#shape=[6]
-    # [0.0617545, 0.373067, 0.794815, 0.201042, 0.116041, 0.344032]
-
-    Numo::DComplex.new(6).rand(5+5i)
-    # => Numo::DComplex#shape=[6]
-    # [2.69974+3.68908i, 0.825443+0.254414i, 0.540323+0.34354i, 4.52061+2.39322i, ...]
-
-    Numo::Int32.new(6).rand(2,5)
-    # => Numo::Int32#shape=[6]
-    # [4, 3, 3, 2, 4, 2]
+  kahan_sum of self.
+  @overload kahan_sum(axis:nil, keepdims:false, nan:false)
+    @param [TrueClass] nan  If true, apply NaN-aware algorithm (avoid NaN for sum/mean etc, or,
+    return NaN for min/max etc).
+    @param [Numeric,Array,Range] axis  Performs kahan_sum along the axis.
+    @param [TrueClass] keepdims  If true, the reduced axes are left in the result array as
+    dimensions with size one.
+    @return [Numo::DComplex] returns result of kahan_sum.
 */
-static VALUE dcomplex_rand(int argc, VALUE* argv, VALUE self) {
-  rand_opt_t g;
-  VALUE v1 = Qnil, v2 = Qnil;
-  dtype high;
-  ndfunc_arg_in_t ain[1] = { { OVERWRITE, 0 } };
-  ndfunc_t ndf = { iter_dcomplex_rand, FULL_LOOP, 1, 0, ain, 0 };
-
-  rb_scan_args(argc, argv, "02", &v1, &v2);
-  if (v2 == Qnil) {
-    g.low = m_zero;
-    if (v1 == Qnil) {
-
-      g.max = high = c_new(1, 1);
+static VALUE dcomplex_kahan_sum(int argc, VALUE* argv, VALUE self) {
+  VALUE v, reduce;
+  ndfunc_arg_in_t ain[2] = { { cT, 0 }, { sym_reduce, 0 } };
+  ndfunc_arg_out_t aout[1] = { { cT, 0 } };
+  ndfunc_t ndf = {
+    iter_dcomplex_kahan_sum, STRIDE_LOOP_NIP | NDF_FLAT_REDUCE, 2, 1, ain, aout
+  };
 
-    } else {
-      g.max = high = m_num_to_data(v1);
-    }
+  reduce = na_reduce_dimension(argc, argv, 1, &self, &ndf, iter_dcomplex_kahan_sum_nan);
 
-  } else {
-    g.low = m_num_to_data(v1);
-    high = m_num_to_data(v2);
-    g.max = m_sub(high, g.low);
-  }
+  v = na_ndloop(&ndf, 2, self, reduce);
 
-  na_ndloop3(&ndf, &g, 1, self);
-  return self;
+  return dcomplex_extract(v);
 }
 
 typedef struct {
@@ -4930,20 +2931,77 @@ 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);
   rb_define_method(cT, "**", dcomplex_pow, 1);
   rb_define_alias(cT, "pow", "**");
@@ -4962,22 +3020,110 @@ 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.
+   * @overload sum(axis:nil, keepdims:false, nan:false)
+   *   @param [TrueClass] nan  If true, apply NaN-aware algorithm
+   *     (avoid NaN for sum/mean etc, or, return NaN for min/max etc).
+   *   @param [Numeric,Array,Range] axis  Performs sum along the axis.
+   *   @param [TrueClass] keepdims  If true, the reduced axes are left in the result array as
+   *     dimensions with size one.
+   *   @return [Numo::DComplex] returns result of sum.
+   */
   rb_define_method(cT, "sum", dcomplex_sum, -1);
+  /**
+   * prod of self.
+   * @overload prod(axis:nil, keepdims:false, nan:false)
+   *   @param [TrueClass] nan  If true, apply NaN-aware algorithm
+   *     (avoid NaN for sum/mean etc, or, return NaN for min/max etc).
+   *   @param [Numeric,Array,Range] axis  Performs prod along the axis.
+   *   @param [TrueClass] keepdims  If true, the reduced axes are left in the result array as
+   *     dimensions with size one.
+   *   @return [Numo::DComplex] returns result of prod.
+   */
   rb_define_method(cT, "prod", dcomplex_prod, -1);
   rb_define_method(cT, "kahan_sum", dcomplex_kahan_sum, -1);
   /**
@@ -5024,13 +3170,106 @@ void Init_numo_dcomplex(void) {
    *   @return [Numo::DFloat] returns result of rms.
    */
   rb_define_method(cT, "rms", dcomplex_rms, -1);
+  /**
+   * cumsum of self.
+   * @overload cumsum(axis:nil, nan:false)
+   *   @param [Numeric,Array,Range] axis  Performs cumsum along the axis.
+   *   @param [TrueClass] nan  If true, apply NaN-aware algorithm (avoid NaN if exists).
+   *   @return [Numo::DComplex] cumsum of self.
+   */
   rb_define_method(cT, "cumsum", dcomplex_cumsum, -1);
+  /**
+   * cumprod of self.
+   * @overload cumprod(axis:nil, nan:false)
+   *   @param [Numeric,Array,Range] axis  Performs cumprod along the axis.
+   *   @param [TrueClass] nan  If true, apply NaN-aware algorithm (avoid NaN if exists).
+   *   @return [Numo::DComplex] cumprod of self.
+   */
   rb_define_method(cT, "cumprod", dcomplex_cumprod, -1);
+  /**
+   * Binary mulsum.
+   *
+   * @overload mulsum(other, axis:nil, keepdims:false, nan:false)
+   *   @param [Numo::NArray,Numeric] other
+   *   @param [Numeric,Array,Range] axis  Performs mulsum along the axis.
+   *   @param [TrueClass] keepdims (keyword) If true, the reduced axes are left in
+   *     the result array as dimensions with size one.
+   *   @param [TrueClass] nan (keyword) If true, apply NaN-aware algorithm
+   *     (avoid NaN if exists).
+   *   @return [Numo::NArray] mulsum of self and other.
+   */
   rb_define_method(cT, "mulsum", dcomplex_mulsum, -1);
+  /**
+   * Set linear sequence of numbers to self. The sequence is obtained from
+   *    beg+i*step
+   * where i is 1-dimensional index.
+   * @overload seq([beg,[step]])
+   *   @param [Numeric] beg  beginning of sequence. (default=0)
+   *   @param [Numeric] step  step of sequence. (default=1)
+   *   @return [Numo::DComplex] self.
+   * @example
+   *   Numo::DFloat.new(6).seq(1,-0.2)
+   *   # => Numo::DFloat#shape=[6]
+   *   # [1, 0.8, 0.6, 0.4, 0.2, 0]
+   *
+   *   Numo::DComplex.new(6).seq(1,-0.2+0.2i)
+   *   # => Numo::DComplex#shape=[6]
+   *   # [1+0i, 0.8+0.2i, 0.6+0.4i, 0.4+0.6i, 0.2+0.8i, 0+1i]
+   */
   rb_define_method(cT, "seq", dcomplex_seq, -1);
+  /**
+   * Set logarithmic sequence of numbers to self. The sequence is obtained from
+   *    `base**(beg+i*step)`
+   * where i is 1-dimensional index.
+   * Applicable classes: DFloat, SFloat, DComplex, SCopmplex.
+   *
+   * @overload logseq(beg,step,[base])
+   *   @param [Numeric] beg  The beginning of sequence.
+   *   @param [Numeric] step  The step of sequence.
+   *   @param [Numeric] base  The base of log space. (default=10)
+   *   @return [Numo::DComplex] self.
+   *
+   * @example
+   *   Numo::DFloat.new(5).logseq(4,-1,2)
+   *   # => Numo::DFloat#shape=[5]
+   *   # [16, 8, 4, 2, 1]
+   *
+   *   Numo::DComplex.new(5).logseq(0,1i*Math::PI/3,Math::E)
+   *   # => Numo::DComplex#shape=[5]
+   *   # [1+7.26156e-310i, 0.5+0.866025i, -0.5+0.866025i, -1+1.22465e-16i, ...]
+   */
   rb_define_method(cT, "logseq", dcomplex_logseq, -1);
+  /**
+   * Eye: Set a value to diagonal components, set 0 to non-diagonal components.
+   * @overload eye([element,offset])
+   *   @param [Numeric] element  Diagonal element to be stored. Default is 1.
+   *   @param [Integer] offset Diagonal offset from the main diagonal.  The
+   *       default is 0. k>0 for diagonals above the main diagonal, and k<0
+   *       for diagonals below the main diagonal.
+   *   @return [Numo::DComplex] eye of self.
+   */
   rb_define_method(cT, "eye", dcomplex_eye, -1);
   rb_define_alias(cT, "indgen", "seq");
+  /**
+   * Generate uniformly distributed random numbers on self narray.
+   * @overload rand([[low],high])
+   *   @param [Numeric] low  lower inclusive boundary of random numbers. (default=0)
+   *   @param [Numeric] high  upper exclusive boundary of random numbers.
+   *     (default=1 or 1+1i for complex types)
+   *   @return [Numo::DComplex] self.
+   * @example
+   *   Numo::DFloat.new(6).rand
+   *   # => Numo::DFloat#shape=[6]
+   *   # [0.0617545, 0.373067, 0.794815, 0.201042, 0.116041, 0.344032]
+   *
+   *   Numo::DComplex.new(6).rand(5+5i)
+   *   # => Numo::DComplex#shape=[6]
+   *   # [2.69974+3.68908i, 0.825443+0.254414i, 0.540323+0.34354i, 4.52061+2.39322i, ...]
+   *
+   *   Numo::Int32.new(6).rand(2,5)
+   *   # => Numo::Int32#shape=[6]
+   *   # [4, 3, 3, 2, 4, 2]
+   */
   rb_define_method(cT, "rand", dcomplex_rand, -1);
   rb_define_method(cT, "rand_norm", dcomplex_rand_norm, -1);
   rb_define_method(cT, "poly", dcomplex_poly, -2);