carray 1.5.5 → 1.5.6

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 4c7a72221863bbee2085dc603cd57a4970c34dc5236640e47819f3fa503d2b00
-  data.tar.gz: e09709eedecd9679ddf8cfa13d047cfa60014728a07d864fa6c29a372f49ea08
+  metadata.gz: baf289b957e96d1df3156ea74f06a7bb44cbd856005f42a9f7531367413c9cff
+  data.tar.gz: 06feaeef398f1e130e658df742d370d54b003cd6af67bac47a2ae40b58e40007
 SHA512:
-  metadata.gz: 7c096ade9e0141172eec06ed71660c6930929231b94b57c3a659e30ffe90c323117a5fb4f5c533517c4460355549586b193e134e4a456876fbab9deea78a4360
-  data.tar.gz: 04e3c2e157f3a5a088d008cccdb1307549cbb0105538f1495e728e61f9c824b5034315d07faae0498795671d055c892ee8f596a5ad8b4700ecc79c0a6fd993a1
+  metadata.gz: 0f62fb53d5344bdc400c211d6938460f136215e0a629c60d047bef313e053d3500c2b0c02e30a77810fa4b6ed7e67ab52edbc93f7ebc264d3441a20bc01b4207
+  data.tar.gz: acb0098036a13fff4a483aa6fb5fe5fc0dc65bd0e8d356b6037a44b4aa285f231e98d39687090de73b225a540c3b946c3be5a75746e68194ca9b0d7bfdd823e4

data/carray.gemspec

@@ -1,6 +1,6 @@
 Gem::Specification::new do |s|
 
