fibonacci 0.1.8 → 0.1.10

checksums.yaml

@@ -1,7 +1,7 @@
 ---
-SHA1:
-  metadata.gz: 00d1c8968bf446f0b4ce5ec0c2f89d56d81f3999
-  data.tar.gz: 4fc420e93c907198c3296bbd9ff1894366376e5d
+SHA256:
+  metadata.gz: 308698f8ba3046c3c5739f458419a27d9737e749c2ab4f5bfdff9ea2c12828ca
+  data.tar.gz: 7e58056a369c590049551d87bbb241964932dcd676fd8b89f036ae6b00a00ec8
 SHA512:
-  metadata.gz: b042fdac974e77f267337c2adaf9be05980664ba6d1f235510a043aa2652974563202899ab3fbd95b98d83ca2de298f8b2f23bac437e3248f8ffd0b257420fac
-  data.tar.gz: eec7e3ef052a2dbc8317f78f2b4551d18d8876cb31e20e19743d386afa0cdf5958c1bf383806f8dcc71cc3a5d518b335e492a9f9da7b3cfb0f0d2708bf953d03
+  metadata.gz: ed07c3ff1409a4d0daaf4dce7fc34c5eb51a27631ffe0eb9de0ce09d9445d4f26d482328861f1cacec171cb446bf889c2fc037212751e1d6e1128e93f7bd66bd
+  data.tar.gz: 51133cbf54f16a20481dee806b028f4efa077b9cf73653c5fa2bccd3e4205bc5b9e7b778ee85609eddfd9fff675e659d3c5fef3f612e7a00d0fdfb164757d131

data/LICENSE

@@ -0,0 +1,15 @@
+ISC License (ISC)
+
+Copyright (c) 2011, NagaChaitanya Vellanki <me@chaitanyavellanki.com>
+
+Permission to use, copy, modify, and/or distribute this software for any
+purpose with or without fee is hereby granted, provided that the above
+copyright notice and this permission notice appear in all copies.
+
+THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
+REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
+AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
+INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
+LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
+OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
+PERFORMANCE OF THIS SOFTWARE.

data/README.markdown

