kwyjibo 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 886c37a69e3ad030b4be88e46b566dc2a10c6805
+  data.tar.gz: f6d6fc193642069fc4e8d2f7e108954996c5c4c9
+SHA512:
+  metadata.gz: a46b15539dd7e17be72a4154d5206b26d69569693364e9693e8fb73984cd9aeb5427afcceea212ddcaa7a841a0983139f9fc50110abe8798cb0729218507ae61
+  data.tar.gz: 31cd1b37c0c727e835b329b21b53382a8bff03a0ad4656a010d69fa7d5c2daada1c24f77172af5662340adb3c5adff1a6d4a8b2fe4a0ad221c33e3ed2076ad72

data/.gitignore

@@ -0,0 +1,18 @@
+*.gem
+*.rbc
+.bundle
+.config
+.yardoc
+Gemfile.lock
+InstalledFiles
+_yardoc
+coverage
+doc/
+lib/bundler/man
+pkg
+rdoc
+spec/reports
+test/tmp
+test/version_tmp
+tmp
+*~

data/.rspec

@@ -0,0 +1,2 @@
+--color
+--format progress

data/.travis.yml

@@ -0,0 +1,5 @@
+rvm:
+  - 1.9.3
+  - jruby
+
+script: "bundle exec rake"

data/Gemfile

@@ -0,0 +1,8 @@
+source 'https://rubygems.org'
+
+# Specify your gem's dependencies in kwyjibo.gemspec
+gemspec
+
+gem 'guard'
+gem 'guard-rspec'
+gem 'guard-bundler'

data/Guardfile

@@ -0,0 +1,38 @@
+guard 'bundler' do
+  watch('Gemfile')
+  watch(/^.+\.gemspec/)
+end
+
+guard 'rspec', :version => 2 do
+  watch(%r{^spec/.+_spec\.rb$})
+  watch(%r{^lib/(.+)\.rb$})     { |m| "spec/#{m[1]}_spec.rb" }
+  watch('spec/spec_helper.rb')  { "spec" }
+end
+
+guard :bundler do
+  watch('Gemfile')
+  # Uncomment next line if your Gemfile contains the `gemspec' command.
+  # watch(/^.+\.gemspec/)
+end
+
+guard :rspec do
+  watch(%r{^spec/.+_spec\.rb$})
+  watch(%r{^lib/(.+)\.rb$})     { |m| "spec/lib/#{m[1]}_spec.rb" }
+  watch('spec/spec_helper.rb')  { "spec" }
+
+  # Rails example
+  watch(%r{^app/(.+)\.rb$})                           { |m| "spec/#{m[1]}_spec.rb" }
+  watch(%r{^app/(.*)(\.erb|\.haml|\.slim)$})          { |m| "spec/#{m[1]}#{m[2]}_spec.rb" }
+  watch(%r{^app/controllers/(.+)_(controller)\.rb$})  { |m| ["spec/routing/#{m[1]}_routing_spec.rb", "spec/#{m[2]}s/#{m[1]}_#{m[2]}_spec.rb", "spec/acceptance/#{m[1]}_spec.rb"] }
+  watch(%r{^spec/support/(.+)\.rb$})                  { "spec" }
+  watch('config/routes.rb')                           { "spec/routing" }
+  watch('app/controllers/application_controller.rb')  { "spec/controllers" }
+
+  # Capybara features specs
+  watch(%r{^app/views/(.+)/.*\.(erb|haml|slim)$})     { |m| "spec/features/#{m[1]}_spec.rb" }
+
+  # Turnip features and steps
+  watch(%r{^spec/acceptance/(.+)\.feature$})
+  watch(%r{^spec/acceptance/steps/(.+)_steps\.rb$})   { |m| Dir[File.join("**/#{m[1]}.feature")][0] || 'spec/acceptance' }
+end
+

data/LICENSE.txt

@@ -0,0 +1,22 @@
+Copyright (c) 2013 José Alberto
+
+MIT License
+
+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,44 @@
+# Kwyjibo
+
+Creating a Gem to represent Matrix and Sparse Matrix
+
+## Class Inheritance
+
+We have a first class called Matriz where all Matrix will be stored and a subclass called Dispersa to represent a Sparse Matrix
+
+## Status
+
+[![Build Status](https://travis-ci.org/alu0100537291/kwyjibo.png?branch=master)](https://travis-ci.org/alu0100537291/kwyjibo)
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+    gem 'kwyjibo'
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install kwyjibo
+
+## Usage
+
+Gem under construction!
+
+## Contributing
+
+1. Fork it
+2. Create your feature branch (`git checkout -b my-new-feature`)
+3. Commit your changes (`git commit -am 'Add some feature'`)
+4. Push to the branch (`git push origin my-new-feature`)
+5. Create new Pull Request
+
+## Authors
+
+| ALUMNO | CORREO|
+| -------- | ------- |
+| José Alberto Pérez Melián | alu0100537291[AT]ull.edu.es |
+| Jéssica Alejandra Ramos Villarreal | alu0100537338[AT]ull.edu.es |

data/Rakefile

@@ -0,0 +1,10 @@
+require "bundler/gem_tasks"
+
+require 'rspec/core/rake_task'
+RSpec::Core::RakeTask.new
+task :default => :spec
+
+desc "Unit test"
+task :test do
+	sh "ruby -Ilib test/tc_kwyjibo.rb"
+end

data/kwyjibo.gemspec

@@ -0,0 +1,24 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'kwyjibo/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = "kwyjibo"
+  spec.version       = Kwyjibo::VERSION
+  spec.authors       = ["José Alberto"]
+  spec.email         = ["japmelian@gmail.com"]
+  spec.description   = %q{CoAuthor: Jéssica Alejandra Ramos Villarreal}
+  spec.summary       = %q{LPP - Práctica 9}
+  spec.homepage      = ""
+  spec.license       = "MIT"
+
+  spec.files         = `git ls-files`.split($/)
+  spec.executables   = spec.files.grep(%r{^bin/}) { |f| File.basename(f) }
+  spec.test_files    = spec.files.grep(%r{^(test|spec|features)/})
+  spec.require_paths = ["lib"]
+
+  spec.add_development_dependency "bundler", "~> 1.3"
+  spec.add_development_dependency "rake"
+  spec.add_development_dependency 'rspec', '~> 2.9'
+end

data/lib/kwyjibo.rb

@@ -0,0 +1,305 @@
+require "kwyjibo/version"
+
+module Kwyjibo
+    class Matrix
+        attr_reader :rows, :cols
+
+        def initialize(rows,cols)
+            @rows, @cols = rows, cols
+        end
+
+        def +(other)
+            raise ArgumentError, "Matrix size must be equal" unless @rows == other.rows && @cols == other.cols
+            c = DenseMatrix.new(@rows, @cols)
+            @rows.times do |i|
+                @cols.times do |j|
+                    if self[i][j] == nil && other[i][j] == nil
+                        c[i][j] = 0
+                    elsif self[i][j] == nil && other[i][j] != nil
+                        c[i][j] = other[i][j]
+                    elsif self[i][j] != nil && other[i][j] == nil
+                        c[i][j] = self[i][j]
+                    else
+                        c[i][j] = self[i][j] + other[i][j]
+                    end
+                end
+            end
+            c
+        end
+
+        def -(other)
+            raise ArgumentError, "Matrix size must be equal" unless @rows == other.rows && @cols == other.cols
+            c = DenseMatrix.new(@rows, @cols)
+            @rows.times do |i|
+                @cols.times do |j|
+                    if self[i][j] == nil && other[i][j] == nil
+                        c[i][j] = 0
+                    elsif self[i][j] == nil && other[i][j] != nil
+                        c[i][j] = -other[i][j]
+                    elsif self[i][j] != nil && other[i][j] == nil
+                        c[i][j] = self[i][j]
+                    else
+                        c[i][j] = self[i][j] - other[i][j]
+                    end
+                end
+            end
+            c
+        end
+
+        def *(other)
+            raise ArgumentError, "Columns and Rows must be equal" unless (@cols == other.rows)
+            c = DenseMatrix.new(@rows,other.cols)
+            @rows.times do |i|
+                other.cols.times do |j|
+                    ac = 0
+                    @cols.times do |k|
+                        ac += self[i][k] * other[k][j] if (self[i][k] != nil && other[k][j] != nil)
+                    end
+                    c[i][j] = ac
+                end
+            end
+            c
+        end
+
+        def max
+            encontrado = false
+            value = 0
+            i = -1
+
+            while encontrado == false
+                i += 1
+                j = 0
+                while j < self.cols
+                    if self[i][j] != nil and value == 0
+                        value = self[i][j]
+                        encontrado = true
+                        break
+                    else
+                        j += 1
+                    end
+                end
+            end
+
+            @rows.times do |i|
+                @cols.times do |j|
+                    if self[i][j] != nil && self[i][j] > value
+                        value = self[i][j]
+                    end
+                end
+            end
+            value
+        end
+
+        def min
+            encontrado = false
+            value = 0
+            i = -1
+
+            while encontrado == false
+                i += 1
+                j = 0
+                while j < self.cols
+                    if self[i][j] != nil and value == 0
+                        value = self[i][j]
+                        encontrado = true
+                        break
+                    else
+                        j += 1
+                    end
+                end
+            end
+
+            @rows.times do |i|
+                @cols.times do |j|
+                    if self[i][j] != nil && self[i][j] < value
+                        value = self[i][j]
+                    end
+                end
+            end
+            value
+        end
+    end
+
+    class DenseMatrix < Matrix
+        attr_reader :data
+
+        def initialize(rows,cols)
+            @data = Array.new(rows) {Array.new(cols)}
+            super
+        end
+
+        def [](i)
+            @data[i]
+        end
+
+        def []=(i,value)
+            @data[i] = value
+        end
+
+        def tras()
+            c = DenseMatrix.new(@cols, @rows)
+            c.rows.times do |i|
+                c.cols.times do |j|
+                    c[i][j] = self[j][i]
+                end
+            end
+            c
+        end
+
+        def x(value)
+            self.rows.times do |i|
+                self.cols.times do |j|
+                    self[i][j] *= 2
+                end
+            end
+        end
+    end
+
+    class SparseVector
+        attr_reader :vector
+
+        def initialize(h = {})
+            @vector = Hash.new(0)
+            @vector = @vector.merge!(h)
+        end
+
+        def [](i)
+            @vector[i]
+        end
+    end
+
+    class SparseMatrix < Matrix
+        attr_reader :data
+
+        def initialize(rows,cols, h = {})
+            @data = Hash.new({})
+            for k in h.keys do
+                if h[k].is_a? SparseVector
+                    @data[k] = h[k]
+                else
+                    @data[k] = SparseVector.new(h[k])
+                end
+            end
+            super(rows,cols)
+        end
+
+        def [](i)
+            @data[i]
+        end
+    end
+
+    class Fraccion
+        include Comparable
+
+        attr_accessor :num, :denom
+
+        def initialize(a, b)
+            x = mcd(a,b)
+            @num = a/x
+            @denom = b/x
+
+            if (@num < 0 && @denom < 0)
+                @num = @num * -1
+                @denom = @denom * -1
+            end
+
+            if (@denom < 0)
+                @denom = @denom * -1
+                @num = @num * -1
+            end
+        end
+
+        def mcd(u, v)
+           u, v = u.abs, v.abs
+           while v != 0
+              u, v = v, u % v
+           end
+           u
+        end
+
+        def to_s
+            "#{@num}/#{@denom}"
+        end
+
+        def to_f
+            @num.to_f/@denom.to_f
+        end
+
+        def +(other)
+            if other.instance_of? Fixnum
+                c = Fraccion.new(other,1)
+                Fraccion.new(@num * c.denom + @denom * c.num, @denom * c.denom)
+            else
+                Fraccion.new(@num * other.denom + @denom * other.num, @denom * other.denom)
+            end
+        end
+
+        def -(other)
+            if other.instance_of? Fixnum
+                c = Fraccion.new(other,1)
+                Fraccion.new(@num * c.denom - @denom * c.num, @denom * c.denom)
+            else
+                Fraccion.new(@num * other.denom - @denom * other.num, @denom * other.denom)
+            end
+        end
+
+        def *(other)
+            if other.instance_of? Fixnum
+                c = Fraccion.new(other,1)
+                Fraccion.new(@num * c.num, @denom * c.denom)
+            else
+                Fraccion.new(@num * other.num, @denom * other.denom)
+            end
+        end
+
+        def /(other)
+            if other.instance_of? Fixnum
+                c = Fraccion.new(other,1)
+                Fraccion.new(@num * c.denom, @denom * c.num)
+            else
+                Fraccion.new(@num * other.denom, @denom * other.num)
+            end        
+        end
+
+        def %(other)
+            if other.instance_of? Fixnum
+                c = Fraccion.new(other,1)
+                division = Fraccion.new(@num * c.denom, @denom * c.num)
+            else
+                division = Fraccion.new(@num * other.denom, @denom * other.num)
+            end  
+            division.num % division.denom
+        end
+
+        def abs
+            @num = @num.abs
+            @denom = @denom.abs
+        end
+
+        def reciprocal
+            x = @num
+            @num = @denom
+            @denom = x
+        end
+
+        def -@
+            if (@num > 0)
+                @num = @num * -1
+            end
+        end
+
+        def <=>(other)
+            return nil unless (other.instance_of? Fraccion) || (other.instance_of? Fixnum)
+            if other.instance_of? Fixnum
+                c = Fraccion.new(other,1)
+                (c.num.to_f/c.denom.to_f) <=> (self.num.to_f/self.denom.to_f)
+            else
+                (self.num.to_f/self.denom.to_f) <=> (other.num.to_f/other.denom.to_f)
+            end
+        end
+
+        def coerce(other)
+            [self,other]
+        end
+    end
+end

data/lib/kwyjibo/version.rb

@@ -0,0 +1,3 @@
+module Kwyjibo
+  VERSION = "0.1.0"
+end

data/spec/kwyjibo_spec.rb

@@ -0,0 +1,329 @@
+require 'spec_helper'
+
+describe Kwyjibo do
+	before :each do
+		@a = Kwyjibo::DenseMatrix.new(2,2)
+		@a[0][0] = Kwyjibo::Fraccion.new(1,1)
+		@a[0][1] = Kwyjibo::Fraccion.new(2,1)
+		@a[1][0] = Kwyjibo::Fraccion.new(3,1)
+		@a[1][1] = 4
+
+		@b = Kwyjibo::SparseMatrix.new(2,2,0 => { 0 => 1, 1 => 2})
+	end
+
+	describe "\n # Matrix data \n" do
+		it "### Una matriz densa tiene su numero de filas almacenadas" do
+			@a.rows.should eq(2)
+		end
+
+		it "### Una matriz densa tiene su numero de columnas almacenadas" do
+			@a.cols.should eq(2)
+		end
+
+		it "### Una matriz dispersa tiene su numero de filas almacenadas" do
+			@b.rows.should eq(2)
+		end
+
+		it "### Una matriz dispersa tiene su numero de columnas almacenadas" do
+			@b.cols.should eq(2)
+		end
+	end
+
+	describe "\n # Operaciones con matrices densas" do
+		describe "\n  ## Suma de matrices densas \n" do
+			it "### Se pueden sumar matrices del mismo tamano" do
+				c = Kwyjibo::DenseMatrix.new(2,2)
+
+				c[0][0] = 1
+				c[0][1] = 2
+				c[1][0] = 3
+				c[1][1] = 4
+
+				d = @a + c
+
+				d[0][0].should eq(2)
+				d[0][1].should eq(4)
+				d[1][0].should eq(6)
+				d[1][1].should eq(8)
+			end
+
+			it "### No se pueden sumar matrices de distinto tamano" do
+				c = Kwyjibo::DenseMatrix.new(2,1)
+
+				c[0][0] = 1
+				c[1][0] = 3
+
+				expect {@a + c}.to raise_error(ArgumentError)
+			end
+
+			it "### El resultado de sumar dos matrices densas debe ser una matriz densa" do
+				c = Kwyjibo::DenseMatrix.new(2,2)
+
+				c[0][0] = 1
+				c[0][1] = 2
+				c[1][0] = 3
+				c[1][1] = 4
+
+				d = @a + c
+
+				d.should be_an_instance_of Kwyjibo::DenseMatrix
+			end
+
+			it "### La suma de dos matrices densas debe dar una matriz densa del mismo tamano" do
+				c = Kwyjibo::DenseMatrix.new(2,2)
+
+				c[0][0] = 1
+				c[0][1] = 2
+				c[1][0] = 3
+				c[1][1] = 4
+
+				d = @a + c
+
+				d.rows.should eq(2)
+				d.cols.should eq(2)
+			end
+		end
+
+		describe "\n  ## Resta de matrices densas \n" do
+			it "### Se pueden restar matrices del mismo tamano" do
+				c = Kwyjibo::DenseMatrix.new(2,2)
+
+				c[0][0] = Kwyjibo::Fraccion.new(1,1)
+				c[0][1] = Kwyjibo::Fraccion.new(2,1)
+				c[1][0] = Kwyjibo::Fraccion.new(3,1)
+				c[1][1] = Kwyjibo::Fraccion.new(4,1)
+
+				d = @a - c
+
+				d[0][0].should eq(Kwyjibo::Fraccion.new(0,1))
+				d[0][1].should eq(Kwyjibo::Fraccion.new(0,1))
+				d[1][0].should eq(Kwyjibo::Fraccion.new(0,1))
+				d[1][1].should eq(Kwyjibo::Fraccion.new(0,1))
+			end
+
+			it "### No se pueden restar matrices de distinto tamano" do
+				c = Kwyjibo::DenseMatrix.new(2,1)
+
+				c[0][0] = Kwyjibo::Fraccion.new(1,1)
+				c[1][0] = Kwyjibo::Fraccion.new(3,1)
+
+				expect {@a - c}.to raise_error(ArgumentError)
+			end
+
+			it "### El resultado de restar dos matrices densas debe ser una matriz densa" do
+				c = Kwyjibo::DenseMatrix.new(2,2)
+
+				c[0][0] = 1
+				c[0][1] = 2
+				c[1][0] = 3
+				c[1][1] = 4
+
+				d = @a - c
+
+				d.should be_an_instance_of Kwyjibo::DenseMatrix
+			end
+
+			it "### La resta de dos matrices debe dar una matriz del mismo tamano" do
+				c = Kwyjibo::DenseMatrix.new(2,2)
+
+				c[0][0] = 1
+				c[0][1] = 2
+				c[1][0] = 3
+				c[1][1] = 4
+
+				d = @a - c
+
+				d.rows.should eq(2)
+				d.cols.should eq(2)
+			end
+		end
+
+		describe "\n  ## Multiplicacion de matrices densas \n" do
+			it "### Se pueden multiplicar dos matrices si el numero de columnas de la primera es igual al numero de de la segunda matriz" do
+				c = Kwyjibo::DenseMatrix.new(2,5)
+
+				c[0][0] = Kwyjibo::Fraccion.new(1,1)
+				c[0][1] = Kwyjibo::Fraccion.new(2,1)
+				c[0][2] = Kwyjibo::Fraccion.new(3,1)
+				c[0][3] = Kwyjibo::Fraccion.new(4,1)
+				c[0][4] = Kwyjibo::Fraccion.new(5,1)
+				c[1][0] = Kwyjibo::Fraccion.new(6,1)
+				c[1][1] = Kwyjibo::Fraccion.new(7,1)
+				c[1][2] = Kwyjibo::Fraccion.new(8,1)
+				c[1][3] = Kwyjibo::Fraccion.new(9,1)
+				c[1][4] = Kwyjibo::Fraccion.new(10,1)
+
+				d = @a * c
+
+				d[0][0].should eq(Kwyjibo::Fraccion.new(13,1))
+				d[0][1].should eq(Kwyjibo::Fraccion.new(16,1))
+				d[0][2].should eq(Kwyjibo::Fraccion.new(19,1))
+				d[0][3].should eq(Kwyjibo::Fraccion.new(22,1))
+				d[0][4].should eq(Kwyjibo::Fraccion.new(25,1))
+				d[1][0].should eq(Kwyjibo::Fraccion.new(27,1))
+				d[1][1].should eq(Kwyjibo::Fraccion.new(34,1))
+				d[1][2].should eq(Kwyjibo::Fraccion.new(41,1))
+				d[1][3].should eq(Kwyjibo::Fraccion.new(48,1))
+				d[1][4].should eq(Kwyjibo::Fraccion.new(55,1))
+			end
+
+			it "### No se pueden multiplicar dos matrices si el numero de columnas de la primera es distinto al numero de de la segunda matriz" do
+				c = Kwyjibo::DenseMatrix.new(1,2)
+
+				c[0][0] = 1
+				c[0][1] = Kwyjibo::Fraccion.new(2,1)
+
+				expect {@a * c}.to raise_error(ArgumentError)
+			end
+
+			it "### El resultado de multiplicar dos matrices debe ser una matriz con numero de filas igual a las filas de la primera matriz y numero de columnas igual al numero de columnas de la segunda matriz" do
+				c = Kwyjibo::DenseMatrix.new(2,5)
+
+				c[0][0] = Kwyjibo::Fraccion.new(1,1)
+				c[0][1] = Kwyjibo::Fraccion.new(2,1)
+				c[0][2] = Kwyjibo::Fraccion.new(3,1)
+				c[0][3] = Kwyjibo::Fraccion.new(4,1)
+				c[0][4] = Kwyjibo::Fraccion.new(5,1)
+				c[1][0] = Kwyjibo::Fraccion.new(6,1)
+				c[1][1] = Kwyjibo::Fraccion.new(7,1)
+				c[1][2] = Kwyjibo::Fraccion.new(8,1)
+				c[1][3] = Kwyjibo::Fraccion.new(9,1)
+				c[1][4] = Kwyjibo::Fraccion.new(10,1)
+
+				d = @a * c
+
+				d.rows.should eq(2)
+				d.cols.should eq(5)
+			end
+		end
+
+		describe "\n ##Operaciones entre matrices densas y escalares \n" do
+			it "### Se puede multiplicar una matriz densa por un escalar" do
+				@a.x(2)
+
+				@a[0][0].should eq(2)
+				@a[0][1].should eq(4)
+				@a[1][0].should eq(6)
+				@a[1][1].should eq(8)
+			end
+		end
+
+		describe "\n ## Opuesta de una matriz densa \n" do
+			it "### Se puede calcular la opuesta de una matriz densa" do
+				c = @a.tras
+
+				c[0][0].should eq(1)
+				c[0][1].should eq(3)
+				c[1][0].should eq(2)
+				c[1][1].should eq(4)
+			end
+
+			it "### En el calculo de la matriz opuesta de una matriz se intercambian sus filas y columnas" do
+				c = Kwyjibo::DenseMatrix.new(2,5)
+
+				c[0][0] = Kwyjibo::Fraccion.new(1,1)
+				c[0][1] = Kwyjibo::Fraccion.new(2,1)
+				c[0][2] = Kwyjibo::Fraccion.new(3,1)
+				c[0][3] = Kwyjibo::Fraccion.new(4,1)
+				c[0][4] = Kwyjibo::Fraccion.new(5,1)
+				c[1][0] = Kwyjibo::Fraccion.new(6,1)
+				c[1][1] = Kwyjibo::Fraccion.new(7,1)
+				c[1][2] = Kwyjibo::Fraccion.new(8,1)
+				c[1][3] = Kwyjibo::Fraccion.new(9,1)
+				c[1][4] = Kwyjibo::Fraccion.new(10,1)
+
+				d = c.tras
+
+				d.rows.should eq(5)
+				d.cols.should eq(2)
+			end
+		end
+	end
+
+	describe "\n # Calculo de valores maximos y minimos en una matriz \n" do
+		it "### Se puede calcular el valor maximo de los elementos de una matriz" do
+			@a.max.should eq(4)
+		end
+
+		it "### Se puede calcular el valor minimo de los elementos de una matriz" do
+			@a.min.should eq(1)
+		end
+	end
+
+	describe "\n # Operaciones con matrices dispersas \n" do
+		it "### Sumar dos matrices dispersas" do
+			q = Kwyjibo::SparseMatrix.new(2,2,0 => { 0 => 1, 1 => 2}, 1 => { 0 => 3, 1 => 4})
+			w = Kwyjibo::SparseMatrix.new(2,2,0 => { 0 => 1, 1 => 2}, 1 => { 0 => 3, 1 => 4})
+
+			c = q + w
+
+			c[0][0].should eq(2)
+			c[0][1].should eq(4)
+			c[1][0].should eq(6)
+			c[1][1].should eq(8)
+		end
+
+		it "### Sumar una matriz densa y otra dispersa" do
+			q = Kwyjibo::SparseMatrix.new(2,2,0 => { 0 => 1, 1 => 2}, 1 => { 0 => 3, 1 => 4})
+
+			c = @a + q
+
+			c[0][0].should eq(2)
+			c[0][1].should eq(4)
+			c[1][0].should eq(6)
+			c[1][1].should eq(8)
+		end
+
+		it "### Sumar una matriz dispersa y otra densa" do
+			q = Kwyjibo::SparseMatrix.new(2,2,0 => { 0 => 1, 1 => 2}, 1 => { 0 => 3, 1 => 4})
+
+			c = q + @a
+
+			c[0][0].should eq(2)
+			c[0][1].should eq(4)
+			c[1][0].should eq(6)
+			c[1][1].should eq(8)
+		end
+
+		it "### Multiplicacion de una matriz dispersa por una densa" do
+			q = Kwyjibo::SparseMatrix.new(2,2,0 => { 0 => Kwyjibo::Fraccion.new(5,1), 1 => 6})
+
+			c = @a * q
+
+			c[0][0].should eq(5)
+			c[0][1].should eq(6)
+			c[1][0].should eq(15)
+			c[1][1].should eq(Kwyjibo::Fraccion.new(18,1))
+		end
+
+		it "### El resultado de multiplicar dos matrices debe ser una matriz con numero de filas igual a las filas de la primera matriz y numero de columnas igual al numero de columnas de la segunda matriz" do
+			q = Kwyjibo::SparseMatrix.new(2,2,0 => { 0 => Kwyjibo::Fraccion.new(5,1), 1 => 6})
+
+			c = @a * q
+
+			c.rows.should eq(2)
+			c.cols.should eq(2)			
+		end
+	end
+
+	describe "\n # EXPECTATIVA A CUMPLIR \n" do
+		it "Suma de una matriz densa y una matriz dispersa" do
+			f = Kwyjibo::DenseMatrix.new(2,2)
+			f[0][0] = 2
+			f[0][1] = 1
+			f[1][0] = -5
+			f[1][1] = Kwyjibo::Fraccion.new(-3,2)
+
+			g = Kwyjibo::SparseMatrix.new(2,2, 1 => {1 => 1})
+
+			h = f + g
+
+			h.rows.should eq(2)
+			h.cols.should eq(2)
+			h[0][0].should eq(2)
+			h[0][1].should eq(1)
+			h[1][0].should eq(-5)
+			h[1][1].should eq(Kwyjibo::Fraccion.new(-1,2))
+		end
+	end
+end

data/spec/spec_helper.rb

@@ -0,0 +1,8 @@
+$:.unshift File.dirname(__FILE__) + '/../lib'
+require 'kwyjibo'
+
+RSpec.configure do |config|
+  config.treat_symbols_as_metadata_keys_with_true_values = true
+  config.run_all_when_everything_filtered = true
+  config.filter_run :focus
+end

data/test/tc_kwyjibo.rb

@@ -0,0 +1,97 @@
+require 'test/unit'
+require 'kwyjibo'
+
+class Test_Kwyjibo < Test::Unit::TestCase
+	def setup
+		@a = Kwyjibo::DenseMatrix.new(2,2)
+		@a[0][0] = Kwyjibo::Fraccion.new(1,1)
+		@a[0][1] = Kwyjibo::Fraccion.new(2,1)
+		@a[1][0] = Kwyjibo::Fraccion.new(3,1)
+		@a[1][1] = 4
+
+		@b = Kwyjibo::DenseMatrix.new(2,2)
+		@b[0][0] = Kwyjibo::Fraccion.new(5,1)
+		@b[0][1] = Kwyjibo::Fraccion.new(6,1)
+		@b[1][0] = 7
+		@b[1][1] = 8
+
+		@c = Kwyjibo::SparseMatrix.new(2,3,0 => { 0 => Kwyjibo::Fraccion.new(5,1), 1 => 6})
+	end
+
+	def test_rows
+		assert_equal(2,@a.rows)
+		assert_equal(2,@b.rows)
+		assert_not_equal(3,@a.rows)
+		assert_not_equal(3,@b.rows)
+	end
+
+	def test_cols
+		assert_equal(2,@a.cols)
+		assert_equal(2,@b.cols)
+		assert_not_equal(3,@a.cols)
+		assert_not_equal(3,@b.cols)
+	end
+
+	def test_values
+		assert_equal(Kwyjibo::Fraccion.new(1,1),@a[0][0])
+		assert_equal(Kwyjibo::Fraccion.new(2,1),@a[0][1])
+		assert_equal(3,@a[1][0])
+		assert_equal(4,@a[1][1])
+	end
+
+	def test_plus
+		d = @a + @b
+		assert_equal(2,d.rows)
+		assert_equal(2,d.cols)
+		assert_equal(6,d[0][0])
+		assert_equal(8,d[0][1])
+		assert_equal(10,d[1][0])
+		assert_equal(Kwyjibo::Fraccion.new(12,1),d[1][1])
+
+		assert_raise(ArgumentError) {@a + @c}
+	end
+
+	def test_minus
+		d = @a - @b
+		assert_equal(2,d.rows)
+		assert_equal(2,d.cols)
+		assert_equal(-4,d[0][0])
+		assert_equal(-4,d[0][1])
+		assert_equal(-4,d[1][0])
+		assert_equal(Kwyjibo::Fraccion.new(4,-1),d[1][1])
+
+		assert_raise(ArgumentError) {@a - @c}
+	end
+
+	def test_product
+		d = @a * @c
+		assert_equal(2,d.rows)
+		assert_equal(3,d.cols)
+		assert_equal(5,d[0][0])
+		assert_equal(6,d[0][1])
+		assert_equal(0,d[0][2])
+		assert_equal(15,d[1][0])
+		assert_equal(18,d[1][1])
+		assert_equal(0,d[1][2])
+	end
+
+	def test_traspose
+		d = @a.tras
+		assert_equal(2,d.cols)
+		assert_equal(2,d.rows)
+		assert_equal(1,d[0][0])
+		assert_equal(3,d[0][1])
+		assert_equal(2,d[1][0])
+		assert_equal(4,d[1][1])
+	end
+
+	def test_max
+		assert_equal(4,@a.max)
+		assert_equal(6,@c.max)
+	end
+
+	def test_min
+		assert_equal(Kwyjibo::Fraccion.new(1,1),@a.min)
+		assert_equal(Kwyjibo::Fraccion.new(0,1),@c.min)
+	end
+end

metadata

@@ -0,0 +1,103 @@
+--- !ruby/object:Gem::Specification
+name: kwyjibo
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- José Alberto
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2013-11-20 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '1.3'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '1.3'
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: rspec
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '2.9'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '2.9'
+description: 'CoAuthor: Jéssica Alejandra Ramos Villarreal'
+email:
+- japmelian@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- .gitignore
+- .rspec
+- .travis.yml
+- Gemfile
+- Guardfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- kwyjibo.gemspec
+- lib/kwyjibo.rb
+- lib/kwyjibo/version.rb
+- spec/kwyjibo_spec.rb
+- spec/spec_helper.rb
+- test/tc_kwyjibo.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: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 2.1.11
+signing_key: 
+specification_version: 4
+summary: LPP - Práctica 9
+test_files:
+- spec/kwyjibo_spec.rb
+- spec/spec_helper.rb
+- test/tc_kwyjibo.rb