sortviz 0.5.2

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: b212635c737033687fa8fd584a29bba5a6a4bdc1
+  data.tar.gz: 6786147038a1092d595facfa0df0888b5aac1515
+SHA512:
+  metadata.gz: 6b407fb6f5332ecd5e45a22105585712077fbe2240db5db67324af79730e9e744344f15e302b970f70bce4bc227c4c84f01deca106365a02a2f4d9961c1c88cd
+  data.tar.gz: f576f741da8b1f7c958d2c932ea51b8fb646fc71585f950e05203e0cbee30a94697269df92b04c727e11cc3fd0dcdd43902ba752bbc16ffb79532f85753efd45

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/.ruby-gemset

@@ -0,0 +1 @@
+sortviz

data/.ruby-version

@@ -0,0 +1 @@
+ruby-2.1.5

data/.travis.yml

@@ -0,0 +1,5 @@
+sudo: false
+language: ruby
+rvm:
+  - 2.1.5
+before_install: gem install bundler -v 1.12.5

data/CODE_OF_CONDUCT.md

@@ -0,0 +1,49 @@
+# Contributor Code of Conduct
+
+As contributors and maintainers of this project, and in the interest of
+fostering an open and welcoming community, 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, religion, or nationality.
+
+Examples of unacceptable behavior by participants include:
+
+* The use of sexualized language or imagery
+* Personal attacks
+* Trolling or insulting/derogatory comments
+* Public or private harassment
+* Publishing other's private information, such as physical or electronic
+  addresses, without explicit permission
+* Other unethical or 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, or to ban temporarily or
+permanently any contributor for other behaviors that they deem inappropriate,
+threatening, offensive, or harmful.
+
+By adopting this Code of Conduct, project maintainers commit themselves to
+fairly and consistently applying these principles to every aspect of managing
+this project. Project maintainers who do not follow or enforce the Code of
+Conduct may be permanently removed from the project team.
+
+This code of conduct applies both within project spaces and in public spaces
+when an individual is representing the project or its community.
+
+Instances of abusive, harassing, or otherwise unacceptable behavior may be
+reported by contacting a project maintainer at hady.fathy@gmail.com. All
+complaints will be reviewed and investigated and will result in a response that
+is deemed necessary and appropriate to the circumstances. Maintainers are
+obligated to maintain confidentiality with regard to the reporter of an
+incident.
+
+This Code of Conduct is adapted from the [Contributor Covenant][homepage],
+version 1.3.0, available at
+[http://contributor-covenant.org/version/1/3/0/][version]
+
+[homepage]: http://contributor-covenant.org
+[version]: http://contributor-covenant.org/version/1/3/0/

data/Gemfile

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

data/LICENSE.txt

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2016 Hady Ahmed
+
+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,93 @@
+# Sortviz
+
+Sortviz is a sorting algorithm visualizer. But here's the rub, it's terminal
+based. You guessed it! This sweet little tool will visualize sorting algorithms
+for your viewing pleasures, it's written in Ruby and uses Curses for the terminal work.
+
+It also has a rather over simplified plugin architecture, more like a ruby 
+trick than anything. You can write your own sorting code and have it visualize
+that for you. You just need to follow a general principle.
+
+## Looks like this
+![alt text][screenshot]
+
+## Working with Sortviz
+
+Some sorting algorithms operate on single lists, swapping and sifting through
+it. Others operate on multiple lists, like merge sort. With any luck, you
+might be able to get these kind of sorting algorithms working but until I officially test against them, you're on your own.
+
+__Generally speaking, the sorting algorithm (your code) has to yield a partially sorted list, with a current index on *every iteration*__.
+
+For examples, check the `algorithms` folder. 
+
+Some implementations like the bubble sort one at `algorithms/bubblesort.rb` generate some visual artifacts. 
+If you look at it, you'd notice that the index we're yielding is +1.
+
+The reason for that is because otherwise, Sortviz will be selecting a column
+that might in fact be the real current index, but the actual swapping is happening a column + 1. Which becomes confusing, so we +1 to select the
+actual column that's moving around.
+
+## Installation
+
+This gem is not intended for your application's Gemfile, it's a
+ruby program packaged as a Gem:
+
+install it as:
+
+    $ gem install sortviz
+
+## Usage
+
+```shell
+$ sortviz -h      # Will display help
+$ sortviz -l      # Will give you a list of available sorting algorithms
+$ sortviz -s ALGO # Will start visualizing the sorting of 20 digits using that algorithm
+```
+
+__Notice: I haven't yet added the ability to load algorithms from a folder of your choosing, but its pretty much the same concept as of loading them from the `algorithms` folder__
+
+## Development
+
+*I'm using RVM to manage my Ruby and Gemset environments for the development of this Gem. So if you too are doing the same, careful cause I've checked in the following files `.ruby-gemset` and `.ruby-version`. If you don't know what I'm talking about, ignore this.*
+
+After checking out the repo, run `bin/setup` to install dependencies. Then, run `rake spec` 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/l0gicpath/sortviz. (This project is intended to be a safe, welcoming space for collaboration, and contributors are expected to adhere to the [Contributor Covenant](http://contributor-covenant.org) code of conduct) I Awe there, bundler is really sweet, isn't it?
+
+Seriously now, PRs are welcome, bug reports too but don't make me do your
+job for you. It's OSS, be reasonable.
+
+## Why
+
+Because I'm a terminal guy that's why. I like to think I'm not too
+bad googling either and for the life of me I couldn't find anything similar
+when a buddy of mine that teaches CS at a university was like, I need a terminal based sorting visualizer. I'm like PSH! Like there has to be some out there, lo-and-behold, they're all web and javascript based.
+
+I'm also using this as a demo for an interview, hope it works out. They asked
+for code I'm most proud of, pretty hard question to find an answer to, as it turns out.
+It's not like I write code I'm not generally proud of but yeah, was a real
+bummer looking over everything I worked in, so this is my solution.
+
+Am I proud of it? Well yes, could be way better but I'm pressed on time.
+
+## Future
+
+When I started this, I wanted something that's easy to use to learn more
+about sorting. So I might actually expand on that and allow a way to 
+write sorting algorithms using pseudocode instead of Ruby.
+
+Should be a fun little language design exercise.
+
+## License
+
+The gem is available as open source under the terms of the [MIT License](http://opensource.org/licenses/MIT).
+I wouldn't know why wouldn't you like MIT license but just in case you don't, 
+don't ping me saying it sucks. Ping bundler, they make it absurdly easy not to
+think about licensing when creating a new Gem.
+
+[screenshot]: screenshot.png "Mac OSX Terminal.app xterm-256color"

data/Rakefile

@@ -0,0 +1,6 @@
+require "bundler/gem_tasks"
+require "rspec/core/rake_task"
+
+RSpec::Core::RakeTask.new(:spec)
+
+task :default => :spec

data/algorithms/bubblesort.rb

@@ -0,0 +1,15 @@
+module Sortviz
+  
+  def bubblesort(list)
+    list.each_index do |i|
+      (list.length - i - 1).times do |j|
+        if list[j] > list[j + 1]
+          list[j], list[j + 1] = list[j + 1], list[j]
+        end
+        yield list, j + 1
+      end
+    end
+  end
+
+  define_algorithm "Bubble Sort", :bubblesort
+end

data/algorithms/insertionsort.rb

@@ -0,0 +1,16 @@
+module Sortviz
+  # insertion_sort is brought in from
+  # https://coderwall.com/p/z8vowg/simple-sorting-algorithms-with-ruby  
+  def insertionsort(list)
+    (1...list.size).each do |i|
+      j = i
+      while j > 0 and list[j-1] > list[j]
+        list[j], list[j-1] = list[j-1], list[j]
+        j = j - 1
+        yield list, j
+      end
+    end
+  end
+
+  define_algorithm "Insertion Sort", :insertionsort
+end

data/algorithms/selectionsort.rb

@@ -0,0 +1,19 @@
+module Sortviz
+  # selection_sort is brought in from
+  # https://coderwall.com/p/z8vowg/simple-sorting-algorithms-with-ruby
+  def selectionsort(list)
+    (0...list.size).each do |j|
+      # find index of minimum element in the unsorted part 
+      iMin = j
+      (j+1...list.size).each do |i|
+        iMin = i if list[i] < list[iMin]
+      end
+
+      # then swap it
+      list[j], list[iMin] = list[iMin], list[j]
+      yield list, iMin
+    end
+  end
+
+  define_algorithm "Selection Sort", :selectionsort
+end

data/bin/console

@@ -0,0 +1,14 @@
+#!/usr/bin/env ruby
+
+require "bundler/setup"
+require "sortviz"
+
+# 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
+
+require "irb"
+IRB.start

data/bin/setup

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

data/exe/sortviz

@@ -0,0 +1,39 @@
+#! /usr/bin/env ruby
+
+require 'optparse'
+require "sortviz"
+
+options = {}
+
+oparser = OptionParser.new do |opts|
+  opts.banner = <<-HELP
+USAGE: sortviz [options]
+
+Exit: Use 'q' to exit during visualization
+
+  HELP
+
+  opts.on('-s', '--sort ALGORITHM', 'Visualize sorting ALGORITHM (Default: bubblesort)') do |algo|
+    if Sortviz::ALGORITHMS.has_key? algo.to_sym
+      Sortviz.init(algo.to_sym)
+    else
+      puts "We couldn't find this algorithm, please check available algorithms through -l option"
+      exit
+    end
+  end
+
+  opts.on('-l', '--list', 'List of available sorting algorithms') do
+    puts "Sortviz: List of available algorithms"
+    puts "-------------------------------------"
+    Sortviz::ALGORITHMS.each do |func_name, name|
+      puts "  #{name} (-s #{func_name})"
+    end
+  end
+
+  opts.on('-h', '--help', 'View this help') do
+    puts opts
+    exit
+  end
+end
+
+oparser.parse!(ARGV)

data/lib/sortviz/canvas.rb

@@ -0,0 +1,68 @@
+module Sortviz
+  class Canvas
+    extend Forwardable
+    def_delegators :@window, 
+      :refresh, :clear, 
+      :getch, :close, :attron, :attroff
+    def_delegators :@cursor, :tprint
+
+    CANVAS_HEIGHT = 20  # That's our drawing area
+    CANVAS_GUTTER = 50  # We subtract this value from Curses.cols
+    GUTTER = 5
+    GRAY_COLOR = 8
+
+    attr_reader :window
+
+    def initialize(title, cursor, screen_dim)
+      @screen_dim = screen_dim
+      @cursor = cursor
+      @title = title
+      # Cache red since we'll use it to highlight later, best do it now
+      @red_highlighter = Curses.color_pair(Curses.const_get("COLOR_RED"))
+      @gray_highlighter = Curses.color_pair(GRAY_COLOR)
+      @window = nil
+    end
+
+    def setup
+      @window = Curses::Window.new(
+        @cursor.y + CANVAS_HEIGHT, 
+        @screen_dim[:cols] - CANVAS_GUTTER,
+        @cursor.y, @cursor.x)
+      @window.box('|', '-')
+      # Update our y-position to reflect the addition of canvas and its height
+      @cursor.incr_y CANVAS_HEIGHT + 4
+      @window.nodelay = 1 # Non-blocking mode for #getch
+    end
+
+    def redraw(partially_sorted, selected_indx)
+      @window.clear
+      @window.box('|', '-')
+      @cursor.move(0, 0)
+      @cursor.tprint("Algorithm: #{@title}")
+      @cursor.move(CANVAS_HEIGHT + 2, GUTTER)
+      partially_sorted.each_with_index do |n, i|
+        
+        attron(@gray_highlighter)
+        tprint(("|%02d|" % n))
+        attroff(@gray_highlighter)
+
+        @cursor.decr_y
+
+
+        attron(@red_highlighter) if selected_indx == i
+        draw_bar(n)
+        attroff(@red_highlighter)
+
+        @cursor.move_y(CANVAS_HEIGHT + 2)
+        @cursor.incr_x GUTTER
+      end
+    end
+    private
+    def draw_bar(height)
+      height.times do
+        tprint("|_ |")
+        @cursor.decr_y
+      end
+    end
+  end
+end

data/lib/sortviz/cursor.rb

@@ -0,0 +1,113 @@
+module Sortviz
+  # Cursor represents a terminal cursor, can easily switch between
+  # different windows (curses) and can remember the last cursor position it
+  # was at.
+  # This is to wrap up the boilerplate code of moving a cursor around a terminal
+  # window
+  class Cursor
+    attr_reader :y, :x, :window
+    # Initialize a new Cursor object, follows curses practice of passing
+    # the y before the x coords.
+    # @params
+    # => window (Curses::Window)
+    # => y      (Int)
+    # => x      (Int)
+    # @return instance of Sortviz::Cursor
+    def initialize(window, y, x)
+      @window = window
+      @cached = nil
+      move(y, x)
+    end
+
+    # Move to positions y, x
+    # @params
+    # => y (Int)
+    # => x (Int)
+    def move(y, x)
+      update(y, x)
+      apply_pos
+    end
+
+    # Move along the y-axis
+    # @params
+    # => val (Int) new Value of y
+    def move_y(val)
+      update(val, x)
+      apply_pos
+    end
+
+    # Move along the x-axis
+    # @params
+    # => val (Int) new Value of x
+    def move_x(val)
+      update(y, val)
+      apply_pos
+    end
+
+    # Increment the y value by val
+    # @params
+    # => val (Int) new Value of y, Default: 1
+    def incr_y(val = 1)
+      update(y + val, x)
+      apply_pos
+    end
+
+    # Decrement the y value by val
+    # @params
+    # => val (Int) new Value of y, Default: 1
+    def decr_y(val = 1)
+      update((y - val).abs, x)
+      apply_pos
+    end
+
+    # Increment the x value by val
+    # @params
+    # => val (Int) new Value of x, Default: 1
+    def incr_x(val = 1)
+      update(y, x + val)
+      apply_pos
+    end
+
+    # Decrement the x value by val
+    # @params
+    # => val (Int) new Value of x, Default: 1
+    def decr_x(val = 1)
+      update(y, (x - val).abs)
+      apply_pos
+    end
+
+    # Cache the current cursor coordinates
+    def cache
+      @cached = { y: @y, x: @x }
+    end
+
+    # Restore the previously cached cursor coordinates if any are cached
+    def restore
+      return unless @cached
+      update(@cached[:y], @cached[:x])
+      @cached = nil
+    end
+
+    def switch_window(new_window, coords: {})
+      @window = new_window
+      move(coords[:y], coords[:x]) unless coords.empty?
+    end
+
+    def tprint(string)
+      @window.addstr(string)
+    end
+
+    def newline
+      incr_y
+    end
+
+    private
+    def update(y, x)
+      @y, @x = y, x
+    end
+
+    def apply_pos
+      window.setpos(@y, @x)
+    end
+  end
+end

data/lib/sortviz/plugins.rb

@@ -0,0 +1,9 @@
+module Sortviz
+  extend self
+  ALGORITHMS = {}
+
+  def define_algorithm(name, func_name)
+    ALGORITHMS[func_name] = name
+    module_function func_name
+  end
+end

data/lib/sortviz/version.rb

@@ -0,0 +1,3 @@
+module Sortviz
+  VERSION = "0.5.2"
+end

data/lib/sortviz/visualizer.rb

@@ -0,0 +1,92 @@
+module Sortviz
+  # Visualizer is the entry point of our Terminal UI. That's where all the juice
+  # happens. It initializes the curses library, visualizes sorting, 
+  # cleans up after we're done and controls the event loop.
+  class Visualizer
+    extend Forwardable
+    def_delegators :@cursor, :tprint, :newline 
+    # All our rendering kicks off from these two values, consider them
+    # our origin point instead of (0, 0)
+    GUTTER = 5          # We don't want to flirt too much with the terminal border
+    TOP_MARGIN = 1      # Same issue with the top border
+    SLEEP_INTERVAL = 0.3
+
+    def initialize(unsorted_list, algo)
+      setup_curses
+      # Cache our dimensions, helpful in calculations
+      @screen_dim = { cols: Curses.cols, lines: Curses.lines }
+      # Take Reference for Curses initial standard window
+      @screen     = Curses.stdscr
+      @cursor     = Cursor.new(@screen, TOP_MARGIN, GUTTER)
+      @canvas     = Canvas.new(ALGORITHMS[algo], @cursor, @screen_dim)
+
+      @algo       = algo
+      @unsorted_list = unsorted_list
+    end
+
+    def visualize
+      begin
+        banner
+        # NOTICE: :Cavet: It's important to setup the canvas AFTER displaying
+        # the banner, so the canvas would correctly calculate its offsets
+        # based on the current cursor position, as in, after printing banner
+        @canvas.setup
+        @cursor.cache # Cache our location before the visualization mess kicks in
+
+        @screen.refresh
+        @canvas.refresh
+        
+        @cursor.switch_window @canvas.window
+
+        loop do
+           Sortviz.send(@algo, @unsorted_list) do |partially_sorted, selected_indx|
+            @canvas.redraw(partially_sorted, selected_indx)
+            update
+            return if @canvas.getch == 'q'
+           end
+          @canvas.close
+
+          @cursor.switch_window @screen # Switch back to our stdscr
+          @cursor.restore # Restoring here, would place us right under the canvas box
+          newline
+          tprint("Press 'q' to exit")
+          break if Curses.getch == 'q'
+        end
+      ensure
+        Curses.close_screen
+      end
+    end
+
+    private
+    def update
+      # doupdate is much more efficient than multiple refreshes
+      # and after some testing, it seems to clear out the flicker
+      # caused by multiple rapid calls to refresh
+      Curses.doupdate
+      sleep SLEEP_INTERVAL
+    end
+
+    def setup_curses
+      Curses.init_screen
+      Curses.noecho       # As soon as we prep the terminal screen, stop echo
+      Curses.nonl         # Line feeds and carriage return as well
+      Curses.curs_set(0)        # Hide cursor
+      Curses.start_color        # Kick off colored output
+      Curses.use_default_colors
+
+      # We need Red and Gray
+      Curses.init_pair(Curses::COLOR_RED, Curses::COLOR_RED, -1)
+      Curses.init_pair(8, 235, -1)
+    end
+
+    def banner
+      tprint("-----------------------------------------------------------------")
+      newline
+      tprint("SortViz: Sorting Algorithms Visualization, Ruby & Curses - v#{VERSION}")
+      newline
+      tprint("-----------------------------------------------------------------")
+      newline
+    end
+
+  end
+end

data/lib/sortviz.rb

@@ -0,0 +1,20 @@
+require 'curses'
+require 'forwardable'
+require 'sortviz/version'
+require 'sortviz/cursor'
+require 'sortviz/canvas'
+require 'sortviz/visualizer'
+require 'sortviz/plugins'
+
+dir = './algorithms'
+$LOAD_PATH.unshift(dir)
+Dir[File.join(dir, '*.rb')].each {|file| require File.basename(file) }
+
+module Sortviz
+  extend self
+  def init(algo)
+    unsorted_list = (1..20).to_a.shuffle
+    visualizer = Visualizer.new unsorted_list, algo
+    visualizer.visualize
+  end
+end

data/sortviz.gemspec

@@ -0,0 +1,26 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'sortviz/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = "sortviz"
+  spec.version       = Sortviz::VERSION
+  spec.authors       = ["Hady Ahmed"]
+  spec.email         = ["hady.fathy@gmail.com"]
+
+  spec.summary       = %q{Terminal based sorting algorithms visualizer}
+  spec.description   = %q{Visualize sorting algorithms with Ruby and Curses lib}
+  spec.homepage      = "http://hadyahmed.com/sortviz"
+  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.12"
+  spec.add_development_dependency "rake", "~> 10.0"
+  spec.add_development_dependency "rspec", "~> 3.0"
+  spec.add_dependency "curses"
+end

metadata

@@ -0,0 +1,125 @@
+--- !ruby/object:Gem::Specification
+name: sortviz
+version: !ruby/object:Gem::Version
+  version: 0.5.2
+platform: ruby
+authors:
+- Hady Ahmed
+autorequire: 
+bindir: exe
+cert_chain: []
+date: 2016-06-18 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.12'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.12'
+- !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: '3.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '3.0'
+- !ruby/object:Gem::Dependency
+  name: curses
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+description: Visualize sorting algorithms with Ruby and Curses lib
+email:
+- hady.fathy@gmail.com
+executables:
+- sortviz
+extensions: []
+extra_rdoc_files: []
+files:
+- ".gitignore"
+- ".rspec"
+- ".ruby-gemset"
+- ".ruby-version"
+- ".travis.yml"
+- CODE_OF_CONDUCT.md
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- algorithms/bubblesort.rb
+- algorithms/insertionsort.rb
+- algorithms/selectionsort.rb
+- bin/console
+- bin/setup
+- exe/sortviz
+- lib/sortviz.rb
+- lib/sortviz/canvas.rb
+- lib/sortviz/cursor.rb
+- lib/sortviz/plugins.rb
+- lib/sortviz/version.rb
+- lib/sortviz/visualizer.rb
+- screenshot.png
+- sortviz.gemspec
+homepage: http://hadyahmed.com/sortviz
+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.6.4
+signing_key: 
+specification_version: 4
+summary: Terminal based sorting algorithms visualizer
+test_files: []