@@ -0,0 +1,87 @@
+Fibonacci is a Ruby gem written as a C-extension for exploring the Fibonacci series.
+===============================================================================
+
+-------------------------------------------------------------------------------
+Installation:
+-------------------------------------------------------------------------------
+
+    gem install fibonacci
+
+If you download the source and want to build locally:
+
+    bundle install
+    bundle exec rake test
+
+This will generate the extension Makefile, compile the native extension, and run the tests.
+
+If you want to build the extension manually:
+
+    cd ext/fibonacci
+    ruby extconf.rb
+    make
+
+-------------------------------------------------------------------------------
+Testing:
+-------------------------------------------------------------------------------
+
+From the project root:
+
+    bundle install
+    bundle exec rake test
+
+This is the recommended path for cloned source.
+
+-------------------------------------------------------------------------------
+Usage:
+-------------------------------------------------------------------------------
+
+    irb(main):001:0> require 'fibonacci'
+    #=> true
+
+    irb(main):002:0> fib = Fibonacci.new
+    #=> #<Fibonacci:0x000000025cf218>
+
+ fib.print(n) will print the first n terms of the series
+
+    irb(main):003:0> fib.print(5)
+    #=> 0
+        1
+        1
+        2
+        3
+
+ fib[n] will return the nth term of the series, the nth term is computed
+iteratively
+
+    irb(main):004:0> fib[1000]
+    #=> 43466557686937456435688527675040625802564660517371780402481729089536555417949051890403879840079255169295922593080322634775209689623239873322471161642996440906533187938298969649928516003704476137795166849228875
+
+ fib.matrix(n) will return the nth power of matrix(http://en.wikipedia.org/wiki/Fibonacci_number#Matrix_form)
+
+    irb(main):013:0> fib.matrix(100)
+    #=> [[573147844013817084101, 354224848179261915075], [354224848179261915075, 218922995834555169026]]
+
+
+ fib.terms(n) will return an array of first n terms of the series
+
+    irb(main):005:0> fib.terms(5)
+    #=> [0, 1, 1, 2, 3]
+
+ fib.num_digits(n) will return the number of digits in the nth term of series
+ (http://en.wikipedia.org/wiki/Fibonacci_number#Computation_by_rounding)
+
+    irb(main):007:0> fib.num_digits(1000)
+    #=> 209
+
+    irb(main):006:0> fib[1000].to_s.length
+    #=> 209
+
+ fib.fast_val(n) will return the nth term of the series, the nth term is
+ computed as the product of the Lucas numbers,
+
+ ref: Daisuke Takahashi, A fast algorithm for computing large Fibonacci
+ numbers, Information Processing Letters, Volume 75, Issue 6, 30 November
+ 2000, Pages 243-246, ISSN 0020-0190, 10.1016/S0020-0190(00)00112-5.
+
+    irb(main):004:0> fib.fast_val(10000)
+    #=> 33644764876431783266621612005107543310302148460680063906564769974680081442166662368155595513633734025582065332680836159373734790483865268263040892463056431887354544369559827491606602099884183933864652731300088830269235673613135117579297437854413752130520504347701602264758318906527890855154366159582987279682987510631200575428783453215515103870818298969791613127856265033195487140214287532698187962046936097879900350962302291026368131493195275630227837628441540360584402572114334961180023091208287046088923962328835461505776583271252546093591128203925285393434620904245248929403901706233888991085841065183173360437470737908552631764325733993712871937587746897479926305837065742830161637408969178426378624212835258112820516370298089332099905707920064367426202389783111470054074998459250360633560933883831923386783056136435351892133279732908133732642652633989763922723407882928177953580570993691049175470808931841056146322338217465637321248226383092103297701648054726243842374862411453093812206564914032751086643394517512161526545361333111314042436854805106765843493523836959653428071768775328348234345557366719731392746273629108210679280784718035329131176778924659089938635459327894523777674406192240337638674004021330343297496902028328145933418826817683893072003634795623117103101291953169794607632737589253530772552375943788434504067715555779056450443016640119462580972216729758615026968443146952034614932291105970676243268515992834709891284706740862008587135016260312071903172086094081298321581077282076353186624611278245537208532365305775956430072517744315051539600905168603220349163222640885248852433158051534849622434848299380905070483482449327453732624567755879089187190803662058009594743150052402532709746995318770724376825907419939632265984147498193609285223945039707165443156421328157688908058783183404917434556270520223564846495196112460268313970975069382648706613264507665074611512677522748621598642530711298441182622661057163515069260029861704945425047491378115154139941550671256271197133252763631939606902895650288268608362241082050562430701794976171121233066073310059947366875

data/Rakefile

@@ -0,0 +1,27 @@
+require "bundler/gem_tasks"
+require "rake/testtask"
+require "rbconfig"
+
+EXT_DIR = File.expand_path("ext/fibonacci", __dir__)
+EXT_NAME = "fibonacci_ext"
+EXT_FILE = File.join(EXT_DIR, "#{EXT_NAME}.#{RbConfig::CONFIG['DLEXT']}")
+
+file EXT_FILE => File.join(EXT_DIR, "extconf.rb") do
+  Dir.chdir(EXT_DIR) do
+    sh RbConfig.ruby, "extconf.rb"
+    sh "make"
+  end
+end
+
+task compile_extension: EXT_FILE
+
+Rake::TestTask.new do |t|
+  t.libs << "lib"
+  t.libs << EXT_DIR
+  t.test_files = FileList['test/**/*_test.rb']
+  t.verbose = true
+end
+
+task test: :compile_extension
+
+task default: :test

data/ext/fibonacci/extconf.rb

@@ -1,2 +1,2 @@
 require 'mkmf'
-create_makefile('fibonacci/fibonacci')
+create_makefile('fibonacci_ext')

data/ext/fibonacci/fibonacci.c

@@ -1,13 +1,18 @@
 /******************************************************************************
  *
- * Fibonacci Series
+ * Fibonacci Series (Modern Ruby C API version)
  *
  * Author: NagaChaitanya Vellanki
+ * Updated: 2026 - Ruby 3.0+ compatible
  *
- * ***************************************************************************/
+ ***************************************************************************/
 
 #include "ruby.h"
 
+/* Ruby version compatibility */
+#define RUBY_VERSION_MAJOR RUBY_API_VERSION_MAJOR
+#define RUBY_VERSION_MINOR RUBY_API_VERSION_MINOR
+
 #define ONE INT2NUM(1)
 #define ZERO INT2NUM(0)
 #define TWO INT2NUM(2)
@@ -16,156 +21,137 @@
 #define ARY_LEN 2L
 
 static VALUE cFibonacci;
+
+/* Pre-cached method IDs - initialized at module load time */
 static ID id_plus, id_lte, id_gte, id_lt, id_pow, id_minus, id_fdiv, id_div;
 static ID id_to_i, id_log10, id_floor, id_sqrt, id_mul, id_eq, id_not_eq;
-static ID id_mod, id_bit_and, id_log2;
+static ID id_mod, id_bit_and, id_log2, id_to_s;
+
+/* Inline helper for safer integer type checking */
+static inline int fib_is_valid_index(VALUE n) { return FIXNUM_P(n); }
 
-static VALUE
-fibonacci_init(VALUE self)
-{
-    return self;
+/* Inline helper to check if number is negative */
+static inline int fib_is_negative(VALUE n) {
+  return RTEST(rb_funcall(n, id_lt, 1, ZERO));
 }
 
-static VALUE
-rb_print_num(VALUE num)
-{
-    VALUE num_str =  rb_funcall(num, rb_intern("to_s"), 0);
-    char *cptr = StringValuePtr(num_str);
-    printf("%s\n", cptr);
-    return Qnil;
+/* Inline helper to compare equality with zero */
+static inline int fib_is_zero(VALUE n) {
+  return RTEST(rb_funcall(n, id_eq, 1, ZERO));
 }
 
+/* Inline helper for safe output */
+static inline void fib_print_value(VALUE num) {
+  VALUE num_str = rb_funcall(num, id_to_s, 0);
+  printf("%s\n", StringValueCStr(num_str));
+}
 
 /*  call-seq:
  *    fib.fast_val(n)
  *
- *  Returns a Fixnum or Bignum.
+ *  Returns a Fixnum or Bignum using fast matrix-based algorithm.
  *
  *   fib.fast_val(100)
  *   #=> 354224848179261915075
  *
- *   fib.fast_val(10)
- *   #=> 55
- *
- *   fib.fast_val(200)
- *   #=> 280571172992510140037611932413038677189525
- *
- *
  *  ref: Daisuke Takahashi, A fast algorithm for computing large Fibonacci
  *  numbers, Information Processing Letters, Volume 75, Issue 6, 30 November
  *  2000, Pages 243-246, ISSN 0020-0190, 10.1016/S0020-0190(00)00112-5.
  */
+static VALUE rb_fast_val(VALUE self, VALUE n) {
+  VALUE f, l, sign, mask, i, logn, logn_min_1, temp;
 
-static VALUE
-rb_fast_val(VALUE self, VALUE n)
-{
-    VALUE f, l, sign, mask, log2, i, logn, logn_min_1, temp;
-
-    if(TYPE(n) != T_FIXNUM)
-    {
-        rb_raise(rb_eArgError, "Invalid argument for type Fixnum");
-        return Qnil;
-    }
+  if (!fib_is_valid_index(n)) {
+    rb_raise(rb_eArgError, "Fibonacci index must be an integer");
+    return Qnil;
+  }
 
-    if(RTEST(rb_funcall(n, id_lt, 1, ZERO)))
-    {
-        rb_raise(rb_eArgError, "n cannot be negative");
-        return Qnil;
-    }
-    else
-    {
-      if(rb_equal(n, ZERO))
-      {
-        return ZERO;
-      }
-      else if(rb_equal(n, ONE))
-      {
-        return ONE;
-      }
-      else if(rb_equal(n, TWO))
-      {
-        return ONE;
-      }
-      else
-      {
-        f = ONE;
-        l = ONE;
-        sign = MINUS_ONE;
-        logn = rb_funcall(rb_mMath, id_log2, 1, n);
-        logn = rb_funcall(logn, id_floor, 0);
-        logn_min_1 = rb_funcall(logn, id_minus, 1, ONE);
-        mask = rb_funcall(TWO, id_pow, 1, logn_min_1);
-        for(i = ONE; RTEST(rb_funcall(i, id_lte, 1, logn_min_1)); i = rb_funcall(i, id_plus, 1, ONE))
-        {
-          temp = rb_funcall(f, id_mul, 1, f);
-          f = rb_funcall(f, id_plus, 1, l);
-          f = rb_funcall(f, id_div, 1, TWO);
-          f = rb_funcall(rb_funcall(f, id_mul, 1, f), id_mul, 1, TWO);
-          f = rb_funcall(f, id_minus, 1, rb_funcall(temp, id_mul, 1, THREE));
-          f = rb_funcall(f, id_minus, 1, rb_funcall(sign, id_mul, 1, TWO));
-          l = rb_funcall(temp, id_mul, 1, INT2NUM(5));
-          l = rb_funcall(l, id_plus, 1, rb_funcall(TWO, id_mul, 1, sign));
-          sign = ONE;
-          if(!rb_equal(rb_funcall(n, id_bit_and, 1, mask), ZERO))
-          {
-            temp = f;
-            f = rb_funcall(f, id_plus, 1, l);
-            f = rb_funcall(f, id_div, 1, TWO);
-            l = rb_funcall(TWO, id_mul, 1, temp);
-            l = rb_funcall(l, id_plus, 1, f);
-            sign = MINUS_ONE;
-          }
-          mask = rb_funcall(mask, id_div, 1, TWO);
-        }
-          if(rb_equal(rb_funcall(n, id_bit_and, 1, mask), ZERO))
-          {
-            f = rb_funcall(f, id_mul, 1, l);
-          }
-          else
-          {
-            f = rb_funcall(f, id_plus, 1, l);
-            f = rb_funcall(f, id_div, 1, TWO);
-            f = rb_funcall(f, id_mul, 1, l);
-            f = rb_funcall(f, id_minus, 1, sign);
-          }
-      }
+  if (fib_is_negative(n)) {
+    rb_raise(rb_eArgError, "Fibonacci index cannot be negative");
+    return Qnil;
+  }
+
+  if (fib_is_zero(n)) {
+    return ZERO;
+  }
+  if (rb_equal(n, ONE)) {
+    return ONE;
+  }
+  if (rb_equal(n, TWO)) {
+    return ONE;
+  }
+
+  f = ONE;
+  l = ONE;
+  sign = MINUS_ONE;
+  logn = rb_funcall(rb_mMath, id_log2, 1, n);
+  logn = rb_funcall(logn, id_floor, 0);
+  logn_min_1 = rb_funcall(logn, id_minus, 1, ONE);
+  mask = rb_funcall(TWO, id_pow, 1, logn_min_1);
+
+  for (i = ONE; RTEST(rb_funcall(i, id_lte, 1, logn_min_1));
+       i = rb_funcall(i, id_plus, 1, ONE)) {
+    temp = rb_funcall(f, id_mul, 1, f);
+    f = rb_funcall(f, id_plus, 1, l);
+    f = rb_funcall(f, id_div, 1, TWO);
+    f = rb_funcall(rb_funcall(f, id_mul, 1, f), id_mul, 1, TWO);
+    f = rb_funcall(f, id_minus, 1, rb_funcall(temp, id_mul, 1, THREE));
+    f = rb_funcall(f, id_minus, 1, rb_funcall(sign, id_mul, 1, TWO));
+    l = rb_funcall(temp, id_mul, 1, INT2NUM(5));
+    l = rb_funcall(l, id_plus, 1, rb_funcall(TWO, id_mul, 1, sign));
+    sign = ONE;
+
+    if (!rb_equal(rb_funcall(n, id_bit_and, 1, mask), ZERO)) {
+      temp = f;
+      f = rb_funcall(f, id_plus, 1, l);
+      f = rb_funcall(f, id_div, 1, TWO);
+      l = rb_funcall(TWO, id_mul, 1, temp);
+      l = rb_funcall(l, id_plus, 1, f);
+      sign = MINUS_ONE;
     }
-
-    return f;
+    mask = rb_funcall(mask, id_div, 1, TWO);
+  }
+
+  if (rb_equal(rb_funcall(n, id_bit_and, 1, mask), ZERO)) {
+    f = rb_funcall(f, id_mul, 1, l);
+  } else {
+    f = rb_funcall(f, id_plus, 1, l);
+    f = rb_funcall(f, id_div, 1, TWO);
+    f = rb_funcall(f, id_mul, 1, l);
+    f = rb_funcall(f, id_minus, 1, sign);
+  }
+
+  return f;
 }
 
-static VALUE
-rb_matrix_mul(VALUE ary1, VALUE ary2)
-{
-    long i, j, k;
-    VALUE temp;
-    VALUE tmp_ary = rb_ary_new2(ARY_LEN);
-    VALUE zero_ary = rb_ary_new2(ARY_LEN);
-
-    rb_ary_push(zero_ary, ZERO);
-    rb_ary_push(zero_ary, ZERO);
-    rb_ary_push(tmp_ary, zero_ary);
-
-    zero_ary = rb_ary_new2(ARY_LEN);
-    rb_ary_push(zero_ary, ZERO);
-    rb_ary_push(zero_ary, ZERO);
-    rb_ary_push(tmp_ary, zero_ary);
-
-    for(i = 0; i < 2; i++)
-    {
-        for(j = 0; j < 2; j++)
-        {
-            for(k = 0; k < 2; k++)
-            {
-                /* tmp[i][j] = (tmp[i][j] + ary1[i][k] * ary2[k][j]); */
-                temp = rb_funcall(rb_ary_entry(rb_ary_entry(ary1, i), k), id_mul,
-                        1, rb_ary_entry(rb_ary_entry(ary2, k), j));
-                rb_ary_store(rb_ary_entry(tmp_ary, i), j, rb_funcall(temp, id_plus, 1, rb_ary_entry(rb_ary_entry(tmp_ary, i), j)));
-            }
-        }
+static VALUE rb_matrix_mul(VALUE ary1, VALUE ary2) {
+  long i, j, k;
+  VALUE temp;
+  VALUE tmp_ary = rb_ary_new2(ARY_LEN);
+  VALUE zero_ary = rb_ary_new2(ARY_LEN);
+
+  rb_ary_push(zero_ary, ZERO);
+  rb_ary_push(zero_ary, ZERO);
+  rb_ary_push(tmp_ary, zero_ary);
+
+  zero_ary = rb_ary_new2(ARY_LEN);
+  rb_ary_push(zero_ary, ZERO);
+  rb_ary_push(zero_ary, ZERO);
+  rb_ary_push(tmp_ary, zero_ary);
+
+  for (i = 0; i < 2; i++) {
+    for (j = 0; j < 2; j++) {
+      for (k = 0; k < 2; k++) {
+        temp = rb_funcall(rb_ary_entry(rb_ary_entry(ary1, i), k), id_mul, 1,
+                          rb_ary_entry(rb_ary_entry(ary2, k), j));
+        rb_ary_store(rb_ary_entry(tmp_ary, i), j,
+                     rb_funcall(temp, id_plus, 1,
+                                rb_ary_entry(rb_ary_entry(tmp_ary, i), j)));
+      }
     }
+  }
 
-    return tmp_ary;
+  return tmp_ary;
 }
 
 /*  call-seq:
@@ -175,195 +161,131 @@ rb_matrix_mul(VALUE ary1, VALUE ary2)
  *
  *   fib.matrix(10)
  *   #=> [[89, 55], [55, 34]]
- *
- *   fib.matrix(100)
- *   #=> [[573147844013817084101, 354224848179261915075], [354224848179261915075,218922995834555169026]]
- *
- *   arr = fib.matrix(15)
- *   #=> [[987, 610], [610, 377]]
- *
- *   arr[0][1] or arr[1][0] is the value of nth term
- *
- *  Refer to http://en.wikipedia.org/wiki/Fibonacci_number#Matrix_form
  */
+static VALUE rb_matrix_form(VALUE self, VALUE n) {
+  VALUE base_ary, res_ary, tmp_ary;
 
-static VALUE
-rb_matrix_form(VALUE self, VALUE n)
-{
-    VALUE base_ary;
-    VALUE res_ary;
-    VALUE tmp_ary;
-    long ary_len = 2;
-
-    if(TYPE(n) != T_FIXNUM)
-    {
-        rb_raise(rb_eArgError, "Invalid argument for type Fixnum");
-        return Qnil;
-    }
+  if (!fib_is_valid_index(n)) {
+    rb_raise(rb_eArgError, "Matrix index must be an integer");
+    return Qnil;
+  }
 
-    if(RTEST(rb_funcall(n, id_lt, 1, ZERO)))
-    {
-        rb_raise(rb_eArgError, "n cannot be negative");
-        return Qnil;
-    }
-    else
-    {
-        base_ary = rb_ary_new2(ARY_LEN);
-        res_ary =  rb_ary_new2(ARY_LEN);
-        tmp_ary = rb_ary_new2(ARY_LEN);
-
-        /* base is {{1, 1}, {1, 0}} */
-        rb_ary_push(tmp_ary, ONE);
-        rb_ary_push(tmp_ary, ONE);
-        rb_ary_push(base_ary, tmp_ary);
-
-        tmp_ary = rb_ary_new2(ARY_LEN);
-        rb_ary_push(tmp_ary, ONE);
-        rb_ary_push(tmp_ary, ZERO);
-        rb_ary_push(base_ary, tmp_ary);
-
-        /* res is {{1, 0}, {0, 1}} */
-        tmp_ary = rb_ary_new2(ARY_LEN);
-        rb_ary_push(tmp_ary, ONE);
-        rb_ary_push(tmp_ary, ZERO);
-        rb_ary_push(res_ary, tmp_ary);
-
-        tmp_ary = rb_ary_new2(ARY_LEN);
-        rb_ary_push(tmp_ary, ZERO);
-        rb_ary_push(tmp_ary, ONE);
-        rb_ary_push(res_ary, tmp_ary);
-
-        while(!rb_equal(n, ZERO))
-        {
-            if(rb_equal(rb_funcall(n, id_mod, 1, TWO), ZERO))
-            {
-                n = rb_funcall(n, id_div, 1, TWO);
-                base_ary = rb_matrix_mul(base_ary, base_ary);
-            }
-            else
-            {
-                n = rb_funcall(n, id_minus, 1, ONE);
-                res_ary = rb_matrix_mul(res_ary, base_ary);
-            }
-        }
+  if (fib_is_negative(n)) {
+    rb_raise(rb_eArgError, "Matrix index cannot be negative");
+    return Qnil;
+  }
+
+  base_ary = rb_ary_new2(ARY_LEN);
+  res_ary = rb_ary_new2(ARY_LEN);
+
+  /* base is {{1, 1}, {1, 0}} */
+  tmp_ary = rb_ary_new2(ARY_LEN);
+  rb_ary_push(tmp_ary, ONE);
+  rb_ary_push(tmp_ary, ONE);
+  rb_ary_push(base_ary, tmp_ary);
+
+  tmp_ary = rb_ary_new2(ARY_LEN);
+  rb_ary_push(tmp_ary, ONE);
+  rb_ary_push(tmp_ary, ZERO);
+  rb_ary_push(base_ary, tmp_ary);
+
+  /* res is {{1, 0}, {0, 1}} */
+  tmp_ary = rb_ary_new2(ARY_LEN);
+  rb_ary_push(tmp_ary, ONE);
+  rb_ary_push(tmp_ary, ZERO);
+  rb_ary_push(res_ary, tmp_ary);
+
+  tmp_ary = rb_ary_new2(ARY_LEN);
+  rb_ary_push(tmp_ary, ZERO);
+  rb_ary_push(tmp_ary, ONE);
+  rb_ary_push(res_ary, tmp_ary);
+
+  while (!rb_equal(n, ZERO)) {
+    if (rb_equal(rb_funcall(n, id_mod, 1, TWO), ZERO)) {
+      n = rb_funcall(n, id_div, 1, TWO);
+      base_ary = rb_matrix_mul(base_ary, base_ary);
+    } else {
+      n = rb_funcall(n, id_minus, 1, ONE);
+      res_ary = rb_matrix_mul(res_ary, base_ary);
     }
+  }
 
-    return res_ary;
+  return res_ary;
 }
 
 /*  call-seq:
  *    fib[n]
  *
- *  Returns a Fixnum or Bignum.
+ *  Returns the nth Fibonacci number (iterative calculation).
  *
  *   fib[100]
  *   #=> 354224848179261915075
- *
- *   fib[10]
- *   #=> 55
- *
- *   fib[200]
- *   #=> 280571172992510140037611932413038677189525
- *
- *  The value of nth term is calculated iteratively.
- *
- *  Refer to http://en.wikipedia.org/wiki/Fibonacci_number#First_identity
  */
+static VALUE rb_iterative_val(VALUE self, VALUE n) {
+  VALUE start = TWO;
+  VALUE fib_n_1 = ONE;
+  VALUE fib_n_2 = ZERO;
+  VALUE fib_n = ZERO;
+
+  if (!fib_is_valid_index(n)) {
+    rb_raise(rb_eArgError, "Index must be an integer");
+    return Qnil;
+  }
 
-static VALUE
-rb_iterative_val(VALUE self, VALUE n)
-{
-    VALUE start = TWO;
-    VALUE fib_n_1 = ONE;
-    VALUE fib_n_2 = ZERO;
-    VALUE fib_n = ZERO;
-
-    if(TYPE(n) != T_FIXNUM)
-    {
-        rb_raise(rb_eArgError, "Invalid argument for type Fixnum");
-        return Qnil;
-    }
-
-    if(RTEST(rb_funcall(n, id_lt, 1, ZERO)))
-    {
-        rb_raise(rb_eArgError, "n cannot be negative");
-        return Qnil;
+  if (fib_is_negative(n)) {
+    rb_raise(rb_eArgError, "Index cannot be negative");
+    return Qnil;
+  }
+
+  if (fib_is_zero(n)) {
+    fib_n = ZERO;
+  } else if (rb_equal(n, ONE)) {
+    fib_n = ONE;
+  } else {
+    for (start; RTEST(rb_funcall(start, id_lte, 1, n));
+         start = rb_funcall(start, id_plus, 1, ONE)) {
+      fib_n = rb_funcall(fib_n_1, id_plus, 1, fib_n_2);
+      fib_n_2 = fib_n_1;
+      fib_n_1 = fib_n;
     }
+  }
 
-    if(rb_equal(n, ZERO))
-    {
-      fib_n = ZERO;
-    }
-    else if(rb_equal(n, ONE))
-    {
-      fib_n = ONE;
-    }
-    else
-    {
-      for(start; RTEST(rb_funcall(start, id_lte, 1, n)); start = rb_funcall(start, id_plus, 1, ONE))
-      {
-        fib_n = rb_funcall(fib_n_1, id_plus, 1, fib_n_2);
-        fib_n_2 = fib_n_1;
-        fib_n_1 = fib_n;
-      }
-    }
-    return fib_n;
+  return fib_n;
 }
 
 /*  call-seq:
  *    fib.terms(n)
  *
- *  Returns a array with the first n terms of the series
+ *  Returns array with the first n terms of the series
  *
  *   fib.terms(5)
  *   #=> [0, 1, 1, 2, 3]
- *
- *   fib.terms(10)
- *   #=> [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
- *
- *   fib.terms(15)
- *   #=> [0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377]
- *
- *   fib.terms(0)
- *   #=> []
- *
- *  Refer to http://en.wikipedia.org/wiki/Fibonacci_number#First_identity
  */
+static VALUE terms(VALUE self, VALUE n) {
+  long ary_len = NUM2LONG(n);
+  long i;
+  VALUE ary;
 
-static VALUE
-terms(VALUE self, VALUE n)
-{
-    long ary_len = NUM2LONG(n);
-    long i;
-    VALUE ary = Qnil;
-
-    if(ary_len < 0)
-    {
-        rb_raise(rb_eArgError, "num terms cannot be negative");
-        return ary;
+  if (ary_len < 0) {
+    rb_raise(rb_eArgError, "Number of terms cannot be negative");
+    return Qnil;
+  }
+
+  ary = rb_ary_new2(ary_len);
+
+  for (i = 0; i < ary_len; i++) {
+    if (i == 0) {
+      rb_ary_store(ary, i, ZERO);
+    } else if (i <= 2) {
+      rb_ary_store(ary, i, ONE);
+    } else {
+      rb_ary_store(ary, i,
+                   rb_funcall(rb_ary_entry(ary, i - 1), id_plus, 1,
+                              rb_ary_entry(ary, i - 2)));
     }
+  }
 
-    ary = rb_ary_new2(ary_len);
-
-    for(i=0; i < ary_len; i++)
-    {
-        if(i == 0)
-        {
-            rb_ary_store(ary, i, ZERO);
-        }
-        if((i > 0))
-        {
-            if(i <= 2)
-            {
-                rb_ary_store(ary, i, ONE);
-            }
-            else
-            {
-                rb_ary_store(ary, i, rb_funcall(rb_ary_entry(ary, i-1), id_plus, 1, rb_ary_entry(ary, i-2)));
-            }
-        }
-    }
-    return ary;
+  return ary;
 }
 
 /*  call-seq:
@@ -371,162 +293,133 @@ terms(VALUE self, VALUE n)
  *
  *  Prints the first n terms of the series.
  *
- *   fib.print(1)
- *   #=>   0
- *
- *   fib.print(2)
- *   #=>   0
- *         1
  *   fib.print(5)
  *   #=>    0
  *          1
  *          1
  *          2
  *          3
- *
  */
-
-static VALUE
-print(VALUE self, VALUE n)
-{
-    VALUE start = ZERO;
-    VALUE fib_n_1 = ONE;
-    VALUE fib_n_2 = ZERO;
-    VALUE fib_n = ZERO;
-
-    if(TYPE(n) != T_FIXNUM)
-    {
-        rb_raise(rb_eArgError, "Invalid argument for type Fixnum");
-        return Qnil;
-    }
-
-    if(RTEST(rb_funcall(n, id_lt, 1, ZERO)))
-    {
-        rb_raise(rb_eArgError, "n cannot be negative");
-        return Qnil;
-    }
-
-    for(start; RTEST(rb_funcall(start, id_lt, 1, n)); start = rb_funcall(start, id_plus, 1, ONE))
-    {
-        if(rb_equal(start, ZERO))
-        {
-            rb_print_num(ZERO);
-        }
-        else if(rb_equal(start, ONE))
-        {
-            rb_print_num(ONE);
-        }
-        else
-        {
-            fib_n = rb_funcall(fib_n_1, id_plus, 1, fib_n_2);
-            fib_n_2 = fib_n_1;
-            fib_n_1 = fib_n;
-            rb_print_num(fib_n);
-        }
-    }
+static VALUE print_terms(VALUE self, VALUE n) {
+  VALUE start = ZERO;
+  VALUE fib_n_1 = ONE;
+  VALUE fib_n_2 = ZERO;
+  VALUE fib_n = ZERO;
+
+  if (!fib_is_valid_index(n)) {
+    rb_raise(rb_eArgError, "Argument must be an integer");
     return Qnil;
-}
+  }
 
-static VALUE
-index_of(VALUE self, VALUE val)
-{
+  if (fib_is_negative(n)) {
+    rb_raise(rb_eArgError, "Argument cannot be negative");
     return Qnil;
+  }
+
+  for (start; RTEST(rb_funcall(start, id_lt, 1, n));
+       start = rb_funcall(start, id_plus, 1, ONE)) {
+    if (rb_equal(start, ZERO)) {
+      fib_print_value(ZERO);
+    } else if (rb_equal(start, ONE)) {
+      fib_print_value(ONE);
+    } else {
+      fib_n = rb_funcall(fib_n_1, id_plus, 1, fib_n_2);
+      fib_n_2 = fib_n_1;
+      fib_n_1 = fib_n;
+      fib_print_value(fib_n);
+    }
+  }
+
+  return Qnil;
 }
 
 /*  call-seq:
  *    fib.num_digits(n)
  *
- *  Returns the number of digits in the nth term of the series
- *
- *   fib.num_digits(10)
- *   #=> 2
+ *  Returns the number of digits in the nth Fibonacci number
  *
  *   fib.num_digits(100)
  *   #=> 21
- *
- *  Refer to http://en.wikipedia.org/wiki/Fibonacci_number#Computation_by_rounding
  */
+static VALUE num_digits(VALUE self, VALUE n) {
+  VALUE phi, num_digits, log_sqrt_5, sqrt_5;
 
-static VALUE
-num_digits(VALUE self, VALUE n)
-{
-    if(TYPE(n) != T_FIXNUM)
-    {
-        rb_raise(rb_eArgError, "Invalid argument for type Fixnum");
-        return Qnil;
-    }
+  if (!fib_is_valid_index(n)) {
+    rb_raise(rb_eArgError, "Argument must be an integer");
+    return Qnil;
+  }
 
-    if(RTEST(rb_funcall(n, id_lt, 1, ZERO)))
-    {
-        rb_raise(rb_eArgError, "n cannot be negative");
-        return Qnil;
-    }
+  if (fib_is_negative(n)) {
+    rb_raise(rb_eArgError, "Argument cannot be negative");
+    return Qnil;
+  }
 
-    VALUE phi = ONE;
-    VALUE num_digits = ZERO;
-    VALUE log_sqrt_5 = ZERO;
-    VALUE sqrt_5;
+  if (fib_is_zero(n)) {
+    return ZERO;
+  }
 
-    if(rb_equal(n, ZERO))
-    {
-      return ZERO;
-    }
+  if (rb_equal(n, ONE)) {
+    return ONE;
+  }
 
-    /*  work around since the value log(phi/sqrt(5)) + 1 = 0.8595026380819693
-     *  converting to integer would be zero */
-    if(rb_equal(n, ONE))
-    {
-      return ONE;
-    }
+  if (!RTEST(rb_funcall(n, id_gte, 1, TWO))) {
+    return Qnil;
+  }
 
-    if(RTEST(rb_funcall(n, id_gte, 1, TWO)))
-    {
-      sqrt_5 = rb_funcall(rb_mMath, id_sqrt, 1, INT2NUM(5));
-      log_sqrt_5 = rb_funcall(rb_mMath, id_log10, 1, sqrt_5);
+  phi = ONE;
+  num_digits = ZERO;
+  log_sqrt_5 = ZERO;
 
-      phi = rb_funcall(phi, id_plus, 1, sqrt_5);
-      phi = rb_funcall(phi, id_fdiv, 1, TWO);
+  sqrt_5 = rb_funcall(rb_mMath, id_sqrt, 1, INT2NUM(5));
+  log_sqrt_5 = rb_funcall(rb_mMath, id_log10, 1, sqrt_5);
 
-      num_digits = rb_funcall(rb_mMath, id_log10, 1, phi);
-      num_digits = rb_funcall(num_digits, id_mul, 1, n);
-      num_digits = rb_funcall(num_digits, id_minus, 1, log_sqrt_5);
+  phi = rb_funcall(phi, id_plus, 1, sqrt_5);
+  phi = rb_funcall(phi, id_fdiv, 1, TWO);
 
-      num_digits = rb_funcall(num_digits, id_floor, 0);
-      num_digits = rb_funcall(num_digits, id_plus, 1, ONE);
-      num_digits = rb_funcall(num_digits, id_to_i, 0);
+  num_digits = rb_funcall(rb_mMath, id_log10, 1, phi);
+  num_digits = rb_funcall(num_digits, id_mul, 1, n);
+  num_digits = rb_funcall(num_digits, id_minus, 1, log_sqrt_5);
+  num_digits = rb_funcall(num_digits, id_floor, 0);
+  num_digits = rb_funcall(num_digits, id_plus, 1, ONE);
+  num_digits = rb_funcall(num_digits, id_to_i, 0);
 
-      return num_digits;
-    }
+  return num_digits;
 }
 
-void
-Init_fibonacci(void)
-{
-    id_plus = rb_intern("+");
-    id_lte = rb_intern("<=");
-    id_lt = rb_intern("<");
-    id_gte = rb_intern(">=");
-    id_pow = rb_intern("**");
-    id_mul = rb_intern("*");
-    id_minus = rb_intern("-");
-    id_fdiv = rb_intern("fdiv");
-    id_div = rb_intern("/");
-    id_to_i = rb_intern("to_i");
-    id_log10 = rb_intern("log10");
-    id_log2 = rb_intern("log2");
-    id_floor = rb_intern("floor");
-    id_sqrt = rb_intern("sqrt");
-    id_eq = rb_intern("==");
-    id_not_eq = rb_intern("!=");
-    id_mod = rb_intern("!=");
-    id_bit_and = rb_intern("&");
-
-    cFibonacci = rb_define_class("Fibonacci", rb_cObject);
-    rb_define_method(cFibonacci, "initialize", fibonacci_init, 0);
-    rb_define_method(cFibonacci, "print", print, 1);
-    rb_define_method(cFibonacci, "terms", terms, 1);
-    rb_define_method(cFibonacci, "num_digits", num_digits, 1);
-    rb_define_method(cFibonacci, "[]", rb_iterative_val, 1);
-    rb_define_method(cFibonacci, "matrix", rb_matrix_form, 1);
-    rb_define_method(cFibonacci, "fast_val", rb_fast_val, 1);
+static VALUE fibonacci_init(VALUE self) { return self; }
+
+/* Initialize Ruby module and methods */
+void Init_fibonacci_ext(void) {
+  /* Cache commonly used method IDs at initialization time */
+  id_plus = rb_intern("+");
+  id_lte = rb_intern("<=");
+  id_lt = rb_intern("<");
+  id_gte = rb_intern(">=");
+  id_pow = rb_intern("**");
+  id_mul = rb_intern("*");
+  id_minus = rb_intern("-");
+  id_fdiv = rb_intern("fdiv");
+  id_div = rb_intern("/");
+  id_to_i = rb_intern("to_i");
+  id_log10 = rb_intern("log10");
+  id_log2 = rb_intern("log2");
+  id_floor = rb_intern("floor");
+  id_sqrt = rb_intern("sqrt");
+  id_eq = rb_intern("==");
+  id_not_eq = rb_intern("!=");
+  id_mod = rb_intern("%");
+  id_bit_and = rb_intern("&");
+  id_to_s = rb_intern("to_s");
+
+  /* Define the Fibonacci class */
+  cFibonacci = rb_define_class("Fibonacci", rb_cObject);
+
+  /* Define instance methods */
+  rb_define_method(cFibonacci, "initialize", fibonacci_init, 0);
+  rb_define_method(cFibonacci, "print", print_terms, 1);
+  rb_define_method(cFibonacci, "terms", terms, 1);
+  rb_define_method(cFibonacci, "num_digits", num_digits, 1);
+  rb_define_method(cFibonacci, "[]", rb_iterative_val, 1);
+  rb_define_method(cFibonacci, "matrix", rb_matrix_form, 1);
+  rb_define_method(cFibonacci, "fast_val", rb_fast_val, 1);
 }

data/fibonacci.gemspec

@@ -0,0 +1,32 @@
+# -*- encoding: utf-8 -*-
+$:.push File.expand_path("../lib", __FILE__)
+require "fibonacci/version"
+
+Gem::Specification.new do |s|
+  s.name        = "fibonacci"
+  s.version     = VERSION
+  s.authors     = ["NagaChaitanya Vellanki"]
+  s.email       = ["nagachaitanya.vellanki.com"]
+  s.homepage    = "http://github.com/chaitanyav/fibonacci"
+  s.summary     = %q{Fibonacci}
+  s.description = %q{A Ruby gem for exploring Fibonacci series}
+  s.license     = "MIT"
+  s.required_ruby_version = ">= 2.7"
+
+  s.rubyforge_project = "fibonacci"
+
+  s.files = Dir.glob('lib/**/*') + Dir.glob('ext/**/*.{c,h,rb}') + %w[README.markdown LICENSE Rakefile fibonacci.gemspec]
+  s.extensions = ['ext/fibonacci/extconf.rb']
+  s.test_files = `git ls-files -- {test,spec,features}/*`.split("\n")
+  s.executables = `git ls-files -- bin/*`.split("\n").map { |f| File.basename(f) }
+  s.require_paths = ["lib"]
+
+  s.metadata = {
+    "homepage_uri" => s.homepage,
+    "source_code_uri" => "https://github.com/chaitanyav/fibonacci",
+    "changelog_uri" => "https://github.com/chaitanyav/fibonacci/releases"
+  }
+
+  s.add_development_dependency "rake", ">= 13.0"
+  s.add_development_dependency "minitest", ">= 5.0"
+end

data/lib/fibonacci/version.rb

@@ -1 +1 @@
-VERSION = "0.1.8"
+VERSION = "0.1.10"

data/lib/fibonacci.rb

@@ -1,2 +1,7 @@
-require 'fibonacci/fibonacci'
+begin
+  require 'fibonacci_ext'
+rescue LoadError
+  $LOAD_PATH.unshift File.expand_path('../ext/fibonacci', __dir__)
+  require 'fibonacci_ext'
+end
 require "fibonacci/version"

data/test/fibonacci_test.rb

@@ -1,7 +1,8 @@
+require_relative 'test_helper'
 require 'minitest/autorun'
 require 'fibonacci'
 
-class FibonacciTest < MiniTest::Unit::TestCase
+class FibonacciTest < Minitest::Test
   def setup
     @fib = Fibonacci.new
   end

data/test/test_helper.rb

@@ -0,0 +1,15 @@
+require "bundler/setup"
+require "rbconfig"
+
+EXT_DIR = File.expand_path("../ext/fibonacci", __dir__)
+EXT_NAME = "fibonacci_ext"
+EXT_FILE = File.join(EXT_DIR, "#{EXT_NAME}.#{RbConfig::CONFIG['DLEXT']}")
+
+unless File.exist?(EXT_FILE)
+  Dir.chdir(EXT_DIR) do
+    system(RbConfig.ruby, "extconf.rb") or raise "Failed to generate Makefile for the extension"
+    system("make") or raise "Failed to build the extension"
+  end
+end
+
+$LOAD_PATH.unshift(EXT_DIR) unless $LOAD_PATH.include?(EXT_DIR)

metadata

@@ -1,15 +1,42 @@
 --- !ruby/object:Gem::Specification
 name: fibonacci
 version: !ruby/object:Gem::Version
-  version: 0.1.8
+  version: 0.1.10
 platform: ruby
 authors:
 - NagaChaitanya Vellanki
-autorequire: 
 bindir: bin
 cert_chain: []
-date: 2015-09-23 00:00:00.000000000 Z
-dependencies: []
+date: 1980-01-02 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '13.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '13.0'
+- !ruby/object:Gem::Dependency
+  name: minitest
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '5.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '5.0'
 description: A Ruby gem for exploring Fibonacci series
 email:
 - nagachaitanya.vellanki.com
@@ -18,15 +45,23 @@ extensions:
 - ext/fibonacci/extconf.rb
 extra_rdoc_files: []
 files:
+- LICENSE
+- README.markdown
+- Rakefile
 - ext/fibonacci/extconf.rb
 - ext/fibonacci/fibonacci.c
+- fibonacci.gemspec
 - lib/fibonacci.rb
 - lib/fibonacci/version.rb
 - test/fibonacci_test.rb
+- test/test_helper.rb
 homepage: http://github.com/chaitanyav/fibonacci
-licenses: []
-metadata: {}
-post_install_message: 
+licenses:
+- MIT
+metadata:
+  homepage_uri: http://github.com/chaitanyav/fibonacci
+  source_code_uri: https://github.com/chaitanyav/fibonacci
+  changelog_uri: https://github.com/chaitanyav/fibonacci/releases
 rdoc_options: []
 require_paths:
 - lib
@@ -34,17 +69,16 @@ required_ruby_version: !ruby/object:Gem::Requirement
   requirements:
   - - ">="
     - !ruby/object:Gem::Version
-      version: '0'
+      version: '2.7'
 required_rubygems_version: !ruby/object:Gem::Requirement
   requirements:
   - - ">="
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubyforge_project: fibonacci
-rubygems_version: 2.4.5
-signing_key: 
+rubygems_version: 4.0.13
 specification_version: 4
 summary: Fibonacci
 test_files:
 - test/fibonacci_test.rb
+- test/test_helper.rb