magician 0.1.0

data/.document

@@ -0,0 +1,5 @@
+lib/**/*.rb
+bin/*
+- 
+features/**/*.feature
+LICENSE.txt

data/.rspec

@@ -0,0 +1 @@
+--color

data/.travis.yml

@@ -0,0 +1,8 @@
+language: ruby
+rvm:
+- 1.9.3
+- jruby-19mode # JRuby in 1.9 mode
+- rbx-19mode # Rubinius in 1.9 mode
+branches:
+  only:
+    - master

data/Gemfile

@@ -0,0 +1,14 @@
+source :rubygems
+
+# Add dependencies required to use your gem here.
+
+# Add dependencies to develop your gem here.
+# Include everything needed to run rake, tests, features, etc.
+group :development do
+  gem 'rspec', '~> 2.12.0'
+  gem 'yard', '~> 0.7'
+  gem 'rdoc', '~> 3.12'
+  gem 'bundler'
+  gem 'jeweler', '~> 1.8.4'
+  gem 'simplecov'
+end

data/LICENSE.txt

@@ -0,0 +1,20 @@
+Copyright (c) 2012 Nicolas McCurdy
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

data/README.md

@@ -0,0 +1,18 @@
+# magician [![Build Status](https://secure.travis-ci.org/thenickperson/magician.png?branch=master)](http://travis-ci.org/thenickperson/magician) [![Dependency Status](https://gemnasium.com/thenickperson/magician.png)](https://gemnasium.com/thenickperson/magician) [![Code Climate](https://codeclimate.com/badge.png)](https://codeclimate.com/github/thenickperson/magician)
+
+A suite of handy methods for doing calculations in irb.
+
+## Contributing to magician
+ 
+- Check out the latest master to make sure the feature hasn't been implemented or the bug hasn't been fixed yet.
+- Check out the issue tracker to make sure someone already hasn't requested it and/or contributed it.
+- Fork the project.
+- Start a feature/bugfix branch.
+- Commit and push until you are happy with your contribution.
+- Make sure to add tests for it. This is important so I don't break it in a future version unintentionally.
+- Please try not to mess with the Rakefile, version, or history. If you want to have your own version, or is otherwise necessary, that is fine, but please isolate to its own commit so I can cherry-pick around it.
+
+## Copyright
+
+Copyright (c) 2012 Nicolas McCurdy. See LICENSE.txt for
+further details.

data/Rakefile

@@ -0,0 +1,42 @@
+# encoding: utf-8
+
+require 'rubygems'
+require 'bundler'
+begin
+  Bundler.setup(:default, :development)
+rescue Bundler::BundlerError => e
+  $stderr.puts e.message
+  $stderr.puts "Run `bundle install` to install missing gems"
+  exit e.status_code
+end
+require 'rake'
+
+require 'jeweler'
+Jeweler::Tasks.new do |gem|
+  # gem is a Gem::Specification... see http://docs.rubygems.org/read/chapter/20 for more options
+  gem.name = "magician"
+  gem.homepage = "http://github.com/thenickperson/magician"
+  gem.license = "MIT"
+  gem.summary = "A suite of handy methods for doing calculations in irb."
+  gem.description = "A suite of handy methods for doing calculations in irb."
+  gem.email = "thenickperson@gmail.com"
+  gem.authors = ["Nicolas McCurdy"]
+  # dependencies defined in Gemfile
+end
+Jeweler::RubygemsDotOrgTasks.new
+
+require 'rspec/core'
+require 'rspec/core/rake_task'
+RSpec::Core::RakeTask.new(:spec) do |spec|
+  spec.pattern = FileList['spec/**/*_spec.rb']
+end
+
+RSpec::Core::RakeTask.new(:rcov) do |spec|
+  spec.pattern = 'spec/**/*_spec.rb'
+  spec.rcov = true
+end
+
+task :default => :spec
+
+require 'yard'
+YARD::Rake::YardocTask.new

data/VERSION

@@ -0,0 +1 @@
+0.1.0

data/lib/magician.rb

@@ -0,0 +1,3 @@
+# Require all of magician's stuff
+lib_path = File.join(File.dirname(__FILE__), 'magician', '*.rb')
+Dir[lib_path].each { |file| require file }

data/lib/magician/array.rb

@@ -0,0 +1,83 @@
+# Magician's extensions to the Array class.
+class Array
+
+	# Gets the sum of the numbers in the array. The sum of an empty array is 0.
+	#
+	# @return [Numeric] the sum of the numbers in the array
+	def sum
+		return 0 if self.empty?
+		inject(:+)
+	end
+
+	# Gets the product of the numbers in the array. The product of an empty array
+	# is 1.
+	#
+	# @return [Numeric] the product of the numbers in the array
+	def product
+		return 1 if self.empty?
+		inject(:*)
+	end
+
+	# Gets the range of the numbers in the array (maximum - minimum). The range of
+	# an empty array is nil.
+	#
+	# @return [Numeric] the range of the numbers in the array
+	def range
+		return nil if self.empty?
+		max - min
+	end
+
+	# Gets the mean (average) of the numbers in the array. The mean of an empty
+	# array is nil.
+	#
+	# @return [Float] the mean (average) of the numbers in the array
+	def mean
+		return nil if self.empty?
+		sum.to_f / size
+	end
+
+	# Gets the median of the numbers in the array (the value in the middle of a
+	# sorted version of the array). If the array has an even length, the middle
+	# two values are averaged. The median of an empty array is nil.
+	#
+	# @return [Numeric] the median of the numbers in the array
+	def median
+		return nil if self.empty?
+		sorted = sort
+		if sorted.length.odd?
+			self[length/2]
+		else
+			(self[length/2-1] + self[length/2]) / 2.0
+		end
+	end
+
+	# Gets the mode(s) of the items in the array (the item(s) that occur(s) most
+	# frequently). The mode of an empty array is nil.
+	#
+	# @return [Array] an array of all of the items in the array that occur the
+	# most freqeuntly (they must all have the same number of occurences)
+	def mode
+		return nil if self.empty?
+		occ = occurences
+		max_occ = occ.values.max
+		occ.select { |key, value| value == max_occ }.keys
+	end
+
+	# Gets a hash table with the number of occurences of each item from the
+	# original array. The keys are the items from the original array, and the
+	# values are integers counting the number of occurences of the associated key
+	# values.
+	#
+	# @return [Hash] a hash table of the occurences of each item from the original
+	# array
+	def occurences
+		occurences = {}
+		self.each { |item| occurences[item] = 0 }
+		self.each { |item| occurences[item] += 1 }
+		occurences
+	end
+
+	# Alias average to mean.
+	alias :average :mean
+
+end

data/lib/magician/integer.rb

@@ -0,0 +1,66 @@
+# Magician's extensions to the Integer class.
+class Integer
+
+	# Gets all of the factors of the current integer. If the current integer is
+	# negative, it will be treated as if it were positive (so the results will
+	# never contain negative integers).
+	#
+	# @return [Array] an array of all of the factors of the current integer (in
+	# order, including 1 and the integer itself)
+	def factors
+		return nil if self == 0
+		return [1] if self.abs == 1
+		#first half
+		factors = []
+		for i in 1..self.abs
+			if self.abs % i == 0
+				if i < self.abs/i
+					factors << i
+				else break
+				end
+			end
+		end
+		#second half
+		factors_old = factors.dup
+		until factors_old.length == 0
+			factors << self.abs/factors_old.pop
+		end
+		return factors
+	end
+
+	# Gets the factorial of the integer, which is equivalent to the product of all
+	# integers from 1 to the integer (inclusive). When the integer is 0, it is
+	# equivalent to 1.
+	#
+	# @return [Integer] factorial of the integer
+	def factorial
+		return 1 if self == 0
+		(1..self).inject(:*)
+	end
+
+	# Returns true if the integer is prime (that is, if it is not divisible by any
+	# integer between 1 and the integer itself, exclusive). 0 and 1 are not prime
+	# numbers, though 2 is prime. Negative numbers are never considered prime in
+	# this implementation.
+	#
+	# @return [Boolean] true if the integer is prime
+	def prime?
+		return false if self <= 1
+		for i in 2..Math.sqrt(self)
+			return false if self % i == 0
+		end
+		return true
+	end
+
+	# Returns true if the integer is evenly divisible by n. If n is 0, it returns
+	# false, since numbers cannot be divided by 0 in real number arithmetic.
+	#
+	# @param [Numeric] n the number the integer should be divided by
+	#
+	# @return [Boolean] true if the integer is evenly divisible by n
+	def divisible? n
+		return false if n.zero?
+		(self % n).zero?
+	end
+
+end

data/lib/magician/math.rb

@@ -0,0 +1,120 @@
+# Magician's extensions to the Math module.
+module Math
+
+	# If we don't do this, our new methods won't get added onto Math.
+	extend self
+
+	# Solves a quadratic formula of the form "ax^2+bx+c=0" for x, where a is not
+	# 0. It asks for the three coefficients of the function (a, b, and c), and
+	# returns the two possible values for x.
+	#
+	# @param [Numeric] a the first coefficient (must not be 0)
+	# @param [Numeric] b the second coefficient
+	# @param [Numeric] c the third coefficient
+	#
+	# @return [Array] a sorted array of two Floats, the two possible values for x
+	def quadratic(a, b, c)
+		return nil if a.zero?
+		left = -b
+		right = Math.sqrt(b**2 - 4*a*c)
+		bottom = 2*a
+		[ (left+right)/bottom, (left-right)/bottom ].sort
+	end
+
+	# The number of size k ordered subsets of a set of size n. Equivalent to
+	# n!/(n-k)!. Returns nil if either is negative, or if n < k.
+	#
+	# @param [Integer] n the size of the set to pick from
+	# @param [Integer] k the size of the ordered subsets
+	#
+	# @return [Integer] the number of permutations
+	def permutations(n, k)
+		return nil if n < 0 or k < 0 or n < k
+		return n.factorial / (n-k).factorial
+	end
+
+	# The number of size k unordered subsets of a set of size n. Equivalent to
+	# n!/(k!(n-k)!). Returns nil if either is negative, or if n < k.
+	#
+	# @param [Integer] n the size of the set to pick from
+	# @param [Integer] k the size of the unordered subsets
+	#
+	# @return [Integer] the number of combinations
+	def combinations(n, k)
+		return nil if n < 0 or k < 0 or n < k
+		return n.factorial / (k.factorial * (n-k).factorial)
+	end
+
+	# Get the number of steps it takes to get from integer n to 1 using the
+	# Collatz Conjecture (set http://en.wikipedia.org/wiki/Collatz_conjecture).
+	#
+	# @param [Integer] n the number to put into the Collatz Conjecture initially
+	# @param [Integer] depth the number of steps that have passed so far (should
+	# not be modified unless this is being cached carefully)
+	#
+	# @return [Integer] the number of steps it takes to get from integer n to 1
+	# using the Collatz Conjecture (the depth)
+	def collatz(n, depth=0)
+		return nil if n < 1
+		if n == 1
+			return depth
+		elsif n % 2 == 0
+			depth += 1
+			return collatz(n/2, depth)
+		else
+			depth += 1
+			return collatz(3*n + 1, depth)
+		end
+	end
+
+	# Using the Pythagorean theorem, gets c (the length of the hypotenuse) when a
+	# and b (the lengths of the other sides of a triangle) are given. Returns nil
+	# if either a or b is negative.
+	#
+	# @param [Numeric] a the length of the first side of the triangle
+	# @param [Numeric] b the length of the second side of the triangle
+	#
+	# @return [Float] the length of the hypotenuse of the triangle
+	def hypotenuse(a, b)
+		[a,b].each do |n|
+			return nil if n < 0
+		end
+		Math.sqrt(a**2 + b**2)
+	end
+
+	# Returns true if the three given numbers are positive integers that form a
+	# Pythagorean triplet (that is, if a^2+b^2=c^2). C must be the last parameter.
+	#
+	# @param [Integer] a the length of the first side of the triangle
+	# @param [Integer] b the length of the second side of the triangle
+	# @param [Integer] c the length of the hypotenuse of the triangle
+	#
+	# @return [Boolean] true if the three numbers form a Pythagorean triplet
+	def triplet?(a, b, c)
+		inputs_are_valid = true
+		[a,b,c].each do |n|
+			inputs_are_valid = false if n < 1 or not n.class <= Integer
+		end
+		return false unless inputs_are_valid
+		a**2 + b**2 == c**2
+	end
+
+	# Calculates a series of Fibonacci numbers of a specified length. Returns nil
+	# if a negative length is given.
+	#
+	# @param [Integer] length the length of the Fibonacci series that should be
+	# returned
+	#
+	# @return [Array] a Fibonacci series of Integers with the specified length
+	# (ordered)
+	def fibs length
+		return nil if length < 0
+		terms = []
+		until terms.length == length do
+			at_beginning = [0,1].include? terms.length
+			terms << ( at_beginning ? 1 : terms[-2] + terms[-1] )
+		end
+		terms
+	end
+
+end

data/lib/magician/numeric.rb

@@ -0,0 +1,17 @@
+# Magician's extensions to the Numeric class (affects Integers and Floats).
+class Numeric
+
+	# Performs self.to_s[selection].to_i on the number. Note that for floats, the
+	# decimal counts as a digit within the string.
+	# TODO: Let this intelligently convert back to an Integer or Float.
+	#
+	# @param [Range] selection the selection/range to get from the number (you can
+	# use anything that works with the [] syntax)
+	#
+	# @return [Integer] substring of the number (using []), converted to an
+	# Integer
+	def digits selection
+		self.to_s[selection].to_i
+	end
+
+end

data/lib/magician/shortcuts.rb

@@ -0,0 +1,7 @@
+# Miscellaneous shortcuts to different methods/values.
+
+# Alias Math::PI to PI
+PI = Math::PI
+
+# Alias Math::E to E
+E = Math::E

data/lib/magician/string.rb

@@ -0,0 +1,12 @@
+# Magician's extensions to the String class.
+class String
+
+	# Returns true if the string is a palindrome (meaning it is the same forward
+	# and backward).
+	#
+	# @return [Boolean] true if the string is a palindrome
+	def palindrome?
+		self == reverse
+	end
+
+end

data/spec/array_spec.rb

@@ -0,0 +1,55 @@
+require File.expand_path(File.dirname(__FILE__) + '/spec_helper')
+
+describe Array do
+
+	it 'should get the sum of a list' do
+		[].sum.should == 0
+		[1].sum.should == 1
+		[1, 2, 3, 4].sum.should == 10
+		[-4, 0, 5].sum.should == 1
+	end
+
+	it 'should get the product of a list' do
+		[].product.should == 1
+		[1].product.should == 1
+		[5, 7, 2].product.should == 70
+	end
+
+	it 'should get the range of a list' do
+		[].range.should == nil
+		[4].range.should == 0
+		[5, 1, 10].range.should == 9
+	end
+
+	it 'should get the mean of a list' do
+		[].mean.should == nil
+		[4].mean.should == 4
+		[-3, 0, 6].mean.should == 1
+		[1, 2, 3, 4, 5].mean.should == 3
+	end
+
+	it 'should get the median of a list' do
+		[].median.should == nil
+		[4].median.should == 4.0
+		[2, 1, 3, 5, 4].median.should == 3.0
+		[1, 2, 3, 4].median.should == 2.5
+	end
+
+	it 'should get the mode of a list' do
+		[].mode.should == nil
+		[4].mode.should == [4]
+		[1, 2, 1, 3, 1, 4].mode.should == [1]
+		[1, 1, 1, 2, 2, 2, 3].mode.should == [1, 2]
+	end
+
+	it 'should get a hash with the number of occurences of items in a list' do
+		[].occurences.should == {}
+		[4].occurences.should == { 4=>1 }
+		[1, 2, 2, 5].occurences.should == { 1=>1, 2=>2, 5=>1 }
+	end
+
+	it 'should let Array#average be used as an alias to Array#mean' do
+		[4].average.should == 4.0
+	end
+
+end

data/spec/integer_spec.rb

@@ -0,0 +1,45 @@
+require File.expand_path(File.dirname(__FILE__) + '/spec_helper')
+
+describe Integer do
+
+	it 'should get the factors of an integer' do
+		0.factors.should == nil
+		1.factors.should == [1]
+		6.factors.should == [1, 2, 3, 6]
+		7.factors.should == [1, 7]
+		-1.factors.should == [1]
+		-6.factors.should == [1, 2, 3, 6]
+		-7.factors.should == [1, 7]
+	end
+
+	it 'should get the factorial of an integer' do
+		0.factorial.should == 1
+		1.factorial.should == 1
+		-1.factorial.should == nil
+		5.factorial.should == 120
+		10.factorial.should == 3_628_800
+	end
+
+	it 'should determine if an integer is prime' do
+		0.prime?.should be_false
+		1.prime?.should be_false
+		2.prime?.should be_true
+		5.prime?.should be_true
+		6.prime?.should be_false
+		-1.prime?.should be_false
+		-2.prime?.should be_false
+		-5.prime?.should be_false
+		-6.prime?.should be_false
+	end
+
+	it 'should determine if an integer is divisible by another number' do
+		0.divisible?(5).should be_true
+		1.divisible?(6).should be_false
+		-1.divisible?(1).should be_true
+		12.divisible?(6).should be_true
+		6.divisible?(5).should be_false
+		9.divisible?(1.5).should be_true
+		10.divisible?(0).should be_false
+	end
+
+end

data/spec/math_spec.rb

@@ -0,0 +1,77 @@
+require File.expand_path(File.dirname(__FILE__) + '/spec_helper')
+
+describe Math do
+
+	it 'should solve a quadratic formula' do
+		Math.quadratic(1, 2, 1).should == [-1.0, -1.0]
+		Math.quadratic(1, 1, 0).should == [-1.0, 0.0]
+		Math.quadratic(1, 0, 0).should == [0.0, 0.0]
+		Math.quadratic(0, 1, 2).should == nil
+		#Math.quadratic(1, 2, 3).should == 'change me'
+		#Math.quadratic(-1, -2, -3).should == 'change me'
+		#Math.quadratic(1, 1, 1).should == 'change me'
+	end
+
+	it 'should get the number of permutations with n and k' do
+		Math.permutations(10, 5).should == 30_240
+		Math.permutations(5, 5).should == 120
+		Math.permutations(5, 0).should == 1
+		Math.permutations(0, 5).should == nil
+		Math.permutations(0, 0).should == 1
+		Math.permutations(5, 10).should == nil
+		Math.permutations(-5, 5).should == nil
+		Math.permutations(5, -5).should == nil
+		Math.permutations(-5, -5).should == nil
+	end
+
+	it 'should get the number of combinations with n and k' do
+		Math.combinations(10, 5).should == 252
+		Math.combinations(5, 10).should == nil
+		Math.combinations(5, 5).should == 1
+		Math.combinations(5, 0).should == 1
+		Math.combinations(0, 5).should == nil
+		Math.combinations(0, 0).should == 1
+		Math.combinations(-5, 5).should == nil
+		Math.combinations(5, -5).should == nil
+		Math.combinations(-5, -5).should == nil
+	end
+
+	it 'should get the number of steps to finish the Collatz Conjecture' do
+		Math.collatz(-1).should == nil
+		Math.collatz(0).should == nil
+		Math.collatz(1).should == 0
+		Math.collatz(2).should == 1
+		Math.collatz(7).should == 16
+		Math.collatz(100).should == 25
+	end
+
+	it 'should get the length of a hypotenuse with the Pythagorean theorem' do
+		Math.hypotenuse(0, 0).should == 0
+		Math.hypotenuse(Math.sqrt(5), 2).should == 3
+		Math.hypotenuse(1, 1).should == Math.sqrt(2)
+		Math.hypotenuse(5, -5).should be_nil
+	end
+
+	it 'should determine if three given numbers form a Pythagorean triplet' do
+		Math.triplet?(3, 4, 5).should be_true
+		Math.triplet?(5, 12, 13).should be_true
+		Math.triplet?(7, 24, 25).should be_true
+		Math.triplet?(8, 15, 17).should be_true
+		Math.triplet?(4, 3, 5).should be_true
+		Math.triplet?(5, 4, 3).should be_false
+		Math.triplet?(0, 0, 0).should be_false
+		Math.triplet?(Math.sqrt(5), 2, 3).should be_false
+		Math.triplet?(1, 1, Math.sqrt(2)).should be_false
+		Math.triplet?(-1, -1, -1).should be_false
+	end
+
+	it 'should calculate a series of Fibonacci numbers of a specified length' do
+		Math.fibs(-1).should == nil
+		Math.fibs(0).should == []
+		Math.fibs(1).should == [1]
+		Math.fibs(2).should == [1, 1]
+		Math.fibs(5).should == [1, 1, 2, 3, 5]
+		Math.fibs(10).should == [1, 1, 2, 3, 5, 8, 13, 21, 34, 55]
+	end
+
+end

