numo-narray-alt 0.9.11 → 0.9.12

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

@@ -43,6 +43,30 @@ 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/op/mod.h"
+#include "mh/divmod.h"
+#include "mh/comp/eq.h"
+#include "mh/comp/ne.h"
+#include "mh/comp/gt.h"
+#include "mh/comp/ge.h"
+#include "mh/comp/lt.h"
+#include "mh/comp/le.h"
+#include "mh/bit/and.h"
+#include "mh/bit/or.h"
+#include "mh/bit/xor.h"
+#include "mh/bit/not.h"
+#include "mh/bit/left_shift.h"
+#include "mh/bit/right_shift.h"
 #include "mh/clip.h"
 #include "mh/sum.h"
 #include "mh/prod.h"
@@ -56,6 +80,7 @@ extern VALUE cRT;
 #include "mh/maximum.h"
 #include "mh/minimum.h"
 #include "mh/minmax.h"
+#include "mh/bincount.h"
 #include "mh/cumsum.h"
 #include "mh/cumprod.h"
 #include "mh/mulsum.h"
@@ -69,6 +94,30 @@ extern VALUE cRT;
 
 typedef int8_t int8; // Type aliases for shorter notation
                      // following the codebase naming convention.
+DEF_NARRAY_COERCE_CAST_METHOD_FUNC(int8)
+DEF_NARRAY_TO_A_METHOD_FUNC(int8)
+DEF_NARRAY_FILL_METHOD_FUNC(int8)
+DEF_NARRAY_FORMAT_METHOD_FUNC(int8)
+DEF_NARRAY_FORMAT_TO_A_METHOD_FUNC(int8)
+DEF_NARRAY_INSPECT_METHOD_FUNC(int8)
+DEF_NARRAY_INT8_ADD_METHOD_FUNC(int8, numo_cInt8)
+DEF_NARRAY_INT8_SUB_METHOD_FUNC(int8, numo_cInt8)
+DEF_NARRAY_INT8_MUL_METHOD_FUNC(int8, numo_cInt8)
+DEF_NARRAY_INT8_DIV_METHOD_FUNC(int8, numo_cInt8)
+DEF_NARRAY_INT8_MOD_METHOD_FUNC(int8, numo_cInt8)
+DEF_NARRAY_INT_DIVMOD_METHOD_FUNC(int8, numo_cInt8)
+DEF_NARRAY_EQ_METHOD_FUNC(int8, numo_cInt8)
+DEF_NARRAY_NE_METHOD_FUNC(int8, numo_cInt8)
+DEF_NARRAY_GT_METHOD_FUNC(int8, numo_cInt8)
+DEF_NARRAY_GE_METHOD_FUNC(int8, numo_cInt8)
+DEF_NARRAY_LT_METHOD_FUNC(int8, numo_cInt8)
+DEF_NARRAY_LE_METHOD_FUNC(int8, numo_cInt8)
+DEF_NARRAY_INT8_BIT_AND_METHOD_FUNC(int8, numo_cInt8)
+DEF_NARRAY_INT8_BIT_OR_METHOD_FUNC(int8, numo_cInt8)
+DEF_NARRAY_INT8_BIT_XOR_METHOD_FUNC(int8, numo_cInt8)
+DEF_NARRAY_INT8_BIT_NOT_METHOD_FUNC(int8, numo_cInt8)
+DEF_NARRAY_INT8_LEFT_SHIFT_METHOD_FUNC(int8, numo_cInt8)
+DEF_NARRAY_INT8_RIGHT_SHIFT_METHOD_FUNC(int8, numo_cInt8)
 DEF_NARRAY_CLIP_METHOD_FUNC(int8, numo_cInt8)
 DEF_NARRAY_INT_SUM_METHOD_FUNC(int8, numo_cInt8, int64_t, numo_cInt64)
 DEF_NARRAY_INT_PROD_METHOD_FUNC(int8, numo_cInt8, int64_t, numo_cInt64)
@@ -82,6 +131,7 @@ DEF_NARRAY_INT_ARGMIN_METHOD_FUNC(int8)
 DEF_NARRAY_INT_MAXIMUM_METHOD_FUNC(int8, numo_cInt8)
 DEF_NARRAY_INT_MINIMUM_METHOD_FUNC(int8, numo_cInt8)
 DEF_NARRAY_INT_MINMAX_METHOD_FUNC(int8, numo_cInt8)
+DEF_NARRAY_INT_BINCOUNT_METHOD_FUNC(int8, numo_cInt8)
 DEF_NARRAY_INT_CUMSUM_METHOD_FUNC(int8, numo_cInt8)
 DEF_NARRAY_INT_CUMPROD_METHOD_FUNC(int8, numo_cInt8)
 DEF_NARRAY_INT_MULSUM_METHOD_FUNC(int8, numo_cInt8)
