SparseMatrixProject 0.0.1

data/.gitignore

@@ -0,0 +1,17 @@
+*.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/Gemfile

@@ -0,0 +1,13 @@
+source 'https://rubygems.org'
+
+# Specify your gem's dependencies in SparseMatrixProject.gemspec
+gem 'nokogiri'
+gem 'rack', '~>1.1'
+gem 'rspec', :require => 'spec'
+
+gem 'rake'
+gem 'rspec'
+gem 'guard'
+gem 'guard-rspec'
+gem 'guard-bundler'
+gem 'guard-gitpusher'

data/LICENSE.txt

@@ -0,0 +1,22 @@
+Copyright (c) 2013 Jacobo Saavedra
+
+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,29 @@
+# SparseMatrixProject
+
+TODO: Write a gem description
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+    gem 'SparseMatrixProject'
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install SparseMatrixProject
+
+## Usage
+
+TODO: Write usage instructions here
+
+## 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

data/Rakefile

@@ -0,0 +1,15 @@
+require "bundler/gem_tasks"
+
+$:.unshift File.dirname(__FILE__) + 'lib'
+$:.unshift './lib', './spec'
+
+require 'rspec/core/rake_task'
+RSpec::Core::RakeTask.new
+task :default => :spec
+
+desc "Run UniTest Matrices"
+task :test do
+   sh "ruby -Ilib -Itest test/tc_Matrices.rb"
+end
+
+

data/SparseMatrixProject.gemspec

@@ -0,0 +1,23 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'SparseMatrixProject/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = "SparseMatrixProject"
+  spec.version       = SparseMatrixProject::VERSION
+  spec.authors       = ["Jacobo Saavedra Valdes", "Aaron Jose Vera Cerdeña"]
+  spec.email         = ["alu0100658682@ull.edu.es", "alu0100537451@ull.edu.es"]
+  spec.description   = %q{Gema para realizar suma y resta entre matrices densas y dispersas}
+  spec.summary       = %q{Matrices dispersas y densas}
+  spec.homepage      = ""
+  spec.license       = ""
+
+  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"
+end

data/bin/SparseMatrixProject

@@ -0,0 +1,3 @@
+#!/usr/bin/env ruby
+
+require 'SparseMatrixProject'

data/lib/SparseMatrixProject/version.rb

@@ -0,0 +1,3 @@
+module SparseMatrixProject
+  VERSION = "0.0.1"
+end

data/lib/SparseMatrixProject.rb

