missing-math 0.1.3 → 0.1.4

data/lib/missing_math.rb

@@ -1,4 +1,7 @@
 module MissingMath
+  # @esieve
+  # @fib
+
 
   # Methods that can apply to all number object types
   module Number
@@ -13,6 +16,19 @@ module MissingMath
       end
     end
 
+    # Converts an number to an array of numbers.  If a decimal number, the decimal will be a position in the array
+    # Example: 12345.to_a => [1, 2, 3, 4, 5]
+    def to_a
+      self.to_s.split('').map do |n|
+        matches = n.scan(/[0-9]/).length
+        if matches > 0
+          n.to_i
+        else
+          n
+        end
+      end
+    end
+
     # Returns the number with a number added to the beginning of the number
     # @param integer n The number to prepend
     # Example: 2345.prepend(1) => 12345
@@ -55,6 +71,18 @@ module MissingMath
       number_out(str)
     end
 
+    # Checks if the number contains a digit sequence or regex
+    # @param integer|regexp search
+    # Example 1: 12345.contains?(34) => true
+    # Example 2: 12345.contains?(/34/) => true
+    def contains?(search)
+      if search.is_a? Regexp
+        return self.to_s.scan(search).length > 0 ? true : false
+      else
+        return self.to_s.index(search.to_s) ? true : false
+      end
+    end
+
     # Returns the number with the first digit moved to the end
     # @param boolean right Defaults to rotating right.  Set to false to rotate left
     # Example 1: 12345.rotate => 23451
@@ -70,31 +98,21 @@ module MissingMath
       number_out(str)
     end
 
-    # Checks if the number contains a digit sequence or regex
-    # @param integer|regexp search
-    # Example 1: 12345.contains?(34) => true
-    # Example 2: 12345.contains?(/34/) => true
-    def contains?(search)
-      if search.is_a? Regexp
-        return self.to_s.scan(search).length > 0 ? true : false
-      else
-        return self.to_s.index(search.to_s) ? true : false
-      end
+    # Returns the number reversed
+    # Example: 12345.reverse => 54321
+    def reverse
+      a = self.to_a
+      str = a.reverse.join('')
+      number_out(str)
     end
 
-    # Converts an number to an array of numbers.  If a decimal number, the decimal will be a position in the array
-    # Example: 12345.to_a => [1, 2, 3, 4, 5]
-    def to_a
-      self.to_s.split('').map do |n|
-        matches = n.scan(/[0-9]/).length
-        if matches > 0
-          n.to_i
-        else
-          n
-        end
-      end
+    # Returns true|false if the number is a palindrome
+    # Example: 123454321.palindrome? => true
+    def palindrome?
+      return self == self.reverse
     end
 
+
     private
 
     # Output a stringed version of a number as a float or integer (whichever it deserves)
@@ -134,7 +152,11 @@ module MissingMath
     # Calculates an integer's factorial
     def factorial
       throw "Not an Integer" if !self.is_i?
-      self.downto(1).reduce(:*)
+      if self == 0
+        1
+      else
+        self.downto(1).reduce(:*)
+      end
     end
 
     # Returns an array of an integer's factors
@@ -163,6 +185,44 @@ module MissingMath
       factors = primes.collect { |i| i if self % i == 0 && i <= ceil }
       return factors.compact.uniq
     end
+
+
+    # Returns the triangle number
+    def triangle
+      return (self * (self + 1)) / 2
+    end
+
+    # Returns the pentagonal number
+    def pentagon
+      return (self * ((3 * self) - 1)) / 2
+    end
+
+    # Returns the hexagonal number
+    def hexagon
+      return self * ((2 * self) - 1)
+    end
+
+
+    # Checks if the number is triangular.  If true, returns the number, otherwise false
+    def triangular?
+      n = (Math.sqrt((8 * self) + 1) - 1) / 2
+      if n.floor == n.ceil
+        return n
+      else
+        return false
+      end
+    end
+
+    # Checks if the number is pentagonal.  If true, returns the number, otherwise false
+    def pentagonal?
+      n = (Math.sqrt((24 * self) + 1) + 1) / 6
+      if n.floor == n.ceil
+        return n
+      else
+        return false
+      end
+    end
+
   end
 
 
@@ -188,6 +248,21 @@ module MissingMath
     return @esieve
   end
 
+  # Generates an array holding an n-length fibonacci sequence
+  # @param integer n Length of sequence to generate
+  # @param boolean true_fib Use the true fibonacci sequence (0, 1, 1, 2...) or skip the first two values (1, 2, 3, 5...). Default true
+  # @param boolean force_new Force new module variable @fib generation.  Default uses module variable @fib if it hasn't been set
+  # Example: MissingMath.fibonacci(5) => [0, 1, 1, 2, 3]
+  def self.fibonacci(n, true_fib=true, force_new=false)
+    if !@fib || force_new
+      @fib = true_fib ? [0, 1] : [1, 2]
+      while @fib.length < n
+        @fib << @fib[-1] + @fib[-2]
+      end
+    end
+    return @fib
+  end
+
 end
 
 
@@ -195,3 +270,4 @@ end
 require 'missing_math/integer'
 require 'missing_math/float'
 require 'missing_math/fixnum'
+require 'missing_math/array'

data/lib/missing_math/array.rb

@@ -0,0 +1,7 @@
+class Array
+
+  def to_i
+    i = self.join('').to_i
+  end
+
+end

data/lib/missing_math/version.rb

@@ -1,3 +1,3 @@
 module MissingMath
-  VERSION = "0.1.3"
+  VERSION = "0.1.4"
 end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: missing-math
 version: !ruby/object:Gem::Version
-  version: 0.1.3
+  version: 0.1.4
   prerelease: 
 platform: ruby
 authors:
@@ -9,7 +9,7 @@ authors:
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2013-12-04 00:00:00.000000000 Z
+date: 2013-12-13 00:00:00.000000000 Z
 dependencies: []
 description: A library of missing math functions.
 email: mail@enorganik.com
@@ -17,6 +17,7 @@ executables: []
 extensions: []
 extra_rdoc_files: []
 files:
+- lib/missing_math/array.rb
 - lib/missing_math/fixnum.rb
 - lib/missing_math/float.rb
 - lib/missing_math/integer.rb