roots 2.1.0 → 2.2.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: bd63244d7b73fd41061b8ba024846116fcacd95e
-  data.tar.gz: 23fd715e6b991c71adcd74043f18e2ba4f165ba2
+  metadata.gz: aa49c39432ae20839016d0beb515b8f623cc9d00
+  data.tar.gz: 41c2a43899fc9f13fa4370bc289ea8f8e6c2f568
 SHA512:
-  metadata.gz: daf32159f9103e28e2c5bfa1c9330869a677e0d586542f8e8ca1ac74b01ec414556a521c35cab7555026d3088fff5c3d98173eb87b72e23692693b3282191f2c
-  data.tar.gz: abb72e384abeda80bb8ef6c4595785961e87a73217635d8c02e57749e33226ec305aa9b0eb75c43e31a8699ae4dba2cdeb29398bdea7550ae222895a588d777b
+  metadata.gz: 409ff9cda40258bca3e9733a4b0ff240256df9f12e3fd542e872a0765a1fc1607f437df7b998e084c3dfa514cc42ceeeb665eeabf06584ff4a9299950a55778a
+  data.tar.gz: '089bc4812353949dbc022dea855015f8dc813644c9e94de48e691c26b51eb156482751f3a9402361f29542e61897704353f7745d53109675214cb01576df7a80'

data/lib/roots.rb

@@ -193,26 +193,25 @@ end
 class Numeric; include Roots end
 
 module IntRoots
-  def irootn(n)
+  def irootn(n)   # Newton's method for nth root
     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 = 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 (numb = root**n) > num
+    return self if self == 0 || (self == -1 && n.odd?)
+    num = self.abs
+    e, x = n-1, 1 << (num.bit_length-1)/n + 1
+    while (t = (e * x + num / x ** e)/n) < x
+      x = t
     end
-    root *= (self < 0 ? -1 : 1)
+    x *= self < 0 ? -1 : 1
   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
+    x = 1 << (b-1)/2 | n >> (b/2 + 1)    # optimum initial root estimat
     while (t = n / x) < x; x = ((x + t) >> 1) end
     x
   end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: roots
 version: !ruby/object:Gem::Version
-  version: 2.1.0
+  version: 2.2.0
 platform: ruby
 authors:
 - Jabari Zakiya
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2017-06-01 00:00:00.000000000 Z
+date: 2017-06-17 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler
@@ -39,7 +39,7 @@ 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.root(n) or ival.irootn(n); Roots.digits_to_show
+  [opt]); For Integer ival: ival.iroot2, and ival.iroot(n) or ival.irootn(n); Roots.digits_to_show
   to see/change number of digts to show'
 email:
 - jzakiya@gmail.com
@@ -50,7 +50,7 @@ files:
 - lib/roots.rb
 homepage: https://github.com/jzakiya/roots
 licenses:
-- GPLv2+
+- GPL-2.0+
 metadata: {}
 post_install_message: 
 rdoc_options: []