@@ -1252,204 +1302,6 @@ static VALUE int8_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 int8_coerce_cast(VALUE self, VALUE type) {
-  return Qnil;
-}
-
-static void iter_int8_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 int8_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_int8_to_a, FULL_LOOP_NIP, 3, 1, ain, aout };
-  return na_ndloop_cast_narray_to_rarray(&ndf, self, Qnil);
-}
-
-static void iter_int8_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::Int8] self.
-*/
-static VALUE int8_fill(VALUE self, VALUE val) {
-  ndfunc_arg_in_t ain[2] = { { OVERWRITE, 0 }, { sym_option } };
-  ndfunc_t ndf = { iter_int8_fill, FULL_LOOP, 2, 0, ain, 0 };
-
-  na_ndloop(&ndf, 2, self, val);
-  return self;
-}
-
-static VALUE format_int8(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_int8_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_int8(fmt, x);
-      SET_DATA_STRIDE(p2, s2, VALUE, y);
-    }
-  } else {
-    for (; i--;) {
-      x = (dtype*)p1;
-      p1 += s1;
-      y = format_int8(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 int8_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_int8_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_int8_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_int8(fmt, x);
-      rb_ary_push(a, y);
-    }
-  } else {
-    for (; i--;) {
-      x = (dtype*)p1;
-      p1 += s1;
-      y = format_int8(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 int8_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_int8_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_int8_inspect(char* ptr, size_t pos, VALUE fmt) {
-  return format_int8(fmt, (dtype*)(ptr + pos));
-}
-
-/*
-  Returns a string containing a human-readable representation of NArray.
-  @overload inspect
-    @return [String]
-*/
-static VALUE int8_inspect(VALUE ary) {
-  return na_ndloop_inspect(ary, iter_int8_inspect, Qnil);
-}
-
 static void iter_int8_each(na_loop_t* const lp) {
   size_t i, s1;
   char* p1;
@@ -1759,1165 +1611,154 @@ static VALUE int8_abs(VALUE self) {
   return na_ndloop(&ndf, 1, self);
 }
 
-#define check_intdivzero(y)                                                                    \
-  {}
-
-static void iter_int8_add(na_loop_t* const lp) {
-  size_t i = 0;
-  size_t n;
+static void iter_int8_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 (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;
-      }
-    }
+  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);
   }
+}
 
-  return;
-  //
+static void iter_int8_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 int8_add_self(VALUE self, VALUE other) {
+static VALUE int8_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_int8_add, STRIDE_LOOP, 2, 1, ain, aout };
+  ndfunc_t ndf = { iter_int8_pow, STRIDE_LOOP, 2, 1, ain, aout };
+  ndfunc_t ndf_i = { iter_int8_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 int8_add(VALUE self, VALUE other) {
+static VALUE int8_pow(VALUE self, VALUE other) {
 
   VALUE klass, v;
-
   klass = na_upcast(rb_obj_class(self), rb_obj_class(other));
   if (klass == cT) {
-    return int8_add_self(self, other);
+    return int8_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_int8_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_int8_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);
-
-  //
+  INIT_PTR_IDX(lp, 0, p1, s1, idx1);
+  INIT_PTR_IDX(lp, 1, p2, s2, idx2);
 
-  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);
-        }
+  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++) {
-        *(dtype*)p3 = m_sub(*(dtype*)p1, *(dtype*)p2);
-        p1 += s1;
-        p3 += s3;
+        GET_DATA_INDEX(p1, idx1, dtype, x);
+        x = m_minus(x);
+        SET_DATA_STRIDE(p2, s2, dtype, x);
       }
     }
   } else {
-    if (p1 == p3) { // inplace case
+    if (idx2) {
       for (i = 0; i < n; i++) {
-        check_intdivzero(*(dtype*)p2);
-        *(dtype*)p1 = m_sub(*(dtype*)p1, *(dtype*)p2);
-        p1 += s1;
-        p2 += s2;
+        GET_DATA_STRIDE(p1, s1, dtype, x);
+        x = m_minus(x);
+        SET_DATA_INDEX(p2, idx2, dtype, x);
       }
     } else {
+      //
       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;
-  //
-}
-#undef check_intdivzero
-
-static VALUE int8_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_int8_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::Int8] minus of self.
 */
-static VALUE int8_sub(VALUE self, VALUE other) {
-
-  VALUE klass, v;
+static VALUE int8_minus(VALUE self) {
+  ndfunc_arg_in_t ain[1] = { { cT, 0 } };
+  ndfunc_arg_out_t aout[1] = { { cT, 0 } };
+  ndfunc_t ndf = { iter_int8_minus, FULL_LOOP, 1, 1, ain, aout };
 
-  klass = na_upcast(rb_obj_class(self), rb_obj_class(other));
-  if (klass == cT) {
-    return int8_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_int8_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_int8_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);
-
-  //
+  INIT_PTR_IDX(lp, 0, p1, s1, idx1);
+  INIT_PTR_IDX(lp, 1, p2, s2, idx2);
 
-  if (s2 == 0) { // Broadcasting from scalar value.
-    check_intdivzero(*(dtype*)p2);
-    if (s1 == sizeof(dtype) && s3 == sizeof(dtype)) {
-      if (p1 == p3) { // inplace case
-        for (; i < n; i++) {
-          ((dtype*)p1)[i] = m_mul(((dtype*)p1)[i], *(dtype*)p2);
-        }
-      } else {
-        for (; i < n; i++) {
-          ((dtype*)p3)[i] = m_mul(((dtype*)p1)[i], *(dtype*)p2);
-        }
-      }
-    } else {
-      for (i = 0; i < n; i++) {
-        *(dtype*)p3 = m_mul(*(dtype*)p1, *(dtype*)p2);
-        p1 += s1;
-        p3 += s3;
-      }
-    }
-  } else {
-    if (p1 == p3) { // inplace case
-      for (i = 0; i < n; i++) {
-        check_intdivzero(*(dtype*)p2);
-        *(dtype*)p1 = m_mul(*(dtype*)p1, *(dtype*)p2);
-        p1 += s1;
-        p2 += s2;
-      }
-    } else {
-      for (i = 0; i < n; i++) {
-        check_intdivzero(*(dtype*)p2);
-        *(dtype*)p3 = m_mul(*(dtype*)p1, *(dtype*)p2);
-        p1 += s1;
-        p2 += s2;
-        p3 += s3;
-      }
-    }
-  }
-
-  return;
-  //
-}
-#undef check_intdivzero
-
-static VALUE int8_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_int8_mul, STRIDE_LOOP, 2, 1, ain, aout };
-
-  return na_ndloop(&ndf, 2, self, other);
-}
-
-/*
-  Binary mul.
-  @overload * other
-    @param [Numo::NArray,Numeric] other
-    @return [Numo::NArray] self * other
-*/
-static VALUE int8_mul(VALUE self, VALUE other) {
-
-  VALUE klass, v;
-
-  klass = na_upcast(rb_obj_class(self), rb_obj_class(other));
-  if (klass == cT) {
-    return int8_mul_self(self, other);
-  } else {
-    v = rb_funcall(klass, id_cast, 1, self);
-    return rb_funcall(v, '*', 1, other);
-  }
-}
-
-#define check_intdivzero(y)                                                                    \
-  if ((y) == 0) {                                                                              \
-    lp->err_type = rb_eZeroDivError;                                                           \
-    return;                                                                                    \
-  }
-
-static void iter_int8_div(na_loop_t* const lp) {
-  size_t i = 0;
-  size_t n;
-  char *p1, *p2, *p3;
-  ssize_t s1, s2, s3;
-
-  INIT_COUNTER(lp, n);
-  INIT_PTR(lp, 0, p1, s1);
-  INIT_PTR(lp, 1, p2, s2);
-  INIT_PTR(lp, 2, p3, s3);
-
-  //
-
-  if (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;
-  //
-}
-#undef check_intdivzero
-
-static VALUE int8_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_int8_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 int8_div(VALUE self, VALUE other) {
-
-  VALUE klass, v;
-
-  klass = na_upcast(rb_obj_class(self), rb_obj_class(other));
-  if (klass == cT) {
-    return int8_div_self(self, other);
-  } else {
-    v = rb_funcall(klass, id_cast, 1, self);
-    return rb_funcall(v, '/', 1, other);
-  }
-}
-
-#define check_intdivzero(y)                                                                    \
-  if ((y) == 0) {                                                                              \
-    lp->err_type = rb_eZeroDivError;                                                           \
-    return;                                                                                    \
-  }
-
-static void iter_int8_mod(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 (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_mod(((dtype*)p1)[i], *(dtype*)p2);
-        }
-      } else {
-        for (; i < n; i++) {
-          ((dtype*)p3)[i] = m_mod(((dtype*)p1)[i], *(dtype*)p2);
-        }
-      }
-    } else {
-      for (i = 0; i < n; i++) {
-        *(dtype*)p3 = m_mod(*(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_mod(*(dtype*)p1, *(dtype*)p2);
-        p1 += s1;
-        p2 += s2;
-      }
-    } else {
-      for (i = 0; i < n; i++) {
-        check_intdivzero(*(dtype*)p2);
-        *(dtype*)p3 = m_mod(*(dtype*)p1, *(dtype*)p2);
-        p1 += s1;
-        p2 += s2;
-        p3 += s3;
-      }
-    }
-  }
-
-  return;
-  //
-}
-#undef check_intdivzero
-
-static VALUE int8_mod_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_int8_mod, STRIDE_LOOP, 2, 1, ain, aout };
-
-  return na_ndloop(&ndf, 2, self, other);
-}
-
-/*
-  Binary mod.
-  @overload % other
-    @param [Numo::NArray,Numeric] other
-    @return [Numo::NArray] self % other
-*/
-static VALUE int8_mod(VALUE self, VALUE other) {
-
-  VALUE klass, v;
-
-  klass = na_upcast(rb_obj_class(self), rb_obj_class(other));
-  if (klass == cT) {
-    return int8_mod_self(self, other);
-  } else {
-    v = rb_funcall(klass, id_cast, 1, self);
-    return rb_funcall(v, '%', 1, other);
-  }
-}
-
-static void iter_int8_divmod(na_loop_t* const lp) {
-  size_t i, n;
-  char *p1, *p2, *p3, *p4;
-  ssize_t s1, s2, s3, s4;
-  dtype x, y, a, b;
-  INIT_COUNTER(lp, n);
-  INIT_PTR(lp, 0, p1, s1);
-  INIT_PTR(lp, 1, p2, s2);
-  INIT_PTR(lp, 2, p3, s3);
-  INIT_PTR(lp, 3, p4, s4);
-  for (i = n; i--;) {
-    GET_DATA_STRIDE(p1, s1, dtype, x);
-    GET_DATA_STRIDE(p2, s2, dtype, y);
-    if (y == 0) {
-      lp->err_type = rb_eZeroDivError;
-      return;
-    }
-    m_divmod(x, y, a, b);
-    SET_DATA_STRIDE(p3, s3, dtype, a);
-    SET_DATA_STRIDE(p4, s4, dtype, b);
-  }
-}
-
-static VALUE int8_divmod_self(VALUE self, VALUE other) {
-  ndfunc_arg_in_t ain[2] = { { cT, 0 }, { cT, 0 } };
-  ndfunc_arg_out_t aout[2] = { { cT, 0 }, { cT, 0 } };
-  ndfunc_t ndf = { iter_int8_divmod, STRIDE_LOOP, 2, 2, ain, aout };
-
-  return na_ndloop(&ndf, 2, self, other);
-}
-
-/*
-  Binary divmod.
-  @overload divmod other
-    @param [Numo::NArray,Numeric] other
-    @return [Numo::NArray] divmod of self and other.
-*/
-static VALUE int8_divmod(VALUE self, VALUE other) {
-
-  VALUE klass, v;
-  klass = na_upcast(rb_obj_class(self), rb_obj_class(other));
-  if (klass == cT) {
-    return int8_divmod_self(self, other);
-  } else {
-    v = rb_funcall(klass, id_cast, 1, self);
-    return rb_funcall(v, id_divmod, 1, other);
-  }
-}
-
-static void iter_int8_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_int8_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 int8_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_int8_pow, STRIDE_LOOP, 2, 1, ain, aout };
-  ndfunc_t ndf_i = { iter_int8_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 int8_pow(VALUE self, VALUE other) {
-
-  VALUE klass, v;
-  klass = na_upcast(rb_obj_class(self), rb_obj_class(other));
-  if (klass == cT) {
-    return int8_pow_self(self, other);
-  } else {
-    v = rb_funcall(klass, id_cast, 1, self);
-    return rb_funcall(v, id_pow, 1, other);
-  }
-}
-
-static void iter_int8_minus(na_loop_t* const lp) {
-  size_t i, n;
-  char *p1, *p2;
-  ssize_t s1, s2;
-  size_t *idx1, *idx2;
-  dtype x;
-
-  INIT_COUNTER(lp, n);
-  INIT_PTR_IDX(lp, 0, p1, s1, idx1);
-  INIT_PTR_IDX(lp, 1, p2, s2, idx2);
-
-  if (idx1) {
-    if (idx2) {
-      for (i = 0; i < n; i++) {
-        GET_DATA_INDEX(p1, idx1, dtype, x);
-        x = m_minus(x);
-        SET_DATA_INDEX(p2, idx2, dtype, x);
-      }
-    } else {
-      for (i = 0; i < n; i++) {
-        GET_DATA_INDEX(p1, idx1, dtype, x);
-        x = m_minus(x);
-        SET_DATA_STRIDE(p2, s2, dtype, x);
-      }
-    }
-  } else {
-    if (idx2) {
-      for (i = 0; i < n; i++) {
-        GET_DATA_STRIDE(p1, s1, dtype, x);
-        x = m_minus(x);
-        SET_DATA_INDEX(p2, idx2, dtype, x);
-      }
-    } else {
-      //
-      for (i = 0; i < n; i++) {
-        *(dtype*)p2 = m_minus(*(dtype*)p1);
-        p1 += s1;
-        p2 += s2;
-      }
-      return;
-      //
-    }
-  }
-}
-
-/*
-  Unary minus.
-  @overload -@
-    @return [Numo::Int8] minus of self.
-*/
-static VALUE int8_minus(VALUE self) {
-  ndfunc_arg_in_t ain[1] = { { cT, 0 } };
-  ndfunc_arg_out_t aout[1] = { { cT, 0 } };
-  ndfunc_t ndf = { iter_int8_minus, FULL_LOOP, 1, 1, ain, aout };
-
-  return na_ndloop(&ndf, 1, self);
-}
-
-static void iter_int8_reciprocal(na_loop_t* const lp) {
-  size_t i, n;
-  char *p1, *p2;
-  ssize_t s1, s2;
-  size_t *idx1, *idx2;
-  dtype x;
-
-  INIT_COUNTER(lp, n);
-  INIT_PTR_IDX(lp, 0, p1, s1, idx1);
-  INIT_PTR_IDX(lp, 1, p2, s2, idx2);
-
-  if (idx1) {
-    if (idx2) {
-      for (i = 0; i < n; i++) {
-        GET_DATA_INDEX(p1, idx1, dtype, x);
-        x = m_reciprocal(x);
-        SET_DATA_INDEX(p2, idx2, dtype, x);
-      }
-    } else {
-      for (i = 0; i < n; i++) {
-        GET_DATA_INDEX(p1, idx1, dtype, x);
-        x = m_reciprocal(x);
-        SET_DATA_STRIDE(p2, s2, dtype, x);
-      }
-    }
-  } else {
-    if (idx2) {
-      for (i = 0; i < n; i++) {
-        GET_DATA_STRIDE(p1, s1, dtype, x);
-        x = m_reciprocal(x);
-        SET_DATA_INDEX(p2, idx2, dtype, x);
-      }
-    } else {
-      //
-      for (i = 0; i < n; i++) {
-        *(dtype*)p2 = m_reciprocal(*(dtype*)p1);
-        p1 += s1;
-        p2 += s2;
-      }
-      return;
-      //
-    }
-  }
-}
-
-/*
-  Unary reciprocal.
-  @overload reciprocal
-    @return [Numo::Int8] reciprocal of self.
-*/
-static VALUE int8_reciprocal(VALUE self) {
-  ndfunc_arg_in_t ain[1] = { { cT, 0 } };
-  ndfunc_arg_out_t aout[1] = { { cT, 0 } };
-  ndfunc_t ndf = { iter_int8_reciprocal, FULL_LOOP, 1, 1, ain, aout };
-
-  return na_ndloop(&ndf, 1, self);
-}
-
-static void iter_int8_sign(na_loop_t* const lp) {
-  size_t i, n;
-  char *p1, *p2;
-  ssize_t s1, s2;
-  size_t *idx1, *idx2;
-  dtype x;
-
-  INIT_COUNTER(lp, n);
-  INIT_PTR_IDX(lp, 0, p1, s1, idx1);
-  INIT_PTR_IDX(lp, 1, p2, s2, idx2);
-
-  if (idx1) {
-    if (idx2) {
-      for (i = 0; i < n; i++) {
-        GET_DATA_INDEX(p1, idx1, dtype, x);
-        x = m_sign(x);
-        SET_DATA_INDEX(p2, idx2, dtype, x);
-      }
-    } else {
-      for (i = 0; i < n; i++) {
-        GET_DATA_INDEX(p1, idx1, dtype, x);
-        x = m_sign(x);
-        SET_DATA_STRIDE(p2, s2, dtype, x);
-      }
-    }
-  } else {
-    if (idx2) {
-      for (i = 0; i < n; i++) {
-        GET_DATA_STRIDE(p1, s1, dtype, x);
-        x = m_sign(x);
-        SET_DATA_INDEX(p2, idx2, dtype, x);
-      }
-    } else {
-      //
-      for (i = 0; i < n; i++) {
-        *(dtype*)p2 = m_sign(*(dtype*)p1);
-        p1 += s1;
-        p2 += s2;
-      }
-      return;
-      //
-    }
-  }
-}
-
-/*
-  Unary sign.
-  @overload sign
-    @return [Numo::Int8] sign of self.
-*/
-static VALUE int8_sign(VALUE self) {
-  ndfunc_arg_in_t ain[1] = { { cT, 0 } };
-  ndfunc_arg_out_t aout[1] = { { cT, 0 } };
-  ndfunc_t ndf = { iter_int8_sign, FULL_LOOP, 1, 1, ain, aout };
-
-  return na_ndloop(&ndf, 1, self);
-}
-
-static void iter_int8_square(na_loop_t* const lp) {
-  size_t i, n;
-  char *p1, *p2;
-  ssize_t s1, s2;
-  size_t *idx1, *idx2;
-  dtype x;
-
-  INIT_COUNTER(lp, n);
-  INIT_PTR_IDX(lp, 0, p1, s1, idx1);
-  INIT_PTR_IDX(lp, 1, p2, s2, idx2);
-
-  if (idx1) {
-    if (idx2) {
-      for (i = 0; i < n; i++) {
-        GET_DATA_INDEX(p1, idx1, dtype, x);
-        x = m_square(x);
-        SET_DATA_INDEX(p2, idx2, dtype, x);
-      }
-    } else {
-      for (i = 0; i < n; i++) {
-        GET_DATA_INDEX(p1, idx1, dtype, x);
-        x = m_square(x);
-        SET_DATA_STRIDE(p2, s2, dtype, x);
-      }
-    }
-  } else {
-    if (idx2) {
-      for (i = 0; i < n; i++) {
-        GET_DATA_STRIDE(p1, s1, dtype, x);
-        x = m_square(x);
-        SET_DATA_INDEX(p2, idx2, dtype, x);
-      }
-    } else {
-      //
-      for (i = 0; i < n; i++) {
-        *(dtype*)p2 = m_square(*(dtype*)p1);
-        p1 += s1;
-        p2 += s2;
-      }
-      return;
-      //
-    }
-  }
-}
-
-/*
-  Unary square.
-  @overload square
-    @return [Numo::Int8] square of self.
-*/
-static VALUE int8_square(VALUE self) {
-  ndfunc_arg_in_t ain[1] = { { cT, 0 } };
-  ndfunc_arg_out_t aout[1] = { { cT, 0 } };
-  ndfunc_t ndf = { iter_int8_square, FULL_LOOP, 1, 1, ain, aout };
-
-  return na_ndloop(&ndf, 1, self);
-}
-
-static void iter_int8_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 int8_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_int8_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 int8_eq(VALUE self, VALUE other) {
-
-  VALUE klass, v;
-  klass = na_upcast(rb_obj_class(self), rb_obj_class(other));
-  if (klass == cT) {
-    return int8_eq_self(self, other);
-  } else {
-    v = rb_funcall(klass, id_cast, 1, self);
-    return rb_funcall(v, id_eq, 1, other);
-  }
-}
-
-static void iter_int8_ne(na_loop_t* const lp) {
-  size_t i;
-  char *p1, *p2;
-  BIT_DIGIT* a3;
-  size_t p3;
-  ssize_t s1, s2, s3;
-  dtype x, y;
-  BIT_DIGIT b;
-  INIT_COUNTER(lp, i);
-  INIT_PTR(lp, 0, p1, s1);
-  INIT_PTR(lp, 1, p2, s2);
-  INIT_PTR_BIT(lp, 2, a3, p3, s3);
-  for (; i--;) {
-    GET_DATA_STRIDE(p1, s1, dtype, x);
-    GET_DATA_STRIDE(p2, s2, dtype, y);
-    b = (m_ne(x, y)) ? 1 : 0;
-    STORE_BIT(a3, p3, b);
-    p3 += s3;
-  }
-}
-
-static VALUE int8_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_int8_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 int8_ne(VALUE self, VALUE other) {
-
-  VALUE klass, v;
-  klass = na_upcast(rb_obj_class(self), rb_obj_class(other));
-  if (klass == cT) {
-    return int8_ne_self(self, other);
-  } else {
-    v = rb_funcall(klass, id_cast, 1, self);
-    return rb_funcall(v, id_ne, 1, other);
-  }
-}
-
-#define check_intdivzero(y)                                                                    \
-  {}
-
-static void iter_int8_bit_and(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 (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_bit_and(((dtype*)p1)[i], *(dtype*)p2);
-        }
-      } else {
-        for (; i < n; i++) {
-          ((dtype*)p3)[i] = m_bit_and(((dtype*)p1)[i], *(dtype*)p2);
-        }
-      }
-    } else {
-      for (i = 0; i < n; i++) {
-        *(dtype*)p3 = m_bit_and(*(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_bit_and(*(dtype*)p1, *(dtype*)p2);
-        p1 += s1;
-        p2 += s2;
-      }
-    } else {
-      for (i = 0; i < n; i++) {
-        check_intdivzero(*(dtype*)p2);
-        *(dtype*)p3 = m_bit_and(*(dtype*)p1, *(dtype*)p2);
-        p1 += s1;
-        p2 += s2;
-        p3 += s3;
-      }
-    }
-  }
-
-  return;
-  //
-}
-#undef check_intdivzero
-
-static VALUE int8_bit_and_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_int8_bit_and, STRIDE_LOOP, 2, 1, ain, aout };
-
-  return na_ndloop(&ndf, 2, self, other);
-}
-
-/*
-  Binary bit_and.
-  @overload & other
-    @param [Numo::NArray,Numeric] other
-    @return [Numo::NArray] self & other
-*/
-static VALUE int8_bit_and(VALUE self, VALUE other) {
-
-  VALUE klass, v;
-
-  klass = na_upcast(rb_obj_class(self), rb_obj_class(other));
-  if (klass == cT) {
-    return int8_bit_and_self(self, other);
-  } else {
-    v = rb_funcall(klass, id_cast, 1, self);
-    return rb_funcall(v, '&', 1, other);
-  }
-}
-
-#define check_intdivzero(y)                                                                    \
-  {}
-
-static void iter_int8_bit_or(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 (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_bit_or(((dtype*)p1)[i], *(dtype*)p2);
-        }
-      } else {
-        for (; i < n; i++) {
-          ((dtype*)p3)[i] = m_bit_or(((dtype*)p1)[i], *(dtype*)p2);
-        }
-      }
-    } else {
-      for (i = 0; i < n; i++) {
-        *(dtype*)p3 = m_bit_or(*(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_bit_or(*(dtype*)p1, *(dtype*)p2);
-        p1 += s1;
-        p2 += s2;
-      }
-    } else {
-      for (i = 0; i < n; i++) {
-        check_intdivzero(*(dtype*)p2);
-        *(dtype*)p3 = m_bit_or(*(dtype*)p1, *(dtype*)p2);
-        p1 += s1;
-        p2 += s2;
-        p3 += s3;
-      }
-    }
-  }
-
-  return;
-  //
-}
-#undef check_intdivzero
-
-static VALUE int8_bit_or_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_int8_bit_or, STRIDE_LOOP, 2, 1, ain, aout };
-
-  return na_ndloop(&ndf, 2, self, other);
-}
-
-/*
-  Binary bit_or.
-  @overload | other
-    @param [Numo::NArray,Numeric] other
-    @return [Numo::NArray] self | other
-*/
-static VALUE int8_bit_or(VALUE self, VALUE other) {
-
-  VALUE klass, v;
-
-  klass = na_upcast(rb_obj_class(self), rb_obj_class(other));
-  if (klass == cT) {
-    return int8_bit_or_self(self, other);
-  } else {
-    v = rb_funcall(klass, id_cast, 1, self);
-    return rb_funcall(v, '|', 1, other);
-  }
-}
-
-#define check_intdivzero(y)                                                                    \
-  {}
-
-static void iter_int8_bit_xor(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 (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_bit_xor(((dtype*)p1)[i], *(dtype*)p2);
-        }
-      } else {
-        for (; i < n; i++) {
-          ((dtype*)p3)[i] = m_bit_xor(((dtype*)p1)[i], *(dtype*)p2);
-        }
-      }
-    } else {
-      for (i = 0; i < n; i++) {
-        *(dtype*)p3 = m_bit_xor(*(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_bit_xor(*(dtype*)p1, *(dtype*)p2);
-        p1 += s1;
-        p2 += s2;
-      }
-    } else {
-      for (i = 0; i < n; i++) {
-        check_intdivzero(*(dtype*)p2);
-        *(dtype*)p3 = m_bit_xor(*(dtype*)p1, *(dtype*)p2);
-        p1 += s1;
-        p2 += s2;
-        p3 += s3;
-      }
-    }
-  }
-
-  return;
-  //
-}
-#undef check_intdivzero
-
-static VALUE int8_bit_xor_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_int8_bit_xor, STRIDE_LOOP, 2, 1, ain, aout };
-
-  return na_ndloop(&ndf, 2, self, other);
-}
-
-/*
-  Binary bit_xor.
-  @overload ^ other
-    @param [Numo::NArray,Numeric] other
-    @return [Numo::NArray] self ^ other
-*/
-static VALUE int8_bit_xor(VALUE self, VALUE other) {
-
-  VALUE klass, v;
-
-  klass = na_upcast(rb_obj_class(self), rb_obj_class(other));
-  if (klass == cT) {
-    return int8_bit_xor_self(self, other);
-  } else {
-    v = rb_funcall(klass, id_cast, 1, self);
-    return rb_funcall(v, '^', 1, other);
-  }
-}
-
-static void iter_int8_bit_not(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) {
+  if (idx1) {
+    if (idx2) {
       for (i = 0; i < n; i++) {
         GET_DATA_INDEX(p1, idx1, dtype, x);
-        x = m_bit_not(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_bit_not(x);
+        x = m_reciprocal(x);
         SET_DATA_STRIDE(p2, s2, dtype, x);
       }
     }
@@ -2925,626 +1766,149 @@ static void iter_int8_bit_not(na_loop_t* const lp) {
     if (idx2) {
       for (i = 0; i < n; i++) {
         GET_DATA_STRIDE(p1, s1, dtype, x);
-        x = m_bit_not(x);
+        x = m_reciprocal(x);
         SET_DATA_INDEX(p2, idx2, dtype, x);
       }
     } else {
       //
-      for (i = 0; i < n; i++) {
-        *(dtype*)p2 = m_bit_not(*(dtype*)p1);
-        p1 += s1;
-        p2 += s2;
-      }
-      return;
-      //
-    }
-  }
-}
-
-/*
-  Unary bit_not.
-  @overload ~
-    @return [Numo::Int8] bit_not of self.
-*/
-static VALUE int8_bit_not(VALUE self) {
-  ndfunc_arg_in_t ain[1] = { { cT, 0 } };
-  ndfunc_arg_out_t aout[1] = { { cT, 0 } };
-  ndfunc_t ndf = { iter_int8_bit_not, FULL_LOOP, 1, 1, ain, aout };
-
-  return na_ndloop(&ndf, 1, self);
-}
-
-#define check_intdivzero(y)                                                                    \
-  {}
-
-static void iter_int8_left_shift(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 (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_left_shift(((dtype*)p1)[i], *(dtype*)p2);
-        }
-      } else {
-        for (; i < n; i++) {
-          ((dtype*)p3)[i] = m_left_shift(((dtype*)p1)[i], *(dtype*)p2);
-        }
-      }
-    } else {
-      for (i = 0; i < n; i++) {
-        *(dtype*)p3 = m_left_shift(*(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_left_shift(*(dtype*)p1, *(dtype*)p2);
-        p1 += s1;
-        p2 += s2;
-      }
-    } else {
-      for (i = 0; i < n; i++) {
-        check_intdivzero(*(dtype*)p2);
-        *(dtype*)p3 = m_left_shift(*(dtype*)p1, *(dtype*)p2);
-        p1 += s1;
-        p2 += s2;
-        p3 += s3;
-      }
-    }
-  }
-
-  return;
-  //
-}
-#undef check_intdivzero
-
-static VALUE int8_left_shift_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_int8_left_shift, STRIDE_LOOP, 2, 1, ain, aout };
-
-  return na_ndloop(&ndf, 2, self, other);
-}
-
-/*
-  Binary left_shift.
-  @overload << other
-    @param [Numo::NArray,Numeric] other
-    @return [Numo::NArray] self << other
-*/
-static VALUE int8_left_shift(VALUE self, VALUE other) {
-
-  VALUE klass, v;
-
-  klass = na_upcast(rb_obj_class(self), rb_obj_class(other));
-  if (klass == cT) {
-    return int8_left_shift_self(self, other);
-  } else {
-    v = rb_funcall(klass, id_cast, 1, self);
-    return rb_funcall(v, id_left_shift, 1, other);
-  }
-}
-
-#define check_intdivzero(y)                                                                    \
-  {}
-
-static void iter_int8_right_shift(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 (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_right_shift(((dtype*)p1)[i], *(dtype*)p2);
-        }
-      } else {
-        for (; i < n; i++) {
-          ((dtype*)p3)[i] = m_right_shift(((dtype*)p1)[i], *(dtype*)p2);
-        }
-      }
-    } else {
-      for (i = 0; i < n; i++) {
-        *(dtype*)p3 = m_right_shift(*(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_right_shift(*(dtype*)p1, *(dtype*)p2);
-        p1 += s1;
-        p2 += s2;
-      }
-    } else {
-      for (i = 0; i < n; i++) {
-        check_intdivzero(*(dtype*)p2);
-        *(dtype*)p3 = m_right_shift(*(dtype*)p1, *(dtype*)p2);
-        p1 += s1;
-        p2 += s2;
-        p3 += s3;
-      }
-    }
-  }
-
-  return;
-  //
-}
-#undef check_intdivzero
-
-static VALUE int8_right_shift_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_int8_right_shift, STRIDE_LOOP, 2, 1, ain, aout };
-
-  return na_ndloop(&ndf, 2, self, other);
-}
-
-/*
-  Binary right_shift.
-  @overload >> other
-    @param [Numo::NArray,Numeric] other
-    @return [Numo::NArray] self >> other
-*/
-static VALUE int8_right_shift(VALUE self, VALUE other) {
-
-  VALUE klass, v;
-
-  klass = na_upcast(rb_obj_class(self), rb_obj_class(other));
-  if (klass == cT) {
-    return int8_right_shift_self(self, other);
-  } else {
-    v = rb_funcall(klass, id_cast, 1, self);
-    return rb_funcall(v, id_right_shift, 1, other);
-  }
-}
-
-static void iter_int8_gt(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_gt(x, y)) ? 1 : 0;
-    STORE_BIT(a3, p3, b);
-    p3 += s3;
-  }
-}
-
-static VALUE int8_gt_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_int8_gt, STRIDE_LOOP, 2, 1, ain, aout };
-
-  return na_ndloop(&ndf, 2, self, other);
-}
-
-/*
-  Comparison gt other.
-  @overload gt other
-    @param [Numo::NArray,Numeric] other
-    @return [Numo::Bit] result of self gt other.
-*/
-static VALUE int8_gt(VALUE self, VALUE other) {
-
-  VALUE klass, v;
-  klass = na_upcast(rb_obj_class(self), rb_obj_class(other));
-  if (klass == cT) {
-    return int8_gt_self(self, other);
-  } else {
-    v = rb_funcall(klass, id_cast, 1, self);
-    return rb_funcall(v, id_gt, 1, other);
-  }
-}
-
-static void iter_int8_ge(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_ge(x, y)) ? 1 : 0;
-    STORE_BIT(a3, p3, b);
-    p3 += s3;
-  }
-}
-
-static VALUE int8_ge_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_int8_ge, STRIDE_LOOP, 2, 1, ain, aout };
-
-  return na_ndloop(&ndf, 2, self, other);
-}
-
-/*
-  Comparison ge other.
-  @overload ge other
-    @param [Numo::NArray,Numeric] other
-    @return [Numo::Bit] result of self ge other.
-*/
-static VALUE int8_ge(VALUE self, VALUE other) {
-
-  VALUE klass, v;
-  klass = na_upcast(rb_obj_class(self), rb_obj_class(other));
-  if (klass == cT) {
-    return int8_ge_self(self, other);
-  } else {
-    v = rb_funcall(klass, id_cast, 1, self);
-    return rb_funcall(v, id_ge, 1, other);
-  }
-}
-
-static void iter_int8_lt(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_lt(x, y)) ? 1 : 0;
-    STORE_BIT(a3, p3, b);
-    p3 += s3;
-  }
-}
-
-static VALUE int8_lt_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_int8_lt, STRIDE_LOOP, 2, 1, ain, aout };
-
-  return na_ndloop(&ndf, 2, self, other);
-}
-
-/*
-  Comparison lt other.
-  @overload lt other
-    @param [Numo::NArray,Numeric] other
-    @return [Numo::Bit] result of self lt other.
-*/
-static VALUE int8_lt(VALUE self, VALUE other) {
-
-  VALUE klass, v;
-  klass = na_upcast(rb_obj_class(self), rb_obj_class(other));
-  if (klass == cT) {
-    return int8_lt_self(self, other);
-  } else {
-    v = rb_funcall(klass, id_cast, 1, self);
-    return rb_funcall(v, id_lt, 1, other);
-  }
-}
-
-static void iter_int8_le(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_le(x, y)) ? 1 : 0;
-    STORE_BIT(a3, p3, b);
-    p3 += s3;
+      for (i = 0; i < n; i++) {
+        *(dtype*)p2 = m_reciprocal(*(dtype*)p1);
+        p1 += s1;
+        p2 += s2;
+      }
+      return;
+      //
+    }
   }
 }
 
