sparsematrix 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 75a863cc44635687c0dbbdef870967237ed1f591
+  data.tar.gz: 2aef4b2397b7bed56dc45f4442192a6b159f791c
+SHA512:
+  metadata.gz: ec3371816390c08de7defe518b26b9eccd3c973d64287b42e4bcd1dbc224a1a17eef2a71c3215b26100bcae4ba4fadb60d524d7fb1add2b823fdbea0475ffbe9
+  data.tar.gz: 89cb75aaa47a1b380dad896f3ef565e92c2d0d6ba63d9d8565ccb21448735dbde5c4e3514c7e04e6a3c412535469696bc6cdae78ce96980b47527381f40c2a9d

data/.gitignore

@@ -0,0 +1,9 @@
+/.bundle/
+/.yardoc
+/Gemfile.lock
+/_yardoc/
+/coverage/
+/doc/
+/pkg/
+/spec/reports/
+/tmp/

data/.rspec

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

data/.travis.yml

@@ -0,0 +1,4 @@
+language: ruby
+rvm:
+  - 2.2.1
+before_install: gem install bundler -v 1.10.5

data/CODE_OF_CONDUCT.md

@@ -0,0 +1,13 @@
+# Contributor Code of Conduct
+
+As contributors and maintainers of this project, we pledge to respect all people who contribute through reporting issues, posting feature requests, updating documentation, submitting pull requests or patches, and other activities.
+
+We are committed to making participation in this project a harassment-free experience for everyone, regardless of level of experience, gender, gender identity and expression, sexual orientation, disability, personal appearance, body size, race, ethnicity, age, or religion.
+
+Examples of unacceptable behavior by participants include the use of sexual language or imagery, derogatory comments or personal attacks, trolling, public or private harassment, insults, or other unprofessional conduct.
+
+Project maintainers have the right and responsibility to remove, edit, or reject comments, commits, code, wiki edits, issues, and other contributions that are not aligned to this Code of Conduct. Project maintainers who do not follow the Code of Conduct may be removed from the project team.
+
+Instances of abusive, harassing, or otherwise unacceptable behavior may be reported by opening an issue or contacting one or more of the project maintainers.
+
+This Code of Conduct is adapted from the [Contributor Covenant](http://contributor-covenant.org), version 1.0.0, available at [http://contributor-covenant.org/version/1/0/0/](http://contributor-covenant.org/version/1/0/0/)

data/Gemfile

@@ -0,0 +1,4 @@
+source 'https://rubygems.org'
+
+# Specify your gem's dependencies in sparsematrix.gemspec
+gemspec

data/LICENSE.txt

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2015 Reed Kraft-Murphy
+
+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,68 @@
+# SparseMatrix
+
+Sparse matrix implementations (just Yale currently) in pure Ruby.
+
+Why? Why not.
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+```ruby
+gem 'sparsematrix'
+```
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install sparsematrix
+
+## Usage
+
+```ruby
+require 'sparsematrix'
+sparse = SparseMatrix::YaleSparseMatrix.new 0
+(1..10).each { |n| sparse[n, n] = 1 }
+sparse.each_with_index { |value, row, column| puts "sparse[#{row}, #{column}] = #{value}" }
+# sparse[1, 1] = 1
+# sparse[2, 2] = 1
+# sparse[3, 3] = 1
+# sparse[4, 4] = 1
+# sparse[5, 5] = 1
+# sparse[6, 6] = 1
+# sparse[7, 7] = 1
+# sparse[8, 8] = 1
+# sparse[9, 9] = 1
+# sparse[10, 10] = 1
+puts sparse.inspect(true)
+# SparseMatrix::YaleSparseMatrix[
+# [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
+# [0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0],
+# [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0],
+# [0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0],
+# [0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0],
+# [0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0],
+# [0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0],
+# [0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0],
+# [0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0],
+# [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0],
+# [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1]] # efficient 8.26% density
+```
+
+## Development
+
+After checking out the repo, run `bin/setup` to install dependencies. Then, run `rake rspec` to run the tests. You can also run `bin/console` for an interactive prompt that will allow you to experiment.
+
+To install this gem onto your local machine, run `bundle exec rake install`. To release a new version, update the version number in `version.rb`, and then run `bundle exec rake release`, which will create a git tag for the version, push git commits and tags, and push the `.gem` file to [rubygems.org](https://rubygems.org).
+
+## Contributing
+
+Bug reports and pull requests are welcome on GitHub at https://github.com/[USERNAME]/sparsematrix. This project is intended to be a safe, welcoming space for collaboration, and contributors are expected to adhere to the [Contributor Covenant](contributor-covenant.org) code of conduct.
+
+
+## License
+
+The gem is available as open source under the terms of the [MIT License](http://opensource.org/licenses/MIT).

data/Rakefile

@@ -0,0 +1,101 @@
+require 'bundler/gem_tasks'
+
+begin
+  require 'rspec/core/rake_task'
+  RSpec::Core::RakeTask.new(:spec)
+rescue LoadError
+end
+
+begin
+  require 'yard'
+  YARD::Rake::YardocTask.new do |t|
+    t.options = [
+      '--markup', 'markdown',
+      '-o', 'doc/',
+      '--private'
+    ]
+  end
+rescue LoadError
+end
+
+begin
+  require 'stackprof'
+  desc 'profile the benchmark task'
+  task :prof do
+    stackprof_data = StackProf.run(mode: :wall, out: 'stackprof.out') do
+      Rake::Task["bench"].execute
+    end
+  end
+rescue LoadError
+end
+
+begin
+  require 'benchmark'
+  desc 'benchmark YaleSparseMatrix against Matrix'
+  task :bench do
+    require 'sparsematrix/yale'
+    require 'matrix'
+
+    SIZES = [
+      [10, 10],
+      [100, 100],
+      # [1000, 1000],
+      # [10_000, 10_000]
+    ]
+    DENSITIES = [0.1, 0.3, 0.5, 0.7, 0.9]
+    N = 100
+    SIZES.each do |rows, cols|
+      printf "Size: %d rows x %d cols\n", rows, cols
+      space_efficient_density_threshold = (rows * (cols - 1) - 1) / (2.0 * rows * cols)
+      printf "Expect density threshold: %.2f", space_efficient_density_threshold
+      DENSITIES.each do |density|
+        zero = 0
+        puts
+        printf "Density: %.2f\n", density
+        puts "YaleSparseMatrix"
+        Benchmark.bm(16) do |bm|
+          sparse = nil
+          bm.report("initialize") do
+            N.times do
+              sparse = SparseMatrix::YaleSparseMatrix.build(zero, rows, cols) { rand <= density ? 1 : zero }
+            end
+          end
+          bm.report("iterate all") do
+            N.times do
+              sparse.each(true) { |e| e == 1 }
+            end
+          end
+          bm.report("iterate non zero") do
+            N.times do
+              sparse.each { |e| e == 1 }
+            end
+          end
+        end
+
+        puts
+        puts "Matrix"
+        Benchmark.bm(16) do |bm|
+          matrix = nil
+          bm.report("initialize") do
+            N.times do
+              matrix = Matrix.build(rows, cols) { rand <= density ? 1 : zero }
+            end
+          end
+          bm.report("iterate all") do
+            N.times do
+              matrix.each { |e| e == 1 }
+            end
+          end
+          bm.report("iterate non zero") do
+            N.times do
+              matrix.each.select{ |e| e!= zero }.each { |e| e == 1 }
+            end
+          end
+        end
+
+        puts
+      end
+    end
+  end
+rescue LoadError
+end

data/bin/console

@@ -0,0 +1,11 @@
+#!/usr/bin/env ruby
+
+require "bundler/setup"
+require "sparsematrix"
+
+# You can add fixtures and/or initialization code here to make experimenting
+# with your gem easier. You can also use a different console, if you like.
+
+# (If you use this, don't forget to add pry to your Gemfile!)
+require "pry"
+Pry.start

data/bin/setup

@@ -0,0 +1,7 @@
+#!/bin/bash
+set -euo pipefail
+IFS=$'\n\t'
+
+bundle install
+
+# Do any other automated setup that you need to do here

data/lib/sparsematrix.rb

@@ -0,0 +1,2 @@
+require 'sparsematrix/version'
+require 'sparsematrix/yale'

data/lib/sparsematrix/version.rb

@@ -0,0 +1,3 @@
+module SparseMatrix
+  VERSION = '0.1.0'
+end

data/lib/sparsematrix/yale.rb

@@ -0,0 +1,293 @@
+module SparseMatrix
+  # The Yale sparse matrix format stores an initial sparse `m` x `n` matrix, `M`, in
+  # row form using three (one-dimensional) arrays (`A`, `IA`, `JA`). Let `NNZ` denote
+  # the number of nonzero entries in `M`. (Note that zero-based indices shall be
+  # used here.)
+  #
+  # * The array `A` is of length `NNZ` and holds all the nonzero entries of `M` in
+  #   left-to-right top-to-bottom ("row-major") order.
+  #
+  # * The array `IA` is of length `m + 1` and contains the index in `A` of the first
+  #   element in each row, followed by the total number of nonzero elements `NNZ`.
+  #   `IA[i]` contains the index in `A` of the first nonzero element of row `i`. Row `i`
+  #   of the original matrix extends from `A[IA[i]]` to `A[IA[i + 1] - 1]`, i.e.
+  #   from the start of one row to the last index before the start of the next.
+  #   The last entry, `IA[m]`, must be the number of elements in `A`.
+  #
+  # * The third array, `JA`, contains the column index in `M` of each element of `A`
+  #   and hence is of length `NNZ` as well.
+  #
+  # For example, the matrix
+  #
+  #     0 0 0 0
+  #     5 8 0 0
+  #     0 0 3 0
+  #     0 6 0 0
+  #
+  # is a 4 x 4 matrix with 4 nonzero elements, hence
+  #
+  #     A  = [ 5 8 3 6 ]
+  #     IA = [ 0 0 2 3 4 ]
+  #     JA = [ 0 1 2 1 ]
+  #
+  # So, in array `JA`, the element "5" from `A` has column index 0, "8" and "6"
+  # have index 1, and element "3" has index 2.
+  #
+  # In this case the Yale representation contains 13 entries, compared to 16 in
+  # the original matrix. The Yale format saves on memory only when
+  # `NNZ < (m (n - 1) - 1) / 2`. Another example, the matrix
+  #
+  #     10 20  0  0  0  0
+  #      0 30  0 40  0  0
+  #      0  0 50 60 70  0
+  #      0  0  0  0  0 80
+  #
+  # is a 4 x 6 matrix (24 entries) with 8 nonzero elements, so
+  #
+  #     A  = [ 10 20 30 40 50 60 70 80 ]
+  #     IA = [ 0 2 4 7 8 ]
+  #     JA = [ 0 1 1 3 2 3 4 5 ]
+  #
+  # The whole is stored as 21 entries.
+  #
+  # `IA` splits the array `A` into rows: `(10, 20) (30, 40) (50, 60, 70) (80)`;
+  # `JA` aligns values in columns:
+  # `(10, 20, ...) (0, 30, 0, 40, ...)(0, 0, 50, 60, 70, 0) (0, 0, 0, 0, 0, 80)`.
+  # Note that in this format, the first value of `IA` is always zero and the last
+  # is always `NNZ`, so they are in some sense redundant. However, they can make
+  # accessing and traversing the array easier for the programmer.
+  #
+  # https://en.wikipedia.org/wiki/Sparse_matrix#Yale
+  class YaleSparseMatrix
+    def self.build(zero, rows, columns, &block)
+      return enum_for :build, rows, columns unless block_given?
+      smx = new zero
+      rows.times do |row|
+        columns.times do |column|
+          value = yield row, column
+          smx[row, column] = value unless value == zero
+        end
+      end
+      smx
+    end
+
+    # @param zero The value to return for zero / unused elements
+    def initialize(zero = nil)
+      @zero = zero
+      @elements = []
+      @row_index = [0]
+      @index_column = []
+    end
+    attr_reader :zero, :elements, :row_index,
+                :index_column
+
+    alias_method :a, :elements
+    alias_method :ia, :row_index
+    alias_method :ja, :index_column
+
+    # @param row [Numeric] row part of the index to return
+    # @param column [Numeric] column part of the index to return
+    # @return the element at the given index, or #zero
+    def [](row, column)
+      index = element_index row, column
+      return zero unless index
+      elements[index]
+    end
+    alias_method :element, :[]
+    alias_method :component, :[]
+
+    # @param row [Numeric] row part of the index to set
+    # @param column [Numeric] column part of the index to set
+    # @param value the value to set
+    # @return the value that was passed in
+    def []=(row, column, value)
+      if row >= row_count
+        add_rows(row - row_count + 1)
+      end
+
+      index = row_start = row_index[row]
+      row_end = row_index[row + 1]
+
+      while index < row_end
+        current_column = index_column[index]
+        if current_column == column
+          @elements[index] = value
+          return value
+        end
+        break if current_column > column
+        index += 1
+      end
+
+      @elements.insert(index, value)
+      @index_column.insert(index, column)
+      while row < row_count
+        row += 1
+        @row_index[row] += 1
+      end
+      value
+    end
+
+    # Compares two SparseMatrix's for equality
+    # @param other [YaleSparseMatrix]
+    # @return [Boolean]
+    def ==(other)
+      return false unless other.is_a? YaleSparseMatrix
+      nonzero_element_count == other.nonzero_element_count &&
+        elements == other.elements &&
+        row_index == other.row_index &&
+        index_column == other.index_column
+    end
+
+    # @param block
+    # @return [YaleSparseMatrix] a new SparseMatrix whos elements have been mapped
+    #                        through the supplied block
+    def collect(&block)
+      return enum_for :collect unless block_given?
+      clone.instance_eval { @elements.collect(&block) }
+    end
+    alias_method :map, :collect
+
+    # @return [Numeric] The number of columns in the matrix
+    def column_count
+      row_index
+      index_column.last + 1
+    end
+    alias_method :n, :column_count
+
+    # @return the density of the SparseMatrix; that is, how many elements are
+    #         non-zero divided by the total size of the matrix
+    def density
+      nonzero_element_count / (row_count * column_count * 1.0)
+    end
+    alias_method :sparsity, :density
+
+    # Passes each element of the matrix to the supplied block
+    # @param block
+    # @return [YaleSparseMatrix]
+    def each(zeroes = false, &block)
+      return enum_for :each, zeroes unless block_given?
+      if zeroes
+        row_count.times do |row|
+          column_count.times do |col|
+            yield self[row, col]
+          end
+        end
+      else
+        @elements.each(&block)
+      end
+      self
+    end
+
+    # Passes each element of the matrix and its index to the supplied block
+    # @param block
+    # @return [YaleSparseMatrix]
+    def each_with_index(zeroes = false, &_block)
+      return enum_for :each_with_index, zeroes unless block_given?
+      if zeroes
+        row_count.times do |row|
+          column_count.times do |_col|
+            element = self[row, column]
+            yield [element, row, column]
+          end
+        end
+      else
+        ia.each_cons(2).each_with_index do |indexes, row|
+          row_start, row_end = *indexes
+          a[row_start...row_end].each_with_index do |element, index|
+            yield [element, row, ja[row_start + index]]
+          end
+        end
+      end
+    end
+
+    # Returns true if the matrix is empty; i.e. if {nonzero_element_count} is 0
+    # @return [Boolean]
+    def empty?
+      nonzero_element_count == 0
+    end
+    alias_method :zero?, :empty?
+
+    # Returns true if the matrix includes element
+    # @param element
+    # @return [Boolean]
+    def include?(element)
+      @elements.include? element
+    end
+
+    # Returns the index of element in the matrix, or nil
+    # @param element
+    # @return [Array(Numeric, Numeric), nil]
+    def index(element)
+      each_with_index { |e, index| return index if e == element }
+      nil
+    end
+
+    def inspect(zeroes = false)
+      "#{self.class}[\n" +
+        row_count.times.map do |row|
+          column_count.times.map { |col| self[row, col] }
+            .reject { |e| !zeroes && e == zero }.inspect
+        end.join(",\n") +
+        '] # ' \
+        "#{saving_memory? ? 'efficient' : 'not efficient'} " \
+        "#{format '%.02f', density * 100.0}% density"
+    end
+
+    # The number of non-zero elements in the matrix
+    # @return [Numeric]
+    def nonzero_element_count
+      @row_index.last
+    end
+    alias_method :nnz, :nonzero_element_count
+
+    # The number of rows in the matrix
+    # @return [Numeric]
+    def row_count
+      row_index.length - 1
+    end
+    alias_method :m, :row_count
+
+    # Returns true if the SparseMatrix uses less memory than a naive matrix
+    # @return [Boolean]
+    def saving_memory?
+      nnz < (m * (n - 1) - 1) / 2
+    end
+
+    private
+
+    # Extends #{@row_index}
+    # @param count [Numeric] the number of rows to add
+    def add_row(count = 1)
+      @row_index += [row_index.last] * count
+    end
+    alias_method :add_rows, :add_row
+
+    # Calculates the index in {@elements} of the given matrix index. Returns nil
+    # if the index is outside the matrix's bounds.
+    # @param row [Numeric]
+    # @param column [Numeric]
+    # @return [Numeric, nil]
+    def element_index(row, column)
+      index = row_start = row_index[row]
+      row_end = row_index[row + 1]
+      return nil unless row_start && row_end
+      return nil if row_start == row_end
+      while index < row_end
+        current_column = index_column[index]
+        return index if current_column == column
+        if current_column > column
+          return nil
+        end
+        index += 1
+      end
+      nil
+    end
+
+    # Sets the number of non-zero elements. For reasons, this is stored as the
+    # last element in {@row_index}.
+    # @param nnz [Numeric]
+    def nonzero_element_count=(nnz)
+      @row_index[-1] = nnz
+    end
+  end
+end

data/sparsematrix.gemspec

@@ -0,0 +1,31 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'sparsematrix/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = 'sparsematrix'
+  spec.version       = SparseMatrix::VERSION
+  spec.authors       = ['Reed Kraft-Murphy']
+  spec.email         = ['reed@reedmurphy.net']
+
+  spec.summary       = 'Yale sparse matrix'
+  spec.description   = 'Yale sparse matrix'
+  spec.homepage      = 'https://github.com/RWJMurphy/'
+  spec.license       = 'MIT'
+
+  spec.files         = `git ls-files -z`.split("\x0").reject { |f| f.match(%r{^(test|spec|features)/}) }
+  spec.bindir        = 'exe'
+  spec.executables   = spec.files.grep(%r{^exe/}) { |f| File.basename(f) }
+  spec.require_paths = ['lib']
+
+  spec.add_development_dependency 'bundler', '~> 1.10'
+  spec.add_development_dependency 'pry'
+  spec.add_development_dependency 'pry-rescue'
+  spec.add_development_dependency 'pry-stack_explorer'
+  spec.add_development_dependency 'rake', '~> 10.0'
+  spec.add_development_dependency 'rspec'
+  spec.add_development_dependency 'simplecov'
+  spec.add_development_dependency 'stackprof'
+  spec.add_development_dependency 'yard'
+end

metadata

@@ -0,0 +1,185 @@
+--- !ruby/object:Gem::Specification
+name: sparsematrix
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- Reed Kraft-Murphy
+autorequire: 
+bindir: exe
+cert_chain: []
+date: 2015-07-21 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.10'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.10'
+- !ruby/object:Gem::Dependency
+  name: pry
+  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: pry-rescue
+  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: pry-stack_explorer
+  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: rake
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.0'
+- !ruby/object:Gem::Dependency
+  name: rspec
+  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: simplecov
+  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: stackprof
+  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: yard
+  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'
+description: Yale sparse matrix
+email:
+- reed@reedmurphy.net
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- ".gitignore"
+- ".rspec"
+- ".travis.yml"
+- CODE_OF_CONDUCT.md
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- bin/console
+- bin/setup
+- lib/sparsematrix.rb
+- lib/sparsematrix/version.rb
+- lib/sparsematrix/yale.rb
+- sparsematrix.gemspec
+homepage: https://github.com/RWJMurphy/
+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.4.7
+signing_key: 
+specification_version: 4
+summary: Yale sparse matrix
+test_files: []
+has_rdoc: