linear1 1.0.0.pre

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 0958577ede7ba8fa57fd241fc9a29aae34cd911b
+  data.tar.gz: c8266881e23d9eab12c5538f0ee408eaf2271fe0
+SHA512:
+  metadata.gz: f1311e4c1482095f42a3f034d32ec7a87c00f45b8d779d8fd004e5ee2356d76d88c1a613f18e78e5bc9e78bdc2a792696485c7e2c2b889e78fc876fdc28cc1e8
+  data.tar.gz: 41fff4658e2866970b790045db11b208a5a4bc19ae2e1ee56695d640f3e4cd7d6aeb8acc3f181f950fdb9501278581c503fa368c4f8286543d633b9cd741aa69

data/LICENSE.md

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2015 Zachary Roth Perlmutter
+
+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,36 @@
+# linear1
+A gem that does linear algebra to an extent
+## Installation
+
+|Method|Runtime|Development|
+|:----:|:-----:|:---------:|
+|`Gemfile`|`gem 'linear1'`| `gem 'linear1', group: :development`|
+|RubyGems|`$ gem install linear1`    |   `$ gem install linear1 --development`    |
+|`.gemspec`|`gem.add_runtime_dependency "linear1"`|`gem.add_development_dependency "linear1"`  |
+
+## Usage
+`$ linear1 help`
+
+`$ linear1 graph _equation_`
+
+`$ linear1 display _equation_`
+
+`$ linear1 execute x _equation_`
+
+### equations
+Replace `_equation_` with one of these equations:
+
+`standard A B C`
+
+`point-slope slope x1 y1`
+
+`slope-intercept slope y_intercept`
+
+`function slope y_intercept power`
+
+`direct-variation k`
+
+## Badges
+[![Build Status](https://travis-ci.org/Zrp200/linear1.svg?branch=master)](https://travis-ci.org/Zrp200/linear1)
+[![Code Climate](https://codeclimate.com/github/Zrp200/linear1/badges/gpa.svg)](https://codeclimate.com/github/Zrp200/linear1)
+[![Test Coverage](https://codeclimate.com/github/Zrp200/linear1/badges/coverage.svg)](https://codeclimate.com/github/Zrp200/linear1)

data/bin/linear1

@@ -0,0 +1,18 @@
+#!/usr/bin/env ruby
+require "linear1"
+include Linear1
+equation = proc do |index|
+	case ARGV[index]
+		when "slope-intercept" then SlopeIntercept
+		when "standard" then Standard
+		when "function" then Function
+		when "direct-variation" then DirectVariation
+		when "point-slope" then PointSlope
+	end.find index + 1
+end
+puts case ARGV[0]
+	when "graph" then Graph.new equation.call 1
+	when "display" then equation.call 1
+	when "execute" then equation.call(2).execute ARGV[1].to_f
+	when "help" then "Help is not available. Please refer to the README."
+end

data/lib/linear1/arthmetic_sequence.rb

@@ -0,0 +1,21 @@
+require "linear1/function"
+module Linear1
+	class ArthmeticSequence < Function
+		attr_reader :a, :common_difference
+		alias d common_difference
+		alias to_a a
+		alias slope d
+		def initialize a
+			i = 0
+			while i < a.length - 2 
+				raise ArgumentError, "Elements must have a common difference" unless a[i+1] - a[i] == a[i+2] - a[i+1]
+				i += 1
+			end
+			@common_difference, @a = a[1] - a[0], a
+			super @common_difference, @a[0]
+		end
+		def to_s # Modified to count from zero instead of one
+			"a[n] = #{a[0]} + #{idx d}n"
+		end
+	end
+end

data/lib/linear1/direct_variation.rb

@@ -0,0 +1,15 @@
+require "linear1/slope_intercept"
+module Linear1
+	class DirectVariation < SlopeIntercept
+		# @param index1 [Fixnum] the index of the first argument
+		# @return [DirectVariation]
+		def self.find index1
+			new ARGV[index1]
+		end
+		def initialize k=1
+			super k, 0
+		end
+		alias k slope
+		alias constant_of_variation k
+	end
+end

data/lib/linear1/function.rb

@@ -0,0 +1,73 @@
+module Linear1
+	class Function
+		attr_reader :slope, :y_intercept, :power
+		# @param i1 [Fixnum] the index to start search
+		# @return [Function]
+		def self.find i1
+			Function.new ARGV[i1], ARGV[i1 + 1], ARGV[i1 + 2]
+		end
+		def initialize(slope=1, y_intercept=0, power=1)
+			@slope, @y_intercept, @power = slope.to_f, y_intercept.to_f, power.to_i
+		end
+		# @param x [Integer, Float]
+		# @return [Integer, Float]
+		def execute x
+			raise ArgumentError unless x.kind_of? Numeric
+			return slope * x ** power + y_intercept
+		end
+		alias f execute
+		def x_intercept
+			f(0)
+		end
+		alias zero x_intercept
+		alias solution x_intercept
+		alias root x_intercept
+		def to_s
+			"f(x) = #{idx slope.to_i if slope.to_i == slope}x#{power_string unless power == 1}#{" + #{@y_intercept.to_i if @y_intercept.to_i == @y_intercept}" unless direct_variation?}"
+		end
+		def direct_variation?
+			y_intercept.zero? and power == 1
+		end
+		alias dv? direct_variation?
+		def to_direct_variation
+			if direct_variation?
+				require "linear1/direct_variation"
+				DirectVariation.new slope
+			else
+				raise TypeError, "Unable to convert to DirectVariation"
+			end
+		end
+		def to_slope_intercept
+			raise "power must be 1" unless power == 1
+			SlopeIntercept.new slope, y_intercept
+		end
+		alias to_dv to_direct_variation
+		private
+		def power_string
+			final = String.new
+			final += "\u207b" if @power < 0
+			final << case @power
+				when 0 then "\u2070"
+				when 1 then "\u00b9"
+				when 2 then "\u00b2"
+				when 3 then "\u00b3"
+				when 4 then "\u2074"
+				when 5 then "\u2075"
+				when 6 then "\u2076"
+				when 7 then "\u2077"
+				when 8 then "\u2078"
+				when 9 then "\u2079"
+			end
+			return final
+		end
+		def idx(s)
+			return case s
+				when 1 then String.new
+				when -1 then ?-
+			else
+				s
+			end
+		end
+	end
+end
+			

data/lib/linear1/graph.rb

@@ -0,0 +1,89 @@
+require "linear1/function"
+module Linear1
+	class Graph
+		def initialize equation
+   			@equation = equation
+		end
+		@@axis = {x: 75, y: 25}
+    
+    		def self.axis(key)
+    			@@axis[key]
+    		end
+		
+		ORIGIN = {x: @@axis[:x] / 2, y: @@axis[:y] / 2} # The center of the graph
+	
+  		def to_a
+  			final = Array.new
+  			y = 0
+  			@@axis[:y].times do
+  				final[y] = Array.new
+  				x = 0
+  				@@axis[:x].times do
+  					final[y][x] = (!to_hash[y].nil? && to_hash[y] == x - ORIGIN[:x] ) ? ?\u2022 : format_grid(x - ORIGIN[:x], y - ORIGIN[:y])
+  					x += 1
+  				end
+  				y += 1
+			end
+			return final.reverse
+		end
+
+	
+  		def to_hash
+  			table = Hash.new
+  			for y in (0..@@axis[:y]).to_a
+  				for x in (0..@@axis[:x]).to_a
+  					x_exec, y_exec = @equation.execute(x - ORIGIN[:x]), y - ORIGIN[:y]
+  					table[y] = x_exec if x_exec == y_exec
+  				end
+  			end
+  			return table
+  		end
+  		alias to_h to_hash
+  		alias xy to_hash
+		def domain # @return [Array<Integer>] the values of the xy hash
+  			xy.values
+  		end
+  	
+  		def range # @return [Array<Integer>] the keys of the xy hash
+  			xy.keys
+  		end
+  		
+  		# @return [String] the graph
+  		def to_s
+  			result = String.new
+  			for y_index in to_a
+  				for x_index in y_index
+  					result << x_index
+  				end
+  				result << ?\n
+  			end
+  			return result.center(100)
+  		end
+  	
+  		private
+  	
+  		def check_axis_argument(arg)
+			if !(num.kind_of?(Integer) )
+				raise ArgumentError, "Argument must be a kind of Integer"
+			elsif num % 2 != 0
+				raise ArgumentError, "Argument must be even"
+			end
+ 		end
+ 
+		alias caa check_axis_argument
+		
+		# @return [String, nil]
+		def format_grid x, y
+			if x.zero? && y.zero?
+				"+"
+			elsif x.zero? && !y.zero?
+				"|"
+			elsif y.zero? && !x.zero?
+				"-"
+			else
+				" "
+			end
+		end
+				
+	end
+end

data/lib/linear1/point_slope.rb

@@ -0,0 +1,22 @@
+require "linear1/function"
+module Linear1
+	class PointSlope < Function
+		attr_reader :x1, :y1
+		private :y_intercept, :power
+		def initialize slope, x, y
+			@slope, @x1, @y1 = slope.to_f, x.to_f, y.to_f
+			super @slope, @x1 - @y1
+		end
+		def self.find index
+			new ARGV[index], ARGV[index + 1], ARGV[index + 2]
+		end
+		def to_slope_intercept
+			require "linear1/slope_intercept"
+			SlopeIntercept.new slope, y_intercept
+		end
+		alias to_si to_slope_intercept
+		def to_standard
+			to_si.to_standard
+		end
+	end
+end

data/lib/linear1/slope_intercept.rb

@@ -0,0 +1,23 @@
+require "linear1/function"
+module Linear1
+	class SlopeIntercept < Function
+		def self.find(index1, array=ARGV)
+			i = 0
+			until i == 2
+				raise ArgumentError, "array[#{index1 + i}] must be a number" unless (array[index1 + i].to_i.to_s == array[index1 + i] || array[index1 + i].to_f.to_s == array[index1 + i])
+				i += 1
+			end
+			return new array[index1+0].to_f, array[index1+1].to_f
+		end
+		def to_s
+			return super.sub "f(x)", "y"
+		end
+		def initialize(slope, y_intercept)
+			super
+		end
+		def to_standard
+			require "linear1/standard"
+			Standard.new slope, -1, -y_intercept
+		end
+	end
+end

data/lib/linear1/standard.rb

@@ -0,0 +1,41 @@
+require "linear1/function"
+module Linear1
+	class Standard < Function
+		attr_reader :a, :b, :c
+		private :slope, :y_intercept
+		def self.find index
+			array = ARGV[index..(index + 2)]
+			$equation_index = index + 3
+			return new array[0], array[1], array[2]
+		end
+		def initialize a, b, c
+			@a, @b, @c = a.to_f, b.to_f, c.to_f
+			super @c / @b / @a, @c / @b
+		end
+		def multiply int
+			new @a * int, @b * int, @c * int
+		end
+		def multiply! factor
+			@a *= factor
+			@b *= factor
+			@c *= factor
+		end
+		def add! int
+			@a += int
+			@b += int
+			@c += int
+		end
+		def add int
+			new @a + int, @b + int, @c + int
+		end
+		def to_s
+			"#{idx a}x + #{idx b} = #{c}"
+		end
+		def to_slope_intercept
+			require "linear1/slope_intercept"
+			SlopeIntercept.new slope, y_intercept
+		end
+		alias to_si to_slope_intercept
+	end
+end
+				

data/lib/linear1/system.rb

@@ -0,0 +1,17 @@
+module Linear1
+  class System
+    attr_reader :e1, :e2
+    def initialize equation1, equation2
+      @e1, @e2 = equation1, equation2
+    end
+    def execute x
+      final = Array.new
+      @equations.each {|equation| final << equation.execute(x)}
+      return final
+    end
+  end
+end
+    
+    
+      
+  

data/lib/linear1.rb

@@ -0,0 +1,8 @@
+require "linear1/system"
+require "linear1/standard"
+require "linear1/slope_intercept"
+require "linear1/point_slope"
+require "linear1/function"
+require "linear1/graph"
+require "linear1/direct_variation"
+

data/spec/lib/linear1/direct_variation_spec.rb

@@ -0,0 +1,9 @@
+require "linear1/direct_variation"
+include Linear1
+RSpec.describe DirectVariation do
+  describe "#new" do
+    subject {DirectVariation.new rand}
+    it {is_expected.to be_direct_variation}
+    it {is_expected.to be_kind_of SlopeIntercept}
+  end
+end

data/spec/lib/linear1/function_spec.rb

@@ -0,0 +1,13 @@
+require "linear1/function"
+include Linear1
+RSpec.describe Function do
+  describe "#new" do
+    context "given no arguments" do
+      subject {Function.new}
+      its(:to_s) {is_expected.to eq "f(x) = x"}
+      its(:power) {is_expected.to eq 1}
+      its(:slope) {is_expected.to eq 1}
+      its(:y_intercept) {is_expected.to be_zero}
+    end
+  end
+end

data/spec/lib/linear1/graph_spec.rb

@@ -0,0 +1,13 @@
+require "linear1/graph"
+include Linear1
+RSpec.describe Graph do
+  describe "#new" do
+    context "given Function" do
+      subject {Graph.new Function.new}
+      it "should not raise error" do
+        expect{Graph.new Function.new}.to_not raise_error
+      end
+      %i[range domain to_a].each {|method| its(method) {is_expected.to be_an_instance_of Array} }
+    end
+  end
+end

data/spec/lib/linear1/slope_intercept_spec.rb

@@ -0,0 +1,20 @@
+require "linear1/slope_intercept"
+include Linear1
+RSpec.describe SlopeIntercept do
+	describe "#new" do
+		subject {SlopeIntercept.new rand, rand}
+		it {is_expected.to be_kind_of Function}
+		its(:power) {is_expected.to eq 1}
+		it {is_expected.to respond_to :execute, :y_intercept, :to_direct_variation, :to_standard, :slope}
+		context "given 1" do
+			it "should raise error" do
+				expect{SlopeIntercept.new 1}.to raise_error
+			end
+		end
+		context "given 1, 0" do
+			subject {SlopeIntercept.new 3, 6}
+			it {is_expected.to_not be_direct_variation}
+			its(:to_s) {is_expected.to eq "y = 3x + 6"}
+		end
+	end
+end

data/spec/lib/linear1/standard_spec.rb

@@ -0,0 +1,10 @@
+require "linear1/standard"
+include Linear1
+RSpec.describe Standard do
+	describe "#new" do
+		subject {Standard.new rand, rand, rand}
+		it {is_expected.to be_kind_of Function}
+		it {is_expected.to respond_to :execute, :a, :b, :c, :direct_variation?}
+	end
+end
+		

metadata

@@ -0,0 +1,96 @@
+--- !ruby/object:Gem::Specification
+name: linear1
+version: !ruby/object:Gem::Version
+  version: 1.0.0.pre
+platform: ruby
+authors:
+- Zachary Perlmutter
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2015-01-29 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: rspec
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '3.1'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '3.1'
+- !ruby/object:Gem::Dependency
+  name: rspec-its
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.1'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.1'
+description: 
+email: zrp200@gmail.com
+executables:
+- linear1
+extensions: []
+extra_rdoc_files:
+- LICENSE.md
+- README.md
+files:
+- LICENSE.md
+- README.md
+- bin/linear1
+- lib/linear1.rb
+- lib/linear1/arthmetic_sequence.rb
+- lib/linear1/direct_variation.rb
+- lib/linear1/function.rb
+- lib/linear1/graph.rb
+- lib/linear1/point_slope.rb
+- lib/linear1/slope_intercept.rb
+- lib/linear1/standard.rb
+- lib/linear1/system.rb
+- spec/lib/linear1/direct_variation_spec.rb
+- spec/lib/linear1/function_spec.rb
+- spec/lib/linear1/graph_spec.rb
+- spec/lib/linear1/slope_intercept_spec.rb
+- spec/lib/linear1/standard_spec.rb
+homepage: 
+licenses:
+- MIT
+metadata: {}
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">"
+    - !ruby/object:Gem::Version
+      version: 1.3.1
+requirements: []
+rubyforge_project: 
+rubygems_version: 2.2.2
+signing_key: 
+specification_version: 4
+summary: Does linear algebra, to an extent
+test_files:
+- spec/lib/linear1/direct_variation_spec.rb
+- spec/lib/linear1/function_spec.rb
+- spec/lib/linear1/graph_spec.rb
+- spec/lib/linear1/slope_intercept_spec.rb
+- spec/lib/linear1/standard_spec.rb