-static VALUE int8_le_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_int8_le, STRIDE_LOOP, 2, 1, ain, aout };
-
-  return na_ndloop(&ndf, 2, self, other);
-}
-
 /*
-  Comparison le other.
-  @overload le other
-    @param [Numo::NArray,Numeric] other
-    @return [Numo::Bit] result of self le other.
+  Unary reciprocal.
+  @overload reciprocal
+    @return [Numo::Int8] reciprocal of self.
 */
-static VALUE int8_le(VALUE self, VALUE other) {
+static VALUE int8_reciprocal(VALUE self) {
+  ndfunc_arg_in_t ain[1] = { { cT, 0 } };
+  ndfunc_arg_out_t aout[1] = { { cT, 0 } };
+  ndfunc_t ndf = { iter_int8_reciprocal, FULL_LOOP, 1, 1, ain, aout };
 
-  VALUE klass, v;
-  klass = na_upcast(rb_obj_class(self), rb_obj_class(other));
-  if (klass == cT) {
-    return int8_le_self(self, other);
-  } else {
-    v = rb_funcall(klass, id_cast, 1, self);
-    return rb_funcall(v, id_le, 1, other);
-  }
+  return na_ndloop(&ndf, 1, self);
 }
 
-// ------- Integer count without weights -------
-
-static void iter_int8_bincount_32(na_loop_t* const lp) {
-  size_t i, x, n;
+static void iter_int8_sign(na_loop_t* const lp) {
+  size_t i, n;
   char *p1, *p2;
   ssize_t s1, s2;
-  size_t* idx1;
+  size_t *idx1, *idx2;
+  dtype x;
 
+  INIT_COUNTER(lp, n);
   INIT_PTR_IDX(lp, 0, p1, s1, idx1);
-  INIT_PTR(lp, 1, p2, s2);
-  i = lp->args[0].shape[0];
-  n = lp->args[1].shape[0];
-
-  // initialize
-  for (x = 0; x < n; x++) {
-    *(u_int32_t*)(p2 + s2 * x) = 0;
-  }
+  INIT_PTR_IDX(lp, 1, p2, s2, idx2);
 
   if (idx1) {
-    for (; i--;) {
-      GET_DATA_INDEX(p1, idx1, dtype, x);
-      (*(u_int32_t*)(p2 + s2 * x))++;
+    if (idx2) {
+      for (i = 0; i < n; i++) {
+        GET_DATA_INDEX(p1, idx1, dtype, x);
+        x = m_sign(x);
+        SET_DATA_INDEX(p2, idx2, dtype, x);
+      }
+    } else {
+      for (i = 0; i < n; i++) {
+        GET_DATA_INDEX(p1, idx1, dtype, x);
+        x = m_sign(x);
+        SET_DATA_STRIDE(p2, s2, dtype, x);
+      }
     }
   } else {
-    for (; i--;) {
-      GET_DATA_STRIDE(p1, s1, dtype, x);
-      (*(u_int32_t*)(p2 + s2 * x))++;
+    if (idx2) {
+      for (i = 0; i < n; i++) {
+        GET_DATA_STRIDE(p1, s1, dtype, x);
+        x = m_sign(x);
+        SET_DATA_INDEX(p2, idx2, dtype, x);
+      }
+    } else {
+      //
+      for (i = 0; i < n; i++) {
+        *(dtype*)p2 = m_sign(*(dtype*)p1);
+        p1 += s1;
+        p2 += s2;
+      }
+      return;
+      //
     }
   }
 }
 
-static VALUE int8_bincount_32(VALUE self, size_t length) {
-  size_t shape_out[1] = { length };
-  ndfunc_arg_in_t ain[1] = { { cT, 1 } };
-  ndfunc_arg_out_t aout[1] = { { numo_cUInt32, 1, shape_out } };
-  ndfunc_t ndf = {
-    iter_int8_bincount_32, NO_LOOP | NDF_STRIDE_LOOP | NDF_INDEX_LOOP, 1, 1, ain, aout
-  };
+/*
+  Unary sign.
+  @overload sign
+    @return [Numo::Int8] sign of self.
+*/
+static VALUE int8_sign(VALUE self) {
+  ndfunc_arg_in_t ain[1] = { { cT, 0 } };
+  ndfunc_arg_out_t aout[1] = { { cT, 0 } };
+  ndfunc_t ndf = { iter_int8_sign, FULL_LOOP, 1, 1, ain, aout };
 
   return na_ndloop(&ndf, 1, self);
 }
 
-static void iter_int8_bincount_64(na_loop_t* const lp) {
-  size_t i, x, n;
+static void iter_int8_square(na_loop_t* const lp) {
+  size_t i, n;
   char *p1, *p2;
   ssize_t s1, s2;
-  size_t* idx1;
+  size_t *idx1, *idx2;
+  dtype x;
 
+  INIT_COUNTER(lp, n);
   INIT_PTR_IDX(lp, 0, p1, s1, idx1);
-  INIT_PTR(lp, 1, p2, s2);
-  i = lp->args[0].shape[0];
-  n = lp->args[1].shape[0];
-
-  // initialize
-  for (x = 0; x < n; x++) {
-    *(u_int64_t*)(p2 + s2 * x) = 0;
-  }
+  INIT_PTR_IDX(lp, 1, p2, s2, idx2);
 
   if (idx1) {
-    for (; i--;) {
-      GET_DATA_INDEX(p1, idx1, dtype, x);
-      (*(u_int64_t*)(p2 + s2 * x))++;
+    if (idx2) {
+      for (i = 0; i < n; i++) {
+        GET_DATA_INDEX(p1, idx1, dtype, x);
+        x = m_square(x);
+        SET_DATA_INDEX(p2, idx2, dtype, x);
+      }
+    } else {
+      for (i = 0; i < n; i++) {
+        GET_DATA_INDEX(p1, idx1, dtype, x);
+        x = m_square(x);
+        SET_DATA_STRIDE(p2, s2, dtype, x);
+      }
     }
   } else {
-    for (; i--;) {
-      GET_DATA_STRIDE(p1, s1, dtype, x);
-      (*(u_int64_t*)(p2 + s2 * x))++;
+    if (idx2) {
+      for (i = 0; i < n; i++) {
+        GET_DATA_STRIDE(p1, s1, dtype, x);
+        x = m_square(x);
+        SET_DATA_INDEX(p2, idx2, dtype, x);
+      }
+    } else {
+      //
+      for (i = 0; i < n; i++) {
+        *(dtype*)p2 = m_square(*(dtype*)p1);
+        p1 += s1;
+        p2 += s2;
+      }
+      return;
+      //
     }
   }
 }
 
-static VALUE int8_bincount_64(VALUE self, size_t length) {
-  size_t shape_out[1] = { length };
-  ndfunc_arg_in_t ain[1] = { { cT, 1 } };
-  ndfunc_arg_out_t aout[1] = { { numo_cUInt64, 1, shape_out } };
-  ndfunc_t ndf = {
-    iter_int8_bincount_64, NO_LOOP | NDF_STRIDE_LOOP | NDF_INDEX_LOOP, 1, 1, ain, aout
-  };
-
-  return na_ndloop(&ndf, 1, self);
-}
-// ------- end of Integer count without weights -------
-
-// ------- Float count with weights -------
-
-static void iter_int8_bincount_sf(na_loop_t* const lp) {
-  float w;
-  size_t i, x, n, m;
-  char *p1, *p2, *p3;
-  ssize_t s1, s2, s3;
-
-  INIT_PTR(lp, 0, p1, s1);
-  INIT_PTR(lp, 1, p2, s2);
-  INIT_PTR(lp, 2, p3, s3);
-  i = lp->args[0].shape[0];
-  m = lp->args[1].shape[0];
-  n = lp->args[2].shape[0];
-
-  if (i != m) {
-    rb_raise(nary_eShapeError, "size mismatch along last axis between self and weight");
-  }
-
-  // initialize
-  for (x = 0; x < n; x++) {
-    *(float*)(p3 + s3 * x) = 0;
-  }
-  for (; i--;) {
-    GET_DATA_STRIDE(p1, s1, dtype, x);
-    GET_DATA_STRIDE(p2, s2, float, w);
-    (*(float*)(p3 + s3 * x)) += w;
-  }
-}
-
-static VALUE int8_bincount_sf(VALUE self, VALUE weight, size_t length) {
-  size_t shape_out[1] = { length };
-  ndfunc_arg_in_t ain[2] = { { cT, 1 }, { numo_cSFloat, 1 } };
-  ndfunc_arg_out_t aout[1] = { { numo_cSFloat, 1, shape_out } };
-  ndfunc_t ndf = { iter_int8_bincount_sf, NO_LOOP | NDF_STRIDE_LOOP, 2, 1, ain, aout };
-
-  return na_ndloop(&ndf, 2, self, weight);
-}
-
-static void iter_int8_bincount_df(na_loop_t* const lp) {
-  double w;
-  size_t i, x, n, m;
-  char *p1, *p2, *p3;
-  ssize_t s1, s2, s3;
-
-  INIT_PTR(lp, 0, p1, s1);
-  INIT_PTR(lp, 1, p2, s2);
-  INIT_PTR(lp, 2, p3, s3);
-  i = lp->args[0].shape[0];
-  m = lp->args[1].shape[0];
-  n = lp->args[2].shape[0];
-
-  if (i != m) {
-    rb_raise(nary_eShapeError, "size mismatch along last axis between self and weight");
-  }
-
-  // initialize
-  for (x = 0; x < n; x++) {
-    *(double*)(p3 + s3 * x) = 0;
-  }
-  for (; i--;) {
-    GET_DATA_STRIDE(p1, s1, dtype, x);
-    GET_DATA_STRIDE(p2, s2, double, w);
-    (*(double*)(p3 + s3 * x)) += w;
-  }
-}
-
-static VALUE int8_bincount_df(VALUE self, VALUE weight, size_t length) {
-  size_t shape_out[1] = { length };
-  ndfunc_arg_in_t ain[2] = { { cT, 1 }, { numo_cDFloat, 1 } };
-  ndfunc_arg_out_t aout[1] = { { numo_cDFloat, 1, shape_out } };
-  ndfunc_t ndf = { iter_int8_bincount_df, NO_LOOP | NDF_STRIDE_LOOP, 2, 1, ain, aout };
-
-  return na_ndloop(&ndf, 2, self, weight);
-}
-// ------- end of Float count with weights -------
-
 /*
-  Count the number of occurrences of each non-negative integer value.
-  Only Integer-types has this method.
-
-  @overload bincount([weight], minlength:nil)
-    @param [SFloat or DFloat or Array] weight (optional) Array of
-      float values. Its size along last axis should be same as that of self.
-    @param [Integer] minlength (keyword, optional) Minimum size along
-      last axis for the output array.
-    @return [UInt32 or UInt64 or SFloat or DFloat]
-      Returns Float NArray if weight array is supplied,
-      otherwise returns UInt32 or UInt64 depending on the size along last axis.
-  @example
-    Numo::Int32[0..4].bincount
-    # => Numo::UInt32#shape=[5]
-    # [1, 1, 1, 1, 1]
-
-    Numo::Int32[0, 1, 1, 3, 2, 1, 7].bincount
-    # => Numo::UInt32#shape=[8]
-    # [1, 3, 1, 1, 0, 0, 0, 1]
-
-    x = Numo::Int32[0, 1, 1, 3, 2, 1, 7, 23]
-    x.bincount.size == x.max+1
-    # => true
-
-    w = Numo::DFloat[0.3, 0.5, 0.2, 0.7, 1.0, -0.6]
-    x = Numo::Int32[0, 1, 1, 2, 2, 2]
-    x.bincount(w)
-    # => Numo::DFloat#shape=[3]
-    # [0.3, 0.7, 1.1]
-
+  Unary square.
+  @overload square
+    @return [Numo::Int8] square of self.
 */
-static VALUE int8_bincount(int argc, VALUE* argv, VALUE self) {
-  VALUE weight = Qnil, kw = Qnil;
-  VALUE opts[1] = { Qundef };
-  VALUE v, wclass;
-  ID table[1] = { id_minlength };
-  size_t length, minlength;
-
-  rb_scan_args(argc, argv, "01:", &weight, &kw);
-  rb_get_kwargs(kw, table, 0, 1, opts);
-
-  v = int8_minmax(0, 0, self);
-  if (m_num_to_data(RARRAY_AREF(v, 0)) < 0) {
-    rb_raise(rb_eArgError, "array items must be non-netagive");
-  }
-  v = RARRAY_AREF(v, 1);
-
-  length = NUM2SIZET(v) + 1;
-
-  if (opts[0] != Qundef) {
-    minlength = NUM2SIZET(opts[0]);
-    if (minlength > length) {
-      length = minlength;
-    }
-  }
+static VALUE int8_square(VALUE self) {
+  ndfunc_arg_in_t ain[1] = { { cT, 0 } };
+  ndfunc_arg_out_t aout[1] = { { cT, 0 } };
+  ndfunc_t ndf = { iter_int8_square, FULL_LOOP, 1, 1, ain, aout };
 
-  if (NIL_P(weight)) {
-    if (length > 4294967295ul) {
-      return int8_bincount_64(self, length);
-    } else {
-      return int8_bincount_32(self, length);
-    }
-  } else {
-    wclass = rb_obj_class(weight);
-    if (wclass == numo_cSFloat) {
-      return int8_bincount_sf(self, weight, length);
-    } else {
-      return int8_bincount_df(self, weight, length);
-    }
-  }
+  return na_ndloop(&ndf, 1, self);
 }
 
 static void iter_int8_poly(na_loop_t* const lp) {
@@ -4170,22 +2534,91 @@ void Init_numo_int8(void) {
   rb_define_singleton_method(cT, "cast", int8_s_cast, 1);
   rb_define_method(cT, "[]", int8_aref, -1);
   rb_define_method(cT, "[]=", int8_aset, -1);
+  /**
+   * return NArray with cast to the type of self.
+   * @overload coerce_cast(type)
+   *   @return [nil]
+   */
   rb_define_method(cT, "coerce_cast", int8_coerce_cast, 1);
+  /**
+   * Convert self to Array.
+   * @overload to_a
+   *   @return [Array]
+   */
   rb_define_method(cT, "to_a", int8_to_a, 0);
+  /**
+   * Fill elements with other.
+   * @overload fill other
+   *   @param [Numeric] other
+   *   @return [Numo::Int8] self.
+   */
   rb_define_method(cT, "fill", int8_fill, 1);
+  /**
+   * Format elements into strings.
+   * @overload format format
+   *   @param [String] format
+   *   @return [Numo::RObject] array of formatted strings.
+   */
   rb_define_method(cT, "format", int8_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", int8_format_to_a, -1);
+  /**
+   * Returns a string containing a human-readable representation of NArray.
+   * @overload inspect
+   *   @return [String]
+   */
   rb_define_method(cT, "inspect", int8_inspect, 0);
   rb_define_method(cT, "each", int8_each, 0);
   rb_define_method(cT, "map", int8_map, 0);
   rb_define_method(cT, "each_with_index", int8_each_with_index, 0);
   rb_define_method(cT, "map_with_index", int8_map_with_index, 0);
   rb_define_method(cT, "abs", int8_abs, 0);
+  /**
+   * Binary add.
+   * @overload + other
+   *   @param [Numo::NArray,Numeric] other
+   *   @return [Numo::NArray] self + other
+   */
   rb_define_method(cT, "+", int8_add, 1);
+  /**
+   * Binary sub.
+   * @overload - other
+   *   @param [Numo::NArray,Numeric] other
+   *   @return [Numo::NArray] self - other
+   */
   rb_define_method(cT, "-", int8_sub, 1);
+  /**
+   * Binary mul.
+   * @overload * other
+   *   @param [Numo::NArray,Numeric] other
+   *   @return [Numo::NArray] self * other
+   */
   rb_define_method(cT, "*", int8_mul, 1);
+  /**
+   * Binary div.
+   * @overload / other
+   *   @param [Numo::NArray,Numeric] other
+   *   @return [Numo::NArray] self / other
+   */
   rb_define_method(cT, "/", int8_div, 1);
+  /**
+   * Binary mod.
+   * @overload % other
+   *   @param [Numo::NArray,Numeric] other
+   *   @return [Numo::NArray] self % other
+   */
   rb_define_method(cT, "%", int8_mod, 1);
+  /**
+   * Binary divmod.
+   * @overload divmod other
+   *   @param [Numo::NArray,Numeric] other
+   *   @return [Numo::NArray] divmod of self and other.
+   */
   rb_define_method(cT, "divmod", int8_divmod, 1);
   rb_define_method(cT, "**", int8_pow, 1);
   rb_define_alias(cT, "pow", "**");
@@ -4196,24 +2629,95 @@ void Init_numo_int8(void) {
   rb_define_alias(cT, "conj", "view");
   rb_define_alias(cT, "im", "view");
   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", int8_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", int8_ne, 1);
   rb_define_alias(cT, "nearly_eq", "eq");
   rb_define_alias(cT, "close_to", "nearly_eq");
+  /**
+   * Binary bit_and.
+   * @overload & other
+   *   @param [Numo::NArray,Numeric] other
+   *   @return [Numo::NArray] self & other
+   */
   rb_define_method(cT, "&", int8_bit_and, 1);
+  /**
+   * Binary bit_or.
+   * @overload | other
+   *   @param [Numo::NArray,Numeric] other
+   *   @return [Numo::NArray] self | other
+   */
   rb_define_method(cT, "|", int8_bit_or, 1);
+  /**
+   * binary bit_xor.
+   * @overload ^ other
+   *   @param [numo::narray,numeric] other
+   *   @return [numo::narray] self ^ other
+   */
   rb_define_method(cT, "^", int8_bit_xor, 1);
+  /**
+   * Unary bit_not.
+   * @overload ~
+   *   @return [Numo::Int8] bit_not of self.
+   */
   rb_define_method(cT, "~", int8_bit_not, 0);
+  /**
+   * Binary left_shift.
+   * @overload << other
+   *   @param [Numo::NArray,Numeric] other
+   *   @return [Numo::NArray] self << other
+   */
   rb_define_method(cT, "<<", int8_left_shift, 1);
+  /**
+   * Binary right_shift.
+   * @overload >> other
+   *   @param [Numo::NArray,Numeric] other
+   *   @return [Numo::NArray] self >> other
+   */
   rb_define_method(cT, ">>", int8_right_shift, 1);
   rb_define_alias(cT, "floor", "view");
   rb_define_alias(cT, "round", "view");
   rb_define_alias(cT, "ceil", "view");
   rb_define_alias(cT, "trunc", "view");
   rb_define_alias(cT, "rint", "view");
+  /**
+   * Comparison gt other.
+   * @overload gt other
+   *   @param [Numo::NArray,Numeric] other
+   *   @return [Numo::Bit] result of self gt other.
+   */
   rb_define_method(cT, "gt", int8_gt, 1);
+  /**
+   * Comparison ge other.
+   * @overload ge other
+   *   @param [Numo::NArray,Numeric] other
+   *   @return [Numo::Bit] result of self ge other.
+   */
   rb_define_method(cT, "ge", int8_ge, 1);
+  /**
+   * Comparison lt other.
+   * @overload lt other
+   *   @param [Numo::NArray,Numeric] other
+   *   @return [Numo::Bit] result of self lt other.
+   */
   rb_define_method(cT, "lt", int8_lt, 1);
+  /**
+   * Comparison le other.
+   * @overload le other
+   *   @param [Numo::NArray,Numeric] other
+   *   @return [Numo::Bit] result of self le other.
+   */
   rb_define_method(cT, "le", int8_le, 1);
   rb_define_alias(cT, ">", "gt");
   rb_define_alias(cT, ">=", "ge");
@@ -4398,6 +2902,37 @@ void Init_numo_int8(void) {
    *   @return [Numo::Int8]
    */
   rb_define_module_function(cT, "minimum", int8_s_minimum, -1);
+  /**
+   * Count the number of occurrences of each non-negative integer value.
+   * Only Integer-types has this method.
+   *
+   * @overload bincount([weight], minlength:nil)
+   *   @param [SFloat or DFloat or Array] weight (optional) Array of
+   *     float values. Its size along last axis should be same as that of self.
+   *   @param [Integer] minlength (keyword, optional) Minimum size along
+   *     last axis for the output array.
+   *   @return [UInt32 or UInt64 or SFloat or DFloat]
+   *     Returns Float NArray if weight array is supplied,
+   *     otherwise returns UInt32 or UInt64 depending on the size along last axis.
+   * @example
+   *   Numo::Int32[0..4].bincount
+   *   # => Numo::UInt32#shape=[5]
+   *   # [1, 1, 1, 1, 1]
+   *
+   *   Numo::Int32[0, 1, 1, 3, 2, 1, 7].bincount
+   *   # => Numo::UInt32#shape=[8]
+   *   # [1, 3, 1, 1, 0, 0, 0, 1]
+   *
+   *   x = Numo::Int32[0, 1, 1, 3, 2, 1, 7, 23]
+   *   x.bincount.size == x.max+1
+   *   # => true
+   *
+   *   w = Numo::DFloat[0.3, 0.5, 0.2, 0.7, 1.0, -0.6]
+   *   x = Numo::Int32[0, 1, 1, 2, 2, 2]
+   *   x.bincount(w)
+   *   # => Numo::DFloat#shape=[3]
+   *   # [0.3, 0.7, 1.1]
+   */
   rb_define_method(cT, "bincount", int8_bincount, -1);
   /**
    * cumsum of self.