@@ -0,0 +1,340 @@
+require "SparseMatrixProject/version"
+require "racional.rb"
+
+module SparseMatrixProject
+class Matrices
+        include Comparable
+        include Enumerable
+
+        attr_accessor :filas, :columnas, :matriz
+
+	def initialize(f, c)
+                #atributo
+                 @filas=f.to_i; #Numero de filas
+                 @columnas=c.to_i; #Numero de columnas
+        end
+
+#################################################      
+	def +(other) 
+		if(self.filas == other.filas and self.columnas == other.columnas)
+                        # SELF Matrices densas
+                        if self.instance_of?Densa
+                                temp = Densa.new(self.filas, self.columnas, nil)
+                                if other.instance_of?Densa
+                                        
+                                        for i in (0...@filas.to_i)
+                                                for j in (0...@columnas.to_i)
+                                                        temp.matriz[i][j] = (self.matriz[i][j]) + (other.matriz[i][j])
+                                                end
+                                        end
+                                end
+
+                                if other.instance_of?Dispersa
+                                        for i in (0...@filas.to_i)
+                                                for j in (0...@columnas.to_i)
+                                                        encontrado = 0
+                                                        for k in (0...other.posx.size)
+                                                                if (i==other.posx[k] and j==other.posy[k] and encontrado==0)
+                                                                        temp.matriz[i][j] = (self.matriz[i][j]) + (other.valor[k])
+                                                                        encontrado = 1        
+                                                                end
+                                                        end
+                                                        if (encontrado == 0)
+                                                                temp.matriz[i][j] = self.matriz[i][j]
+                                                        end
+                                                end
+                                        end
+                                end
+                        end
+
+                        # SELF Matriz Dispersa
+                        if self.instance_of?Dispersa
+                                if other.instance_of?Densa
+                                        temp = Densa.new(self.filas, self.columnas, nil)
+                                        for i in (0...@filas.to_i)
+                                                for j in (0...@columnas.to_i)
+                                                        encontrado = 0
+                                                        for k in (0...self.posx.size.to_i)
+                                                                if (i==self.posx[k] and j==self.posy[k] and encontrado==0)
+                                                                        temp.matriz[i][j] = (other.matriz[i][j]) + (self.valor[k])
+                                                                        encontrado = 1        
+                                                                end
+                                                        end
+                                                        if (encontrado == 0)
+                                                                temp.matriz[i][j] = other.matriz[i][j]
+                                                        end
+                                                end
+                                        end
+                                end
+                
+
+                                if other.instance_of?Dispersa
+                                        temp = Dispersa.new(self.filas,self.columnas,[],[],[])
+                                        temp.valor = self.valor
+                                        temp.posx = self.posx
+                                        temp.posy = self.posy
+
+                                        for j in (0...other.posx.size.to_i)
+                                                encontrado = false
+                                                for k in (0...self.posx.size.to_i)
+                                                        if(other.posx[j] == temp.posx[k] and other.posy[j] == temp.posy[k])
+                                                                temp.valor[k] = temp.valor[k] + other.valor[j]
+                                                                encontrado = true
+                                                        end
+                                                        
+                                                end
+                                                if (encontrado == false)
+                                                        temp.posx << other.posx[j]
+                                                        temp.posy << other.posy[j]
+                                                        temp.valor << other.valor[j]
+                                                end
+                                        end
+                                end
+                        end
+                
+                        return temp
+                else
+                        return nil
+                end       
+                
+        end
+##############################################################################
+
+##############################RESTA###########################################
+
+def -(other)        
+                if(self.filas == other.filas and self.columnas == other.columnas)
+                        # SELF Matrices densas
+                        if self.instance_of?Densa
+                                temp = Densa.new(self.filas, self.columnas, nil)
+                                if other.instance_of?Densa                
+                                        for i in (0...@filas.to_i)
+                                                for j in (0...@columnas.to_i)
+                                                        temp.matriz[i][j] = (self.matriz[i][j]) - (other.matriz[i][j])
+                                                end
+                                        end
+                                end
+
+                                if other.instance_of?Dispersa
+                                        for i in (0...@filas.to_i)
+                                                for j in (0...@columnas.to_i)
+                                                        encontrado = 0
+                                                        for k in (0...other.posx.size)
+                                                                if (i==other.posx[k] and j==other.posy[k] and encontrado==0)
+                                                                        temp.matriz[i][j] = (self.matriz[i][j]) - (other.valor[k])
+                                                                        encontrado = 1        
+                                                                end
+                                                        end
+                                                        if (encontrado == 0)
+                                                                temp.matriz[i][j] = self.matriz[i][j]
+                                                        end
+                                                end
+                                        end
+                                end
+                        end
+
+                        # SELF Matriz Dispersa
+                        if self.instance_of?Dispersa
+                                if other.instance_of?Densa
+                                        temp = Densa.new(self.filas, self.columnas, nil)
+                                        for i in (0...@filas.to_i)
+                                                for j in (0...@columnas.to_i)
+                                                        encontrado = 0
+                                                        for k in (0...self.posx.size.to_i)
+                                                                if (i==self.posx[k] and j==self.posy[k] and encontrado==0)
+                                                                        temp.matriz[i][j] = (other.matriz[i][j]) - (self.valor[k])
+                                                                        encontrado = 1        
+                                                                end
+                                                        end
+                                                        if (encontrado == 0)
+                                                                temp.matriz[i][j] = other.matriz[i][j]
+                                                        end
+                                                end
+                                        end
+                                end
+                
+
+                                if other.instance_of?Dispersa
+                                        temp = Dispersa.new(self.filas,self.columnas,[],[],[])
+                                        temp.valor = self.valor
+                                        temp.posx = self.posx
+                                        temp.posy = self.posy
+
+                                        for j in (0...other.posx.size.to_i)
+                                                encontrado = false
+                                                for k in (0...self.posx.size.to_i)
+                                                        if(other.posx[j] == temp.posx[k] and other.posy[j] == temp.posy[k])
+                                                                temp.valor[k] = temp.valor[k] - other.valor[j]
+                                                                encontrado = true
+                                                        end
+                                                        
+                                                end
+                                                if (encontrado == false)
+                                                        temp.posx << other.posx[j]
+                                                        temp.posy << other.posy[j]
+                                                        temp.valor << other.valor[j]
+                                                end
+                                        end
+                                end
+                        end
+                
+                        return temp
+                else
+                        return nil
+                end
+        end
+        
+end
+
+
+
+class Dispersa < Matrices
+attr_accessor :posx, :posy, :valor
+        def initialize(f,c,posx, posy, valor)
+                super(f,c)
+                @posx = posx
+                @posy = posy
+                @valor = valor
+
+        end
+
+        def to_s
+                s=String.new
+                s << "["
+                for i in (0...@filas.to_i)
+                        s << "[#{posx[i]},#{posy[i]},#{valor[i]}]"
+                end
+                s << "]"
+        end
+
+        def max
+                m = self.valor[0]
+                for i in (0...self.valor.size.to_i)
+                                if (self.valor[i]> m)
+                                        m = self.valor[i]
+                                end
+                end
+                return m
+        end
+
+        def min
+                m = self.valor[0]
+                for i in (0...self.valor.size.to_i)
+                                if (self.valor[i]< m)
+                                        m = self.valor[i]
+                                end
+                end
+                return m
+        end
+
+        def pos(a,b)
+                for i in (0...self.posx.size)
+                        if(posx[i]==a and posy[i]==b)
+                                return valor[i]
+                        end
+                end
+                return nil
+        end
+
+end
+
+
+class Densa < Matrices
+attr_accessor :matriz
+        
+def initialize(f,c,m)
+                super(f,c)
+                @matriz = Array.new(@filas.to_i){Array.new(@columnas.to_i)}
+
+                 if (m != nil)
+                        #Rellenamos la matriz con lo valores recibidos
+                         for i in (0...@filas.to_i)
+                                for j in (0...@columnas.to_i)
+                                        @matriz[i][j]=m[i*@columnas.to_i+j];
+                                end
+                         end
+                 end
+        end
+        # Metodos getter devuelve el valor de una posicion determinada
+
+        def pos(a,b)
+                @matriz[a][b]
+        end
+        
+        #Metodo que devuelve la matriz en forma de string
+        def to_s
+                "#{@matriz}"
+        end
+
+
+
+####Traspuesta de una matriz
+        def traspuesta
+                i=0
+                mtrasp = Array.new(@filas) {Array.new(self.columnas)}
+                while i < @filas
+                        j=0
+                        while j < @columnas
+                                mtrasp[i][j] = self.matriz[j][i]
+                                j+=1
+                        end
+                        i+=1
+                end
+                Matrices.new(mtrasp)
+        end
+
+
+####Opuesta de una matriz
+        def opuesta
+
+                i=0
+                mop = Array.new(@filas) {Array.new(self.columnas)}
+                while i < @filas
+                        j=0
+                        while j < @columnas
+                                mop[i][j] = (self.matriz[i][j]) * (- 1)
+                                j+=1
+                        end
+                        i+=1
+                end
+                Matrices.new(mop)
+
+        end
+
+############Método Mínimo######################################
+      def minimo
+                
+          min = self.matriz[0][0]                
+                i=0                                                                
+                while i < @filas                                                 
+                       j=0
+                       while j < @columnas                                        
+                              if(self.matriz[i][j] < min)                                        
+                                        min = self.matriz[i][j]                                        
+			      end
+                              j+= 1                                
+                        end
+                        i+= 1                        
+                end                                
+                return min                
+        end        
+
+##############Método Máximo######################################
+       def maximo
+                
+           max = self.matriz[0][0]                
+                i = 0                                                                                
+                while i < @filas                                                                       
+                        j = 0                        
+                        while j < @columnas                                                                        
+                                if(self.matriz[i][j] > max)                                        
+                                        max = self.matriz[i][j]                                        
+                                end                                
+                                j+= 1                                
+                        end                        
+                        i+= 1                        
+                end                                
+          return max                
+        end        
+end
+end

metadata

@@ -0,0 +1,90 @@
+--- !ruby/object:Gem::Specification
+name: SparseMatrixProject
+version: !ruby/object:Gem::Version
+  version: 0.0.1
+  prerelease: 
+platform: ruby
+authors:
+- Jacobo Saavedra Valdes
+- Aaron Jose Vera Cerdeña
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2013-11-22 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '1.3'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '1.3'
+- !ruby/object:Gem::Dependency
+  name: rake
+  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: Gema para realizar suma y resta entre matrices densas y dispersas
+email:
+- alu0100658682@ull.edu.es
+- alu0100537451@ull.edu.es
+executables:
+- SparseMatrixProject
+extensions: []
+extra_rdoc_files: []
+files:
+- .gitignore
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- SparseMatrixProject.gemspec
+- bin/SparseMatrixProject
+- lib/SparseMatrixProject.rb
+- lib/SparseMatrixProject/version.rb
+homepage: ''
+licenses:
+- ''
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 1.8.25
+signing_key: 
+specification_version: 3
+summary: Matrices dispersas y densas
+test_files: []