data/spec/numeric_spec.rb

@@ -0,0 +1,11 @@
+require File.expand_path(File.dirname(__FILE__) + '/spec_helper')
+
+describe Numeric do
+
+	it 'should get specific digits from a number' do
+		Math::PI.digits(0..-1).should == 3
+		12345.digits(0..2).should == 123
+		12345.digits(4).should == 5
+	end
+
+end

data/spec/shortcuts_spec.rb

@@ -0,0 +1,10 @@
+require File.expand_path(File.dirname(__FILE__) + '/spec_helper')
+
+describe 'Shortcuts' do
+
+	it 'should properly alias certain values' do
+		PI.should == Math::PI
+		E.should == Math::E
+	end
+
+end

data/spec/spec_helper.rb

@@ -0,0 +1,16 @@
+# Set up simplecov
+require 'simplecov'
+SimpleCov.start { add_filter '/spec/' }
+
+$LOAD_PATH.unshift(File.join(File.dirname(__FILE__), '..', 'lib'))
+$LOAD_PATH.unshift(File.dirname(__FILE__))
+require 'rspec'
+require 'magician'
+
+# Requires supporting files with custom matchers and macros, etc,
+# in ./support/ and its subdirectories.
+Dir["#{File.dirname(__FILE__)}/support/**/*.rb"].each {|f| require f}
+
+RSpec.configure do |config|
+  
+end

data/spec/string_spec.rb

@@ -0,0 +1,14 @@
+require File.expand_path(File.dirname(__FILE__) + '/spec_helper')
+
+describe String do
+
+	it 'should determine if a string is a palindrome' do
+		''.palindrome?.should be_true
+		'a'.palindrome?.should be_true
+		'deed'.palindrome?.should be_true
+		'racecar'.palindrome?.should be_true
+		'cats'.palindrome?.should be_false
+		'no'.palindrome?.should be_false
+	end
+
+end

metadata

@@ -0,0 +1,168 @@
+--- !ruby/object:Gem::Specification
+name: magician
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+  prerelease: 
+platform: ruby
+authors:
+- Nicolas McCurdy
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2012-11-30 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: rspec
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: 2.12.0
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: 2.12.0
+- !ruby/object:Gem::Dependency
+  name: yard
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '0.7'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '0.7'
+- !ruby/object:Gem::Dependency
+  name: rdoc
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '3.12'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '3.12'
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: jeweler
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: 1.8.4
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: 1.8.4
+- !ruby/object:Gem::Dependency
+  name: simplecov
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+description: A suite of handy methods for doing calculations in irb.
+email: thenickperson@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files:
+- LICENSE.txt
+- README.md
+files:
+- .document
+- .rspec
+- .travis.yml
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- VERSION
+- lib/magician.rb
+- lib/magician/array.rb
+- lib/magician/integer.rb
+- lib/magician/math.rb
+- lib/magician/numeric.rb
+- lib/magician/shortcuts.rb
+- lib/magician/string.rb
+- spec/array_spec.rb
+- spec/integer_spec.rb
+- spec/math_spec.rb
+- spec/numeric_spec.rb
+- spec/shortcuts_spec.rb
+- spec/spec_helper.rb
+- spec/string_spec.rb
+homepage: http://github.com/thenickperson/magician
+licenses:
+- MIT
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+      segments:
+      - 0
+      hash: 3387386332341206942
+required_rubygems_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 1.8.24
+signing_key: 
+specification_version: 3
+summary: A suite of handy methods for doing calculations in irb.
+test_files: []