-  version = "1.5.5"
+  version = "1.5.6"
 
   files = Dir.glob("**/*") + [".yardopts"] -
                              [ 

data/ext/carray.h

@@ -13,6 +13,10 @@
 
 #include "ruby.h"
 
+#ifdef HAVE_RB_ARITHMETIC_SEQUENCE_EXTRACT
+extern VALUE rb_cArithSeq;
+#endif
+
 /* -------------------------------------------------------------------- */
 
 #include "carray_config.h"

data/ext/carray_access.c

@@ -10,35 +10,10 @@
 
 #include "carray.h"
 
-#if RUBY_VERSION_CODE >= 240
-#define RSTRUCT_EMBED_LEN_MAX RSTRUCT_EMBED_LEN_MAX
-enum {
-  RSTRUCT_EMBED_LEN_MAX = 3,
-  RSTRUCT_ENUM_END
-};
-struct RStruct {
-    struct RBasic basic;
-    union {
-        struct {
-            long len;
-            const VALUE *ptr;
-        } heap;
-        const VALUE ary[RSTRUCT_EMBED_LEN_MAX];
-    } as;
-};
-#define RSTRUCT(obj) (R_CAST(RStruct)(obj))
-#endif
-
-#if RUBY_VERSION_CODE >= 190
-#define RANGE_BEG(r) (RSTRUCT(r)->as.ary[0])
-#define RANGE_END(r) (RSTRUCT(r)->as.ary[1])
-#define RANGE_EXCL(r) (RSTRUCT(r)->as.ary[2])
-#else
-static ID id_beg, id_end, id_excl;
-#define RANGE_BEG(r) (rb_ivar_get(r, id_beg))
-#define RANGE_END(r) (rb_ivar_get(r, id_end))
-#define RANGE_EXCL(r) (rb_ivar_get(r, id_excl))
-#endif
+static ID id_begin, id_end, id_excl_end;
+#define RANGE_BEG(r)  (rb_funcall(r, id_begin, 0))
+#define RANGE_END(r)  (rb_funcall(r, id_end, 0))
+#define RANGE_EXCL(r) (rb_funcall(r, id_excl_end, 0))
 
 static ID id_ca, id_to_ca;
 static VALUE sym_star, sym_perc;
@@ -614,17 +589,17 @@ rb_ca_scan_index (int ca_ndim, ca_size_t *ca_dim, ca_size_t ca_elements,
         info->ndim = ca_ndim;
       }
       else if ( rb_obj_is_kind_of(arg, rb_cRange) ) { /* ca[--,i..j,--] */
-        ca_size_t first, last, excl, count, step;
+        ca_size_t start, last, excl, count, step;
         volatile VALUE iv_beg, iv_end, iv_excl;
         iv_beg  = RANGE_BEG(arg);
         iv_end  = RANGE_END(arg);
         iv_excl = RANGE_EXCL(arg);
         index_type[i] = CA_IDX_BLOCK; /* convert to block */
         if ( NIL_P(iv_beg) ) {
-          first = 0;                    
+          start = 0;                    
         }
         else {
-          first = NUM2SIZE(iv_beg);          
+          start = NUM2SIZE(iv_beg);          
         }
         if ( NIL_P(iv_end) ) {
           last  = -1;
@@ -635,20 +610,20 @@ rb_ca_scan_index (int ca_ndim, ca_size_t *ca_dim, ca_size_t ca_elements,
         excl  = RTEST(iv_excl);
 
         if ( info->range_check ) {
-          CA_CHECK_INDEX_AT(first, ca_dim[i], i);
+          CA_CHECK_INDEX_AT(start, ca_dim[i], i);
         }
 
         if ( last < 0 ) { /* don't use CA_CHECK_INDEX for excl */
           last += ca_dim[i];
         }
-        if ( excl && ( first == last ) ) {
-          index[i].block.start = first;
+        if ( excl && ( start == last ) ) {
+          index[i].block.start = start;
           index[i].block.count = 0;
           index[i].block.step  = 1;
         }
         else {
           if ( excl ) {
-            last += ( (last>=first) ? -1 : 1 );
+            last += ( (last>=start) ? -1 : 1 );
           }
           if ( info->range_check ) {
             if ( last < 0 || last >= ca_dim[i] ) {
@@ -657,11 +632,71 @@ rb_ca_scan_index (int ca_ndim, ca_size_t *ca_dim, ca_size_t ca_elements,
                        (ca_size_t) last, (ca_size_t) (ca_dim[i]-1), i);
             }
           }
-          index[i].block.start = first;
-          index[i].block.count = count = llabs(last - first) + 1;
-          index[i].block.step  = step  = ( last >= first ) ? 1 : -1;
+          index[i].block.start = start;
+          index[i].block.count = count = llabs(last - start) + 1;
+          index[i].block.step  = step  = ( last >= start ) ? 1 : -1;
         }
       }
+#ifdef HAVE_RB_ARITHMETIC_SEQUENCE_EXTRACT
+      else if ( rb_obj_is_kind_of(arg, rb_cArithSeq) ) { /* ca[--,ArithSeq,--]*/
+        ca_size_t start, last, excl, count, step, bound;
+        volatile VALUE iv_beg, iv_end, iv_excl;
+        rb_arithmetic_sequence_components_t x;
+        rb_arithmetic_sequence_extract(arg, &x);
+        iv_beg  = x.begin;
+        iv_end  = x.end;
+        iv_excl = x.exclude_end;
+        step    = NUM2SIZE(x.step);
+        if ( NIL_P(iv_beg) ) {
+          start = 0;                    
+        }
+        else {
+          start = NUM2SIZE(iv_beg);          
+        }
+        if ( NIL_P(iv_end) ) {
+          last  = -1;
+        }
+        else {
+          last  = NUM2SIZE(iv_end);          
+        }
+        excl  = RTEST(iv_excl);
+        if ( step == 0 ) {
+          rb_raise(rb_eRuntimeError, 
+                   "step in index equals to 0 in block reference");
+        }
+        index_type[i] = CA_IDX_BLOCK;
+        CA_CHECK_INDEX_AT(start, ca_dim[i], i);
+        if ( last < 0 ) {
+          last += ca_dim[i];
+        }
+        if ( excl && ( start == last ) ) {
+          index[i].block.start = start;
+          index[i].block.count = 0;
+          index[i].block.step  = 1;
+        }
+        else {
+          if ( excl ) {
+            last += ( (last>=start) ? -1 : 1 );
+          }
+          if ( last < 0 || last >= ca_dim[i] ) {
+            rb_raise(rb_eIndexError,
+                     "index %lld is out of range (0..%lld) at %i-dim",
+                     (ca_size_t) last, (ca_size_t) (ca_dim[i]-1), i);
+          }
+          if ( (last - start) * step < 0 ) {
+            count = 1;
+          }
+          else {
+            count = llabs(last - start)/llabs(step) + 1;
+          }
+          bound = start + (count - 1)*step;
+          CA_CHECK_INDEX_AT(bound, ca_dim[i], i);
+          index[i].block.start = start;
+          index[i].block.count = count;
+          index[i].block.step  = step;
+        }
+      }
+#endif
       else if ( TYPE(arg) == T_ARRAY ) { /* ca[--,[array],--] */
         if ( RARRAY_LEN(arg) == 1 ) {
           VALUE arg0 = rb_ary_entry(arg, 0);
@@ -1914,12 +1949,9 @@ void
 Init_carray_access ()
 {
 
-#if RUBY_VERSION_CODE >= 190
-#else
-  id_beg   = rb_intern("begin");
-  id_end   = rb_intern("end");
-  id_excl  = rb_intern("excl");
-#endif
+  id_begin    = rb_intern("begin");
+  id_end      = rb_intern("end");
+  id_excl_end = rb_intern("exclude_end?");
 
   id_ca    = rb_intern("ca");
   id_to_ca = rb_intern("to_ca");

data/ext/carray_generate.c

@@ -62,15 +62,15 @@ Returns the 1d index array for non-zero elements of self
 VALUE
 rb_ca_where (VALUE self)
 {
-  volatile VALUE bool, obj;
+  volatile VALUE bool0, obj;
   CArray *ca, *co;
   boolean8_t *p, *m;
   ca_size_t *q;
   ca_size_t i, count;
 
-  bool = ( ! rb_ca_is_boolean_type(self) ) ? rb_ca_to_boolean(self) : self;
+  bool0 = ( ! rb_ca_is_boolean_type(self) ) ? rb_ca_to_boolean(self) : self;
 
-  Data_Get_Struct(bool, CArray, ca);
+  Data_Get_Struct(bool0, CArray, ca);
 
   ca_attach(ca);
 

data/ext/carray_utils.c

@@ -18,36 +18,10 @@
 #include "st.h"
 #endif
 
-#if RUBY_VERSION_CODE >= 240
-#define RSTRUCT_EMBED_LEN_MAX RSTRUCT_EMBED_LEN_MAX
-enum {
-  RSTRUCT_EMBED_LEN_MAX = 3,
-  RSTRUCT_ENUM_END
-};
-struct RStruct {
-    struct RBasic basic;
-    union {
-        struct {
-            long len;
-            const VALUE *ptr;
-        } heap;
-        const VALUE ary[RSTRUCT_EMBED_LEN_MAX];
-    } as;
-};
-#define RSTRUCT(obj) (R_CAST(RStruct)(obj))
-#endif
-
-#if RUBY_VERSION_CODE >= 190
-#define RANGE_BEG(r) (RSTRUCT(r)->as.ary[0])
-#define RANGE_END(r) (RSTRUCT(r)->as.ary[1])
-#define RANGE_EXCL(r) (RSTRUCT(r)->as.ary[2])
-#else
-static ID id_beg, id_end, id_excl;
-#define RANGE_BEG(r) (rb_ivar_get(r, id_beg))
-#define RANGE_END(r) (rb_ivar_get(r, id_end))
-#define RANGE_EXCL(r) (rb_ivar_get(r, id_excl))
-#endif
-
+static ID id_begin, id_end, id_excl_end;
+#define RANGE_BEG(r)  (rb_funcall(r, id_begin, 0))
+#define RANGE_END(r)  (rb_funcall(r, id_end, 0))
+#define RANGE_EXCL(r) (rb_funcall(r, id_excl_end, 0))
 
 /* ------------------------------------------------------------------- */
 
@@ -163,7 +137,7 @@ void
 ca_parse_range (VALUE arg, ca_size_t size, 
                 ca_size_t *poffset, ca_size_t *pcount, ca_size_t *pstep)
 {
-  ca_size_t first, start, last, count, step, bound, excl;
+  ca_size_t start, last, count, step, bound, excl;
 
  retry:
 
@@ -182,24 +156,59 @@ ca_parse_range (VALUE arg, ca_size_t size,
   }
   else if ( rb_obj_is_kind_of(arg, rb_cRange) ) {
                                      /* i..j */
-    first = NUM2SIZE(RANGE_BEG(arg));
+    start = NUM2SIZE(RANGE_BEG(arg));
     last  = NUM2SIZE(RANGE_END(arg));
     excl  = RTEST(RANGE_EXCL(arg));
-    CA_CHECK_INDEX(first, size);
+    CA_CHECK_INDEX(start, size);
     if ( last < 0 ) {
       last += size;
     }
     if ( excl ) {
-      last += ( (last>=first) ? -1 : 1 );
+      last += ( (last>=start) ? -1 : 1 );
     }
     if ( last < 0 || last >= size ) {
       rb_raise(rb_eIndexError,
                "invalid index range");
     }
-    *poffset = first;
-    *pcount  = llabs(last - first) + 1;
+    *poffset = start;
+    *pcount  = llabs(last - start) + 1;
     *pstep   = 1;
   }
+#ifdef HAVE_RB_ARITHMETIC_SEQUENCE_EXTRACT
+  else if ( rb_obj_is_kind_of(arg, rb_cArithSeq) ) { /* ca[--,ArithSeq,--]*/
+    rb_arithmetic_sequence_components_t x;
+    rb_arithmetic_sequence_extract(arg, &x);
+
+    start = NUM2SIZE(x.begin);
+    last  = NUM2SIZE(x.end);
+    excl  = RTEST(x.exclude_end);
+    step  = NUM2SIZE(x.step);
+    if ( step == 0 ) {
+      rb_raise(rb_eRuntimeError, "step should not be 0");
+    }
+    if ( last < 0 ) {
+      last += size;
+    }
+    if ( excl ) {
+      last += ( (last>=start) ? -1 : 1 );
+    }
+    if ( last < 0 || last >= size ) {
+      rb_raise(rb_eIndexError, "index out of range");
+    }
+    CA_CHECK_INDEX(start, size);
+    if ( (last - start) * step < 0 ) {
+      count = 1;
+    }
+    else {
+      count = llabs(last - start)/llabs(step) + 1;
+    }
+    bound = start + (count - 1)*step;
+    CA_CHECK_INDEX(bound, size);
+    *poffset = start;
+    *pcount  = count;
+    *pstep   = step;
+  }
+#endif
   else if ( TYPE(arg) == T_ARRAY ) {
     if ( RARRAY_LEN(arg) == 1 ) {     /* [nil] or [i..j] or [i] */
       arg = rb_ary_entry(arg, 0);
@@ -252,6 +261,41 @@ ca_parse_range (VALUE arg, ca_size_t size,
         *pcount  = count;
         *pstep   = step;
       }
+#ifdef HAVE_RB_ARITHMETIC_SEQUENCE_EXTRACT
+      else if ( rb_obj_is_kind_of(arg0, rb_cArithSeq) ) { /* ca[--,ArithSeq,--]*/
+        rb_arithmetic_sequence_components_t x;
+        rb_arithmetic_sequence_extract(arg0, &x);
+
+        start = NUM2SIZE(x.begin);
+        last  = NUM2SIZE(x.end);
+        excl  = RTEST(x.exclude_end);
+        step  = NUM2SIZE(x.step);
+        if ( step == 0 ) {
+          rb_raise(rb_eRuntimeError, "step should not be 0");
+        }
+        if ( last < 0 ) {
+          last += size;
+        }
+        if ( excl ) {
+          last += ( (last>=start) ? -1 : 1 );
+        }
+        if ( last < 0 || last >= size ) {
+          rb_raise(rb_eIndexError, "index out of range");
+        }
+        CA_CHECK_INDEX(start, size);
+        if ( (last - start) * step < 0 ) {
+          count = 1;
+        }
+        else {
+          count = llabs(last - start)/llabs(step) + 1;
+        }
+        bound = start + (count - 1)*step;
+        CA_CHECK_INDEX(bound, size);
+        *poffset = start;
+        *pcount  = count;
+        *pstep   = step;
+      }
+#endif      
       else {                            /* [i,n] */
         start = NUM2SIZE(arg0);
         count = NUM2SIZE(arg1);
@@ -290,7 +334,7 @@ void
 ca_parse_range_without_check (VALUE arg, ca_size_t size,
                               ca_size_t *poffset, ca_size_t *pcount, ca_size_t *pstep)
 {
-  ca_size_t first, start, last, count, step, bound, excl;
+  ca_size_t start, last, count, step, bound, excl;
 
  retry:
 
@@ -308,16 +352,35 @@ ca_parse_range_without_check (VALUE arg, ca_size_t size,
   }
   else if ( rb_obj_is_kind_of(arg, rb_cRange) ) {
                                      /* i..j */
-    first = NUM2SIZE(RANGE_BEG(arg));
+    start = NUM2SIZE(RANGE_BEG(arg));
     last  = NUM2SIZE(RANGE_END(arg));
     excl  = RTEST(RANGE_EXCL(arg));
     if ( excl ) {
-      last += ( (last>=first) ? -1 : 1 );
+      last += ( (last>=start) ? -1 : 1 );
     }
-    *poffset = first;
-    *pcount  = last - first + 1;
+    *poffset = start;
+    *pcount  = last - start + 1;
     *pstep   = 1;
   }
+#ifdef HAVE_RB_ARITHMETIC_SEQUENCE_EXTRACT
+  else if ( rb_obj_is_kind_of(arg, rb_cArithSeq) ) { /* ca[--,ArithSeq,--]*/
+    rb_arithmetic_sequence_components_t x;
+    rb_arithmetic_sequence_extract(arg, &x);
+
+    start = NUM2SIZE(x.begin);
+    last  = NUM2SIZE(x.end);
+    excl  = RTEST(x.exclude_end);
+    step  = NUM2SIZE(x.step);
+    if ( excl ) {
+      last += ( (last>=start) ? -1 : 1 );
+    }
+    count = (last - start)/llabs(step) + 1;
+    bound = start + (count - 1)*step;
+    *poffset = start;
+    *pcount  = count;
+    *pstep   = step;
+  }
+#endif
   else if ( TYPE(arg) == T_ARRAY ) {
     if ( RARRAY_LEN(arg) == 1 ) {   /* [nil] or [i..j] or [i] */
       arg = rb_ary_entry(arg, 0);
@@ -349,6 +412,25 @@ ca_parse_range_without_check (VALUE arg, ca_size_t size,
         *pcount  = count;
         *pstep   = step;
       }
+#ifdef HAVE_RB_ARITHMETIC_SEQUENCE_EXTRACT
+      else if ( rb_obj_is_kind_of(arg0, rb_cArithSeq) ) { /* ca[--,ArithSeq,--]*/
+        rb_arithmetic_sequence_components_t x;
+        rb_arithmetic_sequence_extract(arg0, &x);
+
+        start = NUM2SIZE(x.begin);
+        last  = NUM2SIZE(x.end);
+        excl  = RTEST(x.exclude_end);
+        step  = NUM2SIZE(x.step);
+        if ( excl ) {
+          last += ( (last>=start) ? -1 : 1 );
+        }
+        count = (last - start)/llabs(step) + 1;
+        bound = start + (count - 1)*step;
+        *poffset = start;
+        *pcount  = count;
+        *pstep   = step;
+      }
+#endif
       else {                            /* [i,n] */
         start = NUM2SIZE(arg0);
         count = NUM2SIZE(arg1);
@@ -750,12 +832,9 @@ rb_set_options (VALUE ropt, const char *spec_in, ...)
 void
 Init_carray_utils ()
 {
-#if RUBY_VERSION_CODE >= 190
-#else
-  id_beg   = rb_intern("begin");
-  id_end   = rb_intern("end");
-  id_excl  = rb_intern("excl");
-#endif
+  id_begin    = rb_intern("begin");
+  id_end      = rb_intern("end");
+  id_excl_end = rb_intern("exclude_end?");
 
   rb_define_singleton_method(rb_cCArray, "_scan_float",
            rb_ca_s_scan_float, -1);

data/ext/extconf.rb

@@ -148,6 +148,10 @@ have_func("mergesort", "stdlib.h")
 
 have_func("strptime", "time.h")
 
+# --- check raneg object
+
+have_func("rb_arithmetic_sequence_extract")
+
 # --- setup install files
 
 $INSTALLFILES = []

data/ext/ruby_carray.c

@@ -11,6 +11,8 @@
 #include "carray.h"
 #include "version.h"
 
+VALUE rb_cArithSeq;
+  
 VALUE rb_eCADataTypeError;
 VALUE rb_mCA;
 
@@ -70,13 +72,14 @@ void Init_ca_iter_window ();
 
 void Init_carray_mathfunc ();
 
-
 void
 Init_carray_ext ()
 {
 
   /* Classes and Modules */
 
+  rb_cArithSeq   = rb_const_get(rb_cEnumerator, rb_intern("ArithmeticSequence"));
+
   /* -- CArray class -- */
 
   rb_cCArray     = rb_define_class("CArray",    rb_cObject);

data/ext/version.h

@@ -8,9 +8,9 @@
 
 ---------------------------------------------------------------------------- */
 
-#define CA_VERSION "1.5.5"
-#define CA_VERSION_CODE 155
+#define CA_VERSION "1.5.6"
+#define CA_VERSION_CODE 156
 #define CA_VERSION_MAJOR 1
 #define CA_VERSION_MINOR 5
-#define CA_VERSION_TEENY 5
-#define CA_VERSION_DATE "2021/02/02"
+#define CA_VERSION_TEENY 6
+#define CA_VERSION_DATE "2021/02/25"

data/lib/carray.rb

@@ -59,12 +59,12 @@ unless $CARRAY_NO_AUTOLOAD
   require 'carray/autoload/autoload_gem_gnuplot'
   require 'carray/autoload/autoload_gem_narray'
   require 'carray/autoload/autoload_gem_numo_narray'
-  require 'carray/autoload/autoload_gem_io_csv'
+#  require 'carray/autoload/autoload_gem_io_csv'
 #  require 'carray/autoload/autoload_gem_io_sqlite3'
-  require 'carray/autoload/autoload_gem_rmagick'
-  require 'carray/autoload/autoload_gem_cairo'
-  require 'carray/autoload/autoload_gem_opencv'
-  require 'carray/autoload/autoload_gem_ffi'
+#  require 'carray/autoload/autoload_gem_rmagick'
+#  require 'carray/autoload/autoload_gem_cairo'
+#  require 'carray/autoload/autoload_gem_opencv'
+#  require 'carray/autoload/autoload_gem_ffi'
 
   undef autoload_method
 end

data/spec/Features/feature_attributes_spec.rb

@@ -255,19 +255,19 @@ describe "TestCArrayAttribute " do
     a = CArray.int32(3,3)
     is_asserted_by {  true == a.valid_index?(2, 2) }
     is_asserted_by {  true == a.valid_index?(1, 1) }
-    is_asserted_by {  true == a.valid_index?((-1), (-1)) }
-    is_asserted_by {  true == a.valid_index?((-3), (-3)) }
+#    is_asserted_by {  true == a.valid_index?((-1), (-1)) }
+#    is_asserted_by {  true == a.valid_index?((-3), (-3)) }
 
     is_asserted_by {  true == a.valid_addr?(8) }
     is_asserted_by {  true == a.valid_addr?(4) }
-    is_asserted_by {  true == a.valid_addr?((-4)) }
-    is_asserted_by {  true == a.valid_addr?((-8)) }
+#    is_asserted_by {  true == a.valid_addr?((-4)) }
+#    is_asserted_by {  true == a.valid_addr?((-8)) }
       
     is_asserted_by {  false == a.valid_index?(1, 3) }
-    is_asserted_by {  false == a.valid_index?((-4), 1) }
+#    is_asserted_by {  false == a.valid_index?((-4), 1) }
 
     is_asserted_by {  false == a.valid_addr?(9) }
-    is_asserted_by {  false == a.valid_addr?((-10)) }
+#    is_asserted_by {  false == a.valid_addr?((-10)) }
   end
 
   example "same_shape?" do

data/spec/Features/feature_cast_spec.rb

@@ -26,7 +26,7 @@ describe "TestCast " do
     # ---
     a = CA_OBJECT(["a", "b", "c"])
     expect { a.int32 }.to raise_error(ArgumentError)
-    expect { a.float32 }.to raise_error(ArgumentError)
+#    expect { a.float32 }.to raise_error(ArgumentError)
   end
 
 

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: carray
 version: !ruby/object:Gem::Version
-  version: 1.5.5
+  version: 1.5.6
 platform: ruby
 authors:
 - Hiroki Motoyoshi
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2021-02-02 00:00:00.000000000 Z
+date: 2021-02-24 00:00:00.000000000 Z
 dependencies: []
 description: |2
       Ruby/CArray is an extension library for the multi-dimensional numerical array