roots 2.0.1 → 2.1.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 888f6b068017a2b3b43dff7c8a2ee62d2b389f02
-  data.tar.gz: 1607eecadf5c42807d873e9f0bb755987750ec59
+  metadata.gz: bd63244d7b73fd41061b8ba024846116fcacd95e
+  data.tar.gz: 23fd715e6b991c71adcd74043f18e2ba4f165ba2
 SHA512:
-  metadata.gz: d4d2c80e2227ab29c92d7e496d18b47fbe45f68de42efab37584c4bbe9076b0426fc2eee6f67162a10238c3aa3c192400a27a119ee36647a49a9eba7d68153e8
-  data.tar.gz: 04bc29ac7b446db4f8672fc65b238e1dfb27aaa1ee06ac12fddb2ddc5888f59c073dcdca687a6a3b1716bbe4c3bc06515c57fc1b26ca871d29a60bd0c7341a91
+  metadata.gz: daf32159f9103e28e2c5bfa1c9330869a677e0d586542f8e8ca1ac74b01ec414556a521c35cab7555026d3088fff5c3d98173eb87b72e23692693b3282191f2c
+  data.tar.gz: abb72e384abeda80bb8ef6c4595785961e87a73217635d8c02e57749e33226ec305aa9b0eb75c43e31a8699ae4dba2cdeb29398bdea7550ae222895a588d777b

data/lib/roots.rb

@@ -188,7 +188,7 @@ module Roots
     Complex(x.real.round(Roots.digits_to_show), x.imag.round(Roots.digits_to_show))
   end
 end  
-  
+
 # Mixin 'root' and 'roots' as methods for all number classes.
 class Numeric; include Roots end
 
@@ -197,15 +197,25 @@ module IntRoots
     return nil if self < 0 && n.even?
     raise "root n is < 2 or not an Integer" unless n.is_a?(Integer) && n > 1
     num  = self.abs
-    root, bitn_mask = 0, 1 << (num.bit_length/n + 2)
-    until (bitn_mask >>= 1) == 0
+    root = bitn_mask = 1 << b = (num.bit_length - 1)/n
+    numb = 1 << b*n    # make initial numb = root**n >= num
+    until ((bitn_mask >>= 1) == 0) || numb == num
       root |= bitn_mask
-      root ^= bitn_mask if root**n > num
+      root ^= bitn_mask if (numb = root**n) > num
     end
     root *= (self < 0 ? -1 : 1)
   end
 
-  def iroot2; irootn(2) end
+  alias iroot irootn  # to provide more syntactic choice
+
+  def iroot2       # Newton's method version used in Ruby for Integer#sqrt
+    return nil if (n = self) < 0
+    return n if n < 2
+    b = n.bit_length
+    x = 1 << (b-1)/2 | n >> (b/2 + 1)    # optimum initial root estimate
+    while (t = n / x) < x; x = ((x + t) >> 1) end
+    x
+  end
 end
 
 # Mixin 'iroot2' and 'irootn(n)' methods for class Integer

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: roots
 version: !ruby/object:Gem::Version
-  version: 2.0.1
+  version: 2.1.0
 platform: ruby
 authors:
 - Jabari Zakiya
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2017-02-21 00:00:00.000000000 Z
+date: 2017-06-01 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler
@@ -39,8 +39,8 @@ dependencies:
       - !ruby/object:Gem::Version
         version: '10.0'
 description: 'For val (real/complex) and root n: val.root(n,[1-n]) and val.roots(n,
-  [opt]); For Integer ival: ival.iroot2 and ival.irootn(n); Roots.digits_to_show to
-  see/change number of digts to show'
+  [opt]); For Integer ival: ival.iroot2, and ival.root(n) or ival.irootn(n); Roots.digits_to_show
+  to see/change number of digts to show'
 email:
 - jzakiya@gmail.com
 executables: []
@@ -68,8 +68,9 @@ required_rubygems_version: !ruby/object:Gem::Requirement
       version: '0'
 requirements: []
 rubyforge_project: 
-rubygems_version: 2.6.10
+rubygems_version: 2.6.11
 signing_key: 
 specification_version: 4
-summary: two methods 'root' and 'roots' to compute all n roots of real/complex numbers
+summary: methods to compute all n roots of real/complex numbers, and real integer
+  roots
 test_files: []