chris_lib 1.0.2 → 1.0.3

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: a4a7fadd656ccabe31c96030a53db4e2557565c5
-  data.tar.gz: e63c111c847aeabe3c66939a8293065b84054a1c
+  metadata.gz: 32ffed400557360fd6645e75dd29aff6481fe8cc
+  data.tar.gz: a4a9e0b507c5844641d46b3e3a3fd61e7c5f8ed7
 SHA512:
-  metadata.gz: 7231e9d1fd9f3ea2cb42fb346fa6e3e2fe79e32b7ab80860d180961a2e5f28fc56afa6a84cd0d282f08d98e4cfc5e9567fbc9683d4916b1e9c124f95bca5bc69
-  data.tar.gz: 7f19672aced8832e52165a0b06eace2a550cc4c9f1744294ed3ae20ddbecca25401eb3db8d48695cb0e53ca8125e5092e761d8e3883b8f6dec0773165416f933
+  metadata.gz: 00e58b8fecbe9408ba6ece1ff97aefa5da3851e42ef0b20f001923ee03183157f65fc692e24453e6c19df1f84004dcb0f0691dce05c38de34f3c52700c8b1a68
+  data.tar.gz: 2e90db2bc7e07fa5ec828daeb44365a57f91de7f3ec5e6d59935d4005cb602d337fa7985d43ed4bed56063343ae8c1cad6048254047d5fd7a2f925b4c03345f3

data/lib/chris_lib/chris_math.rb

@@ -1,89 +1,105 @@
 Integer.class_eval do
-	def factorial
-		n=self
-		if n > 20
-			raise "Number too large"
-		else
-			(1..n).inject {|prod, i| prod * i}
-		end
-	end
+  def factorial
+    n = self
+    if n > 20
+      fail 'Number too large'
+    else
+      (1..n).inject {|prod, i| prod * i}
+    end
+  end
 end
 Array.class_eval do
-	def mean
-		raise "Length must be greater than 1" if count < 2 
-		sum = self.inject { |s,v| s + v}
-		sum/count
-	end
-	def var
-		raise "Length must be greater than 1" if count < 2 
-		m = self.mean
-		sum = self.inject { |s,v| s + (v**2 - m**2)}
-		m=count-1
-		sum.to_f/m
-	end
-	def median
-		return self[0] if length <= 1
-		sorted = sort
-		n = length
-		if n.odd? # length is odd
-		  sorted[n/2]
-		else
-		  (sorted[n/2] + sorted[n/2-1]).to_f/2
-		end
-	end
+  def mean
+    fail 'Length must be greater than 1.' if count < 2
+    sum = self.inject { |s, v| s + v }
+    sum.to_f / count
+  end
+
+  def var
+    fail 'Length must be greater than 1' if count < 2 
+    m = self.mean
+    sum = self.inject { |s,v| s + (v**2 - m**2)}
+    m=count-1
+    sum.to_f/m
+  end
+
+  def median
+    return self[0] if length <= 1
+    sorted = sort
+    n = length
+    if n.odd? # length is odd
+      sorted[n/2]
+    else
+      (sorted[n/2] + sorted[n/2-1]).to_f/2
+    end
+  end
+
+  def histogram
+    k = Hash.new(0)
+    self.each { |x| k[x] += 1 }
+    k
+  end
 end
 
 module ChrisMath
-	
-	include Math
-	
-	def bi_gaussian_rand
-		u1 = rand()
-		u2 = rand()
-		z0 = sqrt(-2*log(u1))*cos(2*PI*u2)
-		z1 = sqrt(-2*log(u1))*sin(2*PI*u2)
-		return [z0,z1]
-	end
+  
+  include Math
+
+  def gaussian_array(n = 1)
+    (1..n).map do
+      u1 = rand()
+      u2 = rand()
+      sqrt(-2*log(u1))*cos(2*PI*u2)
+    end
+  end
+  
+  def bi_gaussian_rand
+    u1 = rand()
+    u2 = rand()
+    z0 = sqrt(-2*log(u1))*cos(2*PI*u2)
+    z1 = sqrt(-2*log(u1))*sin(2*PI*u2)
+    [z0,z1]
+  end
 
-	def gaussian_rand(mean,std)
-		u1 = rand()
-		u2 = rand()
-		z0 = sqrt(-2*log(u1))*cos(2*PI*u2)
-		z0*std + mean
-	end
-	
-	
-	def std(values)
-		n = values.count
-		raise "n = #{n} but must be greater than 1" if n < 2 
-		m = mean(values)
-		sum = values.inject { |s,v| s + (v**2 - m**2)}
-		sqrt(sum.to_f/(n -1))
-	end
-	
+  def gaussian_rand(mean,std)
+    u1 = rand()
+    u2 = rand()
+    z0 = sqrt(-2*log(u1))*cos(2*PI*u2)
+    z0*std + mean
+  end
+  
+  
+  def std(values)
+    n = values.count
+    fail 'n = #{n} but must be greater than 1' if n < 2
+    m = mean(values)
+    sum = values.inject { |s,v| s + (v**2 - m**2)}
+    sqrt(sum.to_f/(n - 1))
+  end
+  
 
-	def combinatorial_distribution(n,r,p)
-		# probability that r out n or greater hits with the 
-		# probability of one hit is p.
-		if r <= n && r >= 0
-		sum = 0
-		(r..n).each do |k|
-			sum += combinatorial(n,k)*(p)**(k)*(1-p)**(n -k)
-		end
-		sum
-		else
-			raise "Error, #{r} must be >= 0  and <= #{n}"
-		end
-	end
-	
-	def factorial(n)
-		#from rosetta code
-		(1..n).inject {|prod, i| prod * i}
-	end
-	
-	def combinatorial(n, k)
-		#from rosetta code
-		(0...k).inject(1) do |m,i| (m * (n - i)) / (i + 1) end
-	end
-	
+  def combinatorial_distribution(n,r,p)
+    # probability that r out n or greater hits with the 
+    # probability of one hit is p.
+    if r <= n && r >= 0
+    sum = 0
+    (r..n).each do |k|
+      sum += combinatorial(n,k)*(p)**(k)*(1-p)**(n - k)
+    end
+    sum
+    else
+      fail 'Error, #{r} must be >= 0  and <= #{n}'
+    end
+  end
+  
+  def factorial(n)
+    #from rosetta code
+    (1..n).inject {|prod, i| prod * i}
+  end
+  
+  def combinatorial(n, k)
+    #from rosetta code
+    (0...k).inject(1) do |m,i| (m * (n - i)) / (i + 1) end
+  end
+  
 end

data/lib/chris_lib/version.rb

@@ -1,3 +1,3 @@
 module ChrisLib
-  VERSION = "1.0.2"
+  VERSION = "1.0.3"
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: chris_lib
 version: !ruby/object:Gem::Version
-  version: 1.0.2
+  version: 1.0.3
 platform: ruby
 authors:
 - Chris
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2016-07-25 00:00:00.000000000 Z
+date: 2016-11-22 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rails
@@ -89,7 +89,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
       version: '0'
 requirements: []
 rubyforge_project: 
-rubygems_version: 2.6.6
+rubygems_version: 2.4.5
 signing_key: 
 specification_version: 4
 summary: This an eclectic collection of methods. It include maths, datetime, and rspec